Trace number 2704176

Some explanations

A solver is run under the control of another program named runsolver. runsolver is in charge of imposing the CPU time limit and the memory limit to the solver. It also monitors some information about the process. The trace of the execution of a solver is divided into four (or five) parts:
  1. SOLVER DATA
    This is the output of the solver (stdout and stderr).
    Note that some very long lines in this section may be truncated by your web browser ! In such a case, you may want to use the "Download as text" link to get the trace as a text file.

    When the --timestamp option is passed to the runsolver program, each line output by the solver is prepended with a timestamp which indicates at what time the line was output by the solver. Times are relative to the start of the program, given in seconds. The first timestamp (if present) is estimated CPU time. The last timestamp is wall clock time.

    As some 'v lines' may be very long (sometimes several megabytes), the 'v line' output by your solver may be split on several lines to help limit the size of the trace recorded in the database. In any case, the exact output of your solver is preserved in a trace file.
  2. VERIFIER DATA
    The output of the solver is piped to a verifier program which will search a value line "v " and, if found, will check that the given interpretation satisfies all constraints.
  3. CONVERSION SCRIPT DATA (Optionnal)
    When a conversion script is used, this section shows the messages that were output by the conversion script.
  4. WATCHER DATA
    This is the informations gathered by the runsolver program. It first prints the different limits. There's a first limit on CPU time set to X seconds (see the parameters in the trace). After this time has ellapsed, runsolver sends a SIGTERM and 2 seconds later a SIGKILL to the solver. For safety, there's also another limit set to X+30 seconds which will send a SIGXPU to the solver. The last limit is on the virtual memory used by the process (see the parameters in the trace).
    Every ten seconds, the runsolver process fetches the content of /proc/loadavg, /proc/pid/stat and /proc/pid/statm (see man proc) and prints it as raw data. This is only recorded in case we need to investigate the behaviour of a solver. The memory used by the solver (vsize) is also given every ten seconds.
    When the solver exits, runsolver prints some informations such as status and time. CPU usage is the ratio CPU Time/Real Time.
  5. LAUNCHER DATA
    These informations are related to the script which will launch the solver. The most important informations are the command line given to the solver, the md5sum of the different files and the dump of the /proc/cpuinfo and /proc/meminfo which provides some useful information on the computer.

Solver answer on this benchmark

