Trace number 4118556

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 NameAnswerobjective functionCPU timeWall clock time
toysat 2016-05-02OPT1 0.089985 0.0980271

General information on the benchmark

NamePB15eval/normalized-PB15eval/OPT-SMALLINT-LIN/
minlplib2-pb-0.1.0/opb/normalized-edgecross10-010.lin.opb
MD5SUM2394550cc574e4ee7e6f4886e1d98583
Bench CategoryOPT-SMALLINT-LIN (optimisation, small integers, linear constraints)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark1
Best CPU time to get the best result obtained on this benchmark0.003999
Has Objective FunctionYES
Satisfiable
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
Number of variables126
Total number of constraints551
Number of constraints which are clauses515
Number of constraints which are cardinality constraints (but not clauses)1
Number of constraints which are nor clauses,nor cardinality constraints35
Minimum length of a constraint1
Maximum length of a constraint3
Number of terms in the objective function 60
Biggest coefficient in the objective function 12
Number of bits for the biggest coefficient in the objective function 4
Sum of the numbers in the objective function 128
Number of bits of the sum of numbers in the objective function 8
Biggest number in a constraint 12
Number of bits of the biggest number in a constraint 4
Biggest sum of numbers in a constraint 128
Number of bits of the biggest sum of numbers8
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Quality of the solution as a function of time


Download the above graph as a PDF file / as an EPS file

Solver Data 

