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-2703577-1278550545.opb>
8.89/8.92 c original problem has 201731 variables (201731 bin, 0 int, 0 impl, 0 cont) and 592525 constraints
8.89/8.92 c problem read
8.89/8.93 c No objective function, only one solution is needed.
8.89/8.95 c presolving settings loaded
11.89/11.99 c presolving:
25.29/25.31 c (round 1) 8525 del vars, 11075 del conss, 3521 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13700352 impls, 0 clqs
25.78/25.88 c (round 2) 8801 del vars, 22390 del conss, 3599 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13703994 impls, 0 clqs
26.18/26.22 c (round 3) 9020 del vars, 22919 del conss, 3813 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13704530 impls, 0 clqs
26.48/26.55 c (round 4) 9137 del vars, 23196 del conss, 3925 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13705110 impls, 0 clqs
26.78/26.88 c (round 5) 9346 del vars, 23537 del conss, 4134 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13705760 impls, 0 clqs
27.18/27.23 c (round 6) 9630 del vars, 24127 del conss, 4419 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13712071 impls, 0 clqs
27.49/27.58 c (round 7) 9968 del vars, 24870 del conss, 4754 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13727267 impls, 0 clqs
27.88/27.96 c (round 8) 10295 del vars, 25735 del conss, 5086 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13735202 impls, 0 clqs
28.28/28.30 c (round 9) 10558 del vars, 26545 del conss, 5334 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13737858 impls, 0 clqs
28.68/28.70 c (round 10) 10842 del vars, 27197 del conss, 5618 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13742812 impls, 0 clqs
28.98/29.05 c (round 11) 11002 del vars, 27845 del conss, 5785 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13754801 impls, 0 clqs
29.38/29.40 c (round 12) 11030 del vars, 28193 del conss, 5812 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13764139 impls, 0 clqs
29.69/29.72 c (round 13) 11058 del vars, 28261 del conss, 5834 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13764765 impls, 0 clqs
29.98/30.05 c (round 14) 11086 del vars, 28319 del conss, 5862 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13764873 impls, 0 clqs
30.28/30.37 c (round 15) 11114 del vars, 28389 del conss, 5890 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13765493 impls, 0 clqs
30.68/30.70 c (round 16) 11142 del vars, 28459 del conss, 5918 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13766501 impls, 0 clqs
30.98/31.04 c (round 17) 11171 del vars, 28532 del conss, 5950 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13768037 impls, 0 clqs
31.28/31.38 c (round 18) 11202 del vars, 28616 del conss, 5978 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13768879 impls, 0 clqs
31.68/31.71 c (round 19) 11228 del vars, 28681 del conss, 6004 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13769441 impls, 0 clqs
31.98/32.04 c (round 20) 11252 del vars, 28745 del conss, 6028 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13769907 impls, 0 clqs
32.28/32.36 c (round 21) 11276 del vars, 28805 del conss, 6052 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13770213 impls, 0 clqs
32.78/32.86 c (round 22) 11304 del vars, 28899 del conss, 6080 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13770585 impls, 0 clqs
36.98/37.08 c (round 23) 11304 del vars, 29551 del conss, 6080 chg bounds, 6548 chg sides, 14490 chg coeffs, 562921 upgd conss, 13770843 impls, 0 clqs
38.77/38.83 c presolving (24 rounds):
38.77/38.83 c 11304 deleted vars, 29551 deleted constraints, 6080 tightened bounds, 0 added holes, 6548 changed sides, 14490 changed coefficients
38.77/38.83 c 13770843 implications, 0 cliques
38.77/38.83 c presolved problem has 190427 variables (190427 bin, 0 int, 0 impl, 0 cont) and 562974 constraints
38.77/38.83 c 12778 constraints of type <knapsack>
38.77/38.83 c 367323 constraints of type <setppc>
38.77/38.83 c 182873 constraints of type <logicor>
38.77/38.83 c transformed objective value is always integral (scale: 1)
38.77/38.83 c Presolving Time: 28.12
38.77/38.83 c - non default parameters ----------------------------------------------------------------------
38.77/38.83 c # SCIP version 1.2.1.3
38.77/38.83 c
38.77/38.83 c # frequency for displaying node information lines
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 100]
38.77/38.83 c display/freq = 10000
38.77/38.83 c
38.77/38.83 c # maximal time in seconds to run
38.77/38.83 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
38.77/38.83 c limits/time = 1781.06
38.77/38.83 c
38.77/38.83 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
38.77/38.83 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
38.77/38.83 c limits/memory = 1620
38.77/38.83 c
38.77/38.83 c # solving stops, if the given number of solutions were found (-1: no limit)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: -1]
38.77/38.83 c limits/solutions = 1
38.77/38.83 c
38.77/38.83 c # maximal number of separation rounds per node (-1: unlimited)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 5]
38.77/38.83 c separating/maxrounds = 1
38.77/38.83 c
38.77/38.83 c # maximal number of separation rounds in the root node (-1: unlimited)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: -1]
38.77/38.83 c separating/maxroundsroot = 5
38.77/38.83 c
38.77/38.83 c # default clock type (1: CPU user seconds, 2: wall clock time)
38.77/38.83 c # [type: int, range: [1,2], default: 1]
38.77/38.83 c timing/clocktype = 2
38.77/38.83 c
38.77/38.83 c # should presolving try to simplify inequalities
38.77/38.83 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
38.77/38.83 c constraints/linear/simplifyinequalities = TRUE
38.77/38.83 c
38.77/38.83 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
38.77/38.83 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
38.77/38.83 c constraints/indicator/addCouplingCons = TRUE
38.77/38.83 c
38.77/38.83 c # should disaggregation of knapsack constraints be allowed in preprocessing?
38.77/38.83 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
38.77/38.83 c constraints/knapsack/disaggregation = FALSE
38.77/38.83 c
38.77/38.83 c # should presolving try to simplify knapsacks
38.77/38.83 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
38.77/38.83 c constraints/knapsack/simplifyinequalities = TRUE
38.77/38.83 c
38.77/38.83 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: -1]
38.77/38.83 c presolving/probing/maxrounds = 0
38.77/38.83 c
38.77/38.83 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 10]
38.77/38.83 c heuristics/coefdiving/freq = -1
38.77/38.83 c
38.77/38.83 c # maximal fraction of diving LP iterations compared to node LP iterations
38.77/38.83 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
38.77/38.83 c heuristics/coefdiving/maxlpiterquot = 0.075
38.77/38.83 c
38.77/38.83 c # additional number of allowed LP iterations
38.77/38.83 c # [type: int, range: [0,2147483647], default: 1000]
38.77/38.83 c heuristics/coefdiving/maxlpiterofs = 1500
38.77/38.83 c
38.77/38.83 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 30]
38.77/38.83 c heuristics/crossover/freq = -1
38.77/38.83 c
38.77/38.83 c # number of nodes added to the contingent of the total nodes
38.77/38.83 c # [type: longint, range: [0,9223372036854775807], default: 500]
38.77/38.83 c heuristics/crossover/nodesofs = 750
38.77/38.83 c
38.77/38.83 c # number of nodes without incumbent change that heuristic should wait
38.77/38.83 c # [type: longint, range: [0,9223372036854775807], default: 200]
38.77/38.83 c heuristics/crossover/nwaitingnodes = 100
38.77/38.83 c
38.77/38.83 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
38.77/38.83 c # [type: real, range: [0,1], default: 0.1]
38.77/38.83 c heuristics/crossover/nodesquot = 0.15
38.77/38.83 c
38.77/38.83 c # minimum percentage of integer variables that have to be fixed
38.77/38.83 c # [type: real, range: [0,1], default: 0.666]
38.77/38.83 c heuristics/crossover/minfixingrate = 0.5
38.77/38.83 c
38.77/38.83 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 20]
38.77/38.83 c heuristics/feaspump/freq = -1
38.77/38.83 c
38.77/38.83 c # additional number of allowed LP iterations
38.77/38.83 c # [type: int, range: [0,2147483647], default: 1000]
38.77/38.83 c heuristics/feaspump/maxlpiterofs = 2000
38.77/38.83 c
38.77/38.83 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 10]
38.77/38.83 c heuristics/fracdiving/freq = -1
38.77/38.83 c
38.77/38.83 c # maximal fraction of diving LP iterations compared to node LP iterations
38.77/38.83 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
38.77/38.83 c heuristics/fracdiving/maxlpiterquot = 0.075
38.77/38.83 c
38.77/38.83 c # additional number of allowed LP iterations
38.77/38.83 c # [type: int, range: [0,2147483647], default: 1000]
38.77/38.83 c heuristics/fracdiving/maxlpiterofs = 1500
38.77/38.83 c
38.77/38.83 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 10]
38.77/38.83 c heuristics/guideddiving/freq = -1
38.77/38.83 c
38.77/38.83 c # maximal fraction of diving LP iterations compared to node LP iterations
38.77/38.83 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
38.77/38.83 c heuristics/guideddiving/maxlpiterquot = 0.075
38.77/38.83 c
38.77/38.83 c # additional number of allowed LP iterations
38.77/38.83 c # [type: int, range: [0,2147483647], default: 1000]
38.77/38.83 c heuristics/guideddiving/maxlpiterofs = 1500
38.77/38.83 c
38.77/38.83 c # maximal fraction of diving LP iterations compared to node LP iterations
38.77/38.83 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
38.77/38.83 c heuristics/intdiving/maxlpiterquot = 0.075
38.77/38.83 c
38.77/38.83 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 10]
38.77/38.83 c heuristics/intshifting/freq = -1
38.77/38.83 c
38.77/38.83 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 10]
38.77/38.83 c heuristics/linesearchdiving/freq = -1
38.77/38.83 c
38.77/38.83 c # maximal fraction of diving LP iterations compared to node LP iterations
38.77/38.83 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
38.77/38.83 c heuristics/linesearchdiving/maxlpiterquot = 0.075
38.77/38.83 c
38.77/38.83 c # additional number of allowed LP iterations
38.77/38.83 c # [type: int, range: [0,2147483647], default: 1000]
38.77/38.83 c heuristics/linesearchdiving/maxlpiterofs = 1500
38.77/38.83 c
38.77/38.83 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 1]
38.77/38.83 c heuristics/nlp/freq = -1
38.77/38.83 c
38.77/38.83 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 20]
38.77/38.83 c heuristics/objpscostdiving/freq = -1
38.77/38.83 c
38.77/38.83 c # maximal fraction of diving LP iterations compared to total iteration number
38.77/38.83 c # [type: real, range: [0,1], default: 0.01]
38.77/38.83 c heuristics/objpscostdiving/maxlpiterquot = 0.015
38.77/38.83 c
38.77/38.83 c # additional number of allowed LP iterations
38.77/38.83 c # [type: int, range: [0,2147483647], default: 1000]
38.77/38.83 c heuristics/objpscostdiving/maxlpiterofs = 1500
38.77/38.83 c
38.77/38.83 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 1]
38.77/38.83 c heuristics/oneopt/freq = -1
38.77/38.83 c
38.77/38.83 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 10]
38.77/38.83 c heuristics/pscostdiving/freq = -1
38.77/38.83 c
38.77/38.83 c # maximal fraction of diving LP iterations compared to node LP iterations
38.77/38.83 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
38.77/38.83 c heuristics/pscostdiving/maxlpiterquot = 0.075
38.77/38.83 c
38.77/38.83 c # additional number of allowed LP iterations
38.77/38.83 c # [type: int, range: [0,2147483647], default: 1000]
38.77/38.83 c heuristics/pscostdiving/maxlpiterofs = 1500
38.77/38.83 c
38.77/38.83 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 0]
38.77/38.83 c heuristics/rens/freq = -1
38.77/38.83 c
38.77/38.83 c # minimum percentage of integer variables that have to be fixable
38.77/38.83 c # [type: real, range: [0,1], default: 0.5]
38.77/38.83 c heuristics/rens/minfixingrate = 0.3
38.77/38.83 c
38.77/38.83 c # number of nodes added to the contingent of the total nodes
38.77/38.83 c # [type: longint, range: [0,9223372036854775807], default: 500]
38.77/38.83 c heuristics/rens/nodesofs = 2000
38.77/38.83 c
38.77/38.83 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 20]
38.77/38.83 c heuristics/rootsoldiving/freq = -1
38.77/38.83 c
38.77/38.83 c # maximal fraction of diving LP iterations compared to node LP iterations
38.77/38.83 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
38.77/38.83 c heuristics/rootsoldiving/maxlpiterquot = 0.015
38.77/38.83 c
38.77/38.83 c # additional number of allowed LP iterations
38.77/38.83 c # [type: int, range: [0,2147483647], default: 1000]
38.77/38.83 c heuristics/rootsoldiving/maxlpiterofs = 1500
38.77/38.83 c
38.77/38.83 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 1]
38.77/38.83 c heuristics/rounding/freq = -1
38.77/38.83 c
38.77/38.83 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 10]
38.77/38.83 c heuristics/shifting/freq = -1
38.77/38.83 c
38.77/38.83 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 1]
38.77/38.83 c heuristics/simplerounding/freq = -1
38.77/38.83 c
38.77/38.83 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 0]
38.77/38.83 c heuristics/trivial/freq = -1
38.77/38.83 c
38.77/38.83 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
38.77/38.83 c # [type: int, range: [-1,2147483647], default: 1]
38.77/38.83 c heuristics/trysol/freq = -1
38.77/38.83 c
38.77/38.84 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
38.77/38.84 c # [type: int, range: [-1,2147483647], default: 10]
38.77/38.84 c heuristics/veclendiving/freq = -1
38.77/38.84 c
38.77/38.84 c # maximal fraction of diving LP iterations compared to node LP iterations
38.77/38.84 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
38.77/38.84 c heuristics/veclendiving/maxlpiterquot = 0.075
38.77/38.84 c
38.77/38.84 c # additional number of allowed LP iterations
38.77/38.84 c # [type: int, range: [0,2147483647], default: 1000]
38.77/38.84 c heuristics/veclendiving/maxlpiterofs = 1500
38.77/38.84 c
38.77/38.84 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
38.77/38.84 c # [type: int, range: [-1,2147483647], default: 1]
38.77/38.84 c heuristics/zirounding/freq = -1
38.77/38.84 c
38.77/38.84 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
38.77/38.84 c # [type: int, range: [-1,2147483647], default: 0]
38.77/38.84 c separating/cmir/freq = -1
38.77/38.84 c
38.77/38.84 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
38.77/38.84 c # [type: int, range: [-1,2147483647], default: 0]
38.77/38.84 c separating/flowcover/freq = -1
38.77/38.84 c
38.77/38.84 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
38.77/38.84 c # [type: int, range: [-1,2147483647], default: -1]
38.77/38.84 c separating/rapidlearning/freq = 0
38.77/38.84 c
38.77/38.84 c -----------------------------------------------------------------------------------------------
38.77/38.84 c start solving
38.98/39.02 c
41.26/41.50 c pressed CTRL-C 1 times (5 times for forcing termination)
42.03/42.31 EMALLC01 malloc: Out of memory - cannot allocate 72060672 bytes
42.03/42.31 c [src/scip/lpi_spx.cpp:1201] Warning: SoPlex threw an exception: XMALLC01 malloc: Could not allocate enough memory
42.03/42.31 c [src/scip/lp.c:5561] ERROR: Error <-6> in function call
42.03/42.31 c [src/scip/lp.c:5837] ERROR: Error <-6> in function call
42.03/42.31 c [src/scip/lp.c:11248] ERROR: Error <-6> in function call
42.03/42.31 c [src/scip/solve.c:801] ERROR: Error <-6> in function call
42.03/42.31 c [src/scip/solve.c:1912] ERROR: Error <-6> in function call
42.03/42.31 c [src/scip/solve.c:2591] ERROR: Error <-6> in function call
42.03/42.31 c [src/scip/solve.c:3206] ERROR: Error <-6> in function call
42.03/42.31 c [src/scip/scip.c:6312] ERROR: Error <-6> in function call
42.03/42.31 c [src/cmain.c:674] ERROR: Error <-6> in function call
42.03/42.31 c [src/cmain.c:849] ERROR: Error <-6> in function call
42.03/42.31 c [src/cmain.c:925] ERROR: Error <-6> in function call
42.03/42.31 c SCIP Error (-6): c error in LP solverc
42.03/42.31 c Time complete: 42.05.