fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r295-tall-167873947700277
Last Updated
May 14, 2023

About the Execution of LoLa+red for PhilosophersDyn-COL-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
506.588 16853.00 23108.00 1374.50 3 3 3 3 2 3 3 3 3 3 3 3 2 3 3 2 normal

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-167873947700277.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 PhilosophersDyn-COL-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947700277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.5K Feb 26 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 12:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 12:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 13K Feb 26 12:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 12:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 31K 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 PhilosophersDyn-COL-03-UpperBounds-00
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-01
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-02
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-03
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-04
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-05
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-06
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-07
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-08
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-09
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-10
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-11
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-12
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-13
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-14
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678814686663

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=PhilosophersDyn-COL-03
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 17:24:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 17:24:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 17:24:48] [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 17:24:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 17:24:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 404 ms
[2023-03-14 17:24:48] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 30 PT places and 87.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-14 17:24:48] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 3 ms.
[2023-03-14 17:24:48] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 7 rows 8 cols
[2023-03-14 17:24:48] [INFO ] Computed 3 place invariants in 8 ms
FORMULA PhilosophersDyn-COL-03-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-14 17:24:48] [INFO ] Invariant cache hit.
[2023-03-14 17:24:48] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-14 17:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:48] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-14 17:24:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:48] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-14 17:24:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-14 17:24:48] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-14 17:24:48] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-14 17:24:48] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2023-03-14 17:24:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:48] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-14 17:24:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:48] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-14 17:24:48] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-14 17:24:48] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 17:24:48] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2023-03-14 17:24:48] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-14 17:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:48] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 17:24:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:48] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 17:24:48] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-14 17:24:48] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 17:24:48] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2023-03-14 17:24:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:48] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 17:24:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:48] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-14 17:24:48] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-14 17:24:48] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 17:24:49] [INFO ] Added : 3 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-14 17:24:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 17:24:49] [INFO ] Added : 4 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 17:24:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-14 17:24:49] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 7 ms.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 17:24:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2023-03-14 17:24:49] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 17:24:49] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 17:24:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 17:24:49] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 17:24:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 17:24:49] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 5 ms.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-14 17:24:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-14 17:24:49] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 4 ms.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 17:24:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 17:24:49] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 17:24:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2023-03-14 17:24:49] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 17:24:49] [INFO ] Added : 3 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [3, 3, 3, 3, 3, 3, 3, 3, -1, 3, 3, 3]
Domain [Philosopher(3), Philosopher(3)] of place Neighbourhood breaks symmetries in sort Philosopher
[2023-03-14 17:24:49] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions 564 arcs in 11 ms.
[2023-03-14 17:24:49] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Incomplete random walk after 10000 steps, including 1423 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :33
FORMULA PhilosophersDyn-COL-03-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 350 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 10001 steps, including 237 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 10001 steps, including 354 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :6
[2023-03-14 17:24:49] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2023-03-14 17:24:49] [INFO ] Computed 11 place invariants in 8 ms
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-14 17:24:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-14 17:24:49] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-14 17:24:49] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2023-03-14 17:24:49] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 7 ms.
[2023-03-14 17:24:49] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 8 ms.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-14 17:24:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Added 36 Read/Feed constraints in 3 ms returned sat
[2023-03-14 17:24:49] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 8 ms.
[2023-03-14 17:24:49] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 10 ms.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-14 17:24:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:49] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-14 17:24:49] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2023-03-14 17:24:49] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 7 ms.
[2023-03-14 17:24:49] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [3, 2147483647, 3] Max seen :[2, 2, 2]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 13 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-14 17:24:49] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
[2023-03-14 17:24:50] [INFO ] Invariant cache hit.
[2023-03-14 17:24:50] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 30 transitions.
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 30/30 places, 51/81 transitions.
// Phase 1: matrix 51 rows 30 cols
[2023-03-14 17:24:50] [INFO ] Computed 11 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 143144 resets, run finished after 1238 ms. (steps per millisecond=807 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 34745 resets, run finished after 465 ms. (steps per millisecond=2150 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 23723 resets, run finished after 424 ms. (steps per millisecond=2358 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 34699 resets, run finished after 463 ms. (steps per millisecond=2159 ) properties (out of 3) seen :6
[2023-03-14 17:24:52] [INFO ] Invariant cache hit.
[2023-03-14 17:24:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:52] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-14 17:24:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:52] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-14 17:24:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:52] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-14 17:24:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:52] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-14 17:24:52] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:24:52] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2023-03-14 17:24:52] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 6 ms.
[2023-03-14 17:24:52] [INFO ] Added : 3 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 15 ms.
[2023-03-14 17:24:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:52] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-14 17:24:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:52] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-14 17:24:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:52] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-14 17:24:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:52] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-14 17:24:52] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2023-03-14 17:24:52] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2023-03-14 17:24:52] [INFO ] Added : 3 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 11 ms.
[2023-03-14 17:24:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:52] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-14 17:24:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:52] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-14 17:24:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:52] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-14 17:24:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:52] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-14 17:24:52] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-14 17:24:52] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2023-03-14 17:24:52] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [3, 2147483647, 3] Max seen :[2, 2, 2]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 30/30 places, 51/51 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 17:24:53] [INFO ] Invariant cache hit.
[2023-03-14 17:24:53] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-14 17:24:53] [INFO ] Invariant cache hit.
[2023-03-14 17:24:53] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:24:53] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-14 17:24:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 17:24:53] [INFO ] Invariant cache hit.
[2023-03-14 17:24:53] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 30/30 places, 51/51 transitions.
Starting property specific reduction for PhilosophersDyn-COL-03-UpperBounds-04
[2023-03-14 17:24:53] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
[2023-03-14 17:24:53] [INFO ] Invariant cache hit.
[2023-03-14 17:24:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:53] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-14 17:24:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:53] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-14 17:24:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:53] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-14 17:24:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:53] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-14 17:24:53] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:24:53] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-14 17:24:53] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2023-03-14 17:24:53] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 51/51 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 48
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 27 transition count 48
Applied a total of 6 rules in 7 ms. Remains 27 /30 variables (removed 3) and now considering 48/51 (removed 3) transitions.
// Phase 1: matrix 48 rows 27 cols
[2023-03-14 17:24:53] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-14 17:24:53] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 27/30 places, 48/51 transitions.
[2023-03-14 17:24:53] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 146659 resets, run finished after 1001 ms. (steps per millisecond=999 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 45333 resets, run finished after 385 ms. (steps per millisecond=2597 ) properties (out of 1) seen :2
[2023-03-14 17:24:54] [INFO ] Invariant cache hit.
[2023-03-14 17:24:54] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-14 17:24:54] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-14 17:24:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:54] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-14 17:24:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-14 17:24:54] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2023-03-14 17:24:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:54] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-14 17:24:54] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:24:54] [INFO ] [Nat]Added 30 Read/Feed constraints in 8 ms returned sat
[2023-03-14 17:24:54] [INFO ] Computed and/alt/rep : 12/93/12 causal constraints (skipped 33 transitions) in 3 ms.
[2023-03-14 17:24:54] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 4 ms to minimize.
[2023-03-14 17:24:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-14 17:24:54] [INFO ] Added : 4 causal constraints over 1 iterations in 53 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 27/27 places, 48/48 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-14 17:24:54] [INFO ] Invariant cache hit.
[2023-03-14 17:24:54] [INFO ] Implicit Places using invariants in 38 ms returned [18, 19, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 39 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/27 places, 48/48 transitions.
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 21 transition count 45
Applied a total of 6 rules in 5 ms. Remains 21 /24 variables (removed 3) and now considering 45/48 (removed 3) transitions.
// Phase 1: matrix 45 rows 21 cols
[2023-03-14 17:24:54] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-14 17:24:54] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-14 17:24:54] [INFO ] Invariant cache hit.
[2023-03-14 17:24:55] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:24:55] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 21/27 places, 45/48 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 132 ms. Remains : 21/27 places, 45/48 transitions.
[2023-03-14 17:24:55] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 203622 resets, run finished after 907 ms. (steps per millisecond=1102 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 66666 resets, run finished after 312 ms. (steps per millisecond=3205 ) properties (out of 1) seen :2
[2023-03-14 17:24:56] [INFO ] Invariant cache hit.
[2023-03-14 17:24:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:56] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-14 17:24:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:56] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-14 17:24:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-14 17:24:56] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-14 17:24:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:56] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-14 17:24:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:24:56] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-14 17:24:56] [INFO ] Computed and/alt/rep : 9/69/9 causal constraints (skipped 33 transitions) in 4 ms.
[2023-03-14 17:24:56] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 21/21 places, 45/45 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-14 17:24:56] [INFO ] Invariant cache hit.
[2023-03-14 17:24:56] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-14 17:24:56] [INFO ] Invariant cache hit.
[2023-03-14 17:24:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:24:56] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-14 17:24:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 17:24:56] [INFO ] Invariant cache hit.
[2023-03-14 17:24:56] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 21/21 places, 45/45 transitions.
Ending property specific reduction for PhilosophersDyn-COL-03-UpperBounds-04 in 3341 ms.
Starting property specific reduction for PhilosophersDyn-COL-03-UpperBounds-12
// Phase 1: matrix 51 rows 30 cols
[2023-03-14 17:24:56] [INFO ] Computed 11 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 1456 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 230 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :2
[2023-03-14 17:24:56] [INFO ] Invariant cache hit.
[2023-03-14 17:24:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:56] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-14 17:24:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:56] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-14 17:24:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:56] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-14 17:24:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:56] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-14 17:24:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:24:56] [INFO ] [Nat]Added 30 Read/Feed constraints in 6 ms returned sat
[2023-03-14 17:24:56] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2023-03-14 17:24:56] [INFO ] Added : 3 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 17:24:56] [INFO ] Invariant cache hit.
[2023-03-14 17:24:56] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 30/30 places, 51/51 transitions.
[2023-03-14 17:24:56] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 143058 resets, run finished after 1013 ms. (steps per millisecond=987 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 23673 resets, run finished after 399 ms. (steps per millisecond=2506 ) properties (out of 1) seen :2
[2023-03-14 17:24:58] [INFO ] Invariant cache hit.
[2023-03-14 17:24:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:58] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-14 17:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:58] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-14 17:24:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:58] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-14 17:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:58] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-14 17:24:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:24:58] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2023-03-14 17:24:58] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 6 ms.
[2023-03-14 17:24:58] [INFO ] Added : 3 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 30/30 places, 51/51 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 17:24:58] [INFO ] Invariant cache hit.
[2023-03-14 17:24:58] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-14 17:24:58] [INFO ] Invariant cache hit.
[2023-03-14 17:24:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:24:58] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-14 17:24:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 17:24:58] [INFO ] Invariant cache hit.
[2023-03-14 17:24:58] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 30/30 places, 51/51 transitions.
Ending property specific reduction for PhilosophersDyn-COL-03-UpperBounds-12 in 1895 ms.
Starting property specific reduction for PhilosophersDyn-COL-03-UpperBounds-15
[2023-03-14 17:24:58] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1413 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 345 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
[2023-03-14 17:24:58] [INFO ] Invariant cache hit.
[2023-03-14 17:24:58] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-14 17:24:58] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-14 17:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:58] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-14 17:24:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:24:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:58] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-14 17:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:58] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-14 17:24:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:24:58] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-14 17:24:58] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2023-03-14 17:24:58] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 51/51 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 48
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 27 transition count 48
Applied a total of 6 rules in 5 ms. Remains 27 /30 variables (removed 3) and now considering 48/51 (removed 3) transitions.
// Phase 1: matrix 48 rows 27 cols
[2023-03-14 17:24:58] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-14 17:24:58] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 27/30 places, 48/51 transitions.
[2023-03-14 17:24:58] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 146542 resets, run finished after 972 ms. (steps per millisecond=1028 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 45339 resets, run finished after 380 ms. (steps per millisecond=2631 ) properties (out of 1) seen :2
[2023-03-14 17:24:59] [INFO ] Invariant cache hit.
[2023-03-14 17:24:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 17:24:59] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2023-03-14 17:24:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:24:59] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-14 17:24:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:25:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 17:25:00] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2023-03-14 17:25:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:25:00] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-14 17:25:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:25:00] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-14 17:25:00] [INFO ] Computed and/alt/rep : 12/93/12 causal constraints (skipped 33 transitions) in 3 ms.
[2023-03-14 17:25:00] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2023-03-14 17:25:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-14 17:25:00] [INFO ] Added : 4 causal constraints over 1 iterations in 51 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 27/27 places, 48/48 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-14 17:25:00] [INFO ] Invariant cache hit.
[2023-03-14 17:25:00] [INFO ] Implicit Places using invariants in 42 ms returned [18, 19, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 43 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/27 places, 48/48 transitions.
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 21 transition count 45
Applied a total of 6 rules in 5 ms. Remains 21 /24 variables (removed 3) and now considering 45/48 (removed 3) transitions.
// Phase 1: matrix 45 rows 21 cols
[2023-03-14 17:25:00] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-14 17:25:00] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-14 17:25:00] [INFO ] Invariant cache hit.
[2023-03-14 17:25:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:25:00] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 21/27 places, 45/48 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 131 ms. Remains : 21/27 places, 45/48 transitions.
[2023-03-14 17:25:00] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 203480 resets, run finished after 911 ms. (steps per millisecond=1097 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 66666 resets, run finished after 319 ms. (steps per millisecond=3134 ) properties (out of 1) seen :2
[2023-03-14 17:25:01] [INFO ] Invariant cache hit.
[2023-03-14 17:25:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 17:25:01] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-14 17:25:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:25:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-14 17:25:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:25:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 17:25:01] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-14 17:25:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:25:01] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-14 17:25:01] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:25:01] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-14 17:25:01] [INFO ] Computed and/alt/rep : 9/69/9 causal constraints (skipped 33 transitions) in 4 ms.
[2023-03-14 17:25:01] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 21/21 places, 45/45 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-14 17:25:01] [INFO ] Invariant cache hit.
[2023-03-14 17:25:01] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-14 17:25:01] [INFO ] Invariant cache hit.
[2023-03-14 17:25:01] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:25:01] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-14 17:25:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 17:25:01] [INFO ] Invariant cache hit.
[2023-03-14 17:25:01] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 21/21 places, 45/45 transitions.
Ending property specific reduction for PhilosophersDyn-COL-03-UpperBounds-15 in 3301 ms.
[2023-03-14 17:25:02] [INFO ] Flatten gal took : 27 ms
[2023-03-14 17:25:02] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-14 17:25:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 51 transitions and 321 arcs took 1 ms.
Total runtime 14458 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PhilosophersDyn-COL-03
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
Upper Bounds

