12.19/12.22 c SCIP version 1.1.0.7
12.19/12.22 c LP-Solver SoPlex 1.4.1
12.19/12.22 c user parameter file <scip.set> not found - using default parameters
12.19/12.22 c read problem <HOME/instance-1868408-1245124963.opb>
12.19/12.22 c original problem has 4500 variables (4500 bin, 0 int, 0 impl, 0 cont) and 674250 constraints
16.27/16.32 c No objective function, only one solution is needed.
16.27/16.32 c start presolving problem
16.27/16.32 c presolving:
25.12/25.25 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
26.22/26.32 c presolving (2 rounds):
26.22/26.32 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
26.22/26.32 c 0 implications, 1500 cliques
26.22/26.32 c presolved problem has 4500 variables (4500 bin, 0 int, 0 impl, 0 cont) and 674250 constraints
26.22/26.32 c 1500 constraints of type <setppc>
26.22/26.32 c 672750 constraints of type <logicor>
26.22/26.32 c transformed objective value is always integral (scale: 1)
26.22/26.32 c Presolving Time: 8.49
26.22/26.32 c SATUNSAT-LIN
26.22/26.32 c -----------------------------------------------------------------------------------------------
26.22/26.32 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: 0]
26.22/26.32 c separating/flowcover/freq = c -1
26.22/26.32 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: 0]
26.22/26.32 c separating/cmir/freq = c -1
26.22/26.32 c # additional number of allowed LP iterations
26.22/26.32 c # [type: int, range: [0,2147483647], default: 1000]
26.22/26.32 c heuristics/veclendiving/maxlpiterofs = c 1500
26.22/26.32 c # maximal fraction of diving LP iterations compared to node LP iterations
26.22/26.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
26.22/26.32 c heuristics/veclendiving/maxlpiterquot = c 0.075
26.22/26.32 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: 10]
26.22/26.32 c heuristics/veclendiving/freq = c -1
26.22/26.32 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: 1]
26.22/26.32 c heuristics/simplerounding/freq = c -1
26.22/26.32 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: 10]
26.22/26.32 c heuristics/shifting/freq = c -1
26.22/26.32 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: 1]
26.22/26.32 c heuristics/rounding/freq = c -1
26.22/26.32 c # additional number of allowed LP iterations
26.22/26.32 c # [type: int, range: [0,2147483647], default: 1000]
26.22/26.32 c heuristics/rootsoldiving/maxlpiterofs = c 1500
26.22/26.32 c # maximal fraction of diving LP iterations compared to node LP iterations
26.22/26.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
26.22/26.32 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
26.22/26.32 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: 20]
26.22/26.32 c heuristics/rootsoldiving/freq = c -1
26.22/26.32 c # number of nodes added to the contingent of the total nodes
26.22/26.32 c # [type: longint, range: [0,9223372036854775807], default: 500]
26.22/26.32 c heuristics/rens/nodesofs = c 2000
26.22/26.32 c # minimum percentage of integer variables that have to be fixable
26.22/26.32 c # [type: real, range: [0,1], default: 0.5]
26.22/26.32 c heuristics/rens/minfixingrate = c 0.3
26.22/26.32 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: 0]
26.22/26.32 c heuristics/rens/freq = c -1
26.22/26.32 c # additional number of allowed LP iterations
26.22/26.32 c # [type: int, range: [0,2147483647], default: 1000]
26.22/26.32 c heuristics/pscostdiving/maxlpiterofs = c 1500
26.22/26.32 c # maximal fraction of diving LP iterations compared to node LP iterations
26.22/26.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
26.22/26.32 c heuristics/pscostdiving/maxlpiterquot = c 0.075
26.22/26.32 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: 10]
26.22/26.32 c heuristics/pscostdiving/freq = c -1
26.22/26.32 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: 1]
26.22/26.32 c heuristics/oneopt/freq = c -1
26.22/26.32 c # additional number of allowed LP iterations
26.22/26.32 c # [type: int, range: [0,2147483647], default: 1000]
26.22/26.32 c heuristics/objpscostdiving/maxlpiterofs = c 1500
26.22/26.32 c # maximal fraction of diving LP iterations compared to total iteration number
26.22/26.32 c # [type: real, range: [0,1], default: 0.01]
26.22/26.32 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
26.22/26.32 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: 20]
26.22/26.32 c heuristics/objpscostdiving/freq = c -1
26.22/26.32 c # additional number of allowed LP iterations
26.22/26.32 c # [type: int, range: [0,2147483647], default: 1000]
26.22/26.32 c heuristics/linesearchdiving/maxlpiterofs = c 1500
26.22/26.32 c # maximal fraction of diving LP iterations compared to node LP iterations
26.22/26.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
26.22/26.32 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
26.22/26.32 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: 10]
26.22/26.32 c heuristics/linesearchdiving/freq = c -1
26.22/26.32 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: 10]
26.22/26.32 c heuristics/intshifting/freq = c -1
26.22/26.32 c # maximal fraction of diving LP iterations compared to node LP iterations
26.22/26.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
26.22/26.32 c heuristics/intdiving/maxlpiterquot = c 0.075
26.22/26.32 c # additional number of allowed LP iterations
26.22/26.32 c # [type: int, range: [0,2147483647], default: 1000]
26.22/26.32 c heuristics/guideddiving/maxlpiterofs = c 1500
26.22/26.32 c # maximal fraction of diving LP iterations compared to node LP iterations
26.22/26.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
26.22/26.32 c heuristics/guideddiving/maxlpiterquot = c 0.075
26.22/26.32 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: 10]
26.22/26.32 c heuristics/guideddiving/freq = c -1
26.22/26.32 c # additional number of allowed LP iterations
26.22/26.32 c # [type: int, range: [0,2147483647], default: 1000]
26.22/26.32 c heuristics/fracdiving/maxlpiterofs = c 1500
26.22/26.32 c # maximal fraction of diving LP iterations compared to node LP iterations
26.22/26.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
26.22/26.32 c heuristics/fracdiving/maxlpiterquot = c 0.075
26.22/26.32 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: 10]
26.22/26.32 c heuristics/fracdiving/freq = c -1
26.22/26.32 c # additional number of allowed LP iterations
26.22/26.32 c # [type: int, range: [0,2147483647], default: 1000]
26.22/26.32 c heuristics/feaspump/maxlpiterofs = c 2000
26.22/26.32 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: 20]
26.22/26.32 c heuristics/feaspump/freq = c -1
26.22/26.32 c # minimum percentage of integer variables that have to be fixed
26.22/26.32 c # [type: real, range: [0,1], default: 0.666]
26.22/26.32 c heuristics/crossover/minfixingrate = c 0.5
26.22/26.32 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
26.22/26.32 c # [type: real, range: [0,1], default: 0.1]
26.22/26.32 c heuristics/crossover/nodesquot = c 0.15
26.22/26.32 c # number of nodes without incumbent change that heuristic should wait
26.22/26.32 c # [type: longint, range: [0,9223372036854775807], default: 200]
26.22/26.32 c heuristics/crossover/nwaitingnodes = c 100
26.22/26.32 c # number of nodes added to the contingent of the total nodes
26.22/26.32 c # [type: longint, range: [0,9223372036854775807], default: 500]
26.22/26.32 c heuristics/crossover/nodesofs = c 750
26.22/26.32 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: 30]
26.22/26.32 c heuristics/crossover/freq = c -1
26.22/26.32 c # additional number of allowed LP iterations
26.22/26.32 c # [type: int, range: [0,2147483647], default: 1000]
26.22/26.32 c heuristics/coefdiving/maxlpiterofs = c 1500
26.22/26.32 c # maximal fraction of diving LP iterations compared to node LP iterations
26.22/26.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
26.22/26.32 c heuristics/coefdiving/maxlpiterquot = c 0.075
26.22/26.32 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: 10]
26.22/26.32 c heuristics/coefdiving/freq = c -1
26.22/26.32 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: -1]
26.22/26.32 c presolving/probing/maxrounds = c 0
26.22/26.32 c # should presolving try to simplify knapsacks
26.22/26.32 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
26.22/26.32 c constraints/knapsack/simplifyinequalities = c TRUE
26.22/26.32 c # should disaggregation of knapsack constraints be allowed in preprocessing?
26.22/26.32 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
26.22/26.32 c constraints/knapsack/disaggregation = c FALSE
26.22/26.32 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
26.22/26.32 c # [type: int, range: [-1,2147483647], default: -1]
26.22/26.32 c constraints/knapsack/maxnumcardlift = c 0
26.22/26.32 c # should presolving try to simplify inequalities
26.22/26.37 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
26.22/26.37 c constraints/linear/simplifyinequalities = c TRUE
26.22/26.37 c # maximal number of separation rounds in the root node (-1: unlimited)
26.22/26.37 c # [type: int, range: [-1,2147483647], default: -1]
26.22/26.37 c separating/maxroundsroot = c 5
26.22/26.37 c # maximal number of separation rounds per node (-1: unlimited)
26.22/26.37 c # [type: int, range: [-1,2147483647], default: 5]
26.22/26.37 c separating/maxrounds = c 1
26.22/26.37 c # solving stops, if the given number of solutions were found (-1: no limit)
26.22/26.37 c # [type: int, range: [-1,2147483647], default: -1]
26.22/26.37 c limits/solutions = c 1
26.22/26.37 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
26.22/26.37 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
26.22/26.37 c limits/memory = c 1620
26.22/26.37 c # maximal time in seconds to run
26.22/26.37 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
26.22/26.37 c limits/time = c 1791
26.22/26.37 c # frequency for displaying node information lines
26.22/26.37 c # [type: int, range: [-1,2147483647], default: 100]
26.22/26.37 c display/freq = c 10000
26.22/26.37 c -----------------------------------------------------------------------------------------------
26.22/26.37 c start solving problem
26.22/26.37 c
32.74/32.97 EMALLC02 realloc: Out of memory - cannot allocate 26372784 bytes
32.74/32.99 c [src/scip/lpi_spx.cpp:918] Warning: SoPlex threw an exception: XMALLC02 realloc: Could not allocate enough memory
32.74/32.99 c [src/scip/lp.c:5513] ERROR: Error <-6> in function call
32.74/32.99 c [src/scip/lp.c:5789] ERROR: Error <-6> in function call
32.74/32.99 c [src/scip/lp.c:10503] ERROR: Error <-6> in function call
32.74/32.99 c [src/scip/solve.c:670] ERROR: Error <-6> in function call
32.74/32.99 c [src/scip/solve.c:1842] ERROR: Error <-6> in function call
32.74/32.99 c [src/scip/solve.c:2513] ERROR: Error <-6> in function call
32.74/32.99 c [src/scip/solve.c:3110] ERROR: Error <-6> in function call
32.74/32.99 c [src/scip/scip.c:5251] ERROR: Error <-6> in function call
32.74/32.99 c [src/cmain.c:772] ERROR: Error <-6> in function call
32.74/32.99 c [src/cmain.c:1137] ERROR: Error <-6> in function call
32.74/32.99 c [src/cmain.c:1217] ERROR: Error <-6> in function call
32.74/32.99 c SCIP Error (-6): c error in LP solverc
32.74/32.99 c Time complete: 32.83.