Solver NameAnswerCPU timeWall clock time
SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver? (MO) 37.4453 37.472

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/liu/
dbst/normalized-dbst_v40_e600_d20_mw10_5.opb.PB06.opb
MD5SUM051b48fdf5558d73afe4ee3d3cae609a
Bench CategoryDEC-SMALLINT (no optimisation, small integers)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark0
Best CPU time to get the best result obtained on this benchmark2.96955
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables2800
Total number of constraints990001
Number of constraints which are clauses986760
Number of constraints which are cardinality constraints (but not clauses)81
Number of constraints which are nor clauses,nor cardinality constraints3160
Minimum length of a constraint2
Maximum length of a constraint1200
Number of terms in the objective function 0
Biggest coefficient in the objective function 0
Number of bits for the biggest coefficient in the objective function 0
Sum of the numbers in the objective function 0
Number of bits of the sum of numbers in the objective function 0
Biggest number in a constraint 336
Number of bits of the biggest number in a constraint 9
Biggest sum of numbers in a constraint 1239
Number of bits of the biggest sum of numbers11
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Solver Data 

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-2704176-1278550004.opb>
16.09/16.11	c original problem has 2800 variables (2800 bin, 0 int, 0 impl, 0 cont) and 990001 constraints
16.09/16.11	c problem read
16.09/16.11	c No objective function, only one solution is needed.
16.09/16.11	c presolving settings loaded
19.69/19.72	c presolving:
28.38/28.42	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
30.08/30.14	c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 3226 chg coeffs, 990000 upgd conss, 2400 impls, 80 clqs
31.89/31.96	c presolving (3 rounds):
31.89/31.96	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 3374 changed coefficients
31.89/31.96	c  5520 implications, 80 cliques
31.89/31.96	c presolved problem has 2800 variables (2800 bin, 0 int, 0 impl, 0 cont) and 990001 constraints
31.89/31.96	c    3160 constraints of type <knapsack>
31.89/31.96	c    1280 constraints of type <setppc>
31.89/31.96	c       1 constraints of type <linear>
31.89/31.96	c  985560 constraints of type <logicor>
31.89/31.96	c transformed objective value is always integral (scale: 1)
31.89/31.96	c Presolving Time: 12.78
31.89/31.96	c - non default parameters ----------------------------------------------------------------------
31.89/31.96	c # SCIP version 1.2.1.3
31.89/31.96	c 
31.89/31.96	c # frequency for displaying node information lines
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 100]
31.89/31.96	c display/freq = 10000
31.89/31.96	c 
31.89/31.96	c # maximal time in seconds to run
31.89/31.96	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
31.89/31.96	c limits/time = 1773.89
31.89/31.96	c 
31.89/31.96	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
31.89/31.96	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
31.89/31.96	c limits/memory = 1620
31.89/31.96	c 
31.89/31.96	c # solving stops, if the given number of solutions were found (-1: no limit)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: -1]
31.89/31.96	c limits/solutions = 1
31.89/31.96	c 
31.89/31.96	c # maximal number of separation rounds per node (-1: unlimited)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 5]
31.89/31.96	c separating/maxrounds = 1
31.89/31.96	c 
31.89/31.96	c # maximal number of separation rounds in the root node (-1: unlimited)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: -1]
31.89/31.96	c separating/maxroundsroot = 5
31.89/31.96	c 
31.89/31.96	c # default clock type (1: CPU user seconds, 2: wall clock time)
31.89/31.96	c # [type: int, range: [1,2], default: 1]
31.89/31.96	c timing/clocktype = 2
31.89/31.96	c 
31.89/31.96	c # should presolving try to simplify inequalities
31.89/31.96	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
31.89/31.96	c constraints/linear/simplifyinequalities = TRUE
31.89/31.96	c 
31.89/31.96	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
31.89/31.96	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
31.89/31.96	c constraints/indicator/addCouplingCons = TRUE
31.89/31.96	c 
31.89/31.96	c # should disaggregation of knapsack constraints be allowed in preprocessing?
31.89/31.96	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
31.89/31.96	c constraints/knapsack/disaggregation = FALSE
31.89/31.96	c 
31.89/31.96	c # should presolving try to simplify knapsacks
31.89/31.96	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
31.89/31.96	c constraints/knapsack/simplifyinequalities = TRUE
31.89/31.96	c 
31.89/31.96	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: -1]
31.89/31.96	c presolving/probing/maxrounds = 0
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 10]
31.89/31.96	c heuristics/coefdiving/freq = -1
31.89/31.96	c 
31.89/31.96	c # maximal fraction of diving LP iterations compared to node LP iterations
31.89/31.96	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
31.89/31.96	c heuristics/coefdiving/maxlpiterquot = 0.075
31.89/31.96	c 
31.89/31.96	c # additional number of allowed LP iterations
31.89/31.96	c # [type: int, range: [0,2147483647], default: 1000]
31.89/31.96	c heuristics/coefdiving/maxlpiterofs = 1500
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 30]
31.89/31.96	c heuristics/crossover/freq = -1
31.89/31.96	c 
31.89/31.96	c # number of nodes added to the contingent of the total nodes
31.89/31.96	c # [type: longint, range: [0,9223372036854775807], default: 500]
31.89/31.96	c heuristics/crossover/nodesofs = 750
31.89/31.96	c 
31.89/31.96	c # number of nodes without incumbent change that heuristic should wait
31.89/31.96	c # [type: longint, range: [0,9223372036854775807], default: 200]
31.89/31.96	c heuristics/crossover/nwaitingnodes = 100
31.89/31.96	c 
31.89/31.96	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
31.89/31.96	c # [type: real, range: [0,1], default: 0.1]
31.89/31.96	c heuristics/crossover/nodesquot = 0.15
31.89/31.96	c 
31.89/31.96	c # minimum percentage of integer variables that have to be fixed 
31.89/31.96	c # [type: real, range: [0,1], default: 0.666]
31.89/31.96	c heuristics/crossover/minfixingrate = 0.5
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 20]
31.89/31.96	c heuristics/feaspump/freq = -1
31.89/31.96	c 
31.89/31.96	c # additional number of allowed LP iterations
31.89/31.96	c # [type: int, range: [0,2147483647], default: 1000]
31.89/31.96	c heuristics/feaspump/maxlpiterofs = 2000
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 10]
31.89/31.96	c heuristics/fracdiving/freq = -1
31.89/31.96	c 
31.89/31.96	c # maximal fraction of diving LP iterations compared to node LP iterations
31.89/31.96	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
31.89/31.96	c heuristics/fracdiving/maxlpiterquot = 0.075
31.89/31.96	c 
31.89/31.96	c # additional number of allowed LP iterations
31.89/31.96	c # [type: int, range: [0,2147483647], default: 1000]
31.89/31.96	c heuristics/fracdiving/maxlpiterofs = 1500
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 10]
31.89/31.96	c heuristics/guideddiving/freq = -1
31.89/31.96	c 
31.89/31.96	c # maximal fraction of diving LP iterations compared to node LP iterations
31.89/31.96	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
31.89/31.96	c heuristics/guideddiving/maxlpiterquot = 0.075
31.89/31.96	c 
31.89/31.96	c # additional number of allowed LP iterations
31.89/31.96	c # [type: int, range: [0,2147483647], default: 1000]
31.89/31.96	c heuristics/guideddiving/maxlpiterofs = 1500
31.89/31.96	c 
31.89/31.96	c # maximal fraction of diving LP iterations compared to node LP iterations
31.89/31.96	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
31.89/31.96	c heuristics/intdiving/maxlpiterquot = 0.075
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 10]
31.89/31.96	c heuristics/intshifting/freq = -1
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 10]
31.89/31.96	c heuristics/linesearchdiving/freq = -1
31.89/31.96	c 
31.89/31.96	c # maximal fraction of diving LP iterations compared to node LP iterations
31.89/31.96	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
31.89/31.96	c heuristics/linesearchdiving/maxlpiterquot = 0.075
31.89/31.96	c 
31.89/31.96	c # additional number of allowed LP iterations
31.89/31.96	c # [type: int, range: [0,2147483647], default: 1000]
31.89/31.96	c heuristics/linesearchdiving/maxlpiterofs = 1500
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 1]
31.89/31.96	c heuristics/nlp/freq = -1
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 20]
31.89/31.96	c heuristics/objpscostdiving/freq = -1
31.89/31.96	c 
31.89/31.96	c # maximal fraction of diving LP iterations compared to total iteration number
31.89/31.96	c # [type: real, range: [0,1], default: 0.01]
31.89/31.96	c heuristics/objpscostdiving/maxlpiterquot = 0.015
31.89/31.96	c 
31.89/31.96	c # additional number of allowed LP iterations
31.89/31.96	c # [type: int, range: [0,2147483647], default: 1000]
31.89/31.96	c heuristics/objpscostdiving/maxlpiterofs = 1500
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 1]
31.89/31.96	c heuristics/oneopt/freq = -1
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 10]
31.89/31.96	c heuristics/pscostdiving/freq = -1
31.89/31.96	c 
31.89/31.96	c # maximal fraction of diving LP iterations compared to node LP iterations
31.89/31.96	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
31.89/31.96	c heuristics/pscostdiving/maxlpiterquot = 0.075
31.89/31.96	c 
31.89/31.96	c # additional number of allowed LP iterations
31.89/31.96	c # [type: int, range: [0,2147483647], default: 1000]
31.89/31.96	c heuristics/pscostdiving/maxlpiterofs = 1500
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 0]
31.89/31.96	c heuristics/rens/freq = -1
31.89/31.96	c 
31.89/31.96	c # minimum percentage of integer variables that have to be fixable 
31.89/31.96	c # [type: real, range: [0,1], default: 0.5]
31.89/31.96	c heuristics/rens/minfixingrate = 0.3
31.89/31.96	c 
31.89/31.96	c # number of nodes added to the contingent of the total nodes
31.89/31.96	c # [type: longint, range: [0,9223372036854775807], default: 500]
31.89/31.96	c heuristics/rens/nodesofs = 2000
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 20]
31.89/31.96	c heuristics/rootsoldiving/freq = -1
31.89/31.96	c 
31.89/31.96	c # maximal fraction of diving LP iterations compared to node LP iterations
31.89/31.96	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
31.89/31.96	c heuristics/rootsoldiving/maxlpiterquot = 0.015
31.89/31.96	c 
31.89/31.96	c # additional number of allowed LP iterations
31.89/31.96	c # [type: int, range: [0,2147483647], default: 1000]
31.89/31.96	c heuristics/rootsoldiving/maxlpiterofs = 1500
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 1]
31.89/31.96	c heuristics/rounding/freq = -1
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 10]
31.89/31.96	c heuristics/shifting/freq = -1
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 1]
31.89/31.96	c heuristics/simplerounding/freq = -1
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 0]
31.89/31.96	c heuristics/trivial/freq = -1
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 1]
31.89/31.96	c heuristics/trysol/freq = -1
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 10]
31.89/31.96	c heuristics/veclendiving/freq = -1
31.89/31.96	c 
31.89/31.96	c # maximal fraction of diving LP iterations compared to node LP iterations
31.89/31.96	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
31.89/31.96	c heuristics/veclendiving/maxlpiterquot = 0.075
31.89/31.96	c 
31.89/31.96	c # additional number of allowed LP iterations
31.89/31.96	c # [type: int, range: [0,2147483647], default: 1000]
31.89/31.96	c heuristics/veclendiving/maxlpiterofs = 1500
31.89/31.96	c 
31.89/31.96	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 1]
31.89/31.96	c heuristics/zirounding/freq = -1
31.89/31.96	c 
31.89/31.96	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 0]
31.89/31.96	c separating/cmir/freq = -1
31.89/31.96	c 
31.89/31.96	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: 0]
31.89/31.96	c separating/flowcover/freq = -1
31.89/31.96	c 
31.89/31.96	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
31.89/31.96	c # [type: int, range: [-1,2147483647], default: -1]
31.89/31.96	c separating/rapidlearning/freq = 0
31.89/31.96	c 
31.89/31.96	c -----------------------------------------------------------------------------------------------
31.89/31.96	c start solving
31.98/32.02	c 
37.24/37.27	c pressed CTRL-C 1 times (5 times for forcing termination)
37.24/37.29	EMALLC02 realloc: Out of memory - cannot allocate 7920008 bytes
37.24/37.31	c [src/scip/lpi_spx.cpp:1201] Warning: SoPlex threw an exception: XMALLC02 realloc: Could not allocate enough memory
37.24/37.31	c [src/scip/lp.c:5561] ERROR: Error <-6> in function call
37.24/37.31	c [src/scip/lp.c:5837] ERROR: Error <-6> in function call
37.24/37.31	c [src/scip/lp.c:11248] ERROR: Error <-6> in function call
37.24/37.31	c [src/scip/solve.c:801] ERROR: Error <-6> in function call
37.24/37.31	c [src/scip/solve.c:1912] ERROR: Error <-6> in function call
37.24/37.31	c [src/scip/solve.c:2591] ERROR: Error <-6> in function call
37.24/37.31	c [src/scip/solve.c:3206] ERROR: Error <-6> in function call
37.24/37.31	c [src/scip/scip.c:6312] ERROR: Error <-6> in function call
37.24/37.31	c [src/cmain.c:674] ERROR: Error <-6> in function call
37.24/37.31	c [src/cmain.c:849] ERROR: Error <-6> in function call
37.24/37.31	c [src/cmain.c:925] ERROR: Error <-6> in function call
37.24/37.31	c SCIP Error (-6): c error in LP solverc 
37.24/37.31	c Time complete: 37.28.

