0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2704164-1278549901.opb>
13.99/14.00 c original problem has 4500 variables (4500 bin, 0 int, 0 impl, 0 cont) and 674250 constraints
13.99/14.00 c problem read
13.99/14.00 c No objective function, only one solution is needed.
13.99/14.01 c presolving settings loaded
18.19/18.22 c presolving:
26.58/26.62 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 674250 upgd conss, 0 impls, 1500 clqs
27.39/27.45 c presolving (2 rounds):
27.39/27.45 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
27.39/27.45 c 0 implications, 1500 cliques
27.39/27.45 c presolved problem has 4500 variables (4500 bin, 0 int, 0 impl, 0 cont) and 674250 constraints
27.39/27.45 c 1500 constraints of type <setppc>
27.39/27.45 c 672750 constraints of type <logicor>
27.39/27.45 c transformed objective value is always integral (scale: 1)
27.39/27.45 c Presolving Time: 9.25
27.39/27.45 c - non default parameters ----------------------------------------------------------------------
27.39/27.45 c # SCIP version 1.2.1.3
27.39/27.45 c
27.39/27.45 c # frequency for displaying node information lines
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 100]
27.39/27.45 c display/freq = 10000
27.39/27.45 c
27.39/27.45 c # maximal time in seconds to run
27.39/27.45 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
27.39/27.45 c limits/time = 1776
27.39/27.45 c
27.39/27.45 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
27.39/27.45 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
27.39/27.45 c limits/memory = 1620
27.39/27.45 c
27.39/27.45 c # solving stops, if the given number of solutions were found (-1: no limit)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: -1]
27.39/27.45 c limits/solutions = 1
27.39/27.45 c
27.39/27.45 c # maximal number of separation rounds per node (-1: unlimited)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 5]
27.39/27.45 c separating/maxrounds = 1
27.39/27.45 c
27.39/27.45 c # maximal number of separation rounds in the root node (-1: unlimited)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: -1]
27.39/27.45 c separating/maxroundsroot = 5
27.39/27.45 c
27.39/27.45 c # default clock type (1: CPU user seconds, 2: wall clock time)
27.39/27.45 c # [type: int, range: [1,2], default: 1]
27.39/27.45 c timing/clocktype = 2
27.39/27.45 c
27.39/27.45 c # should presolving try to simplify inequalities
27.39/27.45 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
27.39/27.45 c constraints/linear/simplifyinequalities = TRUE
27.39/27.45 c
27.39/27.45 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
27.39/27.45 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
27.39/27.45 c constraints/indicator/addCouplingCons = TRUE
27.39/27.45 c
27.39/27.45 c # should disaggregation of knapsack constraints be allowed in preprocessing?
27.39/27.45 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
27.39/27.45 c constraints/knapsack/disaggregation = FALSE
27.39/27.45 c
27.39/27.45 c # should presolving try to simplify knapsacks
27.39/27.45 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
27.39/27.45 c constraints/knapsack/simplifyinequalities = TRUE
27.39/27.45 c
27.39/27.45 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: -1]
27.39/27.45 c presolving/probing/maxrounds = 0
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 10]
27.39/27.45 c heuristics/coefdiving/freq = -1
27.39/27.45 c
27.39/27.45 c # maximal fraction of diving LP iterations compared to node LP iterations
27.39/27.45 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
27.39/27.45 c heuristics/coefdiving/maxlpiterquot = 0.075
27.39/27.45 c
27.39/27.45 c # additional number of allowed LP iterations
27.39/27.45 c # [type: int, range: [0,2147483647], default: 1000]
27.39/27.45 c heuristics/coefdiving/maxlpiterofs = 1500
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 30]
27.39/27.45 c heuristics/crossover/freq = -1
27.39/27.45 c
27.39/27.45 c # number of nodes added to the contingent of the total nodes
27.39/27.45 c # [type: longint, range: [0,9223372036854775807], default: 500]
27.39/27.45 c heuristics/crossover/nodesofs = 750
27.39/27.45 c
27.39/27.45 c # number of nodes without incumbent change that heuristic should wait
27.39/27.45 c # [type: longint, range: [0,9223372036854775807], default: 200]
27.39/27.45 c heuristics/crossover/nwaitingnodes = 100
27.39/27.45 c
27.39/27.45 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
27.39/27.45 c # [type: real, range: [0,1], default: 0.1]
27.39/27.45 c heuristics/crossover/nodesquot = 0.15
27.39/27.45 c
27.39/27.45 c # minimum percentage of integer variables that have to be fixed
27.39/27.45 c # [type: real, range: [0,1], default: 0.666]
27.39/27.45 c heuristics/crossover/minfixingrate = 0.5
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 20]
27.39/27.45 c heuristics/feaspump/freq = -1
27.39/27.45 c
27.39/27.45 c # additional number of allowed LP iterations
27.39/27.45 c # [type: int, range: [0,2147483647], default: 1000]
27.39/27.45 c heuristics/feaspump/maxlpiterofs = 2000
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 10]
27.39/27.45 c heuristics/fracdiving/freq = -1
27.39/27.45 c
27.39/27.45 c # maximal fraction of diving LP iterations compared to node LP iterations
27.39/27.45 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
27.39/27.45 c heuristics/fracdiving/maxlpiterquot = 0.075
27.39/27.45 c
27.39/27.45 c # additional number of allowed LP iterations
27.39/27.45 c # [type: int, range: [0,2147483647], default: 1000]
27.39/27.45 c heuristics/fracdiving/maxlpiterofs = 1500
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 10]
27.39/27.45 c heuristics/guideddiving/freq = -1
27.39/27.45 c
27.39/27.45 c # maximal fraction of diving LP iterations compared to node LP iterations
27.39/27.45 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
27.39/27.45 c heuristics/guideddiving/maxlpiterquot = 0.075
27.39/27.45 c
27.39/27.45 c # additional number of allowed LP iterations
27.39/27.45 c # [type: int, range: [0,2147483647], default: 1000]
27.39/27.45 c heuristics/guideddiving/maxlpiterofs = 1500
27.39/27.45 c
27.39/27.45 c # maximal fraction of diving LP iterations compared to node LP iterations
27.39/27.45 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
27.39/27.45 c heuristics/intdiving/maxlpiterquot = 0.075
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 10]
27.39/27.45 c heuristics/intshifting/freq = -1
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 10]
27.39/27.45 c heuristics/linesearchdiving/freq = -1
27.39/27.45 c
27.39/27.45 c # maximal fraction of diving LP iterations compared to node LP iterations
27.39/27.45 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
27.39/27.45 c heuristics/linesearchdiving/maxlpiterquot = 0.075
27.39/27.45 c
27.39/27.45 c # additional number of allowed LP iterations
27.39/27.45 c # [type: int, range: [0,2147483647], default: 1000]
27.39/27.45 c heuristics/linesearchdiving/maxlpiterofs = 1500
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 1]
27.39/27.45 c heuristics/nlp/freq = -1
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 20]
27.39/27.45 c heuristics/objpscostdiving/freq = -1
27.39/27.45 c
27.39/27.45 c # maximal fraction of diving LP iterations compared to total iteration number
27.39/27.45 c # [type: real, range: [0,1], default: 0.01]
27.39/27.45 c heuristics/objpscostdiving/maxlpiterquot = 0.015
27.39/27.45 c
27.39/27.45 c # additional number of allowed LP iterations
27.39/27.45 c # [type: int, range: [0,2147483647], default: 1000]
27.39/27.45 c heuristics/objpscostdiving/maxlpiterofs = 1500
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 1]
27.39/27.45 c heuristics/oneopt/freq = -1
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 10]
27.39/27.45 c heuristics/pscostdiving/freq = -1
27.39/27.45 c
27.39/27.45 c # maximal fraction of diving LP iterations compared to node LP iterations
27.39/27.45 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
27.39/27.45 c heuristics/pscostdiving/maxlpiterquot = 0.075
27.39/27.45 c
27.39/27.45 c # additional number of allowed LP iterations
27.39/27.45 c # [type: int, range: [0,2147483647], default: 1000]
27.39/27.45 c heuristics/pscostdiving/maxlpiterofs = 1500
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 0]
27.39/27.45 c heuristics/rens/freq = -1
27.39/27.45 c
27.39/27.45 c # minimum percentage of integer variables that have to be fixable
27.39/27.45 c # [type: real, range: [0,1], default: 0.5]
27.39/27.45 c heuristics/rens/minfixingrate = 0.3
27.39/27.45 c
27.39/27.45 c # number of nodes added to the contingent of the total nodes
27.39/27.45 c # [type: longint, range: [0,9223372036854775807], default: 500]
27.39/27.45 c heuristics/rens/nodesofs = 2000
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 20]
27.39/27.45 c heuristics/rootsoldiving/freq = -1
27.39/27.45 c
27.39/27.45 c # maximal fraction of diving LP iterations compared to node LP iterations
27.39/27.45 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
27.39/27.45 c heuristics/rootsoldiving/maxlpiterquot = 0.015
27.39/27.45 c
27.39/27.45 c # additional number of allowed LP iterations
27.39/27.45 c # [type: int, range: [0,2147483647], default: 1000]
27.39/27.45 c heuristics/rootsoldiving/maxlpiterofs = 1500
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 1]
27.39/27.45 c heuristics/rounding/freq = -1
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 10]
27.39/27.45 c heuristics/shifting/freq = -1
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 1]
27.39/27.45 c heuristics/simplerounding/freq = -1
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 0]
27.39/27.45 c heuristics/trivial/freq = -1
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 1]
27.39/27.45 c heuristics/trysol/freq = -1
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 10]
27.39/27.45 c heuristics/veclendiving/freq = -1
27.39/27.45 c
27.39/27.45 c # maximal fraction of diving LP iterations compared to node LP iterations
27.39/27.45 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
27.39/27.45 c heuristics/veclendiving/maxlpiterquot = 0.075
27.39/27.45 c
27.39/27.45 c # additional number of allowed LP iterations
27.39/27.45 c # [type: int, range: [0,2147483647], default: 1000]
27.39/27.45 c heuristics/veclendiving/maxlpiterofs = 1500
27.39/27.45 c
27.39/27.45 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 1]
27.39/27.45 c heuristics/zirounding/freq = -1
27.39/27.45 c
27.39/27.45 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 0]
27.39/27.45 c separating/cmir/freq = -1
27.39/27.45 c
27.39/27.45 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: 0]
27.39/27.45 c separating/flowcover/freq = -1
27.39/27.45 c
27.39/27.45 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
27.39/27.45 c # [type: int, range: [-1,2147483647], default: -1]
27.39/27.45 c separating/rapidlearning/freq = 0
27.39/27.45 c
27.39/27.45 c -----------------------------------------------------------------------------------------------
27.39/27.45 c start solving
27.39/27.49 c
33.94/34.11 c pressed CTRL-C 1 times (5 times for forcing termination)
33.94/34.18 EMALLC02 realloc: Out of memory - cannot allocate 21977328 bytes
33.94/34.19 c [src/scip/lpi_spx.cpp:1201] Warning: SoPlex threw an exception: XMALLC02 realloc: Could not allocate enough memory
33.94/34.19 c [src/scip/lp.c:5561] ERROR: Error <-6> in function call
33.94/34.19 c [src/scip/lp.c:5837] ERROR: Error <-6> in function call
33.94/34.19 c [src/scip/lp.c:11248] ERROR: Error <-6> in function call
33.94/34.19 c [src/scip/solve.c:801] ERROR: Error <-6> in function call
33.94/34.19 c [src/scip/solve.c:1912] ERROR: Error <-6> in function call
33.94/34.19 c [src/scip/solve.c:2591] ERROR: Error <-6> in function call
33.94/34.19 c [src/scip/solve.c:3206] ERROR: Error <-6> in function call
33.94/34.19 c [src/scip/scip.c:6312] ERROR: Error <-6> in function call
33.94/34.19 c [src/cmain.c:674] ERROR: Error <-6> in function call
33.94/34.19 c [src/cmain.c:849] ERROR: Error <-6> in function call
33.94/34.19 c [src/cmain.c:925] ERROR: Error <-6> in function call
33.94/34.19 c SCIP Error (-6): c error in LP solverc
33.94/34.19 c Time complete: 34.01.