About the Execution of LoLa+red for Philosophers-COL-010000
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r295-tall-167873947500165.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Philosophers-COL-010000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947500165
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.0K Feb 26 02:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 02:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 18:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 20:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 20:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 11:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 11:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 447K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-COL-010000-UpperBounds-00
FORMULA_NAME Philosophers-COL-010000-UpperBounds-01
FORMULA_NAME Philosophers-COL-010000-UpperBounds-02
FORMULA_NAME Philosophers-COL-010000-UpperBounds-03
FORMULA_NAME Philosophers-COL-010000-UpperBounds-04
FORMULA_NAME Philosophers-COL-010000-UpperBounds-05
FORMULA_NAME Philosophers-COL-010000-UpperBounds-06
FORMULA_NAME Philosophers-COL-010000-UpperBounds-07
FORMULA_NAME Philosophers-COL-010000-UpperBounds-08
FORMULA_NAME Philosophers-COL-010000-UpperBounds-09
FORMULA_NAME Philosophers-COL-010000-UpperBounds-10
FORMULA_NAME Philosophers-COL-010000-UpperBounds-11
FORMULA_NAME Philosophers-COL-010000-UpperBounds-12
FORMULA_NAME Philosophers-COL-010000-UpperBounds-13
FORMULA_NAME Philosophers-COL-010000-UpperBounds-14
FORMULA_NAME Philosophers-COL-010000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678794115138
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-010000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 11:41:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 11:41:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 11:41:56] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 11:41:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 11:41:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 771 ms
[2023-03-14 11:41:57] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 50000 PT places and 50000.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2023-03-14 11:41:57] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2023-03-14 11:41:57] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2023-03-14 11:41:57] [INFO ] Computed 2 place invariants in 5 ms
FORMULA Philosophers-COL-010000-UpperBounds-15 10000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-010000-UpperBounds-11 10000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-010000-UpperBounds-10 10000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-010000-UpperBounds-09 10000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-010000-UpperBounds-08 10000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-010000-UpperBounds-06 10000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-010000-UpperBounds-05 10000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-14 11:41:57] [INFO ] Invariant cache hit.
[2023-03-14 11:41:57] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-14 11:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:41:57] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 11:41:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:41:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 11:41:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:41:57] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-14 11:41:57] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 11:41:57] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2023-03-14 11:41:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 11:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:41:57] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-14 11:41:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:41:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 11:41:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:41:57] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 11:41:57] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-14 11:41:57] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 11:41:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 11:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:41:57] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-14 11:41:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:41:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 11:41:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:41:57] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 11:41:57] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 11:41:57] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2023-03-14 11:41:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 11:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:41:57] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 11:41:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:41:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 11:41:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:41:57] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-14 11:41:57] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 11:41:57] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 11:41:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 11:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:41:57] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 11:41:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:41:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 11:41:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:41:57] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 11:41:57] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 11:41:57] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 11:41:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 11:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:41:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 11:41:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:41:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 11:41:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:41:58] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 11:41:58] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-14 11:41:58] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 11:41:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 11:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:41:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 11:41:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:41:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 11:41:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:41:58] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 11:41:58] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-14 11:41:58] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 11:41:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 11:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:41:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 11:41:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:41:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 11:41:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:41:58] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-14 11:41:58] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-14 11:41:58] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 11:41:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 11:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:41:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 11:41:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:41:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-14 11:41:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:41:58] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-14 11:41:58] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 11:41:58] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 5000, 10000, 5000, 10000, 5000]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 10000) 10000) 10000)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 11:41:58] [INFO ] Unfolded HLPN to a Petri net with 50000 places and 50000 transitions 160000 arcs in 326 ms.
[2023-03-14 11:41:58] [INFO ] Unfolded 9 HLPN properties in 7 ms.
Finished random walk after 4637 steps, including 1 resets, run visited all 9 properties in 30003 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5437 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5109 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5061 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5196 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5203 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5116 ms. (steps per millisecond=1 ) properties seen 2
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5402 ms. (steps per millisecond=1 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5513 ms. (steps per millisecond=1 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5343 ms. (steps per millisecond=1 ) properties (out of 9) seen :0
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-14 11:43:16] [INFO ] Computed 20000 place invariants in 233 ms
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 5000, 10000, 5000, 10000, 5000] Max seen :[1370, 1393, 1370, 1393, 261, 1370, 261, 1370, 261]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 463 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 471 ms. Remains : 50000/50000 places, 50000/50000 transitions.
[2023-03-14 11:44:02] [INFO ] Invariant cache hit.
Finished random walk after 4691 steps, including 0 resets, run visited all 9 properties in 30006 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5533 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5089 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5234 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5140 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5253 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5259 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5158 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5626 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5083 ms. (steps per millisecond=1 ) properties seen 2
[2023-03-14 11:45:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 5000, 10000, 5000, 10000, 5000] Max seen :[1733, 1805, 1733, 1805, 481, 1733, 481, 1733, 481]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 300 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 50000/50000 places, 50000/50000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 284 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
[2023-03-14 11:46:37] [INFO ] Invariant cache hit.
[2023-03-14 11:46:40] [INFO ] Implicit Places using invariants in 3670 ms returned []
Implicit Place search using SMT only with invariants took 3671 ms to find 0 implicit places.
[2023-03-14 11:46:40] [INFO ] Invariant cache hit.
[2023-03-14 11:46:44] [INFO ] Dead Transitions using invariants and state equation in 3728 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7687 ms. Remains : 50000/50000 places, 50000/50000 transitions.
[2023-03-14 11:46:44] [INFO ] Invariant cache hit.
Finished random walk after 4556 steps, including 0 resets, run visited all 9 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5621 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5113 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5168 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5105 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5122 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5188 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5042 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5102 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5245 ms. (steps per millisecond=1 ) properties seen 2
[2023-03-14 11:48:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 5000, 10000, 5000, 10000, 5000] Max seen :[1733, 1805, 1733, 1805, 481, 1733, 481, 1733, 481]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 245 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 50000/50000 places, 50000/50000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 257 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
[2023-03-14 11:49:20] [INFO ] Invariant cache hit.
[2023-03-14 11:49:24] [INFO ] Implicit Places using invariants in 3760 ms returned []
Implicit Place search using SMT only with invariants took 3764 ms to find 0 implicit places.
[2023-03-14 11:49:24] [INFO ] Invariant cache hit.
[2023-03-14 11:49:28] [INFO ] Dead Transitions using invariants and state equation in 4294 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8324 ms. Remains : 50000/50000 places, 50000/50000 transitions.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-00
[2023-03-14 11:49:28] [INFO ] Invariant cache hit.
Finished random walk after 7723 steps, including 2 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5138 ms. (steps per millisecond=1 ) properties (out of 1) seen :0
[2023-03-14 11:50:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1385]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 18 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 24355 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24358 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-14 11:50:33] [INFO ] Computed 20000 place invariants in 56 ms
Finished random walk after 12201 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5160 ms. (steps per millisecond=1 )
[2023-03-14 11:51:08] [INFO ] Invariant cache hit.
[2023-03-14 11:51:53] [INFO ] [Real]Absence check using 20000 positive place invariants in 41034 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6390]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 167 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 146 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 11:51:53] [INFO ] Invariant cache hit.
[2023-03-14 11:51:56] [INFO ] Implicit Places using invariants in 2497 ms returned []
Implicit Place search using SMT only with invariants took 2499 ms to find 0 implicit places.
[2023-03-14 11:51:56] [INFO ] Invariant cache hit.
[2023-03-14 11:51:58] [INFO ] Dead Transitions using invariants and state equation in 2380 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5027 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 11:51:58] [INFO ] Invariant cache hit.
Finished random walk after 12331 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5008 ms. (steps per millisecond=1 )
[2023-03-14 11:52:33] [INFO ] Invariant cache hit.
[2023-03-14 11:53:15] [INFO ] [Real]Absence check using 20000 positive place invariants in 37903 ms returned sat
[2023-03-14 11:53:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:53:19] [INFO ] [Real]Absence check using state equation in 3082 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6395]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 201 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 144 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 11:53:19] [INFO ] Invariant cache hit.
[2023-03-14 11:53:21] [INFO ] Implicit Places using invariants in 2338 ms returned []
Implicit Place search using SMT only with invariants took 2345 ms to find 0 implicit places.
[2023-03-14 11:53:21] [INFO ] Invariant cache hit.
[2023-03-14 11:53:24] [INFO ] Dead Transitions using invariants and state equation in 2329 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4821 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 11:53:24] [INFO ] Invariant cache hit.
Finished random walk after 12364 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5034 ms. (steps per millisecond=1 )
[2023-03-14 11:53:59] [INFO ] Invariant cache hit.
[2023-03-14 11:54:42] [INFO ] [Real]Absence check using 20000 positive place invariants in 39160 ms returned sat
[2023-03-14 11:54:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:54:44] [INFO ] [Real]Absence check using state equation in 2194 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6395]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 157 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 129 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 11:54:44] [INFO ] Invariant cache hit.
[2023-03-14 11:54:46] [INFO ] Implicit Places using invariants in 2243 ms returned []
Implicit Place search using SMT only with invariants took 2245 ms to find 0 implicit places.
[2023-03-14 11:54:46] [INFO ] Invariant cache hit.
[2023-03-14 11:54:49] [INFO ] Dead Transitions using invariants and state equation in 2243 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4621 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-00 in 320631 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-01
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-14 11:54:49] [INFO ] Computed 20000 place invariants in 159 ms
Finished random walk after 7702 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5018 ms. (steps per millisecond=1 )
[2023-03-14 11:55:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1418]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 7 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 18199 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18200 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-14 11:55:47] [INFO ] Computed 20000 place invariants in 56 ms
Finished random walk after 12558 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 10001 steps, including 0 resets, run visited all 1 properties in 5460 ms. (steps per millisecond=1 )
[2023-03-14 11:56:23] [INFO ] Invariant cache hit.
[2023-03-14 11:57:08] [INFO ] [Real]Absence check using 20000 positive place invariants in 41292 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6557]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 131 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 129 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 11:57:08] [INFO ] Invariant cache hit.
[2023-03-14 11:57:10] [INFO ] Implicit Places using invariants in 2304 ms returned []
Implicit Place search using SMT only with invariants took 2305 ms to find 0 implicit places.
[2023-03-14 11:57:10] [INFO ] Invariant cache hit.
[2023-03-14 11:57:13] [INFO ] Dead Transitions using invariants and state equation in 2267 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4704 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 11:57:13] [INFO ] Invariant cache hit.
Finished random walk after 12498 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 10001 steps, including 0 resets, run visited all 1 properties in 5419 ms. (steps per millisecond=1 )
[2023-03-14 11:57:48] [INFO ] Invariant cache hit.
[2023-03-14 11:58:33] [INFO ] [Real]Absence check using 20000 positive place invariants in 41249 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6557]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 130 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 140 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 11:58:34] [INFO ] Invariant cache hit.
[2023-03-14 11:58:36] [INFO ] Implicit Places using invariants in 2255 ms returned []
Implicit Place search using SMT only with invariants took 2260 ms to find 0 implicit places.
[2023-03-14 11:58:36] [INFO ] Invariant cache hit.
[2023-03-14 11:58:38] [INFO ] Dead Transitions using invariants and state equation in 2265 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4672 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-01 in 229577 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-02
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-14 11:58:38] [INFO ] Computed 20000 place invariants in 143 ms
Finished random walk after 7794 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5166 ms. (steps per millisecond=1 ) properties seen 0
[2023-03-14 11:59:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1398]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 11 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 18119 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18120 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-14 11:59:37] [INFO ] Computed 20000 place invariants in 52 ms
Finished random walk after 12373 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 10001 steps, including 0 resets, run visited all 1 properties in 5474 ms. (steps per millisecond=1 )
[2023-03-14 12:00:12] [INFO ] Invariant cache hit.
[2023-03-14 12:00:53] [INFO ] [Real]Absence check using 20000 positive place invariants in 36524 ms returned sat
[2023-03-14 12:00:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:00:58] [INFO ] [Real]Absence check using state equation in 4852 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6372]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 135 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 138 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:00:58] [INFO ] Invariant cache hit.
[2023-03-14 12:01:00] [INFO ] Implicit Places using invariants in 2409 ms returned []
Implicit Place search using SMT only with invariants took 2422 ms to find 0 implicit places.
[2023-03-14 12:01:00] [INFO ] Invariant cache hit.
[2023-03-14 12:01:03] [INFO ] Dead Transitions using invariants and state equation in 2489 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5056 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 12:01:03] [INFO ] Invariant cache hit.
Finished random walk after 11919 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 10001 steps, including 0 resets, run visited all 1 properties in 5531 ms. (steps per millisecond=1 )
[2023-03-14 12:01:38] [INFO ] Invariant cache hit.
[2023-03-14 12:02:19] [INFO ] [Real]Absence check using 20000 positive place invariants in 36808 ms returned sat
[2023-03-14 12:02:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:02:24] [INFO ] [Real]Absence check using state equation in 4593 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6372]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 133 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 128 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:02:24] [INFO ] Invariant cache hit.
[2023-03-14 12:02:26] [INFO ] Implicit Places using invariants in 2270 ms returned []
Implicit Place search using SMT only with invariants took 2271 ms to find 0 implicit places.
[2023-03-14 12:02:26] [INFO ] Invariant cache hit.
[2023-03-14 12:02:28] [INFO ] Dead Transitions using invariants and state equation in 2247 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4647 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-02 in 230069 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-03
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-14 12:02:28] [INFO ] Computed 20000 place invariants in 142 ms
Finished random walk after 7898 steps, including 2 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5466 ms. (steps per millisecond=1 ) properties (out of 1) seen :0
[2023-03-14 12:03:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1406]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 8 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 16392 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16393 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-14 12:03:26] [INFO ] Computed 20000 place invariants in 52 ms
Finished random walk after 11833 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5055 ms. (steps per millisecond=1 )
[2023-03-14 12:04:01] [INFO ] Invariant cache hit.
[2023-03-14 12:04:43] [INFO ] [Real]Absence check using 20000 positive place invariants in 38041 ms returned sat
[2023-03-14 12:04:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:04:46] [INFO ] [Real]Absence check using state equation in 3217 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6236]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 132 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 148 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:04:46] [INFO ] Invariant cache hit.
[2023-03-14 12:04:48] [INFO ] Implicit Places using invariants in 2270 ms returned []
Implicit Place search using SMT only with invariants took 2271 ms to find 0 implicit places.
[2023-03-14 12:04:48] [INFO ] Invariant cache hit.
[2023-03-14 12:04:51] [INFO ] Dead Transitions using invariants and state equation in 2240 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4666 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 12:04:51] [INFO ] Invariant cache hit.
Finished random walk after 12391 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5036 ms. (steps per millisecond=1 )
[2023-03-14 12:05:26] [INFO ] Invariant cache hit.
[2023-03-14 12:06:08] [INFO ] [Real]Absence check using 20000 positive place invariants in 38699 ms returned sat
[2023-03-14 12:06:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:06:11] [INFO ] [Real]Absence check using state equation in 2465 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6409]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 134 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 125 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:06:11] [INFO ] Invariant cache hit.
[2023-03-14 12:06:13] [INFO ] Implicit Places using invariants in 2275 ms returned []
Implicit Place search using SMT only with invariants took 2277 ms to find 0 implicit places.
[2023-03-14 12:06:13] [INFO ] Invariant cache hit.
[2023-03-14 12:06:16] [INFO ] Dead Transitions using invariants and state equation in 2280 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4685 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 12:06:16] [INFO ] Invariant cache hit.
Finished random walk after 12546 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 10001 steps, including 0 resets, run visited all 1 properties in 5524 ms. (steps per millisecond=1 )
[2023-03-14 12:06:51] [INFO ] Invariant cache hit.
[2023-03-14 12:07:32] [INFO ] [Real]Absence check using 20000 positive place invariants in 37233 ms returned sat
[2023-03-14 12:07:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:07:36] [INFO ] [Real]Absence check using state equation in 4090 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6470]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 148 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 121 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:07:37] [INFO ] Invariant cache hit.
[2023-03-14 12:07:39] [INFO ] Implicit Places using invariants in 2240 ms returned []
Implicit Place search using SMT only with invariants took 2243 ms to find 0 implicit places.
[2023-03-14 12:07:39] [INFO ] Invariant cache hit.
[2023-03-14 12:07:41] [INFO ] Dead Transitions using invariants and state equation in 2234 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4602 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 12:07:41] [INFO ] Invariant cache hit.
Finished random walk after 12717 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 10001 steps, including 0 resets, run visited all 1 properties in 5268 ms. (steps per millisecond=1 )
[2023-03-14 12:08:16] [INFO ] Invariant cache hit.
[2023-03-14 12:08:58] [INFO ] [Real]Absence check using 20000 positive place invariants in 37722 ms returned sat
[2023-03-14 12:08:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:09:02] [INFO ] [Real]Absence check using state equation in 3536 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6524]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 130 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 125 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:09:02] [INFO ] Invariant cache hit.
[2023-03-14 12:09:04] [INFO ] Implicit Places using invariants in 2321 ms returned []
Implicit Place search using SMT only with invariants took 2325 ms to find 0 implicit places.
[2023-03-14 12:09:04] [INFO ] Invariant cache hit.
[2023-03-14 12:09:06] [INFO ] Dead Transitions using invariants and state equation in 2134 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4589 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 12:09:06] [INFO ] Invariant cache hit.
Finished random walk after 12861 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 10001 steps, including 0 resets, run visited all 1 properties in 5149 ms. (steps per millisecond=1 )
[2023-03-14 12:09:42] [INFO ] Invariant cache hit.
[2023-03-14 12:10:23] [INFO ] [Real]Absence check using 20000 positive place invariants in 37593 ms returned sat
[2023-03-14 12:10:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:10:27] [INFO ] [Real]Absence check using state equation in 3794 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6524]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 138 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 133 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:10:27] [INFO ] Invariant cache hit.
[2023-03-14 12:10:29] [INFO ] Implicit Places using invariants in 2239 ms returned []
Implicit Place search using SMT only with invariants took 2240 ms to find 0 implicit places.
[2023-03-14 12:10:29] [INFO ] Invariant cache hit.
[2023-03-14 12:10:32] [INFO ] Dead Transitions using invariants and state equation in 2274 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4648 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-03 in 483258 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-04
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-14 12:10:32] [INFO ] Computed 20000 place invariants in 139 ms
Finished random walk after 8260 steps, including 2 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5397 ms. (steps per millisecond=1 ) properties (out of 1) seen :0
[2023-03-14 12:11:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[268]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 50000 transition count 30000
Reduce places removed 20000 places and 0 transitions.
Ensure Unique test removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 30000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 42235 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42236 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-14 12:11:55] [INFO ] Computed 20000 place invariants in 59 ms
Finished random walk after 15246 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5312 ms. (steps per millisecond=1 )
[2023-03-14 12:12:30] [INFO ] Invariant cache hit.
[2023-03-14 12:13:15] [INFO ] [Real]Absence check using 20000 positive place invariants in 41354 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2822]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 129 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 130 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:13:15] [INFO ] Invariant cache hit.
[2023-03-14 12:13:18] [INFO ] Implicit Places using invariants in 2310 ms returned []
Implicit Place search using SMT only with invariants took 2311 ms to find 0 implicit places.
[2023-03-14 12:13:18] [INFO ] Invariant cache hit.
[2023-03-14 12:13:20] [INFO ] Dead Transitions using invariants and state equation in 2216 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4659 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 12:13:20] [INFO ] Invariant cache hit.
Finished random walk after 15236 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5459 ms. (steps per millisecond=1 )
[2023-03-14 12:13:55] [INFO ] Invariant cache hit.
[2023-03-14 12:14:41] [INFO ] [Real]Absence check using 20000 positive place invariants in 41237 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2822]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 135 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 142 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:14:41] [INFO ] Invariant cache hit.
[2023-03-14 12:14:43] [INFO ] Implicit Places using invariants in 2249 ms returned []
Implicit Place search using SMT only with invariants took 2250 ms to find 0 implicit places.
[2023-03-14 12:14:43] [INFO ] Invariant cache hit.
[2023-03-14 12:14:45] [INFO ] Dead Transitions using invariants and state equation in 2258 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4651 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-04 in 253782 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-07
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-14 12:14:46] [INFO ] Computed 20000 place invariants in 138 ms
Finished random walk after 7918 steps, including 2 resets, run visited all 1 properties in 30003 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5346 ms. (steps per millisecond=1 ) properties seen 0
[2023-03-14 12:15:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1408]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 8 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 22241 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22242 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-14 12:15:48] [INFO ] Computed 20000 place invariants in 50 ms
Finished random walk after 12327 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5387 ms. (steps per millisecond=1 )
[2023-03-14 12:16:24] [INFO ] Invariant cache hit.
[2023-03-14 12:17:09] [INFO ] [Real]Absence check using 20000 positive place invariants in 40939 ms returned sat
[2023-03-14 12:17:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:17:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6273]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 133 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 131 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:17:09] [INFO ] Invariant cache hit.
[2023-03-14 12:17:11] [INFO ] Implicit Places using invariants in 2331 ms returned []
Implicit Place search using SMT only with invariants took 2339 ms to find 0 implicit places.
[2023-03-14 12:17:11] [INFO ] Invariant cache hit.
[2023-03-14 12:17:14] [INFO ] Dead Transitions using invariants and state equation in 2315 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4785 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 12:17:14] [INFO ] Invariant cache hit.
Finished random walk after 11549 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5287 ms. (steps per millisecond=1 )
[2023-03-14 12:17:49] [INFO ] Invariant cache hit.
[2023-03-14 12:18:34] [INFO ] [Real]Absence check using 20000 positive place invariants in 41150 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6273]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 130 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 130 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:18:35] [INFO ] Invariant cache hit.
[2023-03-14 12:18:37] [INFO ] Implicit Places using invariants in 2338 ms returned []
Implicit Place search using SMT only with invariants took 2351 ms to find 0 implicit places.
[2023-03-14 12:18:37] [INFO ] Invariant cache hit.
[2023-03-14 12:18:39] [INFO ] Dead Transitions using invariants and state equation in 2258 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4740 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-07 in 233812 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-12
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-14 12:18:39] [INFO ] Computed 20000 place invariants in 149 ms
Finished random walk after 7319 steps, including 2 resets, run visited all 1 properties in 30003 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5376 ms. (steps per millisecond=1 ) properties seen 0
[2023-03-14 12:19:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[275]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 50000 transition count 30000
Reduce places removed 20000 places and 0 transitions.
Ensure Unique test removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 30000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 34963 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34963 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-14 12:19:55] [INFO ] Computed 20000 place invariants in 67 ms
Finished random walk after 14940 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5317 ms. (steps per millisecond=1 )
[2023-03-14 12:20:30] [INFO ] Invariant cache hit.
[2023-03-14 12:21:15] [INFO ] [Real]Absence check using 20000 positive place invariants in 40991 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2768]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 147 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 129 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:21:16] [INFO ] Invariant cache hit.
[2023-03-14 12:21:18] [INFO ] Implicit Places using invariants in 2321 ms returned []
Implicit Place search using SMT only with invariants took 2323 ms to find 0 implicit places.
[2023-03-14 12:21:18] [INFO ] Invariant cache hit.
[2023-03-14 12:21:20] [INFO ] Dead Transitions using invariants and state equation in 2322 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4775 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 12:21:20] [INFO ] Invariant cache hit.
Finished random walk after 14696 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5419 ms. (steps per millisecond=1 )
[2023-03-14 12:21:56] [INFO ] Invariant cache hit.
[2023-03-14 12:22:41] [INFO ] [Real]Absence check using 20000 positive place invariants in 41077 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2775]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 158 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 132 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:22:41] [INFO ] Invariant cache hit.
[2023-03-14 12:22:43] [INFO ] Implicit Places using invariants in 2296 ms returned []
Implicit Place search using SMT only with invariants took 2297 ms to find 0 implicit places.
[2023-03-14 12:22:43] [INFO ] Invariant cache hit.
[2023-03-14 12:22:46] [INFO ] Dead Transitions using invariants and state equation in 2317 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4747 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 12:22:46] [INFO ] Invariant cache hit.
Finished random walk after 14863 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5368 ms. (steps per millisecond=1 )
[2023-03-14 12:23:21] [INFO ] Invariant cache hit.
[2023-03-14 12:24:06] [INFO ] [Real]Absence check using 20000 positive place invariants in 41110 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2809]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 145 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 136 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:24:07] [INFO ] Invariant cache hit.
[2023-03-14 12:24:09] [INFO ] Implicit Places using invariants in 2275 ms returned []
Implicit Place search using SMT only with invariants took 2277 ms to find 0 implicit places.
[2023-03-14 12:24:09] [INFO ] Invariant cache hit.
[2023-03-14 12:24:11] [INFO ] Dead Transitions using invariants and state equation in 2357 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4771 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 12:24:11] [INFO ] Invariant cache hit.
Finished random walk after 14738 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5446 ms. (steps per millisecond=1 )
[2023-03-14 12:24:47] [INFO ] Invariant cache hit.
[2023-03-14 12:25:32] [INFO ] [Real]Absence check using 20000 positive place invariants in 41107 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2817]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 136 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 145 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:25:32] [INFO ] Invariant cache hit.
[2023-03-14 12:25:34] [INFO ] Implicit Places using invariants in 2335 ms returned []
Implicit Place search using SMT only with invariants took 2336 ms to find 0 implicit places.
[2023-03-14 12:25:35] [INFO ] Invariant cache hit.
[2023-03-14 12:25:37] [INFO ] Dead Transitions using invariants and state equation in 2340 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4827 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 12:25:37] [INFO ] Invariant cache hit.
Finished random walk after 14861 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5388 ms. (steps per millisecond=1 )
[2023-03-14 12:26:12] [INFO ] Invariant cache hit.
[2023-03-14 12:26:57] [INFO ] [Real]Absence check using 20000 positive place invariants in 41025 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2817]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 150 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 133 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:26:58] [INFO ] Invariant cache hit.
[2023-03-14 12:27:00] [INFO ] Implicit Places using invariants in 2300 ms returned []
Implicit Place search using SMT only with invariants took 2301 ms to find 0 implicit places.
[2023-03-14 12:27:00] [INFO ] Invariant cache hit.
[2023-03-14 12:27:02] [INFO ] Dead Transitions using invariants and state equation in 2314 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4751 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-12 in 503154 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-13
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-14 12:27:02] [INFO ] Computed 20000 place invariants in 145 ms
Finished random walk after 6710 steps, including 2 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5452 ms. (steps per millisecond=1 ) properties seen 0
[2023-03-14 12:27:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1383]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 7 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 20902 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20904 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-14 12:28:04] [INFO ] Computed 20000 place invariants in 68 ms
Finished random walk after 11613 steps, including 0 resets, run visited all 1 properties in 30003 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5520 ms. (steps per millisecond=1 )
[2023-03-14 12:28:40] [INFO ] Invariant cache hit.
[2023-03-14 12:29:25] [INFO ] [Real]Absence check using 20000 positive place invariants in 41140 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6076]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 143 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 136 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:29:25] [INFO ] Invariant cache hit.
[2023-03-14 12:29:27] [INFO ] Implicit Places using invariants in 2320 ms returned []
Implicit Place search using SMT only with invariants took 2323 ms to find 0 implicit places.
[2023-03-14 12:29:27] [INFO ] Invariant cache hit.
[2023-03-14 12:29:30] [INFO ] Dead Transitions using invariants and state equation in 2315 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4778 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 12:29:30] [INFO ] Invariant cache hit.
Finished random walk after 11576 steps, including 0 resets, run visited all 1 properties in 30003 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5461 ms. (steps per millisecond=1 )
[2023-03-14 12:30:05] [INFO ] Invariant cache hit.
[2023-03-14 12:30:50] [INFO ] [Real]Absence check using 20000 positive place invariants in 41091 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6168]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 132 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 148 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:30:51] [INFO ] Invariant cache hit.
[2023-03-14 12:30:53] [INFO ] Implicit Places using invariants in 2297 ms returned []
Implicit Place search using SMT only with invariants took 2298 ms to find 0 implicit places.
[2023-03-14 12:30:53] [INFO ] Invariant cache hit.
[2023-03-14 12:30:55] [INFO ] Dead Transitions using invariants and state equation in 2281 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4738 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 12:30:55] [INFO ] Invariant cache hit.
Finished random walk after 11381 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5411 ms. (steps per millisecond=1 )
[2023-03-14 12:31:31] [INFO ] Invariant cache hit.
[2023-03-14 12:32:16] [INFO ] [Real]Absence check using 20000 positive place invariants in 41160 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6168]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 174 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 132 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:32:16] [INFO ] Invariant cache hit.
[2023-03-14 12:32:18] [INFO ] Implicit Places using invariants in 2331 ms returned []
Implicit Place search using SMT only with invariants took 2336 ms to find 0 implicit places.
[2023-03-14 12:32:18] [INFO ] Invariant cache hit.
[2023-03-14 12:32:21] [INFO ] Dead Transitions using invariants and state equation in 2297 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4767 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-13 in 318455 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-14
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-14 12:32:21] [INFO ] Computed 20000 place invariants in 148 ms
Finished random walk after 7176 steps, including 2 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5485 ms. (steps per millisecond=1 ) properties seen 0
[2023-03-14 12:32:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[246]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 50000 transition count 30000
Reduce places removed 20000 places and 0 transitions.
Ensure Unique test removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 30000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 51348 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51349 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-14 12:33:53] [INFO ] Computed 20000 place invariants in 64 ms
Finished random walk after 14793 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5378 ms. (steps per millisecond=1 )
[2023-03-14 12:34:28] [INFO ] Invariant cache hit.
[2023-03-14 12:35:13] [INFO ] [Real]Absence check using 20000 positive place invariants in 41131 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2852]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 149 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 132 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:35:14] [INFO ] Invariant cache hit.
[2023-03-14 12:35:16] [INFO ] Implicit Places using invariants in 2305 ms returned []
Implicit Place search using SMT only with invariants took 2312 ms to find 0 implicit places.
[2023-03-14 12:35:16] [INFO ] Invariant cache hit.
[2023-03-14 12:35:18] [INFO ] Dead Transitions using invariants and state equation in 2328 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4775 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 12:35:18] [INFO ] Invariant cache hit.
Finished random walk after 14570 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5412 ms. (steps per millisecond=1 )
[2023-03-14 12:35:54] [INFO ] Invariant cache hit.
[2023-03-14 12:36:39] [INFO ] [Real]Absence check using 20000 positive place invariants in 41164 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2852]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 149 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 135 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 12:36:39] [INFO ] Invariant cache hit.
[2023-03-14 12:36:42] [INFO ] Implicit Places using invariants in 2312 ms returned []
Implicit Place search using SMT only with invariants took 2313 ms to find 0 implicit places.
[2023-03-14 12:36:42] [INFO ] Invariant cache hit.
[2023-03-14 12:36:44] [INFO ] Dead Transitions using invariants and state equation in 2335 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4785 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-14 in 263203 ms.
[2023-03-14 12:36:46] [INFO ] Flatten gal took : 1924 ms
[2023-03-14 12:36:46] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/UpperBounds.sr.xml took 38 ms.
[2023-03-14 12:36:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 50000 places, 50000 transitions and 160000 arcs took 147 ms.
Total runtime 3290399 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Philosophers-COL-010000
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
Upper Bounds
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15642104 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16062676 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 5 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 10 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 15 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 20 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 25 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 30 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 35 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 40 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 45 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 50 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 55 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 60 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 65 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 70 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 75 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 80 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 85 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 90 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 95 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 100 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 105 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 110 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 115 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 120 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 125 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 130 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 135 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 140 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 145 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 150 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 155 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 160 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 165 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 170 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 175 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 180 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 185 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 190 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 195 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 200 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 205 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 210 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 215 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 220 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 225 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 230 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 235 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 240 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 245 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 250 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 255 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 260 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 265 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 270 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 275 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 280 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 285 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 290 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 295 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 300 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-010000-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-02: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-03: BOUND 0 0 0 0 1 0 0 0
Philosophers-COL-010000-UpperBounds-04: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-12: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0
Philosophers-COL-010000-UpperBounds-14: BOUND 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 305 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 9
lola: caught signal Terminated - aborting LoLA
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-010000-UpperBounds-00: BOUND unknown AGGR
Philosophers-COL-010000-UpperBounds-01: BOUND unknown AGGR
Philosophers-COL-010000-UpperBounds-02: BOUND unknown AGGR
Philosophers-COL-010000-UpperBounds-03: BOUND unknown AGGR
Philosophers-COL-010000-UpperBounds-04: BOUND unknown AGGR
Philosophers-COL-010000-UpperBounds-07: BOUND unknown AGGR
Philosophers-COL-010000-UpperBounds-12: BOUND unknown AGGR
Philosophers-COL-010000-UpperBounds-13: BOUND unknown AGGR
Philosophers-COL-010000-UpperBounds-14: BOUND unknown AGGR
Time elapsed: 307 secs. Pages in use: 0
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-010000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Philosophers-COL-010000, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r295-tall-167873947500165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-010000.tgz
mv Philosophers-COL-010000 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;