Verifier Data 

ERROR: no interpretation found !

Watcher Data 

runsolver version 3.2.9 (svn:492) (c) roussel@cril.univ-artois.fr

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2704176-1278550004/watcher-2704176-1278550004 -o /tmp/evaluation-result-2704176-1278550004/solver-2704176-1278550004 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704176-1278550004.opb -t 1800 -m 1800 

Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 2000 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 1843200 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 1894400 KiB
Current StackSize limit: 10240 KiB


[startup+0 s]
/proc/loadavg: 0.99 0.97 0.91 3/106 28897
/proc/meminfo: memFree=1532116/2059040 swapFree=4139716/4192956
[pid=28897] ppid=28895 vsize=7904 CPUtime=0
/proc/28897/stat : 28897 (pbscip.linux.x8) R 28895 28897 28093 0 -1 4202496 1064 0 0 0 0 0 0 0 20 0 1 0 23208640 8093696 976 1992294400 4194304 8395647 140737010565344 18446744073709551615 7382157 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/28897/statm: 1976 985 365 1026 0 946 0

[startup+0.052434 s]
/proc/loadavg: 0.99 0.97 0.91 3/106 28897
/proc/meminfo: memFree=1532116/2059040 swapFree=4139716/4192956
[pid=28897] ppid=28895 vsize=13208 CPUtime=0.04
/proc/28897/stat : 28897 (pbscip.linux.x8) R 28895 28897 28093 0 -1 4202496 2576 0 0 0 4 0 0 0 20 0 1 0 23208640 13524992 2487 1992294400 4194304 8395647 140737010565344 18446744073709551615 6347101 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/28897/statm: 3302 2487 390 1026 0 2272 0
Current children cumulated CPU time (s) 0.04
Current children cumulated vsize (KiB) 13208

