11.69/11.74 c SCIP version 1.1.0.7
11.69/11.74 c LP-Solver Clp 1.8.2
11.69/11.74 c user parameter file <scip.set> not found - using default parameters
11.69/11.74 c read problem <HOME/instance-1884248-1245256242.opb>
11.69/11.74 c original problem has 276402 variables (276402 bin, 0 int, 0 impl, 0 cont) and 798348 constraints
14.88/14.97 c No objective function, only one solution is needed.
14.88/14.97 c start presolving problem
14.88/14.97 c presolving:
26.88/26.94 c (round 1) 99662 del vars, 44010 del conss, 12475 chg bounds, 268 chg sides, 3336 chg coeffs, 0 upgd conss, 9724924 impls, 0 clqs
29.88/29.96 c (round 2) 100359 del vars, 171579 del conss, 12574 chg bounds, 315 chg sides, 3395 chg coeffs, 0 upgd conss, 9741312 impls, 0 clqs
30.38/30.47 c (round 3) 100500 del vars, 171921 del conss, 12642 chg bounds, 317 chg sides, 3399 chg coeffs, 0 upgd conss, 9741590 impls, 0 clqs
30.88/30.97 c (round 4) 100538 del vars, 172161 del conss, 12677 chg bounds, 319 chg sides, 3403 chg coeffs, 0 upgd conss, 9741731 impls, 0 clqs
32.27/32.32 c (round 5) 100558 del vars, 172200 del conss, 12691 chg bounds, 319 chg sides, 3403 chg coeffs, 0 upgd conss, 9741847 impls, 0 clqs
33.17/33.25 c (round 6) 100576 del vars, 172238 del conss, 12703 chg bounds, 320 chg sides, 3405 chg coeffs, 0 upgd conss, 9741866 impls, 0 clqs
34.07/34.13 c (round 7) 100597 del vars, 172280 del conss, 12715 chg bounds, 322 chg sides, 3410 chg coeffs, 0 upgd conss, 9741878 impls, 0 clqs
36.18/36.21 c (round 8) 100614 del vars, 172317 del conss, 12727 chg bounds, 327 chg sides, 3420 chg coeffs, 0 upgd conss, 9741887 impls, 0 clqs
41.46/41.50 c (round 9) 100631 del vars, 172362 del conss, 12740 chg bounds, 340 chg sides, 3446 chg coeffs, 0 upgd conss, 9741900 impls, 0 clqs
50.46/50.51 c (round 10) 100642 del vars, 173032 del conss, 12751 chg bounds, 351 chg sides, 3468 chg coeffs, 623014 upgd conss, 9741911 impls, 0 clqs
51.85/51.91 c (round 11) 100643 del vars, 173058 del conss, 12751 chg bounds, 351 chg sides, 3468 chg coeffs, 624680 upgd conss, 9741911 impls, 0 clqs
53.06/53.18 c presolving (12 rounds):
53.06/53.18 c 100643 deleted vars, 173058 deleted constraints, 12751 tightened bounds, 0 added holes, 351 changed sides, 3468 changed coefficients
53.06/53.18 c 9741911 implications, 0 cliques
53.06/53.18 c presolved problem has 175759 variables (175759 bin, 0 int, 0 impl, 0 cont) and 625290 constraints
53.06/53.18 c 636 constraints of type <linear>
53.06/53.18 c 624654 constraints of type <logicor>
53.06/53.18 c transformed objective value is always integral (scale: 1)
53.06/53.18 c Presolving Time: 27.25
53.06/53.18 c SATUNSAT-LIN
53.06/53.18 c -----------------------------------------------------------------------------------------------
53.06/53.18 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
53.06/53.18 c # [type: int, range: [-1,2147483647], default: 0]
53.06/53.18 c separating/flowcover/freq = c -1
53.06/53.18 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
53.06/53.18 c # [type: int, range: [-1,2147483647], default: 0]
53.06/53.18 c separating/cmir/freq = c -1
53.06/53.18 c # additional number of allowed LP iterations
53.06/53.18 c # [type: int, range: [0,2147483647], default: 1000]
53.06/53.18 c heuristics/veclendiving/maxlpiterofs = c 1500
53.06/53.18 c # maximal fraction of diving LP iterations compared to node LP iterations
53.06/53.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
53.06/53.18 c heuristics/veclendiving/maxlpiterquot = c 0.075
53.06/53.18 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
53.06/53.18 c # [type: int, range: [-1,2147483647], default: 10]
53.06/53.18 c heuristics/veclendiving/freq = c -1
53.06/53.18 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
53.06/53.18 c # [type: int, range: [-1,2147483647], default: 1]
53.06/53.18 c heuristics/simplerounding/freq = c -1
53.06/53.18 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
53.06/53.18 c # [type: int, range: [-1,2147483647], default: 10]
53.06/53.18 c heuristics/shifting/freq = c -1
53.06/53.18 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
53.06/53.18 c # [type: int, range: [-1,2147483647], default: 1]
53.06/53.18 c heuristics/rounding/freq = c -1
53.06/53.18 c # additional number of allowed LP iterations
53.06/53.18 c # [type: int, range: [0,2147483647], default: 1000]
53.06/53.18 c heuristics/rootsoldiving/maxlpiterofs = c 1500
53.06/53.18 c # maximal fraction of diving LP iterations compared to node LP iterations
53.06/53.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
53.06/53.18 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
53.06/53.18 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
53.06/53.18 c # [type: int, range: [-1,2147483647], default: 20]
53.06/53.18 c heuristics/rootsoldiving/freq = c -1
53.06/53.18 c # number of nodes added to the contingent of the total nodes
53.06/53.18 c # [type: longint, range: [0,9223372036854775807], default: 500]
53.06/53.18 c heuristics/rens/nodesofs = c 2000
53.06/53.18 c # minimum percentage of integer variables that have to be fixable
53.06/53.18 c # [type: real, range: [0,1], default: 0.5]
53.06/53.18 c heuristics/rens/minfixingrate = c 0.3
53.06/53.18 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
53.06/53.18 c # [type: int, range: [-1,2147483647], default: 0]
53.06/53.18 c heuristics/rens/freq = c -1
53.06/53.18 c # additional number of allowed LP iterations
53.06/53.18 c # [type: int, range: [0,2147483647], default: 1000]
53.06/53.18 c heuristics/pscostdiving/maxlpiterofs = c 1500
53.06/53.18 c # maximal fraction of diving LP iterations compared to node LP iterations
53.06/53.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
53.06/53.18 c heuristics/pscostdiving/maxlpiterquot = c 0.075
53.06/53.18 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
53.06/53.18 c # [type: int, range: [-1,2147483647], default: 10]
53.06/53.18 c heuristics/pscostdiving/freq = c -1
53.06/53.18 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
53.06/53.19 c # [type: int, range: [-1,2147483647], default: 1]
53.06/53.19 c heuristics/oneopt/freq = c -1
53.06/53.19 c # additional number of allowed LP iterations
53.06/53.19 c # [type: int, range: [0,2147483647], default: 1000]
53.06/53.19 c heuristics/objpscostdiving/maxlpiterofs = c 1500
53.06/53.19 c # maximal fraction of diving LP iterations compared to total iteration number
53.06/53.19 c # [type: real, range: [0,1], default: 0.01]
53.06/53.19 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
53.06/53.19 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
53.06/53.19 c # [type: int, range: [-1,2147483647], default: 20]
53.06/53.19 c heuristics/objpscostdiving/freq = c -1
53.06/53.19 c # additional number of allowed LP iterations
53.06/53.19 c # [type: int, range: [0,2147483647], default: 1000]
53.06/53.19 c heuristics/linesearchdiving/maxlpiterofs = c 1500
53.06/53.19 c # maximal fraction of diving LP iterations compared to node LP iterations
53.06/53.19 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
53.06/53.19 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
53.06/53.19 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
53.06/53.19 c # [type: int, range: [-1,2147483647], default: 10]
53.06/53.19 c heuristics/linesearchdiving/freq = c -1
53.06/53.19 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
53.06/53.19 c # [type: int, range: [-1,2147483647], default: 10]
53.06/53.19 c heuristics/intshifting/freq = c -1
53.06/53.19 c # maximal fraction of diving LP iterations compared to node LP iterations
53.06/53.19 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
53.06/53.19 c heuristics/intdiving/maxlpiterquot = c 0.075
53.06/53.19 c # additional number of allowed LP iterations
53.06/53.19 c # [type: int, range: [0,2147483647], default: 1000]
53.06/53.19 c heuristics/guideddiving/maxlpiterofs = c 1500
53.06/53.19 c # maximal fraction of diving LP iterations compared to node LP iterations
53.06/53.19 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
53.06/53.19 c heuristics/guideddiving/maxlpiterquot = c 0.075
53.06/53.19 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
53.06/53.19 c # [type: int, range: [-1,2147483647], default: 10]
53.06/53.19 c heuristics/guideddiving/freq = c -1
53.06/53.19 c # additional number of allowed LP iterations
53.06/53.19 c # [type: int, range: [0,2147483647], default: 1000]
53.06/53.19 c heuristics/fracdiving/maxlpiterofs = c 1500
53.06/53.19 c # maximal fraction of diving LP iterations compared to node LP iterations
53.06/53.19 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
53.06/53.19 c heuristics/fracdiving/maxlpiterquot = c 0.075
53.06/53.19 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
53.06/53.19 c # [type: int, range: [-1,2147483647], default: 10]
53.06/53.19 c heuristics/fracdiving/freq = c -1
53.06/53.19 c # additional number of allowed LP iterations
53.06/53.19 c # [type: int, range: [0,2147483647], default: 1000]
53.06/53.19 c heuristics/feaspump/maxlpiterofs = c 2000
53.06/53.19 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
53.06/53.19 c # [type: int, range: [-1,2147483647], default: 20]
53.06/53.19 c heuristics/feaspump/freq = c -1
53.06/53.19 c # minimum percentage of integer variables that have to be fixed
53.06/53.19 c # [type: real, range: [0,1], default: 0.666]
53.06/53.19 c heuristics/crossover/minfixingrate = c 0.5
53.06/53.19 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
53.06/53.19 c # [type: real, range: [0,1], default: 0.1]
53.06/53.19 c heuristics/crossover/nodesquot = c 0.15
53.06/53.19 c # number of nodes without incumbent change that heuristic should wait
53.06/53.19 c # [type: longint, range: [0,9223372036854775807], default: 200]
53.06/53.19 c heuristics/crossover/nwaitingnodes = c 100
53.06/53.19 c # number of nodes added to the contingent of the total nodes
53.06/53.19 c # [type: longint, range: [0,9223372036854775807], default: 500]
53.06/53.19 c heuristics/crossover/nodesofs = c 750
53.06/53.19 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
53.06/53.19 c # [type: int, range: [-1,2147483647], default: 30]
53.06/53.19 c heuristics/crossover/freq = c -1
53.06/53.19 c # additional number of allowed LP iterations
53.06/53.19 c # [type: int, range: [0,2147483647], default: 1000]
53.06/53.19 c heuristics/coefdiving/maxlpiterofs = c 1500
53.06/53.19 c # maximal fraction of diving LP iterations compared to node LP iterations
53.06/53.19 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
53.06/53.19 c heuristics/coefdiving/maxlpiterquot = c 0.075
53.06/53.19 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
53.06/53.19 c # [type: int, range: [-1,2147483647], default: 10]
53.06/53.19 c heuristics/coefdiving/freq = c -1
53.06/53.19 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
53.06/53.19 c # [type: int, range: [-1,2147483647], default: -1]
53.06/53.19 c presolving/probing/maxrounds = c 0
53.06/53.19 c # should presolving try to simplify knapsacks
53.06/53.19 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
53.06/53.19 c constraints/knapsack/simplifyinequalities = c TRUE
53.06/53.19 c # should disaggregation of knapsack constraints be allowed in preprocessing?
53.06/53.19 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
53.06/53.19 c constraints/knapsack/disaggregation = c FALSE
53.06/53.19 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
53.06/53.19 c # [type: int, range: [-1,2147483647], default: -1]
53.06/53.19 c constraints/knapsack/maxnumcardlift = c 0
53.06/53.19 c # should presolving try to simplify inequalities
53.26/53.36 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
53.26/53.36 c constraints/linear/simplifyinequalities = c TRUE
53.26/53.36 c # maximal number of separation rounds in the root node (-1: unlimited)
53.26/53.36 c # [type: int, range: [-1,2147483647], default: -1]
53.26/53.36 c separating/maxroundsroot = c 5
53.26/53.36 c # maximal number of separation rounds per node (-1: unlimited)
53.26/53.36 c # [type: int, range: [-1,2147483647], default: 5]
53.26/53.36 c separating/maxrounds = c 1
53.26/53.36 c # solving stops, if the given number of solutions were found (-1: no limit)
53.26/53.36 c # [type: int, range: [-1,2147483647], default: -1]
53.26/53.36 c limits/solutions = c 1
53.26/53.36 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
53.26/53.36 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
53.26/53.36 c limits/memory = c 1620
53.26/53.36 c # maximal time in seconds to run
53.26/53.36 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
53.26/53.36 c limits/time = c 1791
53.26/53.36 c # frequency for displaying node information lines
53.26/53.36 c # [type: int, range: [-1,2147483647], default: 100]
53.26/53.36 c display/freq = c 10000
53.26/53.36 c -----------------------------------------------------------------------------------------------
53.26/53.36 c start solving problem
53.26/53.36 c
55.36/55.40 c [src/scip/buffer.c:123] ERROR: Insufficient memory for reallocation of 5180899 bytes
55.36/55.40 c [src/scip/buffer.c:123] ERROR: No memory in function call
55.36/55.40 c [src/scip/lp.c:5442] ERROR: Error <-1> in function call
55.36/55.40 c [src/scip/lp.c:5789] ERROR: Error <-1> in function call
55.36/55.40 c [src/scip/lp.c:10503] ERROR: Error <-1> in function call
55.36/55.40 c [src/scip/solve.c:670] ERROR: Error <-1> in function call
55.36/55.40 c [src/scip/solve.c:1842] ERROR: Error <-1> in function call
55.36/55.40 c [src/scip/solve.c:2513] ERROR: Error <-1> in function call
55.36/55.40 c [src/scip/solve.c:3110] ERROR: Error <-1> in function call
55.36/55.40 c [src/scip/scip.c:5251] ERROR: Error <-1> in function call
55.36/55.40 c [src/cmain.c:772] ERROR: Error <-1> in function call
55.36/55.40 c [src/cmain.c:1137] ERROR: Error <-1> in function call
55.36/55.40 c [src/cmain.c:1217] ERROR: Error <-1> in function call
55.36/55.40 c SCIP Error (-1): c insufficient memory errorc
55.36/55.40 c Time complete: 55.36.