0.00/0.00	c 2016-06-29T22:03:47+0200
0.00/0.00	c version = 0.5.0
0.00/0.00	c githash = 1a49202
0.00/0.00	c compilationtime = 2016-05-02 00:19:28.990761 UTC
0.00/0.00	c arch = x86_64
0.00/0.00	c os = linux
0.00/0.00	c compiler = ghc 7.10
0.00/0.00	c packages:
0.00/0.00	c   OptDir-0.0.3
0.00/0.00	c   array-0.5.1.0
0.00/0.00	c   base-4.8.2.0
0.00/0.00	c   bytestring-0.10.6.0
0.00/0.00	c   bytestring-builder-0.10.6.0.0
0.00/0.00	c   clock-0.7.2
0.00/0.00	c   containers-0.5.6.2
0.00/0.00	c   data-default-0.5.3
0.00/0.00	c   data-default-class-0.0.1
0.00/0.00	c   data-interval-1.2.0
0.00/0.00	c   deepseq-1.4.1.1
0.00/0.00	c   directory-1.2.2.0
0.00/0.00	c   exceptions-0.8.2.1
0.00/0.00	c   extended-reals-0.2.1.0
0.00/0.00	c   filepath-1.4.0.0
0.00/0.00	c   finite-field-0.8.0
0.00/0.00	c   hashable-1.2.4.0
0.00/0.00	c   heaps-0.3.3
0.00/0.00	c   intern-0.9.1.4
0.00/0.00	c   loop-0.3.0
0.00/0.00	c   mtl-2.2.1
0.00/0.00	c   multiset-0.3.2
0.00/0.00	c   mwc-random-0.13.3.2
0.00/0.00	c   parse_dimacs-1.3
0.00/0.00	c   parsec-3.1.9
0.00/0.00	c   prettyclass-1.0.0.0
0.00/0.00	c   primes-0.2.1.0
0.00/0.00	c   primitive-0.6.1.0
0.00/0.00	c   process-1.2.3.0
0.00/0.00	c   pseudo-boolean-0.1.3.0
0.00/0.01	c   queue-0.1.2
0.00/0.01	c   semigroups-0.18.1
0.00/0.01	c   sign-0.4.3
0.00/0.01	c   stm-2.4.4.1
0.00/0.01	c   template-haskell-2.10.0.0
0.00/0.01	c   temporary-1.2.0.4
0.00/0.01	c   time-1.5.0.1
0.00/0.01	c   transformers-0.4.2.0
0.00/0.01	c   transformers-compat-0.5.1.4
0.00/0.01	c   type-level-numbers-0.1.1.1
0.00/0.01	c   unbounded-delays-0.1.0.9
0.00/0.01	c   unordered-containers-0.2.6.0
0.00/0.01	c   vector-0.11.0.0
0.00/0.01	c   vector-space-0.10.3
0.00/0.01	c command line = ["+RTS","-H1G","-M15500m","-K1G","-RTS","--pb","--search=bcd2","HOME/instance-4118556-1467230627.opb"]
0.00/0.01	c use --random-gen="2720946518 3941638866 2982494347 3550575593 1142166464 3275438360 1268638361 961654737 1988578478 124409514 1612491453 2153944668 3483950948 964540033 2980552852 3010277516 3224942573 1448278776 549690856 670232278 136062135 1224513913 2534796853 1277914531 844066504 2181290815 2035308369 463339757 3367844706 1609460057 853652435 639352617 330733380 715452720 885791988 4161938851 3704770897 3798224682 1411977303 1539527383 1877029428 3356677871 781591694 1363660853 2798774296 3188837386 1600619860 2007143501 2276360671 2230988582 1965689893 1870042514 3080654839 2898889351 3649149162 1630855071 1491395438 2530545874 1151177721 233294785 3393194762 471884662 3652712064 839820549 425349477 1789440774 288372729 3793309499 2202447102 2655039835 3104204984 3329705326 3810161511 1575834175 1785166790 3853866064 3499702133 905501401 1569194120 2365267253 988038438 1600231685 381943593 3823175616 3857387488 3890234366 1707278047 355151287 2247522537 2472028656 2132296579 586267547 3185557155 1535335095 1747597302 1559241565 3628394632 4207225018 4010959958 76256303 935720412 1686025228 2006352207 1074149925 3405392011 1733186198 1690589846 3450865841 2610880326 2105057480 2458999691 4195976065 3608620866 1031617176 66608842 3488366665 1503614518 3474790964 2372310085 1916656727 34433058 2508905364 3737996077 3060642898 1218247738 892273702 3887451449 3740950026 2849356850 4196894423 2507208095 1252545821 2971576558 802419874 3426961877 1132526482 1455425466 2290832618 565538409 1634147142 471196635 3404578816 3140903877 3019450266 2662312561 443393141 3721307274 3087240818 1937981932 422251244 3519897422 813356875 1256647641 552095323 4155056311 1965845830 2749538369 3449427080 1326058101 1125142665 3803245434 815634048 3249242302 4037665986 1394801977 608808053 3007198188 2764320862 2739839042 493675612 883522606 2666047394 2429263707 3123376806 3708288997 4085230521 497610007 2166148107 1067490342 4112848791 1841122468 2939251125 4215534796 3883752734 605807979 1856410600 1566697961 4101710001 2734356291 180346662 2939616514 3759371704 1380994757 79906741 3831935653 4145557737 899491379 348045004 221896894 1373652598 397289972 3190111708 2080255235 2124121102 2712962036 2606791721 3542360386 267236088 1828016193 1591623346 975634911 5545181 2222235701 4127419915 1020529117 17254675 843592096 2582506815 1451490581 2950257789 3898352540 2245090490 2461047444 3757620750 4020752459 988374849 105977402 3216079277 4017474326 2423793345 1932847831 1229167455 2309757208 1302874682 3743692513 3741344391 3550604906 4054664851 2802105776 461394521 1089320317 2690360925 2947752193 1688418873 359328430 1204246975 4210344324 1564116329 4079730641 125924858 1808344095 3576746757 1188928859 1399060653 3075862022 1492295096 255 362436" option to reproduce the execution
0.00/0.02	c #vars 126
0.00/0.02	c #constraints 551
0.00/0.02	c BCD2: Hardening is enabled.
0.00/0.02	c BCD2: BiasedSearch is enabled.
0.00/0.02	c Solving starts ...
0.00/0.02	c ============================[ Search Statistics ]============================
0.00/0.02	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.02	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.02	c =============================================================================
0.00/0.02	c  0.0s |       0 |        0 |        0 |      225      0 |        1 |        0
0.00/0.03	c  0.0s |       0 |       57 |        0 |      225      0 |        1 |        0
0.00/0.03	c #cpu_time = 0.001s
0.00/0.03	c #wall_clock_time = 0.001s
0.00/0.03	c #decision = 57
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 0
0.00/0.03	c #restart = 0
0.00/0.03	o 12
0.00/0.03	c BCD2: updating upper bound: 128 -> 69
0.00/0.03	c BCD2: 0 <= obj <= 69
0.00/0.03	c BCD2: #cores=0, #unrelaxed=60, #relaxed=0, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=1 bias=1/2
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |      225      0 |        1 |        0
0.00/0.03	c  0.0s |       0 |       12 |        0 |      225      0 |        1 |        0
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 12
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 0
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: found a new core of size 1: cost of the new core is >=12
0.00/0.03	c lower bound updated to -46
0.00/0.03	c BCD2: 12 <= obj <= 69
0.00/0.03	c BCD2: #cores=1, #unrelaxed=59, #relaxed=1, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=2 bias=2/3
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |      225      0 |        1 |        0
0.00/0.03	c  0.0s |       0 |       33 |        0 |      225      0 |        1 |        0
0.00/0.03	c #cpu_time = 0.001s
0.00/0.03	c #wall_clock_time = 0.001s
0.00/0.03	c #decision = 33
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 0
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: found a new core of size 3: cost of the new core is >=2
0.00/0.03	c lower bound updated to -44
0.00/0.03	c BCD2: 14 <= obj <= 69
0.00/0.03	c BCD2: #cores=2, #unrelaxed=56, #relaxed=4, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=3 bias=3/4
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |      225      0 |        1 |        1
0.00/0.03	c  0.0s |       0 |       31 |        0 |      225      0 |        1 |        1
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 31
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 0
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: found a new core of size 3: cost of the new core is >=1
0.00/0.03	c lower bound updated to -43
0.00/0.03	c BCD2: 15 <= obj <= 69
0.00/0.03	c BCD2: #cores=3, #unrelaxed=53, #relaxed=7, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=4 bias=4/5
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |      225      0 |        1 |        2
0.00/0.03	c  0.0s |       0 |       28 |        0 |      225      0 |        1 |        2
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 28
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 0
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: relaxing 2 and merging with 1 cores into a new core of size 5: cost of the new core is >=2
0.00/0.03	c lower bound updated to -42
0.00/0.03	c BCD2: 16 <= obj <= 69
0.00/0.03	c BCD2: #cores=3, #unrelaxed=51, #relaxed=9, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=5 bias=5/6
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |      225      0 |        2 |        2
0.00/0.03	c  0.0s |       0 |       29 |        0 |      225      0 |        2 |        3
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 29
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 0
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: found a new core of size 2: cost of the new core is >=2
0.00/0.03	c lower bound updated to -40
0.00/0.03	c BCD2: 18 <= obj <= 69
0.00/0.03	c BCD2: #cores=4, #unrelaxed=49, #relaxed=11, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=6 bias=6/7
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |      225      0 |        2 |        3
0.00/0.03	c  0.0s |       0 |       26 |        0 |      225      0 |        2 |        3
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 26
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 0
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: relaxing 1 and merging with 1 cores into a new core of size 3: cost of the new core is >=4
0.00/0.03	c lower bound updated to -38
0.00/0.03	c BCD2: 20 <= obj <= 69
0.00/0.03	c BCD2: #cores=4, #unrelaxed=48, #relaxed=12, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=7 bias=7/8
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |      225      0 |        3 |        3
0.00/0.03	c  0.0s |       0 |       26 |        0 |      225      0 |        3 |        4
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 26
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 0
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: relaxing 2 and merging with 1 cores into a new core of size 5: cost of the new core is >=3
0.00/0.03	c lower bound updated to -37
0.00/0.03	c BCD2: 21 <= obj <= 69
0.00/0.03	c BCD2: #cores=4, #unrelaxed=46, #relaxed=14, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=8 bias=8/9
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |      225      0 |        4 |        4
0.00/0.03	c  0.0s |       0 |       20 |        1 |      225      0 |        4 |        5
0.00/0.03	c #cpu_time = 0.001s
0.00/0.03	c #wall_clock_time = 0.001s
0.00/0.03	c #decision = 20
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 1
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: relaxing 1 and merging with 1 cores into a new core of size 6: cost of the new core is >=4
0.00/0.03	c lower bound updated to -36
0.00/0.03	c BCD2: 22 <= obj <= 69
0.00/0.03	c BCD2: #cores=4, #unrelaxed=45, #relaxed=15, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=9 bias=9/10
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |      225      0 |        5 |        5
0.00/0.03	c  0.0s |       0 |       26 |        0 |      225      0 |        5 |        6
0.00/0.04	c #cpu_time = 0.001s
0.00/0.04	c #wall_clock_time = 0.001s
0.00/0.04	c #decision = 26
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 0
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: found a new core of size 2: cost of the new core is >=2
0.00/0.04	c lower bound updated to -34
0.00/0.04	c BCD2: 24 <= obj <= 69
0.00/0.04	c BCD2: #cores=5, #unrelaxed=43, #relaxed=17, #hardened=0
0.00/0.04	c BCD2: #sat=1 #unsat=10 bias=10/11
0.00/0.04	c Solving starts ...
0.00/0.04	c ============================[ Search Statistics ]============================
0.00/0.04	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.04	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.04	c =============================================================================
0.00/0.04	c  0.0s |       0 |        0 |        0 |      225      0 |        5 |        6
0.00/0.04	c  0.0s |       0 |       25 |        0 |      225      0 |        5 |        6
0.00/0.04	c #cpu_time = 0.000s
0.00/0.04	c #wall_clock_time = 0.000s
0.00/0.04	c #decision = 25
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 0
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: relaxing 1 and merging with 1 cores into a new core of size 4: cost of the new core is >=5
0.00/0.04	c lower bound updated to -33
0.00/0.04	c BCD2: 25 <= obj <= 69
0.00/0.04	c BCD2: #cores=5, #unrelaxed=42, #relaxed=18, #hardened=0
0.00/0.04	c BCD2: #sat=1 #unsat=11 bias=11/12
0.00/0.04	c Solving starts ...
0.00/0.04	c ============================[ Search Statistics ]============================
0.00/0.04	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.04	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.04	c =============================================================================
0.00/0.04	c  0.0s |       0 |        0 |        0 |      225      0 |        6 |        6
0.00/0.04	c  0.0s |       0 |       41 |        1 |      225      0 |        6 |        7
0.00/0.04	c #cpu_time = 0.001s
0.00/0.04	c #wall_clock_time = 0.001s
0.00/0.04	c #decision = 41
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 1
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: relaxing 2 and merging with 1 cores into a new core of size 6: cost of the new core is >=6
0.00/0.04	c lower bound updated to -32
0.00/0.04	c BCD2: 26 <= obj <= 69
0.00/0.04	c BCD2: #cores=5, #unrelaxed=40, #relaxed=20, #hardened=0
0.00/0.04	c BCD2: #sat=1 #unsat=12 bias=12/13
0.00/0.04	c Solving starts ...
0.00/0.04	c ============================[ Search Statistics ]============================
0.00/0.04	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.04	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.04	c =============================================================================
0.00/0.04	c  0.0s |       0 |        0 |        0 |      225      0 |        7 |        7
0.00/0.04	c  0.0s |       0 |       26 |        0 |      225      0 |        7 |        8
0.00/0.04	c #cpu_time = 0.001s
0.00/0.04	c #wall_clock_time = 0.001s
0.00/0.04	c #decision = 26
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 0
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.04	c lower bound updated to -31
0.00/0.04	c BCD2: 27 <= obj <= 69
0.00/0.04	c BCD2: #cores=6, #unrelaxed=38, #relaxed=22, #hardened=0
0.00/0.04	c BCD2: #sat=1 #unsat=13 bias=13/14
0.00/0.04	c Solving starts ...
0.00/0.04	c ============================[ Search Statistics ]============================
0.00/0.04	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.04	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.04	c =============================================================================
0.00/0.04	c  0.0s |       0 |        0 |        0 |      225      0 |        7 |        8
0.00/0.04	c  0.0s |       0 |       26 |        0 |      225      0 |        7 |        8
0.00/0.04	c #cpu_time = 0.001s
0.00/0.04	c #wall_clock_time = 0.001s
0.00/0.04	c #decision = 26
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 0
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: found a new core of size 2: cost of the new core is >=2
0.00/0.04	c lower bound updated to -29
0.00/0.04	c BCD2: 29 <= obj <= 69
0.00/0.04	c BCD2: #cores=7, #unrelaxed=36, #relaxed=24, #hardened=0
0.00/0.04	c BCD2: #sat=1 #unsat=14 bias=14/15
0.00/0.04	c Solving starts ...
0.00/0.04	c ============================[ Search Statistics ]============================
0.00/0.04	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.04	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.04	c =============================================================================
0.00/0.04	c  0.0s |       0 |        0 |        0 |      225      0 |        7 |        8
0.00/0.04	c  0.0s |       0 |       26 |        0 |      225      0 |        7 |        8
0.00/0.04	c #cpu_time = 0.000s
0.00/0.04	c #wall_clock_time = 0.000s
0.00/0.04	c #decision = 26
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 0
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.04	c lower bound updated to -28
0.00/0.04	c BCD2: 30 <= obj <= 69
0.00/0.04	c BCD2: #cores=8, #unrelaxed=34, #relaxed=26, #hardened=0
0.00/0.04	c BCD2: #sat=1 #unsat=15 bias=15/16
0.00/0.04	c Solving starts ...
0.00/0.04	c ============================[ Search Statistics ]============================
0.00/0.04	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.04	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.04	c =============================================================================
0.00/0.04	c  0.0s |       0 |        0 |        0 |      225      0 |        7 |        8
0.00/0.04	c  0.0s |       0 |       21 |        0 |      225      0 |        7 |        8
0.00/0.04	c #cpu_time = 0.000s
0.00/0.04	c #wall_clock_time = 0.000s
0.00/0.04	c #decision = 21
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 0
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: relaxing 1 and merging with 1 cores into a new core of size 3: cost of the new core is >=2
0.00/0.04	c lower bound updated to -27
0.00/0.04	c BCD2: 31 <= obj <= 69
0.00/0.04	c BCD2: #cores=8, #unrelaxed=33, #relaxed=27, #hardened=0
0.00/0.04	c BCD2: #sat=1 #unsat=16 bias=16/17
0.00/0.04	c Solving starts ...
0.00/0.04	c ============================[ Search Statistics ]============================
0.00/0.04	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.04	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.04	c =============================================================================
0.00/0.04	c  0.0s |       0 |        0 |        0 |      225      0 |        8 |        9
0.00/0.04	c  0.0s |       0 |       25 |        0 |      225      0 |        8 |       10
0.00/0.04	c #cpu_time = 0.000s
0.00/0.04	c #wall_clock_time = 0.000s
0.00/0.04	c #decision = 25
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 0
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: found a new core of size 2: cost of the new core is >=2
0.00/0.04	c lower bound updated to -25
0.00/0.04	c BCD2: 33 <= obj <= 69
0.00/0.04	c BCD2: #cores=9, #unrelaxed=31, #relaxed=29, #hardened=0
0.00/0.04	c BCD2: #sat=1 #unsat=17 bias=17/18
0.00/0.04	c Solving starts ...
0.00/0.04	c ============================[ Search Statistics ]============================
0.00/0.04	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.04	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.04	c =============================================================================
0.00/0.04	c  0.0s |       0 |        0 |        0 |      225      0 |        8 |       10
0.00/0.04	c  0.0s |       0 |       25 |        0 |      225      0 |        8 |       10
0.00/0.04	c #cpu_time = 0.000s
0.00/0.04	c #wall_clock_time = 0.000s
0.00/0.04	c #decision = 25
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 0
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.04	c lower bound updated to -24
0.00/0.04	c BCD2: 34 <= obj <= 69
0.00/0.04	c BCD2: #cores=10, #unrelaxed=29, #relaxed=31, #hardened=0
0.00/0.04	c BCD2: #sat=1 #unsat=18 bias=18/19
0.00/0.04	c Solving starts ...
0.00/0.04	c ============================[ Search Statistics ]============================
0.00/0.04	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.04	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.04	c =============================================================================
0.00/0.04	c  0.0s |       0 |        0 |        0 |      225      0 |        8 |       10
0.00/0.04	c  0.0s |       0 |       20 |        0 |      225      0 |        8 |       10
0.00/0.04	c #cpu_time = 0.000s
0.00/0.04	c #wall_clock_time = 0.000s
0.00/0.04	c #decision = 20
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 0
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: relaxing 1 and merging with 1 cores into a new core of size 3: cost of the new core is >=2
0.00/0.04	c lower bound updated to -23
0.00/0.04	c BCD2: 35 <= obj <= 69
0.00/0.04	c BCD2: #cores=10, #unrelaxed=28, #relaxed=32, #hardened=0
0.00/0.04	c BCD2: #sat=1 #unsat=19 bias=19/20
0.00/0.04	c Solving starts ...
0.00/0.04	c ============================[ Search Statistics ]============================
0.00/0.04	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.04	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.04	c =============================================================================
0.00/0.04	c  0.0s |       0 |        0 |        0 |      225      0 |        9 |       10
0.00/0.05	c  0.0s |       0 |       38 |        1 |      225      0 |        9 |       11
0.00/0.05	c #cpu_time = 0.001s
0.00/0.05	c #wall_clock_time = 0.001s
0.00/0.05	c #decision = 38
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 1
0.00/0.05	c #restart = 0
0.00/0.05	c BCD2: relaxing 1 and merging with 1 cores into a new core of size 4: cost of the new core is >=4
0.00/0.05	c lower bound updated to -21
0.00/0.05	c BCD2: 37 <= obj <= 69
0.00/0.05	c BCD2: #cores=10, #unrelaxed=27, #relaxed=33, #hardened=0
0.00/0.05	c BCD2: #sat=1 #unsat=20 bias=20/21
0.00/0.05	c Solving starts ...
0.00/0.05	c ============================[ Search Statistics ]============================
0.00/0.05	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.05	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.05	c =============================================================================
0.00/0.05	c  0.0s |       0 |        0 |        0 |      225      0 |       10 |       11
0.00/0.05	c  0.0s |       0 |       24 |        0 |      225      0 |       10 |       12
0.00/0.05	c #cpu_time = 0.000s
0.00/0.05	c #wall_clock_time = 0.000s
0.00/0.05	c #decision = 24
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 0
0.00/0.05	c #restart = 0
0.00/0.05	c BCD2: relaxing 2 and merging with 1 cores into a new core of size 4: cost of the new core is >=2
0.00/0.05	c lower bound updated to -20
0.00/0.05	c BCD2: 38 <= obj <= 69
0.00/0.05	c BCD2: #cores=10, #unrelaxed=25, #relaxed=35, #hardened=0
0.00/0.05	c BCD2: #sat=1 #unsat=21 bias=21/22
0.00/0.05	c Solving starts ...
0.00/0.05	c ============================[ Search Statistics ]============================
0.00/0.05	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.05	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.05	c =============================================================================
0.00/0.05	c  0.0s |       0 |        0 |        0 |      225      0 |       11 |       12
0.00/0.05	c  0.0s |       0 |       31 |        1 |      225      0 |       11 |       13
0.00/0.05	c #cpu_time = 0.001s
0.00/0.05	c #wall_clock_time = 0.001s
0.00/0.05	c #decision = 31
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 1
0.00/0.05	c #restart = 0
0.00/0.05	c BCD2: relaxing 1 and merging with 1 cores into a new core of size 5: cost of the new core is >=3
0.00/0.05	c lower bound updated to -19
0.00/0.05	c BCD2: 39 <= obj <= 69
0.00/0.05	c BCD2: #cores=10, #unrelaxed=24, #relaxed=36, #hardened=0
0.00/0.05	c BCD2: #sat=1 #unsat=22 bias=22/23
0.00/0.05	c Solving starts ...
0.00/0.05	c ============================[ Search Statistics ]============================
0.00/0.05	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.05	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.05	c =============================================================================
0.00/0.05	c  0.0s |       0 |        0 |        0 |      225      0 |       12 |       13
0.00/0.05	c  0.0s |       0 |       24 |        0 |      225      0 |       12 |       14
0.00/0.05	c #cpu_time = 0.001s
0.00/0.05	c #wall_clock_time = 0.001s
0.00/0.05	c #decision = 24
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 0
0.00/0.05	c #restart = 0
0.00/0.05	c BCD2: relaxing 5 and merging with 1 cores into a new core of size 11: cost of the new core is >=5
0.00/0.05	c lower bound updated to -18
0.00/0.05	c BCD2: 40 <= obj <= 69
0.00/0.05	c BCD2: #cores=10, #unrelaxed=19, #relaxed=41, #hardened=0
0.00/0.05	c BCD2: #sat=1 #unsat=23 bias=23/24
0.00/0.05	c Solving starts ...
0.00/0.05	c ============================[ Search Statistics ]============================
0.00/0.05	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.05	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.05	c =============================================================================
0.00/0.05	c  0.0s |       0 |        0 |        0 |      225      0 |       13 |       14
0.00/0.05	c  0.0s |       0 |       20 |        0 |      225      0 |       13 |       15
0.00/0.05	c #cpu_time = 0.000s
0.00/0.05	c #wall_clock_time = 0.000s
0.00/0.05	c #decision = 20
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 0
0.00/0.05	c #restart = 0
0.00/0.05	c BCD2: relaxing 1 and merging with 1 cores into a new core of size 3: cost of the new core is >=3
0.00/0.05	c lower bound updated to -17
0.00/0.05	c BCD2: 41 <= obj <= 69
0.00/0.05	c BCD2: #cores=10, #unrelaxed=18, #relaxed=42, #hardened=0
0.00/0.05	c BCD2: #sat=1 #unsat=24 bias=24/25
0.00/0.05	c Solving starts ...
0.00/0.05	c ============================[ Search Statistics ]============================
0.00/0.05	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.05	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.05	c =============================================================================
0.00/0.05	c  0.0s |       0 |        0 |        0 |      225      0 |       14 |       15
0.00/0.05	c  0.0s |       0 |       27 |        1 |      225      0 |       14 |       16
0.00/0.05	c #cpu_time = 0.001s
0.00/0.05	c #wall_clock_time = 0.001s
0.00/0.05	c #decision = 27
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 1
0.00/0.05	c #restart = 0
0.00/0.05	c BCD2: relaxing 1 and merging with 1 cores into a new core of size 4: cost of the new core is >=4
0.00/0.05	c lower bound updated to -16
0.00/0.05	c BCD2: 42 <= obj <= 69
0.00/0.05	c BCD2: #cores=10, #unrelaxed=17, #relaxed=43, #hardened=0
0.00/0.05	c BCD2: #sat=1 #unsat=25 bias=25/26
0.00/0.05	c Solving starts ...
0.00/0.05	c ============================[ Search Statistics ]============================
0.00/0.05	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.05	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.05	c =============================================================================
0.00/0.05	c  0.0s |       0 |        0 |        0 |      225      0 |       15 |       16
0.00/0.05	c  0.0s |       0 |       19 |        0 |      225      0 |       15 |       17
0.00/0.05	c #cpu_time = 0.001s
0.00/0.05	c #wall_clock_time = 0.001s
0.00/0.05	c #decision = 19
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 0
0.00/0.05	c #restart = 0
0.00/0.05	c BCD2: found a new core of size 3: cost of the new core is >=2
0.00/0.05	c lower bound updated to -14
0.00/0.05	c BCD2: 44 <= obj <= 69
0.00/0.05	c BCD2: #cores=11, #unrelaxed=14, #relaxed=46, #hardened=0
0.00/0.05	c BCD2: #sat=1 #unsat=26 bias=26/27
0.00/0.05	c Solving starts ...
0.00/0.05	c ============================[ Search Statistics ]============================
0.00/0.05	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.05	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.05	c =============================================================================
0.00/0.05	c  0.0s |       0 |        0 |        0 |      225      0 |       15 |       17
0.00/0.05	c  0.0s |       0 |       18 |        0 |      225      0 |       15 |       17
0.00/0.05	c #cpu_time = 0.000s
0.00/0.05	c #wall_clock_time = 0.000s
0.00/0.05	c #decision = 18
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 0
0.00/0.05	c #restart = 0
0.00/0.05	c BCD2: found a new core of size 2: cost of the new core is >=2
0.00/0.05	c lower bound updated to -12
0.00/0.05	c BCD2: 46 <= obj <= 69
0.00/0.05	c BCD2: #cores=12, #unrelaxed=12, #relaxed=48, #hardened=0
0.00/0.05	c BCD2: #sat=1 #unsat=27 bias=27/28
0.00/0.05	c Solving starts ...
0.00/0.05	c ============================[ Search Statistics ]============================
0.00/0.05	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.05	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.05	c =============================================================================
0.00/0.05	c  0.0s |       0 |        0 |        0 |      225      0 |       15 |       17
0.00/0.05	c  0.0s |       0 |       25 |        1 |      225      0 |       15 |       17
0.00/0.05	c #cpu_time = 0.001s
0.00/0.05	c #wall_clock_time = 0.001s
0.00/0.05	c #decision = 25
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 1
0.00/0.05	c #restart = 0
0.00/0.05	c BCD2: relaxing 1 and merging with 3 cores into a new core of size 10: cost of the new core is >=9
0.00/0.05	c lower bound updated to -11
0.00/0.05	c BCD2: 47 <= obj <= 69
0.00/0.05	c BCD2: #cores=10, #unrelaxed=11, #relaxed=49, #hardened=0
0.00/0.05	c BCD2: #sat=1 #unsat=28 bias=28/29
0.00/0.05	c Solving starts ...
0.00/0.05	c ============================[ Search Statistics ]============================
0.00/0.05	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.05	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.05	c =============================================================================
0.00/0.05	c  0.0s |       0 |        0 |        0 |      225      0 |       18 |       17
0.00/0.05	c  0.0s |       0 |       16 |        0 |      225      0 |       18 |       20
0.00/0.05	c #cpu_time = 0.000s
0.00/0.05	c #wall_clock_time = 0.000s
0.00/0.05	c #decision = 16
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 0
0.00/0.05	c #restart = 0
0.00/0.05	c BCD2: found a new core of size 2: cost of the new core is >=2
0.00/0.05	c lower bound updated to -9
0.00/0.05	c BCD2: 49 <= obj <= 69
0.00/0.05	c BCD2: #cores=11, #unrelaxed=9, #relaxed=51, #hardened=0
0.00/0.05	c BCD2: #sat=1 #unsat=29 bias=29/30
0.00/0.05	c Solving starts ...
0.00/0.05	c ============================[ Search Statistics ]============================
0.00/0.05	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.05	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.05	c =============================================================================
0.00/0.06	c  0.0s |       0 |        0 |        0 |      225      0 |       18 |       20
0.00/0.06	c  0.0s |       0 |       17 |        0 |      225      0 |       18 |       20
0.00/0.06	c #cpu_time = 0.001s
0.00/0.06	c #wall_clock_time = 0.001s
0.00/0.06	c #decision = 17
0.00/0.06	c #random_decision = 0
0.00/0.06	c #conflict = 0
0.00/0.06	c #restart = 0
0.00/0.06	c BCD2: found a new core of size 2: cost of the new core is >=2
0.00/0.06	c lower bound updated to -7
0.00/0.06	c BCD2: 51 <= obj <= 69
0.00/0.06	c BCD2: #cores=12, #unrelaxed=7, #relaxed=53, #hardened=0
0.00/0.06	c BCD2: #sat=1 #unsat=30 bias=30/31
0.00/0.06	c Solving starts ...
0.00/0.06	c ============================[ Search Statistics ]============================
0.00/0.06	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.06	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.06	c =============================================================================
0.00/0.06	c  0.0s |       0 |        0 |        0 |      225      0 |       18 |       20
0.00/0.06	c  0.0s |       0 |       17 |        0 |      225      0 |       18 |       20
0.00/0.06	c #cpu_time = 0.000s
0.00/0.06	c #wall_clock_time = 0.000s
0.00/0.06	c #decision = 17
0.00/0.06	c #random_decision = 0
0.00/0.06	c #conflict = 0
0.00/0.06	c #restart = 0
0.00/0.06	c BCD2: relaxing 1 and merging with 1 cores into a new core of size 3: cost of the new core is >=3
0.00/0.06	c lower bound updated to -6
0.00/0.06	c BCD2: 52 <= obj <= 69
0.00/0.06	c BCD2: #cores=12, #unrelaxed=6, #relaxed=54, #hardened=0
0.00/0.06	c BCD2: #sat=1 #unsat=31 bias=31/32
0.00/0.06	c Solving starts ...
0.00/0.06	c ============================[ Search Statistics ]============================
0.00/0.06	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.06	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.06	c =============================================================================
0.00/0.06	c  0.0s |       0 |        0 |        0 |      225      0 |       19 |       20
0.00/0.06	c  0.0s |       0 |       19 |        1 |      225      0 |       19 |       21
0.00/0.06	c #cpu_time = 0.001s
0.00/0.06	c #wall_clock_time = 0.001s
0.00/0.06	c #decision = 19
0.00/0.06	c #random_decision = 0
0.00/0.06	c #conflict = 1
0.00/0.06	c #restart = 0
0.00/0.06	c BCD2: relaxing 1 and merging with 1 cores into a new core of size 4: cost of the new core is >=4
0.00/0.06	c lower bound updated to -5
0.00/0.06	c BCD2: 53 <= obj <= 69
0.00/0.06	c BCD2: #cores=12, #unrelaxed=5, #relaxed=55, #hardened=0
0.00/0.06	c BCD2: #sat=1 #unsat=32 bias=32/33
0.00/0.06	c Solving starts ...
0.00/0.06	c ============================[ Search Statistics ]============================
0.00/0.06	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.06	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.06	c =============================================================================
0.00/0.06	c  0.0s |       0 |        0 |        0 |      225      0 |       20 |       21
0.00/0.06	c  0.0s |       0 |       20 |        1 |      225      0 |       20 |       22
0.00/0.06	c #cpu_time = 0.001s
0.00/0.06	c #wall_clock_time = 0.001s
0.00/0.06	c #decision = 20
0.00/0.06	c #random_decision = 0
0.00/0.06	c #conflict = 1
0.00/0.06	c #restart = 0
0.00/0.06	c BCD2: relaxing 2 and merging with 4 cores into a new core of size 14: cost of the new core is >=13
0.00/0.06	c lower bound updated to -4
0.00/0.06	c BCD2: 54 <= obj <= 69
0.00/0.06	c BCD2: #cores=9, #unrelaxed=3, #relaxed=57, #hardened=0
0.00/0.06	c BCD2: #sat=1 #unsat=33 bias=33/34
0.00/0.06	c Solving starts ...
0.00/0.06	c ============================[ Search Statistics ]============================
0.00/0.06	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.06	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.06	c =============================================================================
0.00/0.06	c  0.0s |       0 |        0 |        0 |      225      0 |       24 |       22
0.00/0.06	c  0.0s |       0 |       45 |       18 |      225      0 |       25 |       27
0.00/0.06	c #cpu_time = 0.002s
0.00/0.06	c #wall_clock_time = 0.002s
0.00/0.06	c #decision = 45
0.00/0.06	c #random_decision = 0
0.00/0.06	c #conflict = 18
0.00/0.06	c #restart = 0
0.00/0.06	c BCD2: updating lower bound of a core
0.00/0.06	c lower bound updated to -3
0.00/0.06	c BCD2: 55 <= obj <= 69
0.00/0.06	c BCD2: #cores=9, #unrelaxed=3, #relaxed=57, #hardened=0
0.00/0.06	c BCD2: #sat=1 #unsat=34 bias=34/35
0.00/0.06	c Solving starts ...
0.00/0.06	c ============================[ Search Statistics ]============================
0.00/0.06	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.06	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.06	c =============================================================================
0.00/0.06	c  0.0s |       0 |        0 |        0 |      225      0 |       25 |       28
0.00/0.06	c  0.0s |       0 |       41 |        0 |      225      0 |       25 |       28
0.00/0.06	c #cpu_time = 0.001s
0.00/0.06	c #wall_clock_time = 0.001s
0.00/0.06	c #decision = 41
0.00/0.06	c #random_decision = 0
0.00/0.06	c #conflict = 0
0.00/0.06	c #restart = 0
0.00/0.06	o 1
0.00/0.06	c BCD2: updating upper bound: 69 -> 58
0.00/0.06	c BCD2: 55 <= obj <= 58
0.00/0.06	c BCD2: #cores=9, #unrelaxed=3, #relaxed=57, #hardened=0
0.00/0.06	c BCD2: #sat=2 #unsat=34 bias=34/36
0.00/0.06	c Solving starts ...
0.00/0.06	c ============================[ Search Statistics ]============================
0.00/0.06	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.06	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.06	c =============================================================================
0.00/0.06	c  0.0s |       0 |        0 |        0 |      225      0 |       25 |       29
0.00/0.06	c  0.0s |       0 |       15 |        1 |      225      0 |       25 |       29
0.00/0.06	c #cpu_time = 0.001s
0.00/0.06	c #wall_clock_time = 0.001s
0.00/0.06	c #decision = 15
0.00/0.06	c #random_decision = 0
0.00/0.06	c #conflict = 1
0.00/0.06	c #restart = 0
0.00/0.06	c BCD2: relaxing 2 and merging with 2 cores into a new core of size 13: cost of the new core is >=10
0.00/0.06	c lower bound updated to -2
0.00/0.06	c BCD2: 56 <= obj <= 58
0.00/0.06	c BCD2: #cores=8, #unrelaxed=1, #relaxed=59, #hardened=0
0.00/0.06	c BCD2: #sat=2 #unsat=35 bias=35/37
0.00/0.06	c Solving starts ...
0.00/0.06	c ============================[ Search Statistics ]============================
0.00/0.06	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.06	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.06	c =============================================================================
0.00/0.06	c  0.0s |       0 |        0 |        0 |      225      0 |       28 |       29
0.00/0.07	c  0.0s |       0 |       40 |       19 |      225      0 |       28 |       33
0.00/0.07	c #cpu_time = 0.002s
0.00/0.07	c #wall_clock_time = 0.002s
0.00/0.07	c #decision = 40
0.00/0.07	c #random_decision = 0
0.00/0.07	c #conflict = 19
0.00/0.07	c #restart = 0
0.00/0.07	c BCD2: relaxing 1 and merging with 2 cores into a new core of size 25: cost of the new core is >=16
0.00/0.07	c lower bound updated to -1
0.00/0.07	c BCD2: 57 <= obj <= 58
0.00/0.07	c BCD2: #cores=7, #unrelaxed=0, #relaxed=60, #hardened=0
0.00/0.07	c BCD2: #sat=2 #unsat=36 bias=36/38
0.00/0.07	c Solving starts ...
0.00/0.07	c ============================[ Search Statistics ]============================
0.00/0.07	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.07	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.07	c =============================================================================
0.00/0.07	c  0.0s |       0 |        0 |        0 |      225      0 |       31 |       33
0.00/0.07	c  0.0s |       0 |       57 |       42 |      225      0 |       31 |       37
0.00/0.07	c #cpu_time = 0.003s
0.00/0.07	c #wall_clock_time = 0.004s
0.00/0.07	c #decision = 57
0.00/0.07	c #random_decision = 0
0.00/0.07	c #conflict = 42
0.00/0.07	c #restart = 0
0.00/0.07	c BCD2: relaxing 0 and merging with 2 cores into a new core of size 35: cost of the new core is >=26
0.00/0.07	c lower bound updated to 0
0.00/0.07	c BCD2: hardening fixes 1 literals
0.00/0.07	c BCD2: 58 <= obj <= 58
0.00/0.07	c BCD2: #cores=6, #unrelaxed=0, #relaxed=59, #hardened=1
0.00/0.07	c BCD2: #sat=2 #unsat=37 bias=37/39
0.00/0.07	c Solving starts ...
0.00/0.07	c ============================[ Search Statistics ]============================
0.00/0.07	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.07	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.07	c =============================================================================
0.00/0.07	c  0.0s |       0 |        0 |        0 |      225      0 |       34 |       37
0.00/0.08	c  0.0s |       1 |      125 |      100 |      248      0 |       34 |       40
0.00/0.09	c  0.0s |       1 |      174 |      143 |      248      0 |       34 |       40
0.00/0.09	c #cpu_time = 0.014s
0.00/0.09	c #wall_clock_time = 0.014s
0.00/0.09	c #decision = 174
0.00/0.09	c #random_decision = 1
0.00/0.09	c #conflict = 143
0.00/0.09	c #restart = 1
0.00/0.09	c BCD2: relaxing 0 and merging with 4 cores into a new core of size 45: cost of the new core is >=33
0.00/0.09	c lower bound updated to 1
0.00/0.09	s OPTIMUM FOUND
0.00/0.09	v x1 x2 x3 x4 x5 x6 x7 x8 x9 x10
0.00/0.09	v x11 x12 x13 x14 x15 x16 x17 x18 x19 x20
0.00/0.09	v x21 x22 x23 x24 -x25 -x26 -x27 -x28 -x29 x30
0.00/0.09	v -x31 x32 x33 x34 x35 x36 x37 x38 x39 x40
0.00/0.09	v x41 x42 x43 x44 x45 x46 -x47 x48 x49 -x50
0.00/0.09	v x51 -x52 x53 -x54 x55 -x56 x57 x58 x59 -x60
0.00/0.09	v x61 -x62 -x63 -x64 -x65 x66 x67 x68 -x69 -x70
0.00/0.09	v -x71 x72 x73 x74 -x75 x76 x77 x78 x79 x80
0.00/0.09	v x81 x82 x83 x84 x85 x86 -x87 -x88 -x89 -x90
0.00/0.09	v x91 -x92 -x93 x94 -x95 -x96 -x97 -x98 -x99 x100
0.00/0.09	v x101 -x102 -x103 x104 x105 -x106 -x107 -x108 -x109 -x110
0.00/0.09	v -x111 -x112 -x113 -x114 -x115 x116 x117 x118 x119 x120
0.00/0.09	v x121 x122 x123 -x124 x125 x126
0.00/0.09	c total CPU time = 0.087s
0.00/0.09	c total wall clock time = 0.088s