[startup+0.101443 s]
/proc/loadavg: 0.99 0.97 0.91 3/106 28897
/proc/meminfo: memFree=1532116/2059040 swapFree=4139716/4192956
[pid=28897] ppid=28895 vsize=14836 CPUtime=0.1
/proc/28897/stat : 28897 (pbscip.linux.x8) R 28895 28897 28093 0 -1 4202496 2994 0 0 0 9 1 0 0 20 0 1 0 23208640 15192064 2905 1992294400 4194304 8395647 140737010565344 18446744073709551615 7385025 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/28897/statm: 3709 2905 390 1026 0 2679 0
Current children cumulated CPU time (s) 0.1
Current children cumulated vsize (KiB) 14836

[startup+0.30148 s]
/proc/loadavg: 0.99 0.97 0.91 3/106 28897
/proc/meminfo: memFree=1532116/2059040 swapFree=4139716/4192956
[pid=28897] ppid=28895 vsize=19596 CPUtime=0.29
/proc/28897/stat : 28897 (pbscip.linux.x8) R 28895 28897 28093 0 -1 4202496 4174 0 0 0 28 1 0 0 20 0 1 0 23208640 20066304 4085 1992294400 4194304 8395647 140737010565344 18446744073709551615 7382056 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/28897/statm: 4899 4085 390 1026 0 3869 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 19596