FORMULA PhilosophersDyn-COL-03-UpperBounds-04 2 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-UpperBounds-15 2 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-UpperBounds-12 2 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678814703516

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 11 (type EXCL) for 0 PhilosophersDyn-COL-03-UpperBounds-04
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 9 (type FNDP) for 0 PhilosophersDyn-COL-03-UpperBounds-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type EQUN) for 0 PhilosophersDyn-COL-03-UpperBounds-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 12 (type FNDP) for 3 PhilosophersDyn-COL-03-UpperBounds-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 3
lola: REPORT NUM
lola: FINISHED task # 11 (type EXCL) for PhilosophersDyn-COL-03-UpperBounds-04
lola: markings : 277
lola: fired transitions : 603
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 9 (type FNDP) for PhilosophersDyn-COL-03-UpperBounds-04 (obsolete)
lola: CANCELED task # 10 (type EQUN) for PhilosophersDyn-COL-03-UpperBounds-04 (obsolete)
lola: LAUNCH task # 17 (type EXCL) for 6 PhilosophersDyn-COL-03-UpperBounds-15
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 15 (type FNDP) for 6 PhilosophersDyn-COL-03-UpperBounds-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type EQUN) for 6 PhilosophersDyn-COL-03-UpperBounds-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 3
lola: REPORT NUM
lola: FINISHED task # 17 (type EXCL) for PhilosophersDyn-COL-03-UpperBounds-15
lola: markings : 277
lola: fired transitions : 603
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 15 (type FNDP) for PhilosophersDyn-COL-03-UpperBounds-15 (obsolete)
lola: CANCELED task # 16 (type EQUN) for PhilosophersDyn-COL-03-UpperBounds-15 (obsolete)
lola: LAUNCH task # 14 (type EXCL) for 3 PhilosophersDyn-COL-03-UpperBounds-12
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type EQUN) for 3 PhilosophersDyn-COL-03-UpperBounds-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 3
lola: REPORT NUM
lola: FINISHED task # 14 (type EXCL) for PhilosophersDyn-COL-03-UpperBounds-12
lola: markings : 276
lola: fired transitions : 557
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 12 (type FNDP) for PhilosophersDyn-COL-03-UpperBounds-12 (obsolete)
lola: CANCELED task # 13 (type EQUN) for PhilosophersDyn-COL-03-UpperBounds-12 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-03-UpperBounds-04: BOUND 2 state space
PhilosophersDyn-COL-03-UpperBounds-12: BOUND 2 state space
PhilosophersDyn-COL-03-UpperBounds-15: BOUND 2 state space


Time elapsed: 0 secs. Pages in use: 1

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="PhilosophersDyn-COL-03"
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 PhilosophersDyn-COL-03, 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-167873947700277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-COL-03 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;