Verifier Data 

OK	1

Watcher Data 

runsolver Copyright (C) 2010-2013 Olivier ROUSSEL

This is runsolver version 3.3.7 (svn: 2553)

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-4118556-1467230627/watcher-4118556-1467230627 -o /tmp/evaluation-result-4118556-1467230627/solver-4118556-1467230627 -C 1800 -W 1900 -M 15500 --bin-var /tmp/runsolver-exch-node139-1467208982-19136 --watchdog 1960 toysat +RTS -H1G -M15500m -K1G -RTS --pb --search=bcd2 HOME/instance-4118556-1467230627.opb 

pid=21594
running on 4 cores: 1,3,5,7

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): 1900 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB
Current StackSize limit: 10240 KiB


[startup+0 s]
/proc/loadavg: 2.45 2.38 2.28 3/179 21597
/proc/meminfo: memFree=28488596/32872528 swapFree=1394328/1580332
[pid=21597] ppid=21594 vsize=399940 CPUtime=0 cores=1,3,5,7
/proc/21597/stat : 21597 (toysat) R 21594 21597 19119 0 -1 4202496 1440 0 0 0 0 0 0 0 20 0 4 0 13091327 409538560 1800 33554432000 4194304 16246674 140736674240352 140736674239776 13880264 0 2 0 34082818 18446744073709551615 0 0 17 3 0 0 0 0 0
/proc/21597/statm: 100497 1808 442 2943 0 97391 0
[pid=21597/tid=21598] ppid=21594 vsize=416324 CPUtime=0 cores=1,3,5,7
/proc/21597/task/21598/stat : 21598 (toysat) S 21594 21597 19119 0 -1 4202560 10 0 0 0 0 0 0 0 20 0 4 0 13091327 426315776 1860 33554432000 4194304 16246674 140736674240352 140492600749296 15012391 0 0 0 34082818 18446744071580610281 0 0 -1 5 0 0 0 0 0
[pid=21597/tid=21599] ppid=21594 vsize=419396 CPUtime=0 cores=1,3,5,7
/proc/21597/task/21599/stat : 21599 (toysat) S 21594 21597 19119 0 -1 4202560 8 0 0 0 0 0 0 0 20 0 4 0 13091327 429461504 1876 33554432000 4194304 16246674 140736674240352 140492590259440 14998865 0 0 0 34082818 18446744071580425449 0 0 -1 1 0 0 0 0 0
[pid=21597/tid=21600] ppid=21594 vsize=424516 CPUtime=0 cores=1,3,5,7
/proc/21597/task/21600/stat : 21600 (toysat) S 21594 21597 19119 0 -1 4202560 1 0 0 0 0 0 0 0 20 0 4 0 13091328 434704384 1893 33554432000 4194304 16246674 140736674240352 140492473887920 14069300 0 0 0 34082818 18446744071579510697 0 0 -1 5 0 0 0 0 0