[startup+0.701556 s]
/proc/loadavg: 0.99 0.97 0.91 3/106 28897
/proc/meminfo: memFree=1532116/2059040 swapFree=4139716/4192956
[pid=28897] ppid=28895 vsize=28944 CPUtime=0.69
/proc/28897/stat : 28897 (pbscip.linux.x8) R 28895 28897 28093 0 -1 4202496 6521 0 0 0 67 2 0 0 21 0 1 0 23208640 29638656 6432 1992294400 4194304 8395647 140737010565344 18446744073709551615 7370937 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/28897/statm: 7236 6432 390 1026 0 6206 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 28944

[startup+1.50071 s]
/proc/loadavg: 0.99 0.97 0.91 2/107 28898
/proc/meminfo: memFree=1501976/2059040 swapFree=4139716/4192956
[pid=28897] ppid=28895 vsize=46604 CPUtime=1.49
/proc/28897/stat : 28897 (pbscip.linux.x8) R 28895 28897 28093 0 -1 4202496 10888 0 0 0 145 4 0 0 23 0 1 0 23208640 47722496 10799 1992294400 4194304 8395647 140737010565344 18446744073709551615 7382031 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/28897/statm: 11651 10799 390 1026 0 10621 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 46604

[startup+3.10101 s]
/proc/loadavg: 0.99 0.97 0.91 2/107 28898
/proc/meminfo: memFree=1476556/2059040 swapFree=4139716/4192956
[pid=28897] ppid=28895 vsize=81764 CPUtime=3.09
/proc/28897/stat : 28897 (pbscip.linux.x8) R 28895 28897 28093 0 -1 4202496 19713 0 0 0 301 8 0 0 25 0 1 0 23208640 83726336 19624 1992294400 4194304 8395647 140737010565344 18446744073709551615 7382056 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/28897/statm: 20441 19624 390 1026 0 19411 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 81764

