0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
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-2667342-1276321102.opb>
17.38/17.41 c original problem has 2800 variables (2800 bin, 0 int, 0 impl, 0 cont) and 990001 constraints
17.38/17.41 c problem read
17.38/17.41 c No objective function, only one solution is needed.
17.38/17.41 c presolving settings loaded
21.09/21.16 c presolving:
32.78/32.83 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 990000 upgd conss, 2400 impls, 80 clqs
35.09/35.14 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 3241 chg coeffs, 990000 upgd conss, 2400 impls, 80 clqs
37.48/37.55 c presolving (3 rounds):
37.48/37.55 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 3414 changed coefficients
37.48/37.55 c 5520 implications, 80 cliques
37.48/37.55 c presolved problem has 2800 variables (2800 bin, 0 int, 0 impl, 0 cont) and 990001 constraints
37.48/37.55 c 3160 constraints of type <knapsack>
37.48/37.55 c 80 constraints of type <setppc>
37.48/37.55 c 1 constraints of type <linear>
37.48/37.55 c 986760 constraints of type <logicor>
37.48/37.55 c transformed objective value is always integral (scale: 1)
37.48/37.55 c Presolving Time: 13.66
37.48/37.55 c - non default parameters ----------------------------------------------------------------------
37.48/37.55 c # SCIP version 1.2.1.2
37.48/37.55 c
37.48/37.55 c # frequency for displaying node information lines
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 100]
37.48/37.55 c display/freq = 10000
37.48/37.55 c
37.48/37.55 c # maximal time in seconds to run
37.48/37.55 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
37.48/37.55 c limits/time = 1782.61
37.48/37.55 c
37.48/37.55 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
37.48/37.55 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
37.48/37.55 c limits/memory = 1620
37.48/37.55 c
37.48/37.55 c # solving stops, if the given number of solutions were found (-1: no limit)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: -1]
37.48/37.55 c limits/solutions = 1
37.48/37.55 c
37.48/37.55 c # maximal number of separation rounds per node (-1: unlimited)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 5]
37.48/37.55 c separating/maxrounds = 1
37.48/37.55 c
37.48/37.55 c # maximal number of separation rounds in the root node (-1: unlimited)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: -1]
37.48/37.55 c separating/maxroundsroot = 5
37.48/37.55 c
37.48/37.55 c # should presolving try to simplify inequalities
37.48/37.55 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
37.48/37.55 c constraints/linear/simplifyinequalities = TRUE
37.48/37.55 c
37.48/37.55 c # should disaggregation of knapsack constraints be allowed in preprocessing?
37.48/37.55 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
37.48/37.55 c constraints/knapsack/disaggregation = FALSE
37.48/37.55 c
37.48/37.55 c # should presolving try to simplify knapsacks
37.48/37.55 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
37.48/37.55 c constraints/knapsack/simplifyinequalities = TRUE
37.48/37.55 c
37.48/37.55 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: -1]
37.48/37.55 c presolving/probing/maxrounds = 0
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 10]
37.48/37.55 c heuristics/coefdiving/freq = -1
37.48/37.55 c
37.48/37.55 c # maximal fraction of diving LP iterations compared to node LP iterations
37.48/37.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
37.48/37.55 c heuristics/coefdiving/maxlpiterquot = 0.075
37.48/37.55 c
37.48/37.55 c # additional number of allowed LP iterations
37.48/37.55 c # [type: int, range: [0,2147483647], default: 1000]
37.48/37.55 c heuristics/coefdiving/maxlpiterofs = 1500
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 30]
37.48/37.55 c heuristics/crossover/freq = -1
37.48/37.55 c
37.48/37.55 c # number of nodes added to the contingent of the total nodes
37.48/37.55 c # [type: longint, range: [0,9223372036854775807], default: 500]
37.48/37.55 c heuristics/crossover/nodesofs = 750
37.48/37.55 c
37.48/37.55 c # number of nodes without incumbent change that heuristic should wait
37.48/37.55 c # [type: longint, range: [0,9223372036854775807], default: 200]
37.48/37.55 c heuristics/crossover/nwaitingnodes = 100
37.48/37.55 c
37.48/37.55 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
37.48/37.55 c # [type: real, range: [0,1], default: 0.1]
37.48/37.55 c heuristics/crossover/nodesquot = 0.15
37.48/37.55 c
37.48/37.55 c # minimum percentage of integer variables that have to be fixed
37.48/37.55 c # [type: real, range: [0,1], default: 0.666]
37.48/37.55 c heuristics/crossover/minfixingrate = 0.5
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 20]
37.48/37.55 c heuristics/feaspump/freq = -1
37.48/37.55 c
37.48/37.55 c # additional number of allowed LP iterations
37.48/37.55 c # [type: int, range: [0,2147483647], default: 1000]
37.48/37.55 c heuristics/feaspump/maxlpiterofs = 2000
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 10]
37.48/37.55 c heuristics/fracdiving/freq = -1
37.48/37.55 c
37.48/37.55 c # maximal fraction of diving LP iterations compared to node LP iterations
37.48/37.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
37.48/37.55 c heuristics/fracdiving/maxlpiterquot = 0.075
37.48/37.55 c
37.48/37.55 c # additional number of allowed LP iterations
37.48/37.55 c # [type: int, range: [0,2147483647], default: 1000]
37.48/37.55 c heuristics/fracdiving/maxlpiterofs = 1500
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 10]
37.48/37.55 c heuristics/guideddiving/freq = -1
37.48/37.55 c
37.48/37.55 c # maximal fraction of diving LP iterations compared to node LP iterations
37.48/37.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
37.48/37.55 c heuristics/guideddiving/maxlpiterquot = 0.075
37.48/37.55 c
37.48/37.55 c # additional number of allowed LP iterations
37.48/37.55 c # [type: int, range: [0,2147483647], default: 1000]
37.48/37.55 c heuristics/guideddiving/maxlpiterofs = 1500
37.48/37.55 c
37.48/37.55 c # maximal fraction of diving LP iterations compared to node LP iterations
37.48/37.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
37.48/37.55 c heuristics/intdiving/maxlpiterquot = 0.075
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 10]
37.48/37.55 c heuristics/intshifting/freq = -1
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 10]
37.48/37.55 c heuristics/linesearchdiving/freq = -1
37.48/37.55 c
37.48/37.55 c # maximal fraction of diving LP iterations compared to node LP iterations
37.48/37.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
37.48/37.55 c heuristics/linesearchdiving/maxlpiterquot = 0.075
37.48/37.55 c
37.48/37.55 c # additional number of allowed LP iterations
37.48/37.55 c # [type: int, range: [0,2147483647], default: 1000]
37.48/37.55 c heuristics/linesearchdiving/maxlpiterofs = 1500
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 1]
37.48/37.55 c heuristics/nlp/freq = -1
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 20]
37.48/37.55 c heuristics/objpscostdiving/freq = -1
37.48/37.55 c
37.48/37.55 c # maximal fraction of diving LP iterations compared to total iteration number
37.48/37.55 c # [type: real, range: [0,1], default: 0.01]
37.48/37.55 c heuristics/objpscostdiving/maxlpiterquot = 0.015
37.48/37.55 c
37.48/37.55 c # additional number of allowed LP iterations
37.48/37.55 c # [type: int, range: [0,2147483647], default: 1000]
37.48/37.55 c heuristics/objpscostdiving/maxlpiterofs = 1500
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 1]
37.48/37.55 c heuristics/oneopt/freq = -1
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 10]
37.48/37.55 c heuristics/pscostdiving/freq = -1
37.48/37.55 c
37.48/37.55 c # maximal fraction of diving LP iterations compared to node LP iterations
37.48/37.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
37.48/37.55 c heuristics/pscostdiving/maxlpiterquot = 0.075
37.48/37.55 c
37.48/37.55 c # additional number of allowed LP iterations
37.48/37.55 c # [type: int, range: [0,2147483647], default: 1000]
37.48/37.55 c heuristics/pscostdiving/maxlpiterofs = 1500
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 0]
37.48/37.55 c heuristics/rens/freq = -1
37.48/37.55 c
37.48/37.55 c # minimum percentage of integer variables that have to be fixable
37.48/37.55 c # [type: real, range: [0,1], default: 0.5]
37.48/37.55 c heuristics/rens/minfixingrate = 0.3
37.48/37.55 c
37.48/37.55 c # number of nodes added to the contingent of the total nodes
37.48/37.55 c # [type: longint, range: [0,9223372036854775807], default: 500]
37.48/37.55 c heuristics/rens/nodesofs = 2000
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 20]
37.48/37.55 c heuristics/rootsoldiving/freq = -1
37.48/37.55 c
37.48/37.55 c # maximal fraction of diving LP iterations compared to node LP iterations
37.48/37.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
37.48/37.55 c heuristics/rootsoldiving/maxlpiterquot = 0.015
37.48/37.55 c
37.48/37.55 c # additional number of allowed LP iterations
37.48/37.55 c # [type: int, range: [0,2147483647], default: 1000]
37.48/37.55 c heuristics/rootsoldiving/maxlpiterofs = 1500
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 1]
37.48/37.55 c heuristics/rounding/freq = -1
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 10]
37.48/37.55 c heuristics/shifting/freq = -1
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 1]
37.48/37.55 c heuristics/simplerounding/freq = -1
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 0]
37.48/37.55 c heuristics/trivial/freq = -1
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 1]
37.48/37.55 c heuristics/trysol/freq = -1
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 10]
37.48/37.55 c heuristics/veclendiving/freq = -1
37.48/37.55 c
37.48/37.55 c # maximal fraction of diving LP iterations compared to node LP iterations
37.48/37.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
37.48/37.55 c heuristics/veclendiving/maxlpiterquot = 0.075
37.48/37.55 c
37.48/37.55 c # additional number of allowed LP iterations
37.48/37.55 c # [type: int, range: [0,2147483647], default: 1000]
37.48/37.55 c heuristics/veclendiving/maxlpiterofs = 1500
37.48/37.55 c
37.48/37.55 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 1]
37.48/37.55 c heuristics/zirounding/freq = -1
37.48/37.55 c
37.48/37.55 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 0]
37.48/37.55 c separating/cmir/freq = -1
37.48/37.55 c
37.48/37.55 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: 0]
37.48/37.55 c separating/flowcover/freq = -1
37.48/37.55 c
37.48/37.55 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
37.48/37.55 c # [type: int, range: [-1,2147483647], default: -1]
37.48/37.55 c separating/rapidlearning/freq = 0
37.48/37.55 c
37.48/37.55 c -----------------------------------------------------------------------------------------------
37.48/37.55 c start solving
37.58/37.61 c
43.27/43.31 c pressed CTRL-C 1 times (5 times for forcing termination)
43.46/43.53 EMALLC02 realloc: Out of memory - cannot allocate 825520 bytes
43.46/43.55 c [src/scip/lpi_spx.cpp:1048] Warning: SoPlex threw an exception: XMALLC02 realloc: Could not allocate enough memory
43.46/43.55 c [src/scip/lp.c:5536] ERROR: Error <-6> in function call
43.46/43.55 c [src/scip/lp.c:5812] ERROR: Error <-6> in function call
43.46/43.55 c [src/scip/lp.c:11214] ERROR: Error <-6> in function call
43.46/43.55 c [src/scip/solve.c:807] ERROR: Error <-6> in function call
43.46/43.55 c [src/scip/solve.c:1863] ERROR: Error <-6> in function call
43.46/43.55 c [src/scip/solve.c:2577] ERROR: Error <-6> in function call
43.46/43.55 c [src/scip/solve.c:3189] ERROR: Error <-6> in function call
43.46/43.55 c [src/scip/scip.c:6167] ERROR: Error <-6> in function call
43.46/43.55 c [src/cmain.c:657] ERROR: Error <-6> in function call
43.46/43.55 c [src/cmain.c:832] ERROR: Error <-6> in function call
43.46/43.55 c [src/cmain.c:908] ERROR: Error <-6> in function call
43.46/43.55 c SCIP Error (-6): c error in LP solverc
43.46/43.55 c Time complete: 43.51.