Solver just ended.
??? exit watcher main loop
??? sigkill at end of watcher main loop
??? kill 21597 sig 9
??? kill -21597 sig 9
??? end of watcher thread
Dumping a history of the last processes samples

Child status: 0
Real time (s): 0.0980271
CPU time (s): 0.089985
CPU user time (s): 0.055991
CPU system time (s): 0.033994
CPU usage (%): 91.7961
Max. virtual memory (cumulated for all children) (KiB): 0

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.055991
system time used= 0.033994
maximum resident set size= 80048
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 19674
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= 19
involuntary context switches= 2

??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.006998 second user time and 0.002999 second system time

The end

Launcher Data 

Begin job on node139 at 2016-06-29 22:03:47
IDJOB=4118556
IDBENCH=111507
IDSOLVER=2542
FILE ID=node139/4118556-1467230627
RUNJOBID= node139-1467208982-19136
PBS_JOBID= 19997572
Free space on /tmp= 71696 MiB

SOLVER NAME= toysat 2016-05-02
BENCH NAME= PB15eval/normalized-PB15eval/OPT-SMALLINT-LIN/minlplib2-pb-0.1.0/opb/normalized-edgecross10-010.lin.opb
COMMAND LINE= toysat +RTS -H1G -MMEMLIMITm -K1G -RTS --pb --search=bcd2 BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-4118556-1467230627/watcher-4118556-1467230627 -o /tmp/evaluation-result-4118556-1467230627/solver-4118556-1467230627 -C 1800 -W 1900 -M 15500 --bin-var /tmp/runsolver-exch-node139-1467208982-19136 --watchdog 1960  toysat +RTS -H1G -M15500m -K1G -RTS --pb --search=bcd2 HOME/instance-4118556-1467230627.opb