[startup+6.30161 s]
/proc/loadavg: 0.99 0.97 0.91 2/107 28898
/proc/meminfo: memFree=1401908/2059040 swapFree=4139716/4192956
[pid=28897] ppid=28895 vsize=154228 CPUtime=6.29
/proc/28897/stat : 28897 (pbscip.linux.x8) R 28895 28897 28093 0 -1 4202496 37830 0 0 0 613 16 0 0 25 0 1 0 23208640 157929472 37741 1992294400 4194304 8395647 140737010565344 18446744073709551615 7382041 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/28897/statm: 38557 37741 390 1026 0 37527 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 154228

[startup+12.7008 s]
/proc/loadavg: 0.99 0.97 0.91 2/107 28898
/proc/meminfo: memFree=1256580/2059040 swapFree=4139716/4192956
[pid=28897] ppid=28895 vsize=295904 CPUtime=12.69
/proc/28897/stat : 28897 (pbscip.linux.x8) R 28895 28897 28093 0 -1 4202496 73202 0 0 0 1239 30 0 0 25 0 1 0 23208640 303005696 73113 1992294400 4194304 8395647 140737010565344 18446744073709551615 5755447 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/28897/statm: 73976 73113 390 1026 0 72946 0
Current children cumulated CPU time (s) 12.69
Current children cumulated vsize (KiB) 295904

[startup+25.5012 s]
/proc/loadavg: 0.99 0.97 0.91 2/107 28898
/proc/meminfo: memFree=307360/2059040 swapFree=4139716/4192956
[pid=28897] ppid=28895 vsize=1266564 CPUtime=25.48
/proc/28897/stat : 28897 (pbscip.linux.x8) R 28895 28897 28093 0 -1 4202496 337557 0 0 0 2430 118 0 0 25 0 1 0 23208640 1296961536 313728 1992294400 4194304 8395647 140737010565344 18446744073709551615 7385017 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/28897/statm: 316641 313728 470 1026 0 315611 0
Current children cumulated CPU time (s) 25.48
Current children cumulated vsize (KiB) 1266564



