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.r309-tall-167873963000407.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 PolyORBNT-COL-S05J40, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r309-tall-167873963000407
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 23:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 23:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 23:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 23:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 23:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 23:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 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 93K 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 booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1679443548022

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=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S05J40
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 00:05:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-22 00:05:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:05:49] [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-22 00:05:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 00:05:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 609 ms
[2023-03-22 00:05:50] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 19 ms.
[2023-03-22 00:05:50] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 65 ms.
[2023-03-22 00:05:50] [INFO ] Unfolded 38 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-22 00:05:50] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-22 00:05:50] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-22 00:05:50] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 40 places in 8 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 702 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 36) seen :32
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 160 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-22 00:05:51] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2023-03-22 00:05:51] [INFO ] Computed 102 place invariants in 71 ms
[2023-03-22 00:05:51] [INFO ] [Real]Absence check using 95 positive place invariants in 50 ms returned sat
[2023-03-22 00:05:51] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-22 00:05:51] [INFO ] After 440ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:05:51] [INFO ] [Nat]Absence check using 95 positive place invariants in 33 ms returned sat
[2023-03-22 00:05:51] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-22 00:05:52] [INFO ] After 925ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:05:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:05:56] [INFO ] After 3970ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:05:56] [INFO ] After 4062ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-22 00:05:56] [INFO ] After 5204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 624 transition count 889
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 97 place count 578 transition count 889
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 97 place count 578 transition count 844
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 187 place count 533 transition count 844
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 188 place count 532 transition count 843
Iterating global reduction 2 with 1 rules applied. Total rules applied 189 place count 532 transition count 843
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 193 place count 530 transition count 841
Applied a total of 193 rules in 180 ms. Remains 530 /629 variables (removed 99) and now considering 841/935 (removed 94) transitions.
[2023-03-22 00:05:56] [INFO ] Flow matrix only has 837 transitions (discarded 4 similar events)
// Phase 1: matrix 837 rows 530 cols
[2023-03-22 00:05:56] [INFO ] Computed 97 place invariants in 25 ms
[2023-03-22 00:05:57] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 530/629 places, 746/935 transitions.
Applied a total of 0 rules in 31 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 728 ms. Remains : 530/629 places, 746/935 transitions.
Incomplete random walk after 1000000 steps, including 52178 resets, run finished after 4182 ms. (steps per millisecond=239 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4559 resets, run finished after 1085 ms. (steps per millisecond=921 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2757189 steps, run timeout after 15001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 2757189 steps, saw 826612 distinct states, run finished after 15004 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:06:17] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-22 00:06:17] [INFO ] Computed 97 place invariants in 19 ms
[2023-03-22 00:06:17] [INFO ] [Real]Absence check using 90 positive place invariants in 19 ms returned sat
[2023-03-22 00:06:17] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-22 00:06:17] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:06:18] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2023-03-22 00:06:18] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-22 00:06:18] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:06:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:06:18] [INFO ] After 180ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:06:18] [INFO ] Deduced a trap composed of 110 places in 189 ms of which 1 ms to minimize.
[2023-03-22 00:06:18] [INFO ] Deduced a trap composed of 159 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:06:19] [INFO ] Deduced a trap composed of 175 places in 185 ms of which 2 ms to minimize.
[2023-03-22 00:06:19] [INFO ] Deduced a trap composed of 179 places in 179 ms of which 1 ms to minimize.
[2023-03-22 00:06:19] [INFO ] Deduced a trap composed of 182 places in 172 ms of which 1 ms to minimize.
[2023-03-22 00:06:19] [INFO ] Deduced a trap composed of 161 places in 162 ms of which 1 ms to minimize.
[2023-03-22 00:06:19] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:06:20] [INFO ] Deduced a trap composed of 164 places in 151 ms of which 2 ms to minimize.
[2023-03-22 00:06:20] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 0 ms to minimize.
[2023-03-22 00:06:20] [INFO ] Deduced a trap composed of 176 places in 149 ms of which 1 ms to minimize.
[2023-03-22 00:06:20] [INFO ] Deduced a trap composed of 161 places in 145 ms of which 1 ms to minimize.
[2023-03-22 00:06:20] [INFO ] Deduced a trap composed of 167 places in 152 ms of which 1 ms to minimize.
[2023-03-22 00:06:21] [INFO ] Deduced a trap composed of 170 places in 149 ms of which 0 ms to minimize.
[2023-03-22 00:06:21] [INFO ] Deduced a trap composed of 167 places in 150 ms of which 0 ms to minimize.
[2023-03-22 00:06:21] [INFO ] Deduced a trap composed of 173 places in 150 ms of which 0 ms to minimize.
[2023-03-22 00:06:21] [INFO ] Deduced a trap composed of 167 places in 161 ms of which 0 ms to minimize.
[2023-03-22 00:06:22] [INFO ] Deduced a trap composed of 164 places in 164 ms of which 1 ms to minimize.
[2023-03-22 00:06:22] [INFO ] Deduced a trap composed of 179 places in 163 ms of which 1 ms to minimize.
[2023-03-22 00:06:22] [INFO ] Deduced a trap composed of 158 places in 164 ms of which 1 ms to minimize.
[2023-03-22 00:06:22] [INFO ] Deduced a trap composed of 161 places in 169 ms of which 0 ms to minimize.
[2023-03-22 00:06:23] [INFO ] Deduced a trap composed of 176 places in 150 ms of which 1 ms to minimize.
[2023-03-22 00:06:23] [INFO ] Deduced a trap composed of 170 places in 159 ms of which 1 ms to minimize.
[2023-03-22 00:06:23] [INFO ] Deduced a trap composed of 179 places in 143 ms of which 1 ms to minimize.
[2023-03-22 00:06:23] [INFO ] Deduced a trap composed of 161 places in 167 ms of which 0 ms to minimize.
[2023-03-22 00:06:24] [INFO ] Deduced a trap composed of 173 places in 159 ms of which 1 ms to minimize.
[2023-03-22 00:06:24] [INFO ] Deduced a trap composed of 161 places in 166 ms of which 0 ms to minimize.
[2023-03-22 00:06:24] [INFO ] Deduced a trap composed of 164 places in 163 ms of which 1 ms to minimize.
[2023-03-22 00:06:24] [INFO ] Deduced a trap composed of 176 places in 165 ms of which 0 ms to minimize.
[2023-03-22 00:06:25] [INFO ] Deduced a trap composed of 158 places in 158 ms of which 1 ms to minimize.
[2023-03-22 00:06:25] [INFO ] Deduced a trap composed of 155 places in 157 ms of which 2 ms to minimize.
[2023-03-22 00:06:25] [INFO ] Deduced a trap composed of 155 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:06:25] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 0 ms to minimize.
[2023-03-22 00:06:25] [INFO ] Deduced a trap composed of 173 places in 144 ms of which 1 ms to minimize.
[2023-03-22 00:06:26] [INFO ] Deduced a trap composed of 173 places in 170 ms of which 3 ms to minimize.
[2023-03-22 00:06:26] [INFO ] Deduced a trap composed of 173 places in 152 ms of which 1 ms to minimize.
[2023-03-22 00:06:26] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 0 ms to minimize.
[2023-03-22 00:06:27] [INFO ] Deduced a trap composed of 149 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:06:27] [INFO ] Deduced a trap composed of 182 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:06:28] [INFO ] Deduced a trap composed of 167 places in 162 ms of which 2 ms to minimize.
[2023-03-22 00:06:28] [INFO ] Deduced a trap composed of 158 places in 149 ms of which 0 ms to minimize.
[2023-03-22 00:06:28] [INFO ] Deduced a trap composed of 167 places in 161 ms of which 0 ms to minimize.
[2023-03-22 00:06:29] [INFO ] Deduced a trap composed of 161 places in 148 ms of which 0 ms to minimize.
[2023-03-22 00:06:29] [INFO ] Deduced a trap composed of 176 places in 159 ms of which 0 ms to minimize.
[2023-03-22 00:06:29] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 1 ms to minimize.
[2023-03-22 00:06:29] [INFO ] Deduced a trap composed of 170 places in 159 ms of which 1 ms to minimize.
[2023-03-22 00:06:30] [INFO ] Deduced a trap composed of 161 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:06:30] [INFO ] Deduced a trap composed of 156 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:06:31] [INFO ] Deduced a trap composed of 168 places in 146 ms of which 0 ms to minimize.
[2023-03-22 00:06:31] [INFO ] Deduced a trap composed of 170 places in 158 ms of which 1 ms to minimize.
[2023-03-22 00:06:31] [INFO ] Deduced a trap composed of 161 places in 149 ms of which 1 ms to minimize.
[2023-03-22 00:06:32] [INFO ] Deduced a trap composed of 165 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:06:33] [INFO ] Deduced a trap composed of 176 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:06:34] [INFO ] Deduced a trap composed of 176 places in 154 ms of which 1 ms to minimize.
[2023-03-22 00:06:34] [INFO ] Deduced a trap composed of 185 places in 159 ms of which 1 ms to minimize.
[2023-03-22 00:06:43] [INFO ] Trap strengthening (SAT) tested/added 54/54 trap constraints in 25024 ms
[2023-03-22 00:06:43] [INFO ] After 25265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:06:43] [INFO ] After 25603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 24 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 40 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-22 00:06:43] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-22 00:06:43] [INFO ] Invariant cache hit.
[2023-03-22 00:06:44] [INFO ] Implicit Places using invariants in 779 ms returned []
[2023-03-22 00:06:44] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-22 00:06:44] [INFO ] Invariant cache hit.
[2023-03-22 00:06:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:06:46] [INFO ] Implicit Places using invariants and state equation in 2529 ms returned []
Implicit Place search using SMT with State Equation took 3347 ms to find 0 implicit places.
[2023-03-22 00:06:47] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-22 00:06:47] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-22 00:06:47] [INFO ] Invariant cache hit.
[2023-03-22 00:06:47] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3871 ms. Remains : 530/530 places, 746/746 transitions.
Incomplete random walk after 100000 steps, including 5259 resets, run finished after 722 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:06:48] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-22 00:06:48] [INFO ] Invariant cache hit.
[2023-03-22 00:06:48] [INFO ] [Real]Absence check using 90 positive place invariants in 16 ms returned sat
[2023-03-22 00:06:48] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-22 00:06:48] [INFO ] After 184ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:06:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:06:48] [INFO ] After 48ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:06:48] [INFO ] After 99ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:06:48] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:06:48] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2023-03-22 00:06:48] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-22 00:06:48] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:06:48] [INFO ] After 97ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:06:49] [INFO ] Deduced a trap composed of 161 places in 167 ms of which 13 ms to minimize.
[2023-03-22 00:06:49] [INFO ] Deduced a trap composed of 161 places in 163 ms of which 0 ms to minimize.
[2023-03-22 00:06:49] [INFO ] Deduced a trap composed of 155 places in 527 ms of which 1 ms to minimize.
[2023-03-22 00:06:50] [INFO ] Deduced a trap composed of 185 places in 170 ms of which 1 ms to minimize.
[2023-03-22 00:06:50] [INFO ] Deduced a trap composed of 176 places in 150 ms of which 1 ms to minimize.
[2023-03-22 00:06:50] [INFO ] Deduced a trap composed of 173 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:06:50] [INFO ] Deduced a trap composed of 164 places in 147 ms of which 1 ms to minimize.
[2023-03-22 00:06:50] [INFO ] Deduced a trap composed of 176 places in 162 ms of which 1 ms to minimize.
[2023-03-22 00:06:51] [INFO ] Deduced a trap composed of 167 places in 163 ms of which 1 ms to minimize.
[2023-03-22 00:06:51] [INFO ] Deduced a trap composed of 176 places in 165 ms of which 0 ms to minimize.
[2023-03-22 00:06:51] [INFO ] Deduced a trap composed of 170 places in 165 ms of which 1 ms to minimize.
[2023-03-22 00:06:51] [INFO ] Deduced a trap composed of 170 places in 169 ms of which 1 ms to minimize.
[2023-03-22 00:06:52] [INFO ] Deduced a trap composed of 161 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:06:52] [INFO ] Deduced a trap composed of 173 places in 161 ms of which 1 ms to minimize.
[2023-03-22 00:06:52] [INFO ] Deduced a trap composed of 173 places in 152 ms of which 0 ms to minimize.
[2023-03-22 00:06:52] [INFO ] Deduced a trap composed of 168 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:06:52] [INFO ] Deduced a trap composed of 170 places in 159 ms of which 0 ms to minimize.
[2023-03-22 00:06:53] [INFO ] Deduced a trap composed of 176 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:06:53] [INFO ] Deduced a trap composed of 173 places in 153 ms of which 1 ms to minimize.
[2023-03-22 00:06:53] [INFO ] Deduced a trap composed of 173 places in 158 ms of which 1 ms to minimize.
[2023-03-22 00:06:53] [INFO ] Deduced a trap composed of 164 places in 148 ms of which 0 ms to minimize.
[2023-03-22 00:06:54] [INFO ] Deduced a trap composed of 179 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:06:54] [INFO ] Deduced a trap composed of 158 places in 258 ms of which 1 ms to minimize.
[2023-03-22 00:06:54] [INFO ] Deduced a trap composed of 170 places in 174 ms of which 1 ms to minimize.
[2023-03-22 00:06:55] [INFO ] Deduced a trap composed of 155 places in 178 ms of which 0 ms to minimize.
[2023-03-22 00:06:55] [INFO ] Deduced a trap composed of 176 places in 172 ms of which 1 ms to minimize.
[2023-03-22 00:06:55] [INFO ] Deduced a trap composed of 170 places in 162 ms of which 0 ms to minimize.
[2023-03-22 00:06:55] [INFO ] Deduced a trap composed of 161 places in 148 ms of which 1 ms to minimize.
[2023-03-22 00:06:56] [INFO ] Deduced a trap composed of 165 places in 143 ms of which 0 ms to minimize.
[2023-03-22 00:06:56] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 1 ms to minimize.
[2023-03-22 00:06:56] [INFO ] Deduced a trap composed of 170 places in 147 ms of which 1 ms to minimize.
[2023-03-22 00:06:57] [INFO ] Deduced a trap composed of 185 places in 145 ms of which 0 ms to minimize.
[2023-03-22 00:06:57] [INFO ] Deduced a trap composed of 164 places in 154 ms of which 0 ms to minimize.
[2023-03-22 00:06:57] [INFO ] Deduced a trap composed of 170 places in 169 ms of which 1 ms to minimize.
[2023-03-22 00:06:57] [INFO ] Deduced a trap composed of 173 places in 156 ms of which 0 ms to minimize.
[2023-03-22 00:06:57] [INFO ] Deduced a trap composed of 167 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:06:58] [INFO ] Deduced a trap composed of 170 places in 162 ms of which 0 ms to minimize.
[2023-03-22 00:06:58] [INFO ] Deduced a trap composed of 170 places in 162 ms of which 0 ms to minimize.
[2023-03-22 00:06:58] [INFO ] Deduced a trap composed of 173 places in 164 ms of which 0 ms to minimize.
[2023-03-22 00:06:58] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 1 ms to minimize.
[2023-03-22 00:06:59] [INFO ] Deduced a trap composed of 173 places in 155 ms of which 0 ms to minimize.
[2023-03-22 00:06:59] [INFO ] Deduced a trap composed of 176 places in 158 ms of which 1 ms to minimize.
[2023-03-22 00:06:59] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 0 ms to minimize.
[2023-03-22 00:07:00] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:07:00] [INFO ] Deduced a trap composed of 164 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:07:01] [INFO ] Deduced a trap composed of 149 places in 162 ms of which 0 ms to minimize.
[2023-03-22 00:07:02] [INFO ] Deduced a trap composed of 158 places in 158 ms of which 1 ms to minimize.
[2023-03-22 00:07:02] [INFO ] Deduced a trap composed of 159 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:07:03] [INFO ] Deduced a trap composed of 155 places in 163 ms of which 1 ms to minimize.
[2023-03-22 00:07:04] [INFO ] Deduced a trap composed of 161 places in 156 ms of which 0 ms to minimize.
[2023-03-22 00:07:05] [INFO ] Deduced a trap composed of 179 places in 156 ms of which 0 ms to minimize.
[2023-03-22 00:07:11] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 0 ms to minimize.
[2023-03-22 00:07:12] [INFO ] Deduced a trap composed of 164 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:07:19] [INFO ] Deduced a trap composed of 167 places in 136 ms of which 1 ms to minimize.
[2023-03-22 00:07:23] [INFO ] Deduced a trap composed of 185 places in 189 ms of which 1 ms to minimize.
[2023-03-22 00:07:23] [INFO ] Deduced a trap composed of 164 places in 179 ms of which 1 ms to minimize.
[2023-03-22 00:07:23] [INFO ] Deduced a trap composed of 155 places in 178 ms of which 0 ms to minimize.
[2023-03-22 00:07:23] [INFO ] Deduced a trap composed of 173 places in 168 ms of which 0 ms to minimize.
[2023-03-22 00:07:24] [INFO ] Deduced a trap composed of 188 places in 159 ms of which 0 ms to minimize.
[2023-03-22 00:07:24] [INFO ] Deduced a trap composed of 173 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:07:24] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 1 ms to minimize.
[2023-03-22 00:07:25] [INFO ] Deduced a trap composed of 155 places in 161 ms of which 0 ms to minimize.
[2023-03-22 00:07:26] [INFO ] Deduced a trap composed of 161 places in 165 ms of which 1 ms to minimize.
[2023-03-22 00:07:27] [INFO ] Deduced a trap composed of 158 places in 166 ms of which 0 ms to minimize.
[2023-03-22 00:07:28] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 0 ms to minimize.
[2023-03-22 00:07:29] [INFO ] Deduced a trap composed of 170 places in 152 ms of which 1 ms to minimize.
[2023-03-22 00:07:30] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 1 ms to minimize.
[2023-03-22 00:07:31] [INFO ] Deduced a trap composed of 152 places in 151 ms of which 1 ms to minimize.
[2023-03-22 00:07:32] [INFO ] Deduced a trap composed of 156 places in 186 ms of which 0 ms to minimize.
[2023-03-22 00:07:33] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 1 ms to minimize.
[2023-03-22 00:07:37] [INFO ] Deduced a trap composed of 170 places in 171 ms of which 1 ms to minimize.
[2023-03-22 00:07:39] [INFO ] Deduced a trap composed of 161 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:07:39] [INFO ] Deduced a trap composed of 179 places in 158 ms of which 1 ms to minimize.
[2023-03-22 00:07:41] [INFO ] Deduced a trap composed of 158 places in 150 ms of which 0 ms to minimize.
[2023-03-22 00:07:42] [INFO ] Deduced a trap composed of 189 places in 160 ms of which 0 ms to minimize.
[2023-03-22 00:07:45] [INFO ] Deduced a trap composed of 198 places in 156 ms of which 0 ms to minimize.
[2023-03-22 00:07:46] [INFO ] Deduced a trap composed of 164 places in 145 ms of which 1 ms to minimize.
[2023-03-22 00:07:49] [INFO ] Deduced a trap composed of 152 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:07:58] [INFO ] Trap strengthening (SAT) tested/added 78/78 trap constraints in 69073 ms
[2023-03-22 00:07:58] [INFO ] After 69245ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:07:58] [INFO ] After 69524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 52145 resets, run finished after 4308 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4462 resets, run finished after 1067 ms. (steps per millisecond=937 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2720954 steps, run timeout after 15001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 2720954 steps, saw 816333 distinct states, run finished after 15001 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:08:18] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-22 00:08:18] [INFO ] Invariant cache hit.
[2023-03-22 00:08:18] [INFO ] [Real]Absence check using 90 positive place invariants in 17 ms returned sat
[2023-03-22 00:08:18] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-22 00:08:18] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:08:18] [INFO ] [Nat]Absence check using 90 positive place invariants in 24 ms returned sat
[2023-03-22 00:08:18] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-22 00:08:18] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:08:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:08:19] [INFO ] After 131ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:08:19] [INFO ] Deduced a trap composed of 161 places in 162 ms of which 1 ms to minimize.
[2023-03-22 00:08:19] [INFO ] Deduced a trap composed of 161 places in 148 ms of which 0 ms to minimize.
[2023-03-22 00:08:19] [INFO ] Deduced a trap composed of 155 places in 153 ms of which 0 ms to minimize.
[2023-03-22 00:08:19] [INFO ] Deduced a trap composed of 185 places in 170 ms of which 1 ms to minimize.
[2023-03-22 00:08:20] [INFO ] Deduced a trap composed of 176 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:08:20] [INFO ] Deduced a trap composed of 173 places in 149 ms of which 0 ms to minimize.
[2023-03-22 00:08:20] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:08:20] [INFO ] Deduced a trap composed of 176 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:08:20] [INFO ] Deduced a trap composed of 167 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:08:21] [INFO ] Deduced a trap composed of 176 places in 163 ms of which 2 ms to minimize.
[2023-03-22 00:08:21] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:08:21] [INFO ] Deduced a trap composed of 170 places in 170 ms of which 1 ms to minimize.
[2023-03-22 00:08:21] [INFO ] Deduced a trap composed of 161 places in 165 ms of which 0 ms to minimize.
[2023-03-22 00:08:22] [INFO ] Deduced a trap composed of 173 places in 165 ms of which 0 ms to minimize.
[2023-03-22 00:08:22] [INFO ] Deduced a trap composed of 173 places in 160 ms of which 0 ms to minimize.
[2023-03-22 00:08:22] [INFO ] Deduced a trap composed of 168 places in 163 ms of which 1 ms to minimize.
[2023-03-22 00:08:22] [INFO ] Deduced a trap composed of 170 places in 165 ms of which 1 ms to minimize.
[2023-03-22 00:08:22] [INFO ] Deduced a trap composed of 176 places in 149 ms of which 1 ms to minimize.
[2023-03-22 00:08:23] [INFO ] Deduced a trap composed of 173 places in 146 ms of which 1 ms to minimize.
[2023-03-22 00:08:23] [INFO ] Deduced a trap composed of 173 places in 146 ms of which 1 ms to minimize.
[2023-03-22 00:08:23] [INFO ] Deduced a trap composed of 164 places in 160 ms of which 0 ms to minimize.
[2023-03-22 00:08:23] [INFO ] Deduced a trap composed of 179 places in 149 ms of which 0 ms to minimize.
[2023-03-22 00:08:24] [INFO ] Deduced a trap composed of 158 places in 145 ms of which 1 ms to minimize.
[2023-03-22 00:08:24] [INFO ] Deduced a trap composed of 170 places in 161 ms of which 0 ms to minimize.
[2023-03-22 00:08:24] [INFO ] Deduced a trap composed of 155 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:08:24] [INFO ] Deduced a trap composed of 176 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:08:25] [INFO ] Deduced a trap composed of 170 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:08:25] [INFO ] Deduced a trap composed of 161 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:08:25] [INFO ] Deduced a trap composed of 165 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:08:26] [INFO ] Deduced a trap composed of 164 places in 151 ms of which 1 ms to minimize.
[2023-03-22 00:08:26] [INFO ] Deduced a trap composed of 170 places in 152 ms of which 1 ms to minimize.
[2023-03-22 00:08:26] [INFO ] Deduced a trap composed of 185 places in 154 ms of which 0 ms to minimize.
[2023-03-22 00:08:26] [INFO ] Deduced a trap composed of 164 places in 160 ms of which 0 ms to minimize.
[2023-03-22 00:08:27] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 0 ms to minimize.
[2023-03-22 00:08:27] [INFO ] Deduced a trap composed of 173 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:08:27] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:08:27] [INFO ] Deduced a trap composed of 170 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:08:28] [INFO ] Deduced a trap composed of 170 places in 163 ms of which 0 ms to minimize.
[2023-03-22 00:08:28] [INFO ] Deduced a trap composed of 173 places in 146 ms of which 1 ms to minimize.
[2023-03-22 00:08:28] [INFO ] Deduced a trap composed of 164 places in 164 ms of which 0 ms to minimize.
[2023-03-22 00:08:28] [INFO ] Deduced a trap composed of 173 places in 148 ms of which 1 ms to minimize.
[2023-03-22 00:08:29] [INFO ] Deduced a trap composed of 176 places in 159 ms of which 0 ms to minimize.
[2023-03-22 00:08:29] [INFO ] Deduced a trap composed of 164 places in 147 ms of which 0 ms to minimize.
[2023-03-22 00:08:29] [INFO ] Deduced a trap composed of 173 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:08:30] [INFO ] Deduced a trap composed of 164 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:08:30] [INFO ] Deduced a trap composed of 149 places in 158 ms of which 1 ms to minimize.
[2023-03-22 00:08:31] [INFO ] Deduced a trap composed of 158 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:08:32] [INFO ] Deduced a trap composed of 159 places in 158 ms of which 1 ms to minimize.
[2023-03-22 00:08:32] [INFO ] Deduced a trap composed of 155 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:08:33] [INFO ] Deduced a trap composed of 161 places in 167 ms of which 0 ms to minimize.
[2023-03-22 00:08:35] [INFO ] Deduced a trap composed of 179 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:08:41] [INFO ] Deduced a trap composed of 170 places in 139 ms of which 1 ms to minimize.
[2023-03-22 00:08:41] [INFO ] Deduced a trap composed of 164 places in 137 ms of which 0 ms to minimize.
[2023-03-22 00:08:48] [INFO ] Deduced a trap composed of 167 places in 139 ms of which 0 ms to minimize.
[2023-03-22 00:08:52] [INFO ] Deduced a trap composed of 185 places in 137 ms of which 0 ms to minimize.
[2023-03-22 00:08:52] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 0 ms to minimize.
[2023-03-22 00:08:52] [INFO ] Deduced a trap composed of 155 places in 149 ms of which 0 ms to minimize.
[2023-03-22 00:08:53] [INFO ] Deduced a trap composed of 173 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:08:53] [INFO ] Deduced a trap composed of 188 places in 164 ms of which 0 ms to minimize.
[2023-03-22 00:08:53] [INFO ] Deduced a trap composed of 173 places in 158 ms of which 1 ms to minimize.
[2023-03-22 00:08:54] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 0 ms to minimize.
[2023-03-22 00:08:54] [INFO ] Deduced a trap composed of 155 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:08:55] [INFO ] Deduced a trap composed of 161 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:08:56] [INFO ] Deduced a trap composed of 158 places in 158 ms of which 1 ms to minimize.
[2023-03-22 00:08:57] [INFO ] Deduced a trap composed of 158 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:08:58] [INFO ] Deduced a trap composed of 170 places in 153 ms of which 0 ms to minimize.
[2023-03-22 00:09:00] [INFO ] Deduced a trap composed of 158 places in 161 ms of which 1 ms to minimize.
[2023-03-22 00:09:00] [INFO ] Deduced a trap composed of 152 places in 156 ms of which 0 ms to minimize.
[2023-03-22 00:09:01] [INFO ] Deduced a trap composed of 156 places in 155 ms of which 0 ms to minimize.
[2023-03-22 00:09:02] [INFO ] Deduced a trap composed of 164 places in 154 ms of which 1 ms to minimize.
[2023-03-22 00:09:07] [INFO ] Deduced a trap composed of 170 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:09:08] [INFO ] Deduced a trap composed of 161 places in 159 ms of which 0 ms to minimize.
[2023-03-22 00:09:09] [INFO ] Deduced a trap composed of 179 places in 152 ms of which 0 ms to minimize.
[2023-03-22 00:09:10] [INFO ] Deduced a trap composed of 158 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:09:11] [INFO ] Deduced a trap composed of 189 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:09:15] [INFO ] Deduced a trap composed of 198 places in 161 ms of which 0 ms to minimize.
[2023-03-22 00:09:15] [INFO ] Deduced a trap composed of 164 places in 160 ms of which 0 ms to minimize.
[2023-03-22 00:09:18] [INFO ] Deduced a trap composed of 152 places in 160 ms of which 0 ms to minimize.
[2023-03-22 00:09:27] [INFO ] Trap strengthening (SAT) tested/added 78/78 trap constraints in 68426 ms
[2023-03-22 00:09:27] [INFO ] After 68625ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:09:27] [INFO ] After 68973ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 33 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 31 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-22 00:09:27] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-22 00:09:27] [INFO ] Invariant cache hit.
[2023-03-22 00:09:28] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-22 00:09:28] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-22 00:09:28] [INFO ] Invariant cache hit.
[2023-03-22 00:09:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:09:30] [INFO ] Implicit Places using invariants and state equation in 1901 ms returned []
Implicit Place search using SMT with State Equation took 2344 ms to find 0 implicit places.
[2023-03-22 00:09:30] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-22 00:09:30] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-22 00:09:30] [INFO ] Invariant cache hit.
[2023-03-22 00:09:30] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2831 ms. Remains : 530/530 places, 746/746 transitions.
Incomplete random walk after 100000 steps, including 5249 resets, run finished after 445 ms. (steps per millisecond=224 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:09:30] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-22 00:09:30] [INFO ] Invariant cache hit.
[2023-03-22 00:09:31] [INFO ] [Real]Absence check using 90 positive place invariants in 17 ms returned sat
[2023-03-22 00:09:31] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-22 00:09:31] [INFO ] After 196ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:09:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:09:31] [INFO ] After 46ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:09:31] [INFO ] After 89ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:09:31] [INFO ] After 382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:09:31] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2023-03-22 00:09:31] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-22 00:09:31] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:09:31] [INFO ] After 98ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:09:31] [INFO ] Deduced a trap composed of 161 places in 161 ms of which 1 ms to minimize.
[2023-03-22 00:09:32] [INFO ] Deduced a trap composed of 161 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:09:32] [INFO ] Deduced a trap composed of 155 places in 161 ms of which 0 ms to minimize.
[2023-03-22 00:09:32] [INFO ] Deduced a trap composed of 185 places in 177 ms of which 1 ms to minimize.
[2023-03-22 00:09:32] [INFO ] Deduced a trap composed of 176 places in 159 ms of which 1 ms to minimize.
[2023-03-22 00:09:32] [INFO ] Deduced a trap composed of 173 places in 165 ms of which 0 ms to minimize.
[2023-03-22 00:09:33] [INFO ] Deduced a trap composed of 164 places in 161 ms of which 1 ms to minimize.
[2023-03-22 00:09:33] [INFO ] Deduced a trap composed of 176 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:09:33] [INFO ] Deduced a trap composed of 167 places in 159 ms of which 0 ms to minimize.
[2023-03-22 00:09:33] [INFO ] Deduced a trap composed of 176 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:09:33] [INFO ] Deduced a trap composed of 170 places in 161 ms of which 1 ms to minimize.
[2023-03-22 00:09:34] [INFO ] Deduced a trap composed of 170 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:09:34] [INFO ] Deduced a trap composed of 161 places in 155 ms of which 0 ms to minimize.
[2023-03-22 00:09:34] [INFO ] Deduced a trap composed of 173 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:09:34] [INFO ] Deduced a trap composed of 173 places in 158 ms of which 1 ms to minimize.
[2023-03-22 00:09:34] [INFO ] Deduced a trap composed of 168 places in 163 ms of which 1 ms to minimize.
[2023-03-22 00:09:35] [INFO ] Deduced a trap composed of 170 places in 158 ms of which 1 ms to minimize.
[2023-03-22 00:09:35] [INFO ] Deduced a trap composed of 176 places in 160 ms of which 0 ms to minimize.
[2023-03-22 00:09:35] [INFO ] Deduced a trap composed of 173 places in 152 ms of which 1 ms to minimize.
[2023-03-22 00:09:36] [INFO ] Deduced a trap composed of 173 places in 156 ms of which 0 ms to minimize.
[2023-03-22 00:09:36] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 2 ms to minimize.
[2023-03-22 00:09:36] [INFO ] Deduced a trap composed of 179 places in 162 ms of which 1 ms to minimize.
[2023-03-22 00:09:36] [INFO ] Deduced a trap composed of 158 places in 153 ms of which 1 ms to minimize.
[2023-03-22 00:09:36] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:09:37] [INFO ] Deduced a trap composed of 155 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:09:37] [INFO ] Deduced a trap composed of 176 places in 150 ms of which 1 ms to minimize.
[2023-03-22 00:09:37] [INFO ] Deduced a trap composed of 170 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:09:38] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:09:38] [INFO ] Deduced a trap composed of 165 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:09:38] [INFO ] Deduced a trap composed of 164 places in 154 ms of which 1 ms to minimize.
[2023-03-22 00:09:38] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:09:39] [INFO ] Deduced a trap composed of 185 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:09:39] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 1 ms to minimize.
[2023-03-22 00:09:39] [INFO ] Deduced a trap composed of 170 places in 154 ms of which 0 ms to minimize.
[2023-03-22 00:09:39] [INFO ] Deduced a trap composed of 173 places in 155 ms of which 0 ms to minimize.
[2023-03-22 00:09:40] [INFO ] Deduced a trap composed of 167 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:09:40] [INFO ] Deduced a trap composed of 170 places in 161 ms of which 1 ms to minimize.
[2023-03-22 00:09:40] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:09:40] [INFO ] Deduced a trap composed of 173 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:09:41] [INFO ] Deduced a trap composed of 164 places in 166 ms of which 0 ms to minimize.
[2023-03-22 00:09:41] [INFO ] Deduced a trap composed of 173 places in 161 ms of which 0 ms to minimize.
[2023-03-22 00:09:41] [INFO ] Deduced a trap composed of 176 places in 149 ms of which 0 ms to minimize.
[2023-03-22 00:09:42] [INFO ] Deduced a trap composed of 164 places in 160 ms of which 0 ms to minimize.
[2023-03-22 00:09:42] [INFO ] Deduced a trap composed of 173 places in 162 ms of which 1 ms to minimize.
[2023-03-22 00:09:42] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 2 ms to minimize.
[2023-03-22 00:09:43] [INFO ] Deduced a trap composed of 149 places in 144 ms of which 1 ms to minimize.
[2023-03-22 00:09:44] [INFO ] Deduced a trap composed of 158 places in 161 ms of which 1 ms to minimize.
[2023-03-22 00:09:44] [INFO ] Deduced a trap composed of 159 places in 153 ms of which 1 ms to minimize.
[2023-03-22 00:09:45] [INFO ] Deduced a trap composed of 155 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:09:46] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:09:48] [INFO ] Deduced a trap composed of 179 places in 167 ms of which 0 ms to minimize.
[2023-03-22 00:09:53] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:09:54] [INFO ] Deduced a trap composed of 164 places in 160 ms of which 0 ms to minimize.
[2023-03-22 00:10:01] [INFO ] Deduced a trap composed of 167 places in 142 ms of which 1 ms to minimize.
[2023-03-22 00:10:05] [INFO ] Deduced a trap composed of 185 places in 152 ms of which 0 ms to minimize.
[2023-03-22 00:10:05] [INFO ] Deduced a trap composed of 164 places in 161 ms of which 1 ms to minimize.
[2023-03-22 00:10:05] [INFO ] Deduced a trap composed of 155 places in 163 ms of which 0 ms to minimize.
[2023-03-22 00:10:06] [INFO ] Deduced a trap composed of 173 places in 162 ms of which 1 ms to minimize.
[2023-03-22 00:10:06] [INFO ] Deduced a trap composed of 188 places in 151 ms of which 1 ms to minimize.
[2023-03-22 00:10:06] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:10:07] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 0 ms to minimize.
[2023-03-22 00:10:07] [INFO ] Deduced a trap composed of 155 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:10:08] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:10:09] [INFO ] Deduced a trap composed of 158 places in 160 ms of which 0 ms to minimize.
[2023-03-22 00:10:10] [INFO ] Deduced a trap composed of 158 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:10:11] [INFO ] Deduced a trap composed of 170 places in 150 ms of which 0 ms to minimize.
[2023-03-22 00:10:13] [INFO ] Deduced a trap composed of 158 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:10:13] [INFO ] Deduced a trap composed of 152 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:10:14] [INFO ] Deduced a trap composed of 156 places in 159 ms of which 1 ms to minimize.
[2023-03-22 00:10:15] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:10:20] [INFO ] Deduced a trap composed of 170 places in 155 ms of which 0 ms to minimize.
[2023-03-22 00:10:21] [INFO ] Deduced a trap composed of 161 places in 153 ms of which 0 ms to minimize.
[2023-03-22 00:10:22] [INFO ] Deduced a trap composed of 179 places in 188 ms of which 1 ms to minimize.
[2023-03-22 00:10:23] [INFO ] Deduced a trap composed of 158 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:10:24] [INFO ] Deduced a trap composed of 189 places in 156 ms of which 0 ms to minimize.
[2023-03-22 00:10:28] [INFO ] Deduced a trap composed of 198 places in 159 ms of which 0 ms to minimize.
[2023-03-22 00:10:29] [INFO ] Deduced a trap composed of 164 places in 164 ms of which 0 ms to minimize.
[2023-03-22 00:10:31] [INFO ] Deduced a trap composed of 152 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:10:40] [INFO ] Trap strengthening (SAT) tested/added 78/78 trap constraints in 69242 ms
[2023-03-22 00:10:41] [INFO ] After 69406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:10:41] [INFO ] After 69711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 535 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 498955 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 498955 steps, saw 149439 distinct states, run finished after 3002 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:10:44] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-22 00:10:44] [INFO ] Invariant cache hit.
[2023-03-22 00:10:44] [INFO ] [Real]Absence check using 90 positive place invariants in 16 ms returned sat
[2023-03-22 00:10:44] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-22 00:10:44] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:10:44] [INFO ] [Nat]Absence check using 90 positive place invariants in 17 ms returned sat
[2023-03-22 00:10:44] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-22 00:10:44] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:10:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:10:44] [INFO ] After 172ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:10:44] [INFO ] Deduced a trap composed of 170 places in 164 ms of which 0 ms to minimize.
[2023-03-22 00:10:45] [INFO ] Deduced a trap composed of 158 places in 148 ms of which 1 ms to minimize.
[2023-03-22 00:10:45] [INFO ] Deduced a trap composed of 161 places in 149 ms of which 1 ms to minimize.
[2023-03-22 00:10:45] [INFO ] Deduced a trap composed of 179 places in 189 ms of which 0 ms to minimize.
[2023-03-22 00:10:45] [INFO ] Deduced a trap composed of 182 places in 147 ms of which 0 ms to minimize.
[2023-03-22 00:10:45] [INFO ] Deduced a trap composed of 182 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:10:46] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 0 ms to minimize.
[2023-03-22 00:10:46] [INFO ] Deduced a trap composed of 158 places in 162 ms of which 1 ms to minimize.
[2023-03-22 00:10:46] [INFO ] Deduced a trap composed of 164 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:10:46] [INFO ] Deduced a trap composed of 167 places in 162 ms of which 0 ms to minimize.
[2023-03-22 00:10:47] [INFO ] Deduced a trap composed of 167 places in 196 ms of which 1 ms to minimize.
[2023-03-22 00:10:47] [INFO ] Deduced a trap composed of 167 places in 160 ms of which 0 ms to minimize.
[2023-03-22 00:10:47] [INFO ] Deduced a trap composed of 152 places in 199 ms of which 0 ms to minimize.
[2023-03-22 00:10:47] [INFO ] Deduced a trap composed of 155 places in 167 ms of which 1 ms to minimize.
[2023-03-22 00:10:48] [INFO ] Deduced a trap composed of 180 places in 167 ms of which 1 ms to minimize.
[2023-03-22 00:10:48] [INFO ] Deduced a trap composed of 173 places in 153 ms of which 1 ms to minimize.
[2023-03-22 00:10:48] [INFO ] Deduced a trap composed of 173 places in 162 ms of which 0 ms to minimize.
[2023-03-22 00:10:49] [INFO ] Deduced a trap composed of 176 places in 166 ms of which 0 ms to minimize.
[2023-03-22 00:10:49] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:10:49] [INFO ] Deduced a trap composed of 170 places in 171 ms of which 1 ms to minimize.
[2023-03-22 00:10:50] [INFO ] Deduced a trap composed of 170 places in 161 ms of which 1 ms to minimize.
[2023-03-22 00:10:50] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 0 ms to minimize.
[2023-03-22 00:10:53] [INFO ] Deduced a trap composed of 170 places in 141 ms of which 0 ms to minimize.
[2023-03-22 00:10:53] [INFO ] Deduced a trap composed of 161 places in 144 ms of which 1 ms to minimize.
[2023-03-22 00:10:54] [INFO ] Deduced a trap composed of 185 places in 162 ms of which 1 ms to minimize.
[2023-03-22 00:10:54] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:10:54] [INFO ] Deduced a trap composed of 185 places in 150 ms of which 0 ms to minimize.
[2023-03-22 00:10:55] [INFO ] Deduced a trap composed of 155 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:11:00] [INFO ] Deduced a trap composed of 164 places in 161 ms of which 0 ms to minimize.
[2023-03-22 00:11:00] [INFO ] Deduced a trap composed of 170 places in 159 ms of which 0 ms to minimize.
[2023-03-22 00:11:01] [INFO ] Deduced a trap composed of 150 places in 154 ms of which 1 ms to minimize.
[2023-03-22 00:11:02] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 0 ms to minimize.
[2023-03-22 00:11:04] [INFO ] Deduced a trap composed of 159 places in 159 ms of which 1 ms to minimize.
[2023-03-22 00:11:04] [INFO ] Deduced a trap composed of 161 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:11:04] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 1 ms to minimize.
[2023-03-22 00:11:04] [INFO ] Deduced a trap composed of 180 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:11:04] [INFO ] Deduced a trap composed of 179 places in 155 ms of which 0 ms to minimize.
[2023-03-22 00:11:05] [INFO ] Deduced a trap composed of 182 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:11:05] [INFO ] Deduced a trap composed of 176 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:11:06] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:11:06] [INFO ] Deduced a trap composed of 161 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:11:06] [INFO ] Deduced a trap composed of 161 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:11:09] [INFO ] Trap strengthening (SAT) tested/added 42/42 trap constraints in 24498 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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)
[2023-03-22 00:11:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:11:09] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 18 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-22 00:11:09] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-22 00:11:09] [INFO ] Invariant cache hit.
[2023-03-22 00:11:09] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 666 ms. Remains : 530/530 places, 746/746 transitions.
Incomplete random walk after 10000 steps, including 525 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 502798 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 502798 steps, saw 150607 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:11:12] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-22 00:11:12] [INFO ] Invariant cache hit.
[2023-03-22 00:11:13] [INFO ] [Real]Absence check using 90 positive place invariants in 19 ms returned sat
[2023-03-22 00:11:13] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-22 00:11:13] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:11:13] [INFO ] [Nat]Absence check using 90 positive place invariants in 28 ms returned sat
[2023-03-22 00:11:13] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 34 ms returned sat
[2023-03-22 00:11:13] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:11:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:11:13] [INFO ] After 164ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:11:13] [INFO ] Deduced a trap composed of 170 places in 152 ms of which 5 ms to minimize.
[2023-03-22 00:11:14] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 1 ms to minimize.
[2023-03-22 00:11:14] [INFO ] Deduced a trap composed of 161 places in 182 ms of which 1 ms to minimize.
[2023-03-22 00:11:14] [INFO ] Deduced a trap composed of 179 places in 184 ms of which 0 ms to minimize.
[2023-03-22 00:11:14] [INFO ] Deduced a trap composed of 182 places in 180 ms of which 0 ms to minimize.
[2023-03-22 00:11:14] [INFO ] Deduced a trap composed of 182 places in 181 ms of which 0 ms to minimize.
[2023-03-22 00:11:15] [INFO ] Deduced a trap composed of 164 places in 161 ms of which 1 ms to minimize.
[2023-03-22 00:11:15] [INFO ] Deduced a trap composed of 158 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:11:15] [INFO ] Deduced a trap composed of 164 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:11:15] [INFO ] Deduced a trap composed of 167 places in 179 ms of which 0 ms to minimize.
[2023-03-22 00:11:15] [INFO ] Deduced a trap composed of 167 places in 150 ms of which 1 ms to minimize.
[2023-03-22 00:11:16] [INFO ] Deduced a trap composed of 167 places in 166 ms of which 0 ms to minimize.
[2023-03-22 00:11:16] [INFO ] Deduced a trap composed of 152 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:11:16] [INFO ] Deduced a trap composed of 155 places in 165 ms of which 1 ms to minimize.
[2023-03-22 00:11:17] [INFO ] Deduced a trap composed of 180 places in 152 ms of which 0 ms to minimize.
[2023-03-22 00:11:17] [INFO ] Deduced a trap composed of 173 places in 170 ms of which 0 ms to minimize.
[2023-03-22 00:11:17] [INFO ] Deduced a trap composed of 173 places in 154 ms of which 0 ms to minimize.
[2023-03-22 00:11:17] [INFO ] Deduced a trap composed of 176 places in 151 ms of which 0 ms to minimize.
[2023-03-22 00:11:18] [INFO ] Deduced a trap composed of 164 places in 147 ms of which 0 ms to minimize.
[2023-03-22 00:11:18] [INFO ] Deduced a trap composed of 170 places in 174 ms of which 0 ms to minimize.
[2023-03-22 00:11:19] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 0 ms to minimize.
[2023-03-22 00:11:19] [INFO ] Deduced a trap composed of 158 places in 145 ms of which 0 ms to minimize.
[2023-03-22 00:11:22] [INFO ] Deduced a trap composed of 170 places in 147 ms of which 1 ms to minimize.
[2023-03-22 00:11:22] [INFO ] Deduced a trap composed of 161 places in 167 ms of which 1 ms to minimize.
[2023-03-22 00:11:23] [INFO ] Deduced a trap composed of 185 places in 159 ms of which 1 ms to minimize.
[2023-03-22 00:11:23] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:11:23] [INFO ] Deduced a trap composed of 185 places in 161 ms of which 1 ms to minimize.
[2023-03-22 00:11:24] [INFO ] Deduced a trap composed of 155 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:11:29] [INFO ] Deduced a trap composed of 164 places in 149 ms of which 0 ms to minimize.
[2023-03-22 00:11:29] [INFO ] Deduced a trap composed of 170 places in 159 ms of which 1 ms to minimize.
[2023-03-22 00:11:30] [INFO ] Deduced a trap composed of 150 places in 149 ms of which 1 ms to minimize.
[2023-03-22 00:11:30] [INFO ] Deduced a trap composed of 170 places in 164 ms of which 1 ms to minimize.
[2023-03-22 00:11:32] [INFO ] Deduced a trap composed of 159 places in 158 ms of which 5 ms to minimize.
[2023-03-22 00:11:33] [INFO ] Deduced a trap composed of 161 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:11:33] [INFO ] Deduced a trap composed of 165 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:11:33] [INFO ] Deduced a trap composed of 180 places in 161 ms of which 0 ms to minimize.
[2023-03-22 00:11:33] [INFO ] Deduced a trap composed of 179 places in 159 ms of which 0 ms to minimize.
[2023-03-22 00:11:34] [INFO ] Deduced a trap composed of 182 places in 159 ms of which 0 ms to minimize.
[2023-03-22 00:11:34] [INFO ] Deduced a trap composed of 176 places in 156 ms of which 0 ms to minimize.
[2023-03-22 00:11:35] [INFO ] Deduced a trap composed of 167 places in 144 ms of which 0 ms to minimize.
[2023-03-22 00:11:35] [INFO ] Deduced a trap composed of 161 places in 150 ms of which 0 ms to minimize.
[2023-03-22 00:11:35] [INFO ] Deduced a trap composed of 161 places in 141 ms of which 0 ms to minimize.
[2023-03-22 00:11:38] [INFO ] Trap strengthening (SAT) tested/added 42/42 trap constraints in 24446 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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)
[2023-03-22 00:11:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:11:38] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 26 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 15 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-22 00:11:38] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-22 00:11:38] [INFO ] Invariant cache hit.
[2023-03-22 00:11:38] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-22 00:11:38] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-22 00:11:38] [INFO ] Invariant cache hit.
[2023-03-22 00:11:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:11:41] [INFO ] Implicit Places using invariants and state equation in 2379 ms returned []
Implicit Place search using SMT with State Equation took 2864 ms to find 0 implicit places.
[2023-03-22 00:11:41] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-22 00:11:41] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-22 00:11:41] [INFO ] Invariant cache hit.
[2023-03-22 00:11:41] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3313 ms. Remains : 530/530 places, 746/746 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 530 transition count 742
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 530 transition count 741
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 529 transition count 741
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 529 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 528 transition count 740
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 528 transition count 735
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 523 transition count 735
Applied a total of 18 rules in 96 ms. Remains 523 /530 variables (removed 7) and now considering 735/746 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 735 rows 523 cols
[2023-03-22 00:11:41] [INFO ] Computed 97 place invariants in 15 ms
[2023-03-22 00:11:41] [INFO ] [Real]Absence check using 90 positive place invariants in 16 ms returned sat
[2023-03-22 00:11:41] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-22 00:11:41] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:11:41] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2023-03-22 00:11:41] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-22 00:11:42] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:11:42] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 0 ms to minimize.
[2023-03-22 00:11:42] [INFO ] Deduced a trap composed of 150 places in 180 ms of which 0 ms to minimize.
[2023-03-22 00:11:42] [INFO ] Deduced a trap composed of 171 places in 179 ms of which 1 ms to minimize.
[2023-03-22 00:11:42] [INFO ] Deduced a trap composed of 183 places in 195 ms of which 1 ms to minimize.
[2023-03-22 00:11:43] [INFO ] Deduced a trap composed of 174 places in 189 ms of which 0 ms to minimize.
[2023-03-22 00:11:43] [INFO ] Deduced a trap composed of 165 places in 174 ms of which 1 ms to minimize.
[2023-03-22 00:11:43] [INFO ] Deduced a trap composed of 147 places in 155 ms of which 0 ms to minimize.
[2023-03-22 00:11:43] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 0 ms to minimize.
[2023-03-22 00:11:44] [INFO ] Deduced a trap composed of 165 places in 171 ms of which 1 ms to minimize.
[2023-03-22 00:11:44] [INFO ] Deduced a trap composed of 171 places in 139 ms of which 0 ms to minimize.
[2023-03-22 00:11:44] [INFO ] Deduced a trap composed of 153 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:11:44] [INFO ] Deduced a trap composed of 171 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:11:44] [INFO ] Deduced a trap composed of 177 places in 161 ms of which 0 ms to minimize.
[2023-03-22 00:11:44] [INFO ] Deduced a trap composed of 168 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:11:45] [INFO ] Deduced a trap composed of 171 places in 155 ms of which 0 ms to minimize.
[2023-03-22 00:11:45] [INFO ] Deduced a trap composed of 162 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:11:45] [INFO ] Deduced a trap composed of 168 places in 143 ms of which 0 ms to minimize.
[2023-03-22 00:11:45] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 0 ms to minimize.
[2023-03-22 00:11:45] [INFO ] Deduced a trap composed of 174 places in 145 ms of which 0 ms to minimize.
[2023-03-22 00:11:46] [INFO ] Deduced a trap composed of 153 places in 151 ms of which 1 ms to minimize.
[2023-03-22 00:11:46] [INFO ] Deduced a trap composed of 162 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:11:46] [INFO ] Deduced a trap composed of 153 places in 154 ms of which 0 ms to minimize.
[2023-03-22 00:11:46] [INFO ] Deduced a trap composed of 183 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:11:47] [INFO ] Deduced a trap composed of 183 places in 159 ms of which 1 ms to minimize.
[2023-03-22 00:11:47] [INFO ] Deduced a trap composed of 171 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:11:47] [INFO ] Deduced a trap composed of 168 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:11:47] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:11:47] [INFO ] Deduced a trap composed of 174 places in 174 ms of which 0 ms to minimize.
[2023-03-22 00:11:48] [INFO ] Deduced a trap composed of 159 places in 168 ms of which 0 ms to minimize.
[2023-03-22 00:11:48] [INFO ] Deduced a trap composed of 171 places in 163 ms of which 0 ms to minimize.
[2023-03-22 00:11:48] [INFO ] Deduced a trap composed of 168 places in 179 ms of which 0 ms to minimize.
[2023-03-22 00:11:48] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 1 ms to minimize.
[2023-03-22 00:11:49] [INFO ] Deduced a trap composed of 156 places in 154 ms of which 0 ms to minimize.
[2023-03-22 00:11:49] [INFO ] Deduced a trap composed of 165 places in 170 ms of which 0 ms to minimize.
[2023-03-22 00:11:49] [INFO ] Deduced a trap composed of 150 places in 153 ms of which 0 ms to minimize.
[2023-03-22 00:11:49] [INFO ] Deduced a trap composed of 165 places in 173 ms of which 0 ms to minimize.
[2023-03-22 00:11:49] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 1 ms to minimize.
[2023-03-22 00:11:50] [INFO ] Deduced a trap composed of 177 places in 166 ms of which 1 ms to minimize.
[2023-03-22 00:11:50] [INFO ] Deduced a trap composed of 159 places in 171 ms of which 0 ms to minimize.
[2023-03-22 00:11:50] [INFO ] Deduced a trap composed of 153 places in 163 ms of which 1 ms to minimize.
[2023-03-22 00:11:50] [INFO ] Deduced a trap composed of 171 places in 150 ms of which 0 ms to minimize.
[2023-03-22 00:11:51] [INFO ] Deduced a trap composed of 165 places in 170 ms of which 1 ms to minimize.
[2023-03-22 00:11:51] [INFO ] Deduced a trap composed of 168 places in 159 ms of which 1 ms to minimize.
[2023-03-22 00:11:51] [INFO ] Deduced a trap composed of 168 places in 181 ms of which 0 ms to minimize.
[2023-03-22 00:11:51] [INFO ] Deduced a trap composed of 165 places in 174 ms of which 0 ms to minimize.
[2023-03-22 00:11:52] [INFO ] Deduced a trap composed of 162 places in 163 ms of which 0 ms to minimize.
[2023-03-22 00:11:52] [INFO ] Deduced a trap composed of 159 places in 159 ms of which 0 ms to minimize.
[2023-03-22 00:11:52] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 1 ms to minimize.
[2023-03-22 00:11:52] [INFO ] Deduced a trap composed of 162 places in 144 ms of which 1 ms to minimize.
[2023-03-22 00:11:52] [INFO ] Deduced a trap composed of 159 places in 164 ms of which 0 ms to minimize.
[2023-03-22 00:11:53] [INFO ] Deduced a trap composed of 165 places in 165 ms of which 0 ms to minimize.
[2023-03-22 00:11:53] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 0 ms to minimize.
[2023-03-22 00:11:53] [INFO ] Deduced a trap composed of 174 places in 171 ms of which 1 ms to minimize.
[2023-03-22 00:11:53] [INFO ] Deduced a trap composed of 171 places in 146 ms of which 1 ms to minimize.
[2023-03-22 00:11:54] [INFO ] Deduced a trap composed of 162 places in 159 ms of which 1 ms to minimize.
[2023-03-22 00:11:54] [INFO ] Deduced a trap composed of 168 places in 181 ms of which 0 ms to minimize.
[2023-03-22 00:11:54] [INFO ] Deduced a trap composed of 168 places in 164 ms of which 0 ms to minimize.
[2023-03-22 00:11:54] [INFO ] Deduced a trap composed of 156 places in 148 ms of which 1 ms to minimize.
[2023-03-22 00:11:55] [INFO ] Deduced a trap composed of 165 places in 142 ms of which 1 ms to minimize.
[2023-03-22 00:11:55] [INFO ] Deduced a trap composed of 159 places in 159 ms of which 1 ms to minimize.
[2023-03-22 00:11:55] [INFO ] Deduced a trap composed of 168 places in 156 ms of which 0 ms to minimize.
[2023-03-22 00:11:55] [INFO ] Deduced a trap composed of 171 places in 143 ms of which 0 ms to minimize.
[2023-03-22 00:11:56] [INFO ] Deduced a trap composed of 168 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:11:56] [INFO ] Deduced a trap composed of 162 places in 142 ms of which 1 ms to minimize.
[2023-03-22 00:11:56] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 1 ms to minimize.
[2023-03-22 00:11:56] [INFO ] Deduced a trap composed of 162 places in 142 ms of which 0 ms to minimize.
[2023-03-22 00:11:56] [INFO ] Deduced a trap composed of 165 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:11:57] [INFO ] Deduced a trap composed of 162 places in 148 ms of which 0 ms to minimize.
[2023-03-22 00:11:57] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 0 ms to minimize.
[2023-03-22 00:11:57] [INFO ] Deduced a trap composed of 171 places in 136 ms of which 1 ms to minimize.
[2023-03-22 00:11:57] [INFO ] Deduced a trap composed of 153 places in 140 ms of which 1 ms to minimize.
[2023-03-22 00:11:58] [INFO ] Deduced a trap composed of 165 places in 159 ms of which 0 ms to minimize.
[2023-03-22 00:11:58] [INFO ] Deduced a trap composed of 171 places in 142 ms of which 0 ms to minimize.
[2023-03-22 00:11:58] [INFO ] Deduced a trap composed of 156 places in 139 ms of which 0 ms to minimize.
[2023-03-22 00:11:59] [INFO ] Deduced a trap composed of 162 places in 141 ms of which 0 ms to minimize.
[2023-03-22 00:11:59] [INFO ] Deduced a trap composed of 159 places in 141 ms of which 0 ms to minimize.
[2023-03-22 00:12:00] [INFO ] Deduced a trap composed of 150 places in 142 ms of which 1 ms to minimize.
[2023-03-22 00:12:00] [INFO ] Deduced a trap composed of 156 places in 154 ms of which 0 ms to minimize.
[2023-03-22 00:12:01] [INFO ] Deduced a trap composed of 156 places in 136 ms of which 1 ms to minimize.
[2023-03-22 00:12:02] [INFO ] Deduced a trap composed of 168 places in 140 ms of which 1 ms to minimize.
[2023-03-22 00:12:02] [INFO ] Deduced a trap composed of 156 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:12:02] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 1 ms to minimize.
[2023-03-22 00:12:02] [INFO ] Deduced a trap composed of 156 places in 160 ms of which 1 ms to minimize.
[2023-03-22 00:12:03] [INFO ] Deduced a trap composed of 168 places in 169 ms of which 1 ms to minimize.
[2023-03-22 00:12:03] [INFO ] Deduced a trap composed of 162 places in 151 ms of which 0 ms to minimize.
[2023-03-22 00:12:04] [INFO ] Deduced a trap composed of 168 places in 172 ms of which 1 ms to minimize.
[2023-03-22 00:12:05] [INFO ] Deduced a trap composed of 165 places in 155 ms of which 0 ms to minimize.
[2023-03-22 00:12:07] [INFO ] Deduced a trap composed of 156 places in 180 ms of which 0 ms to minimize.
[2023-03-22 00:12:07] [INFO ] Deduced a trap composed of 171 places in 173 ms of which 0 ms to minimize.
[2023-03-22 00:12:07] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 0 ms to minimize.
[2023-03-22 00:12:08] [INFO ] Deduced a trap composed of 156 places in 150 ms of which 0 ms to minimize.
[2023-03-22 00:12:08] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 0 ms to minimize.
[2023-03-22 00:12:08] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 1 ms to minimize.
[2023-03-22 00:12:08] [INFO ] Deduced a trap composed of 165 places in 171 ms of which 1 ms to minimize.
[2023-03-22 00:12:09] [INFO ] Deduced a trap composed of 171 places in 166 ms of which 1 ms to minimize.
[2023-03-22 00:12:09] [INFO ] Deduced a trap composed of 153 places in 166 ms of which 0 ms to minimize.
[2023-03-22 00:12:09] [INFO ] Deduced a trap composed of 153 places in 172 ms of which 0 ms to minimize.
[2023-03-22 00:12:09] [INFO ] Deduced a trap composed of 183 places in 174 ms of which 0 ms to minimize.
[2023-03-22 00:12:09] [INFO ] Deduced a trap composed of 168 places in 156 ms of which 0 ms to minimize.
[2023-03-22 00:12:10] [INFO ] Deduced a trap composed of 150 places in 181 ms of which 1 ms to minimize.
[2023-03-22 00:12:10] [INFO ] Deduced a trap composed of 171 places in 163 ms of which 1 ms to minimize.
[2023-03-22 00:12:11] [INFO ] Deduced a trap composed of 162 places in 147 ms of which 1 ms to minimize.
[2023-03-22 00:12:12] [INFO ] Deduced a trap composed of 169 places in 163 ms of which 1 ms to minimize.
[2023-03-22 00:12:12] [INFO ] Deduced a trap composed of 153 places in 192 ms of which 1 ms to minimize.
[2023-03-22 00:12:12] [INFO ] Deduced a trap composed of 165 places in 176 ms of which 0 ms to minimize.
[2023-03-22 00:12:13] [INFO ] Deduced a trap composed of 171 places in 177 ms of which 1 ms to minimize.
[2023-03-22 00:12:13] [INFO ] Deduced a trap composed of 168 places in 177 ms of which 0 ms to minimize.
[2023-03-22 00:12:13] [INFO ] Deduced a trap composed of 168 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:12:14] [INFO ] Deduced a trap composed of 159 places in 178 ms of which 1 ms to minimize.
[2023-03-22 00:12:14] [INFO ] Deduced a trap composed of 171 places in 177 ms of which 0 ms to minimize.
[2023-03-22 00:12:15] [INFO ] Deduced a trap composed of 177 places in 175 ms of which 1 ms to minimize.
[2023-03-22 00:12:15] [INFO ] Deduced a trap composed of 153 places in 160 ms of which 0 ms to minimize.
[2023-03-22 00:12:17] [INFO ] Deduced a trap composed of 162 places in 163 ms of which 0 ms to minimize.
[2023-03-22 00:12:17] [INFO ] Deduced a trap composed of 165 places in 159 ms of which 1 ms to minimize.
[2023-03-22 00:12:20] [INFO ] Deduced a trap composed of 168 places in 184 ms of which 2 ms to minimize.
[2023-03-22 00:12:21] [INFO ] Deduced a trap composed of 159 places in 192 ms of which 1 ms to minimize.
[2023-03-22 00:12:21] [INFO ] Deduced a trap composed of 165 places in 159 ms of which 1 ms to minimize.
[2023-03-22 00:12:22] [INFO ] Deduced a trap composed of 183 places in 161 ms of which 0 ms to minimize.
[2023-03-22 00:12:22] [INFO ] Deduced a trap composed of 165 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:12:24] [INFO ] Deduced a trap composed of 177 places in 162 ms of which 1 ms to minimize.
[2023-03-22 00:12:33] [INFO ] Trap strengthening (SAT) tested/added 120/120 trap constraints in 51259 ms
[2023-03-22 00:12:33] [INFO ] After 51621ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:12:33] [INFO ] After 51727ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 530 transition count 742
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 530 transition count 741
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 529 transition count 741
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 529 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 528 transition count 740
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 528 transition count 735
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 523 transition count 735
Applied a total of 18 rules in 86 ms. Remains 523 /530 variables (removed 7) and now considering 735/746 (removed 11) transitions.
Running SMT prover for 1 properties.
[2023-03-22 00:12:33] [INFO ] Invariant cache hit.
[2023-03-22 00:12:33] [INFO ] [Real]Absence check using 90 positive place invariants in 27 ms returned sat
[2023-03-22 00:12:33] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-22 00:12:33] [INFO ] After 432ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:12:34] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2023-03-22 00:12:34] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-22 00:12:34] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:12:34] [INFO ] Deduced a trap composed of 107 places in 176 ms of which 1 ms to minimize.
[2023-03-22 00:12:34] [INFO ] Deduced a trap composed of 163 places in 161 ms of which 1 ms to minimize.
[2023-03-22 00:12:34] [INFO ] Deduced a trap composed of 162 places in 161 ms of which 1 ms to minimize.
[2023-03-22 00:12:35] [INFO ] Deduced a trap composed of 177 places in 161 ms of which 0 ms to minimize.
[2023-03-22 00:12:35] [INFO ] Deduced a trap composed of 153 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:12:35] [INFO ] Deduced a trap composed of 162 places in 164 ms of which 1 ms to minimize.
[2023-03-22 00:12:35] [INFO ] Deduced a trap composed of 180 places in 164 ms of which 1 ms to minimize.
[2023-03-22 00:12:35] [INFO ] Deduced a trap composed of 165 places in 161 ms of which 1 ms to minimize.
[2023-03-22 00:12:36] [INFO ] Deduced a trap composed of 150 places in 158 ms of which 1 ms to minimize.
[2023-03-22 00:12:36] [INFO ] Deduced a trap composed of 174 places in 154 ms of which 1 ms to minimize.
[2023-03-22 00:12:36] [INFO ] Deduced a trap composed of 168 places in 159 ms of which 1 ms to minimize.
[2023-03-22 00:12:36] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 1 ms to minimize.
[2023-03-22 00:12:36] [INFO ] Deduced a trap composed of 168 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:12:37] [INFO ] Deduced a trap composed of 165 places in 155 ms of which 0 ms to minimize.
[2023-03-22 00:12:37] [INFO ] Deduced a trap composed of 174 places in 154 ms of which 0 ms to minimize.
[2023-03-22 00:12:37] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 0 ms to minimize.
[2023-03-22 00:12:37] [INFO ] Deduced a trap composed of 159 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:12:37] [INFO ] Deduced a trap composed of 165 places in 159 ms of which 1 ms to minimize.
[2023-03-22 00:12:38] [INFO ] Deduced a trap composed of 162 places in 166 ms of which 2 ms to minimize.
[2023-03-22 00:12:38] [INFO ] Deduced a trap composed of 159 places in 143 ms of which 1 ms to minimize.
[2023-03-22 00:12:38] [INFO ] Deduced a trap composed of 165 places in 156 ms of which 0 ms to minimize.
[2023-03-22 00:12:38] [INFO ] Deduced a trap composed of 177 places in 149 ms of which 0 ms to minimize.
[2023-03-22 00:12:38] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 0 ms to minimize.
[2023-03-22 00:12:39] [INFO ] Deduced a trap composed of 168 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:12:39] [INFO ] Deduced a trap composed of 177 places in 158 ms of which 1 ms to minimize.
[2023-03-22 00:12:39] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 0 ms to minimize.
[2023-03-22 00:12:39] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 1 ms to minimize.
[2023-03-22 00:12:39] [INFO ] Deduced a trap composed of 156 places in 149 ms of which 0 ms to minimize.
[2023-03-22 00:12:40] [INFO ] Deduced a trap composed of 153 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:12:40] [INFO ] Deduced a trap composed of 162 places in 150 ms of which 1 ms to minimize.
[2023-03-22 00:12:40] [INFO ] Deduced a trap composed of 162 places in 150 ms of which 0 ms to minimize.
[2023-03-22 00:12:40] [INFO ] Deduced a trap composed of 162 places in 153 ms of which 0 ms to minimize.
[2023-03-22 00:12:40] [INFO ] Deduced a trap composed of 156 places in 148 ms of which 0 ms to minimize.
[2023-03-22 00:12:41] [INFO ] Deduced a trap composed of 156 places in 158 ms of which 0 ms to minimize.
[2023-03-22 00:12:41] [INFO ] Deduced a trap composed of 171 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:12:41] [INFO ] Deduced a trap composed of 156 places in 152 ms of which 1 ms to minimize.
[2023-03-22 00:12:41] [INFO ] Deduced a trap composed of 168 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:12:41] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 0 ms to minimize.
[2023-03-22 00:12:42] [INFO ] Deduced a trap composed of 183 places in 153 ms of which 1 ms to minimize.
[2023-03-22 00:12:42] [INFO ] Deduced a trap composed of 171 places in 183 ms of which 0 ms to minimize.
[2023-03-22 00:12:42] [INFO ] Deduced a trap composed of 153 places in 159 ms of which 0 ms to minimize.
[2023-03-22 00:12:42] [INFO ] Deduced a trap composed of 177 places in 163 ms of which 1 ms to minimize.
[2023-03-22 00:12:43] [INFO ] Deduced a trap composed of 171 places in 151 ms of which 0 ms to minimize.
[2023-03-22 00:12:43] [INFO ] Deduced a trap composed of 168 places in 163 ms of which 1 ms to minimize.
[2023-03-22 00:12:43] [INFO ] Deduced a trap composed of 162 places in 139 ms of which 0 ms to minimize.
[2023-03-22 00:12:43] [INFO ] Deduced a trap composed of 165 places in 155 ms of which 0 ms to minimize.
[2023-03-22 00:12:43] [INFO ] Deduced a trap composed of 168 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:12:44] [INFO ] Deduced a trap composed of 159 places in 158 ms of which 1 ms to minimize.
[2023-03-22 00:12:44] [INFO ] Deduced a trap composed of 177 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:12:46] [INFO ] Deduced a trap composed of 165 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:12:46] [INFO ] Deduced a trap composed of 162 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:12:46] [INFO ] Deduced a trap composed of 168 places in 157 ms of which 0 ms to minimize.
[2023-03-22 00:12:47] [INFO ] Deduced a trap composed of 156 places in 155 ms of which 0 ms to minimize.
[2023-03-22 00:12:47] [INFO ] Deduced a trap composed of 159 places in 162 ms of which 0 ms to minimize.
[2023-03-22 00:12:47] [INFO ] Deduced a trap composed of 156 places in 153 ms of which 1 ms to minimize.
[2023-03-22 00:12:47] [INFO ] Deduced a trap composed of 162 places in 155 ms of which 0 ms to minimize.
[2023-03-22 00:12:47] [INFO ] Deduced a trap composed of 174 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:12:48] [INFO ] Deduced a trap composed of 168 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:12:48] [INFO ] Deduced a trap composed of 159 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:12:48] [INFO ] Deduced a trap composed of 159 places in 154 ms of which 1 ms to minimize.
[2023-03-22 00:12:48] [INFO ] Deduced a trap composed of 159 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:12:48] [INFO ] Deduced a trap composed of 180 places in 156 ms of which 0 ms to minimize.
[2023-03-22 00:12:49] [INFO ] Deduced a trap composed of 165 places in 163 ms of which 0 ms to minimize.
[2023-03-22 00:12:49] [INFO ] Deduced a trap composed of 174 places in 155 ms of which 1 ms to minimize.
[2023-03-22 00:12:49] [INFO ] Deduced a trap composed of 156 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:12:50] [INFO ] Deduced a trap composed of 159 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:12:50] [INFO ] Deduced a trap composed of 156 places in 156 ms of which 0 ms to minimize.
[2023-03-22 00:12:50] [INFO ] Deduced a trap composed of 159 places in 159 ms of which 1 ms to minimize.
[2023-03-22 00:12:50] [INFO ] Deduced a trap composed of 159 places in 153 ms of which 1 ms to minimize.
[2023-03-22 00:12:51] [INFO ] Deduced a trap composed of 165 places in 155 ms of which 0 ms to minimize.
[2023-03-22 00:12:51] [INFO ] Deduced a trap composed of 168 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:12:51] [INFO ] Deduced a trap composed of 159 places in 156 ms of which 0 ms to minimize.
[2023-03-22 00:12:51] [INFO ] Deduced a trap composed of 174 places in 159 ms of which 0 ms to minimize.
[2023-03-22 00:12:51] [INFO ] Deduced a trap composed of 174 places in 159 ms of which 0 ms to minimize.
[2023-03-22 00:12:53] [INFO ] Deduced a trap composed of 165 places in 162 ms of which 1 ms to minimize.
[2023-03-22 00:12:55] [INFO ] Deduced a trap composed of 171 places in 161 ms of which 1 ms to minimize.
[2023-03-22 00:12:56] [INFO ] Deduced a trap composed of 165 places in 164 ms of which 1 ms to minimize.
[2023-03-22 00:12:58] [INFO ] Deduced a trap composed of 165 places in 163 ms of which 0 ms to minimize.
[2023-03-22 00:13:07] [INFO ] Trap strengthening (SAT) tested/added 78/78 trap constraints in 32834 ms
[2023-03-22 00:13:07] [INFO ] After 33476ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:13:07] [INFO ] After 33572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 438062 ms.
starting LoLA
BK_INPUT PolyORBNT-COL-S05J40
BK_EXAMINATION: QuasiLiveness
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
GlobalProperty: QuasiLiveness
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 12945360 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16115120 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 QuasiLiveness -timeout 180 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/model.pnml
lola: reading pnml
lola: PNML file contains High-Level net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: TR BINDINGS
lola: TR BINDINGS DONE
lola: Places: 669, Transitions: 1630
lola: @ trans NoJob
lola: @ trans fi1
lola: @ trans fi3
lola: @ trans trans_689
lola: @ trans DummyOR1
lola: @ trans fo3
lola: @ trans fi2
lola: @ trans trans_457
lola: @ trans WillPerformWork
lola: @ trans trans_461
lola: @ trans MustCheck
lola: @ trans trans_508
lola: @ trans trans_509
lola: @ trans trans_534
lola: @ trans fo2
lola: @ trans LeaveCSTCS
lola: @ trans trans_478
lola: @ trans trans_459
lola: @ trans trans_533
lola: @ trans trans_510
lola: @ trans GoPerformWork
lola: @ trans Run
lola: @ trans trans_685
lola: @ trans GoCheckSource
lola: @ trans fo1
lola: @ trans trans_486
lola: @ trans trans_511
lola: @ trans JobExist
lola: @ trans NotifyEventEndOfCheckSources
lola: @ trans EnterCSTCS
lola: @ trans trans_489
lola: @ trans IsEvt
lola: @ trans trans_463
lola: @ trans trans_776
lola: @ trans trans_488
lola: @ trans trans_487
lola: @ trans DummyOR2
lola: @ trans trans_376
lola: STATE EQUATION TRIES TRANSITION t1490
lola: LAUNCH SYMM
sara: try reading problem file stateEquationProblem-QuasiLiveness-690.sara.
sara: place or transition ordering is non-deterministic

lola: SARA FINISHED
lola: STATE EQUATION TRIES TRANSITION t1611
sara: try reading problem file stateEquationProblem-QuasiLiveness-811.sara.
sara: place or transition ordering is non-deterministic
lola: reporting
lola: not produced: 44
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 176
lola: high level: 1194
lola: reporting
lola: not produced: 44
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 176
lola: high level: 1194
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 215
lola: goal oriented search: 193
lola: high level: 1220
lola: caught signal Terminated - aborting LoLA

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY


Time elapsed: 1360 secs. Pages in use: 254

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="PolyORBNT-COL-S05J40"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 PolyORBNT-COL-S05J40, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r309-tall-167873963000407"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J40.tgz
mv PolyORBNT-COL-S05J40 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;