PB'05 competition: run trace

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 in four parts:

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 provide some useful information on the computer.
SOLVER DATA
This is the output of the solver (stdout and stderr).
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 1200 seconds. 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 1230 seconds which will send a SIGXPU to the solver. The last limit is on the virtual memory used by the process (900Mb).
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.
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.

General information on the benchmark

Name	normalized-opb/web/uclid_pb_benchmarks/normalized-44s.smv.opb
MD5SUM	e2d8b39eddcd6f05d615c413ebf2c78d
Bench Category	no optimization function (SAT)
Has Objective Function	NO
Satisfiable	NO
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
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	68
Number of bits of the biggest number in a constraint	7
Biggest sum of numbers in a constraint	257
Number of bits of the biggest sum of numbers	9
Best result obtained on this benchmark	UNSAT
Best CPU time to get the best result obtained on this benchmark	0.093985
Number of variables	495
Total number of constraints	940
Number of constraints which are clauses	800
Number of constraints which are cardinality constraints (but not clauses)	0
Number of constraints which are nor clauses,nor cardinality constraints	140
Minimum length of a constraint	1
Maximum length of a constraint	13

Trace number 5158

#### BEGIN LAUNCHER DATA ####
LAUNCH ON wulflinc26 THE 2005-04-13 22:35:58 (client local time)
PB2005-SCRIPT v4.0 
MARKUPS: idlaunch=3653 boxname=wulflinc26 idbench=269 idsolver=10 numberseed=0
MD5SUM SOLVER: 
MD5SUM BENCH:  e2d8b39eddcd6f05d615c413ebf2c78d  /oldhome/oroussel/tmp/wulflinc26/normalized-44s.smv.opb
REAL COMMAND:  minisat+ -ca /oldhome/oroussel/tmp/wulflinc26/normalized-44s.smv.opb /oldhome/oroussel/tmp/wulflinc26/normalized-44s.smv.opb
IDLAUNCH: 3653
/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 6
model		: 7
model name	: Pentium III (Katmai)
stepping	: 3
cpu MHz		: 451.061
cache size	: 512 KB
fdiv_bug	: no
hlt_bug		: no
f00f_bug	: no
coma_bug	: no
fpu		: yes
fpu_exception	: yes
cpuid level	: 2
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 mmx fxsr sse
bogomips	: 888.83

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 6
model		: 7
model name	: Pentium III (Katmai)
stepping	: 3
cpu MHz		: 451.061
cache size	: 512 KB
fdiv_bug	: no
hlt_bug		: no
f00f_bug	: no
coma_bug	: no
fpu		: yes
fpu_exception	: yes
cpuid level	: 2
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 mmx fxsr sse
bogomips	: 901.12