TIME LIMIT= 1800 seconds
MEMORY LIMIT= 15500 MiB
NBCORE= 4

MD5SUM BENCH= 2394550cc574e4ee7e6f4886e1d98583
RANDOM SEED=443687368

node139.alineos.net Linux 2.6.32-71.29.1.el6.x86_64 #1 SMP Mon Jun 27 19:49:27 BST 2011

/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2667.092
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 0
initial apicid	: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5334.18
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2667.092
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 16
initial apicid	: 16
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5332.55
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 2
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2667.092
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 2
initial apicid	: 2
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5332.55
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 3
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2667.092
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 18
initial apicid	: 18
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5332.55
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 4
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2667.092
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 4
initial apicid	: 4
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5332.56
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 5
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2667.092
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 20
initial apicid	: 20
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5332.55
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 6
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2667.092
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 6
initial apicid	: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5332.48
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 7
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2667.092
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 22
initial apicid	: 22
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5332.55
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:       32872528 kB
MemFree:        28489240 kB
Buffers:          123932 kB
Cached:           842500 kB
SwapCached:         3080 kB
Active:          1819436 kB
Inactive:         246860 kB
Active(anon):    1098912 kB
Inactive(anon):     3176 kB
Active(file):     720524 kB
Inactive(file):   243684 kB
Unevictable:     1580332 kB
Mlocked:         1394328 kB
SwapTotal:      67108856 kB
SwapFree:       67097568 kB
Dirty:             16348 kB
Writeback:             0 kB
AnonPages:       2678384 kB
Mapped:            11400 kB
Shmem:                 0 kB
Slab:             600792 kB
SReclaimable:      45096 kB
SUnreclaim:       555696 kB
KernelStack:        1480 kB
PageTables:         9020 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83545120 kB
Committed_AS:    2821452 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      346412 kB
VmallocChunk:   34341988032 kB
HardwareCorrupted:     0 kB
AnonHugePages:   1200128 kB
HugePages_Total:       0
HugePages_Free:        0
HugePages_Rsvd:        0
HugePages_Surp:        0
Hugepagesize:       2048 kB
DirectMap4k:        7552 kB
DirectMap2M:    33538048 kB

Free space on /tmp at the end= 71680 MiB
End job on node139 at 2016-06-29 22:03:48