Maximum VSize exceeded: sending SIGTERM then SIGKILL

[startup+37.2037 s]
/proc/loadavg: 0.99 0.97 0.91 3/107 28898
/proc/meminfo: memFree=10440/2059040 swapFree=4139712/4192956
[pid=28897] ppid=28895 vsize=1887668 CPUtime=37.24
/proc/28897/stat : 28897 (pbscip.linux.x8) R 28895 28897 28093 0 -1 4202496 457522 0 0 0 3557 167 0 0 25 0 1 0 23208640 1932972032 428867 1992294400 4194304 8395647 140737010565344 18446744073709551615 6672044 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/28897/statm: 471917 428876 542 1026 0 470887 0
Current children cumulated CPU time (s) 37.24
Current children cumulated vsize (KiB) 1887668

Sending SIGTERM to process tree (bottom up)
Sleeping 2 seconds

Solver just ended. Dumping a history of the last processes samples

[startup+37.4094 s]
/proc/loadavg: 0.99 0.97 0.91 2/108 28899
/proc/meminfo: memFree=708576/2059040 swapFree=4139712/4192956
[pid=28897] ppid=28895 vsize=0 CPUtime=37.37
/proc/28897/stat : 28897 (pbscip.linux.x8) R 28895 28897 28093 0 -1 4202500 459557 0 0 0 3558 179 0 0 25 0 1 0 23208640 0 0 1992294400 0 0 0 0 0 0 0 4096 16384 18446744073709551615 0 0 17 0 0 0 0
/proc/28897/statm: 0 0 0 0 0 0 0
Current children cumulated CPU time (s) 37.37
Current children cumulated vsize (KiB) 0

Child status: 255
Real time (s): 37.472
CPU time (s): 37.4453
CPU user time (s): 35.5896
CPU system time (s): 1.85572
CPU usage (%): 99.9289
Max. virtual memory (cumulated for all children) (KiB): 1887668

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 35.5896
system time used= 1.85572
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 459557
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 3
involuntary context switches= 518

runsolver used 0.074988 second user time and 0.19397 second system time

The end

Launcher Data 

Begin job on node037 at 2010-07-08 02:46:46
IDJOB=2704176
IDBENCH=1383
IDSOLVER=1213
FILE ID=node037/2704176-1278550004
PBS_JOBID= 11239502
Free space on /tmp= 62548 MiB

SOLVER NAME= SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/liu/dbst/normalized-dbst_v40_e600_d20_mw10_5.opb.PB06.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2704176-1278550004/watcher-2704176-1278550004 -o /tmp/evaluation-result-2704176-1278550004/solver-2704176-1278550004 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704176-1278550004.opb -t 1800 -m 1800

TIME LIMIT= 1800 seconds
MEMORY LIMIT= 1800 MiB
MAX NB THREAD= 0

MD5SUM BENCH= 051b48fdf5558d73afe4ee3d3cae609a
RANDOM SEED=23435886

node037.alineos.net Linux 2.6.18-164.el5 #1 SMP Thu Sep 3 03:28:30 EDT 2009

/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.266
cache size	: 2048 KB
physical id	: 0
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx lm constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 6000.53
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.266
cache size	: 2048 KB
physical id	: 3
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx lm constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5599.45
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1532644 kB
Buffers:         68588 kB
Cached:         352912 kB
SwapCached:       7156 kB
Active:         203164 kB
Inactive:       232356 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1532644 kB
SwapTotal:     4192956 kB
SwapFree:      4139716 kB
Dirty:           44528 kB
Writeback:           0 kB
AnonPages:       11460 kB
Mapped:          11932 kB
Slab:            69044 kB
PageTables:       4168 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   181176 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    264880 kB
VmallocChunk: 34359471699 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 62536 MiB
End job on node037 at 2010-07-08 02:47:25