/proc/meminfo:
MemTotal:      1034660 kB
MemFree:        853908 kB
Buffers:         34320 kB
Cached:         106412 kB
SwapCached:       2476 kB
Active:          51908 kB
Inactive:        94152 kB
HighTotal:      131008 kB
HighFree:        21532 kB
LowTotal:       903652 kB
LowFree:        832376 kB
SwapTotal:     2097892 kB
SwapFree:      2095416 kB
Dirty:              28 kB
Writeback:           0 kB
Mapped:           6948 kB
Slab:            29072 kB
Committed_AS:    63616 kB
PageTables:        320 kB
VmallocTotal:   114680 kB
VmallocUsed:      1368 kB
VmallocChunk:   113252 kB
JOB ENDED THE 2005-04-13 22:35:58 (client local time) WITH STATUS 20 IN 0.296954 SECONDS
stats: 3653 7 0.296954 20
#### END LAUNCHER DATA ####
#### BEGIN SOLVER DATA ####
c Parsing PB file...
c Converting 939 PB-constraints to clauses...
c   -- Unit propagations: ppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppp
c   -- Detecting intervals from adjacent constraints: ###################################################################
c   -- Clauses(.)/Splits(s): ...............................................................................................................................................................................................................................................................................................................................................................................................................
c ---[ 871]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 862]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 859]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 856]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 845]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 843]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 834]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 829]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 820]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 815]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 799]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 797]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 789]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 783]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 777]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 774]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 772]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 757]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 749]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 735]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 718]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 704]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 672]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 649]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 647]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 633]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 625]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 605]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 603]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 598]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 587]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 585]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 573]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 570]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 565]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 540]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 537]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 534]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 529]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 526]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 509]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 500]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 492]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 481]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 473]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 468]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 435]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 430]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 285]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 248]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 242]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 240]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 234]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 216]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 204]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 201]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 180]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 178]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 172]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 154]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 139]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[ 138]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[ 137]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[ 136]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[ 135]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[ 134]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[ 133]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[ 132]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[ 131]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[ 130]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[ 129]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[ 128]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[ 126]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[ 123]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[ 122]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[ 121]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[ 120]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[ 119]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[ 118]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[ 117]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[ 116]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[ 115]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[ 114]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[ 113]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[ 112]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[ 110]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[ 107]---> Adder-cost: 22   maxlim: 65   bits: 8/7
c ---[ 106]---> Adder-cost: 17   maxlim: 59   bits: 7/6
c ---[ 105]---> Adder-cost: 21   maxlim: 60   bits: 7/6
c ---[ 104]---> Adder-cost: 24   maxlim: 66   bits: 8/7
c ---[ 103]---> Adder-cost: 22   maxlim: 65   bits: 8/7
c ---[ 102]---> Adder-cost: 17   maxlim: 59   bits: 7/6
c ---[ 101]---> Adder-cost: 21   maxlim: 60   bits: 7/6
c ---[ 100]---> Adder-cost: 24   maxlim: 66   bits: 8/7
c ---[  99]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  98]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  97]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[  96]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[  95]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  94]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  93]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[  92]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[  91]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  90]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  89]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[  88]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[  87]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  86]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  85]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[  84]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[  83]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  82]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  81]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[  80]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[  79]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  78]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  77]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[  76]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[  75]---> Adder-cost: 22   maxlim: 65   bits: 8/7
c ---[  74]---> Adder-cost: 17   maxlim: 59   bits: 7/6
c ---[  73]---> Adder-cost: 21   maxlim: 60   bits: 7/6
c ---[  72]---> Adder-cost: 24   maxlim: 66   bits: 8/7
c ---[  71]---> Adder-cost: 24   maxlim: 65   bits: 8/7
c ---[  70]---> Adder-cost: 20   maxlim: 59   bits: 7/6
c ---[  69]---> Adder-cost: 21   maxlim: 60   bits: 7/6
c ---[  68]---> Adder-cost: 24   maxlim: 66   bits: 8/7
c ---[  66]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[  62]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[  59]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  58]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  57]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[  56]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[  55]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  54]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  53]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[  52]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[  51]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  50]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  49]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[  48]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[  47]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  46]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  45]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[  44]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[  43]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  42]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  41]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[  40]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[  39]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  38]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  37]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[  36]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[  35]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  34]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  33]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[  32]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[  31]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  30]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  29]---> Adder-cost: 9   maxlim: 63   bits: 7/6
c ---[  28]---> Adder-cost: 11   maxlim: 63   bits: 7/6
c ---[  27]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  26]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  25]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[  24]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[  23]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  22]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[  21]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[  20]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[  18]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[  14]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[  10]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[   7]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[   6]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[   5]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[   4]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ---[   3]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[   2]---> Adder-cost: 23   maxlim: 62   bits: 7/6
c ---[   1]---> Adder-cost: 13   maxlim: 63   bits: 7/6
c ---[   0]---> Adder-cost: 12   maxlim: 63   bits: 7/6
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |         0 |   10563    36629 |    3521       0        0     nan |  0.000 % |
c |       100 |   10563    36629 |    3873     100      504     5.0 | 26.737 % |
c |       251 |   10343    36064 |    4260     241     1447     6.0 | 28.997 % |
c |       476 |   10336    36041 |    4686     461     3058     6.6 | 29.031 % |
c ==============================================================================
c [1mUNSATISFIABLE[0m
s UNKNOWN
c _______________________________________________________________________________
c 
c restarts              : 4
c conflicts             : 652            (2363 /sec)
c decisions             : 2354           (8530 /sec)
c propagations          : 0              (0 /sec)
c inspects              : 0              (0 /sec)
c CPU time              : 0.275958 s
c _______________________________________________________________________________
#### END SOLVER DATA ####
#### BEGIN WATCHER DATA ####
Enforcing CPU limit (will send SIGTERM then SIGKILL): 1200 seconds
Enforcing CPUTime (will send SIGXCPU) limit: 1230 seconds
Enforcing VSIZE limit: 943718400 bytes
Raw data (loadavg): 0.87 0.95 0.91 2/54 26308
Raw data (stat): 26308 (runsolver) R 26307 22612 22611 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 479602054 1052672 99 4294967295 134512640 135381576 3221224464 3221219708 135158418 0 2147483391 7 90112 0 0 0 17 1 0 0
Raw data (statm): 257 99 215 215 0 42 0
vsize: 1028
[startup+0.305449 s]
Raw data (loadavg): 0.87 0.95 0.91 1/53 26308
Raw data (stat): 26308 (runsolver) R 26307 22612 22611 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 479602054 1052672 99 4294967295 134512640 135381576 3221224464 3221219708 135158418 0 2147483391 7 90112 0 0 0 17 1 0 0
Raw data (statm): 257 99 215 215 0 42 0
vsize: 0

Child status: 20
Real time (s): 0.305143
CPU time (s): 0.296954
CPU user time (s): 0.277957
CPU system time (s): 0.018997
CPU usage (%): 97.3163
Max. virtual memory (Kb): 1028
#### END WATCHER DATA ####
#### BEGIN VERIFIER DATA ####
ERROR: no interpretation found !
#### END VERIFIER DATA ####