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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.9K Feb 26 00:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 00:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 00:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 12K Feb 26 01:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 01:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 01:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:07 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 1679444410941

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-S10J30
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 00:20:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-22 00:20:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:20:12] [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:20:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 00:20:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 703 ms
[2023-03-22 00:20:13] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 19 ms.
[2023-03-22 00:20:13] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 186 ms.
[2023-03-22 00:20:13] [INFO ] Unfolded 38 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-22 00:20:13] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-22 00:20:13] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-22 00:20:13] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 30 places in 26 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 936 ms. (steps per millisecond=10 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=10 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :17
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-22 00:20:14] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2023-03-22 00:20:14] [INFO ] Computed 92 place invariants in 103 ms
[2023-03-22 00:20:16] [INFO ] [Real]Absence check using 85 positive place invariants in 30 ms returned sat
[2023-03-22 00:20:16] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-22 00:20:17] [INFO ] After 880ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:8
[2023-03-22 00:20:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:20:17] [INFO ] After 151ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:8
[2023-03-22 00:20:17] [INFO ] After 406ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:8
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-22 00:20:18] [INFO ] After 1990ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:8
[2023-03-22 00:20:18] [INFO ] [Nat]Absence check using 85 positive place invariants in 28 ms returned sat
[2023-03-22 00:20:18] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-22 00:20:24] [INFO ] After 5502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-22 00:20:25] [INFO ] After 1579ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-22 00:20:27] [INFO ] Deduced a trap composed of 337 places in 513 ms of which 1 ms to minimize.
[2023-03-22 00:20:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 644 ms
[2023-03-22 00:20:37] [INFO ] After 13855ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1825 ms.
[2023-03-22 00:20:39] [INFO ] After 21595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 1606 ms.
Support contains 85 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 80 place count 619 transition count 1905
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 80 place count 619 transition count 1872
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 146 place count 586 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 585 transition count 1871
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 585 transition count 1871
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 152 place count 583 transition count 1869
Applied a total of 152 rules in 261 ms. Remains 583 /664 variables (removed 81) and now considering 1869/1940 (removed 71) transitions.
[2023-03-22 00:20:41] [INFO ] Flow matrix only has 1860 transitions (discarded 9 similar events)
// Phase 1: matrix 1860 rows 583 cols
[2023-03-22 00:20:41] [INFO ] Computed 82 place invariants in 56 ms
[2023-03-22 00:20:42] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 583/664 places, 1254/1940 transitions.
Applied a total of 0 rules in 34 ms. Remains 583 /583 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1114 ms. Remains : 583/664 places, 1254/1940 transitions.
Incomplete random walk after 1000000 steps, including 65318 resets, run finished after 7484 ms. (steps per millisecond=133 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 1000001 steps, including 8687 resets, run finished after 1655 ms. (steps per millisecond=604 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:20:51] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2023-03-22 00:20:51] [INFO ] Computed 82 place invariants in 26 ms
[2023-03-22 00:20:51] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-22 00:20:51] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-22 00:20:51] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:20:51] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-22 00:20:51] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-22 00:20:52] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:20:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:20:52] [INFO ] After 214ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:20:52] [INFO ] Deduced a trap composed of 238 places in 302 ms of which 1 ms to minimize.
[2023-03-22 00:20:53] [INFO ] Deduced a trap composed of 236 places in 280 ms of which 0 ms to minimize.
[2023-03-22 00:20:53] [INFO ] Deduced a trap composed of 236 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:20:53] [INFO ] Deduced a trap composed of 240 places in 294 ms of which 1 ms to minimize.
[2023-03-22 00:20:54] [INFO ] Deduced a trap composed of 234 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:20:54] [INFO ] Deduced a trap composed of 236 places in 295 ms of which 0 ms to minimize.
[2023-03-22 00:20:54] [INFO ] Deduced a trap composed of 228 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:20:55] [INFO ] Deduced a trap composed of 234 places in 284 ms of which 1 ms to minimize.
[2023-03-22 00:20:55] [INFO ] Deduced a trap composed of 238 places in 294 ms of which 1 ms to minimize.
[2023-03-22 00:20:55] [INFO ] Deduced a trap composed of 244 places in 294 ms of which 0 ms to minimize.
[2023-03-22 00:20:56] [INFO ] Deduced a trap composed of 240 places in 291 ms of which 0 ms to minimize.
[2023-03-22 00:20:56] [INFO ] Deduced a trap composed of 234 places in 293 ms of which 0 ms to minimize.
[2023-03-22 00:20:57] [INFO ] Deduced a trap composed of 232 places in 286 ms of which 1 ms to minimize.
[2023-03-22 00:20:57] [INFO ] Deduced a trap composed of 236 places in 279 ms of which 1 ms to minimize.
[2023-03-22 00:20:57] [INFO ] Deduced a trap composed of 242 places in 272 ms of which 0 ms to minimize.
[2023-03-22 00:20:58] [INFO ] Deduced a trap composed of 234 places in 276 ms of which 1 ms to minimize.
[2023-03-22 00:20:58] [INFO ] Deduced a trap composed of 228 places in 276 ms of which 0 ms to minimize.
[2023-03-22 00:20:58] [INFO ] Deduced a trap composed of 226 places in 274 ms of which 1 ms to minimize.
[2023-03-22 00:20:59] [INFO ] Deduced a trap composed of 232 places in 274 ms of which 1 ms to minimize.
[2023-03-22 00:20:59] [INFO ] Deduced a trap composed of 240 places in 273 ms of which 1 ms to minimize.
[2023-03-22 00:21:00] [INFO ] Deduced a trap composed of 236 places in 283 ms of which 1 ms to minimize.
[2023-03-22 00:21:00] [INFO ] Deduced a trap composed of 238 places in 279 ms of which 0 ms to minimize.
[2023-03-22 00:21:01] [INFO ] Deduced a trap composed of 232 places in 276 ms of which 0 ms to minimize.
[2023-03-22 00:21:02] [INFO ] Deduced a trap composed of 232 places in 279 ms of which 1 ms to minimize.
[2023-03-22 00:21:02] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 1 ms to minimize.
[2023-03-22 00:21:02] [INFO ] Deduced a trap composed of 230 places in 283 ms of which 0 ms to minimize.
[2023-03-22 00:21:03] [INFO ] Deduced a trap composed of 232 places in 285 ms of which 0 ms to minimize.
[2023-03-22 00:21:03] [INFO ] Deduced a trap composed of 228 places in 286 ms of which 1 ms to minimize.
[2023-03-22 00:21:03] [INFO ] Deduced a trap composed of 238 places in 263 ms of which 0 ms to minimize.
[2023-03-22 00:21:04] [INFO ] Deduced a trap composed of 236 places in 270 ms of which 1 ms to minimize.
[2023-03-22 00:21:04] [INFO ] Deduced a trap composed of 240 places in 260 ms of which 2 ms to minimize.
[2023-03-22 00:21:04] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 1 ms to minimize.
[2023-03-22 00:21:05] [INFO ] Deduced a trap composed of 238 places in 270 ms of which 1 ms to minimize.
[2023-03-22 00:21:05] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 1 ms to minimize.
[2023-03-22 00:21:05] [INFO ] Deduced a trap composed of 234 places in 271 ms of which 0 ms to minimize.
[2023-03-22 00:21:06] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 0 ms to minimize.
[2023-03-22 00:21:06] [INFO ] Deduced a trap composed of 232 places in 274 ms of which 0 ms to minimize.
[2023-03-22 00:21:07] [INFO ] Deduced a trap composed of 232 places in 288 ms of which 1 ms to minimize.
[2023-03-22 00:21:07] [INFO ] Deduced a trap composed of 232 places in 268 ms of which 1 ms to minimize.
[2023-03-22 00:21:08] [INFO ] Deduced a trap composed of 226 places in 272 ms of which 1 ms to minimize.
[2023-03-22 00:21:08] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 1 ms to minimize.
[2023-03-22 00:21:08] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 0 ms to minimize.
[2023-03-22 00:21:09] [INFO ] Deduced a trap composed of 230 places in 271 ms of which 0 ms to minimize.
[2023-03-22 00:21:09] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 0 ms to minimize.
[2023-03-22 00:21:09] [INFO ] Deduced a trap composed of 232 places in 293 ms of which 0 ms to minimize.
[2023-03-22 00:21:10] [INFO ] Deduced a trap composed of 236 places in 265 ms of which 0 ms to minimize.
[2023-03-22 00:21:10] [INFO ] Deduced a trap composed of 232 places in 266 ms of which 1 ms to minimize.
[2023-03-22 00:21:10] [INFO ] Deduced a trap composed of 228 places in 249 ms of which 1 ms to minimize.
[2023-03-22 00:21:11] [INFO ] Deduced a trap composed of 224 places in 261 ms of which 0 ms to minimize.
[2023-03-22 00:21:11] [INFO ] Deduced a trap composed of 226 places in 264 ms of which 1 ms to minimize.
[2023-03-22 00:21:11] [INFO ] Deduced a trap composed of 228 places in 267 ms of which 1 ms to minimize.
[2023-03-22 00:21:12] [INFO ] Deduced a trap composed of 228 places in 301 ms of which 0 ms to minimize.
[2023-03-22 00:21:12] [INFO ] Deduced a trap composed of 226 places in 289 ms of which 1 ms to minimize.
[2023-03-22 00:21:12] [INFO ] Deduced a trap composed of 228 places in 298 ms of which 6 ms to minimize.
[2023-03-22 00:21:13] [INFO ] Deduced a trap composed of 232 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:21:14] [INFO ] Deduced a trap composed of 236 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:21:15] [INFO ] Deduced a trap composed of 226 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:21:15] [INFO ] Deduced a trap composed of 234 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:21:16] [INFO ] Deduced a trap composed of 234 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:21:16] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 1 ms to minimize.
[2023-03-22 00:21:24] [INFO ] Deduced a trap composed of 238 places in 269 ms of which 1 ms to minimize.
[2023-03-22 00:21:26] [INFO ] Deduced a trap composed of 242 places in 270 ms of which 2 ms to minimize.
[2023-03-22 00:21:26] [INFO ] Deduced a trap composed of 252 places in 273 ms of which 0 ms to minimize.
[2023-03-22 00:21:28] [INFO ] Deduced a trap composed of 242 places in 284 ms of which 2 ms to minimize.
[2023-03-22 00:21:28] [INFO ] Deduced a trap composed of 232 places in 283 ms of which 15 ms to minimize.
[2023-03-22 00:21:29] [INFO ] Deduced a trap composed of 238 places in 255 ms of which 0 ms to minimize.
[2023-03-22 00:21:29] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 1 ms to minimize.
[2023-03-22 00:21:30] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 1 ms to minimize.
[2023-03-22 00:21:30] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 1 ms to minimize.
[2023-03-22 00:21:30] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 1 ms to minimize.
[2023-03-22 00:21:31] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 1 ms to minimize.
[2023-03-22 00:21:31] [INFO ] Deduced a trap composed of 232 places in 276 ms of which 1 ms to minimize.
[2023-03-22 00:21:31] [INFO ] Deduced a trap composed of 236 places in 269 ms of which 1 ms to minimize.
[2023-03-22 00:21:32] [INFO ] Deduced a trap composed of 224 places in 279 ms of which 0 ms to minimize.
[2023-03-22 00:21:32] [INFO ] Deduced a trap composed of 234 places in 269 ms of which 0 ms to minimize.
[2023-03-22 00:21:33] [INFO ] Deduced a trap composed of 232 places in 291 ms of which 0 ms to minimize.
[2023-03-22 00:21:33] [INFO ] Deduced a trap composed of 232 places in 277 ms of which 0 ms to minimize.
[2023-03-22 00:21:33] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 1 ms to minimize.
[2023-03-22 00:21:34] [INFO ] Deduced a trap composed of 230 places in 292 ms of which 0 ms to minimize.
[2023-03-22 00:21:34] [INFO ] Deduced a trap composed of 232 places in 287 ms of which 0 ms to minimize.
[2023-03-22 00:21:35] [INFO ] Deduced a trap composed of 234 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:21:35] [INFO ] Deduced a trap composed of 232 places in 285 ms of which 0 ms to minimize.
[2023-03-22 00:21:35] [INFO ] Deduced a trap composed of 240 places in 273 ms of which 0 ms to minimize.
[2023-03-22 00:21:36] [INFO ] Deduced a trap composed of 238 places in 256 ms of which 0 ms to minimize.
[2023-03-22 00:21:37] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 0 ms to minimize.
[2023-03-22 00:21:37] [INFO ] Deduced a trap composed of 232 places in 294 ms of which 1 ms to minimize.
[2023-03-22 00:21:37] [INFO ] Deduced a trap composed of 236 places in 310 ms of which 1 ms to minimize.
[2023-03-22 00:21:38] [INFO ] Deduced a trap composed of 232 places in 280 ms of which 1 ms to minimize.
[2023-03-22 00:21:38] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 0 ms to minimize.
[2023-03-22 00:21:39] [INFO ] Deduced a trap composed of 228 places in 274 ms of which 0 ms to minimize.
[2023-03-22 00:21:39] [INFO ] Deduced a trap composed of 226 places in 277 ms of which 1 ms to minimize.
[2023-03-22 00:21:39] [INFO ] Deduced a trap composed of 234 places in 273 ms of which 1 ms to minimize.
[2023-03-22 00:21:40] [INFO ] Deduced a trap composed of 240 places in 262 ms of which 0 ms to minimize.
[2023-03-22 00:21:40] [INFO ] Deduced a trap composed of 236 places in 280 ms of which 0 ms to minimize.
[2023-03-22 00:21:41] [INFO ] Deduced a trap composed of 238 places in 288 ms of which 1 ms to minimize.
[2023-03-22 00:21:41] [INFO ] Deduced a trap composed of 234 places in 277 ms of which 0 ms to minimize.
[2023-03-22 00:21:41] [INFO ] Deduced a trap composed of 238 places in 282 ms of which 1 ms to minimize.
[2023-03-22 00:21:42] [INFO ] Deduced a trap composed of 234 places in 289 ms of which 0 ms to minimize.
[2023-03-22 00:21:42] [INFO ] Deduced a trap composed of 232 places in 274 ms of which 1 ms to minimize.
[2023-03-22 00:21:42] [INFO ] Deduced a trap composed of 240 places in 276 ms of which 1 ms to minimize.
[2023-03-22 00:21:43] [INFO ] Deduced a trap composed of 238 places in 294 ms of which 0 ms to minimize.
[2023-03-22 00:21:43] [INFO ] Deduced a trap composed of 242 places in 291 ms of which 0 ms to minimize.
[2023-03-22 00:21:44] [INFO ] Deduced a trap composed of 244 places in 298 ms of which 0 ms to minimize.
[2023-03-22 00:21:44] [INFO ] Deduced a trap composed of 236 places in 275 ms of which 0 ms to minimize.
[2023-03-22 00:21:45] [INFO ] Deduced a trap composed of 234 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:21:45] [INFO ] Deduced a trap composed of 238 places in 290 ms of which 0 ms to minimize.
[2023-03-22 00:21:45] [INFO ] Deduced a trap composed of 230 places in 278 ms of which 1 ms to minimize.
[2023-03-22 00:21:47] [INFO ] Deduced a trap composed of 232 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:21:47] [INFO ] Deduced a trap composed of 236 places in 279 ms of which 1 ms to minimize.
[2023-03-22 00:21:47] [INFO ] Deduced a trap composed of 228 places in 273 ms of which 1 ms to minimize.
[2023-03-22 00:21:48] [INFO ] Deduced a trap composed of 230 places in 289 ms of which 1 ms to minimize.
[2023-03-22 00:21:48] [INFO ] Deduced a trap composed of 228 places in 276 ms of which 1 ms to minimize.
[2023-03-22 00:21:48] [INFO ] Deduced a trap composed of 234 places in 250 ms of which 0 ms to minimize.
[2023-03-22 00:21:49] [INFO ] Deduced a trap composed of 230 places in 251 ms of which 1 ms to minimize.
[2023-03-22 00:21:49] [INFO ] Deduced a trap composed of 230 places in 251 ms of which 0 ms to minimize.
[2023-03-22 00:21:51] [INFO ] Deduced a trap composed of 244 places in 277 ms of which 1 ms to minimize.
[2023-03-22 00:22:00] [INFO ] Trap strengthening (SAT) tested/added 116/116 trap constraints in 67773 ms
[2023-03-22 00:22:00] [INFO ] After 68107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:22:00] [INFO ] After 68572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 583 transition count 1253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 582 transition count 1253
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 582 transition count 1251
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 6 place count 580 transition count 1251
Applied a total of 6 rules in 72 ms. Remains 580 /583 variables (removed 3) and now considering 1251/1254 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 580/583 places, 1251/1254 transitions.
Incomplete random walk after 1000000 steps, including 72679 resets, run finished after 10066 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8748 resets, run finished after 1940 ms. (steps per millisecond=515 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5507707 steps, run timeout after 36001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 5507707 steps, saw 949924 distinct states, run finished after 36002 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:22:48] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2023-03-22 00:22:48] [INFO ] Computed 82 place invariants in 21 ms
[2023-03-22 00:22:48] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-22 00:22:48] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-22 00:22:48] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:22:48] [INFO ] [Nat]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-22 00:22:48] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-22 00:22:49] [INFO ] After 816ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:22:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:22:49] [INFO ] After 66ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:22:49] [INFO ] Deduced a trap composed of 234 places in 268 ms of which 0 ms to minimize.
[2023-03-22 00:22:50] [INFO ] Deduced a trap composed of 232 places in 307 ms of which 0 ms to minimize.
[2023-03-22 00:22:50] [INFO ] Deduced a trap composed of 232 places in 296 ms of which 0 ms to minimize.
[2023-03-22 00:22:50] [INFO ] Deduced a trap composed of 230 places in 295 ms of which 0 ms to minimize.
[2023-03-22 00:22:51] [INFO ] Deduced a trap composed of 232 places in 304 ms of which 0 ms to minimize.
[2023-03-22 00:22:51] [INFO ] Deduced a trap composed of 232 places in 301 ms of which 0 ms to minimize.
[2023-03-22 00:22:51] [INFO ] Deduced a trap composed of 230 places in 275 ms of which 0 ms to minimize.
[2023-03-22 00:22:52] [INFO ] Deduced a trap composed of 230 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:22:52] [INFO ] Deduced a trap composed of 240 places in 294 ms of which 0 ms to minimize.
[2023-03-22 00:22:53] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 0 ms to minimize.
[2023-03-22 00:22:53] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 0 ms to minimize.
[2023-03-22 00:22:53] [INFO ] Deduced a trap composed of 234 places in 274 ms of which 1 ms to minimize.
[2023-03-22 00:22:53] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 0 ms to minimize.
[2023-03-22 00:22:54] [INFO ] Deduced a trap composed of 238 places in 268 ms of which 0 ms to minimize.
[2023-03-22 00:22:54] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 0 ms to minimize.
[2023-03-22 00:22:55] [INFO ] Deduced a trap composed of 218 places in 281 ms of which 1 ms to minimize.
[2023-03-22 00:22:55] [INFO ] Deduced a trap composed of 226 places in 275 ms of which 1 ms to minimize.
[2023-03-22 00:22:55] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 1 ms to minimize.
[2023-03-22 00:22:56] [INFO ] Deduced a trap composed of 236 places in 269 ms of which 0 ms to minimize.
[2023-03-22 00:22:56] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 0 ms to minimize.
[2023-03-22 00:22:57] [INFO ] Deduced a trap composed of 240 places in 274 ms of which 0 ms to minimize.
[2023-03-22 00:22:57] [INFO ] Deduced a trap composed of 228 places in 278 ms of which 1 ms to minimize.
[2023-03-22 00:22:57] [INFO ] Deduced a trap composed of 224 places in 262 ms of which 1 ms to minimize.
[2023-03-22 00:22:58] [INFO ] Deduced a trap composed of 243 places in 270 ms of which 2 ms to minimize.
[2023-03-22 00:22:58] [INFO ] Deduced a trap composed of 228 places in 270 ms of which 0 ms to minimize.
[2023-03-22 00:22:58] [INFO ] Deduced a trap composed of 226 places in 273 ms of which 0 ms to minimize.
[2023-03-22 00:22:59] [INFO ] Deduced a trap composed of 230 places in 275 ms of which 0 ms to minimize.
[2023-03-22 00:22:59] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 0 ms to minimize.
[2023-03-22 00:22:59] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 1 ms to minimize.
[2023-03-22 00:23:00] [INFO ] Deduced a trap composed of 228 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:23:00] [INFO ] Deduced a trap composed of 236 places in 268 ms of which 0 ms to minimize.
[2023-03-22 00:23:00] [INFO ] Deduced a trap composed of 238 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:23:01] [INFO ] Deduced a trap composed of 224 places in 294 ms of which 0 ms to minimize.
[2023-03-22 00:23:01] [INFO ] Deduced a trap composed of 232 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:23:02] [INFO ] Deduced a trap composed of 226 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:23:02] [INFO ] Deduced a trap composed of 230 places in 335 ms of which 1 ms to minimize.
[2023-03-22 00:23:03] [INFO ] Deduced a trap composed of 232 places in 269 ms of which 0 ms to minimize.
[2023-03-22 00:23:03] [INFO ] Deduced a trap composed of 228 places in 288 ms of which 0 ms to minimize.
[2023-03-22 00:23:03] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 1 ms to minimize.
[2023-03-22 00:23:04] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 0 ms to minimize.
[2023-03-22 00:23:04] [INFO ] Deduced a trap composed of 240 places in 294 ms of which 1 ms to minimize.
[2023-03-22 00:23:05] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 1 ms to minimize.
[2023-03-22 00:23:05] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 1 ms to minimize.
[2023-03-22 00:23:06] [INFO ] Deduced a trap composed of 230 places in 272 ms of which 1 ms to minimize.
[2023-03-22 00:23:06] [INFO ] Deduced a trap composed of 236 places in 271 ms of which 0 ms to minimize.
[2023-03-22 00:23:07] [INFO ] Deduced a trap composed of 232 places in 277 ms of which 0 ms to minimize.
[2023-03-22 00:23:15] [INFO ] Deduced a trap composed of 234 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:23:24] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 34614 ms
[2023-03-22 00:23:24] [INFO ] After 34714ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:23:24] [INFO ] After 35674ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 25 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 24 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2023-03-22 00:23:24] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-22 00:23:24] [INFO ] Invariant cache hit.
[2023-03-22 00:23:24] [INFO ] Implicit Places using invariants in 503 ms returned []
[2023-03-22 00:23:24] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-22 00:23:24] [INFO ] Invariant cache hit.
[2023-03-22 00:23:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:23:27] [INFO ] Implicit Places using invariants and state equation in 3050 ms returned []
Implicit Place search using SMT with State Equation took 3563 ms to find 0 implicit places.
[2023-03-22 00:23:27] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-22 00:23:27] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-22 00:23:27] [INFO ] Invariant cache hit.
[2023-03-22 00:23:28] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4193 ms. Remains : 580/580 places, 1251/1251 transitions.
Incomplete random walk after 100000 steps, including 7229 resets, run finished after 1148 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:23:29] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-22 00:23:29] [INFO ] Invariant cache hit.
[2023-03-22 00:23:29] [INFO ] [Real]Absence check using 75 positive place invariants in 24 ms returned sat
[2023-03-22 00:23:29] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-22 00:23:30] [INFO ] After 313ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:23:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:23:30] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:23:30] [INFO ] After 68ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:23:30] [INFO ] After 502ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:23:30] [INFO ] [Nat]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-22 00:23:30] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-22 00:23:30] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:23:30] [INFO ] After 71ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:23:30] [INFO ] Deduced a trap composed of 230 places in 272 ms of which 1 ms to minimize.
[2023-03-22 00:23:31] [INFO ] Deduced a trap composed of 236 places in 275 ms of which 1 ms to minimize.
[2023-03-22 00:23:31] [INFO ] Deduced a trap composed of 232 places in 269 ms of which 0 ms to minimize.
[2023-03-22 00:23:31] [INFO ] Deduced a trap composed of 226 places in 259 ms of which 0 ms to minimize.
[2023-03-22 00:23:32] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 0 ms to minimize.
[2023-03-22 00:23:32] [INFO ] Deduced a trap composed of 232 places in 286 ms of which 0 ms to minimize.
[2023-03-22 00:23:32] [INFO ] Deduced a trap composed of 230 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:23:33] [INFO ] Deduced a trap composed of 241 places in 273 ms of which 0 ms to minimize.
[2023-03-22 00:23:33] [INFO ] Deduced a trap composed of 242 places in 287 ms of which 1 ms to minimize.
[2023-03-22 00:23:33] [INFO ] Deduced a trap composed of 230 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:23:34] [INFO ] Deduced a trap composed of 228 places in 263 ms of which 1 ms to minimize.
[2023-03-22 00:23:34] [INFO ] Deduced a trap composed of 230 places in 298 ms of which 0 ms to minimize.
[2023-03-22 00:23:34] [INFO ] Deduced a trap composed of 232 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:23:35] [INFO ] Deduced a trap composed of 232 places in 272 ms of which 1 ms to minimize.
[2023-03-22 00:23:35] [INFO ] Deduced a trap composed of 230 places in 306 ms of which 0 ms to minimize.
[2023-03-22 00:23:36] [INFO ] Deduced a trap composed of 239 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:23:36] [INFO ] Deduced a trap composed of 238 places in 271 ms of which 0 ms to minimize.
[2023-03-22 00:23:36] [INFO ] Deduced a trap composed of 234 places in 305 ms of which 0 ms to minimize.
[2023-03-22 00:23:37] [INFO ] Deduced a trap composed of 239 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:23:37] [INFO ] Deduced a trap composed of 226 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:23:37] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 1 ms to minimize.
[2023-03-22 00:23:38] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 1 ms to minimize.
[2023-03-22 00:23:38] [INFO ] Deduced a trap composed of 234 places in 286 ms of which 0 ms to minimize.
[2023-03-22 00:23:38] [INFO ] Deduced a trap composed of 226 places in 277 ms of which 0 ms to minimize.
[2023-03-22 00:23:39] [INFO ] Deduced a trap composed of 228 places in 277 ms of which 0 ms to minimize.
[2023-03-22 00:23:39] [INFO ] Deduced a trap composed of 236 places in 284 ms of which 1 ms to minimize.
[2023-03-22 00:23:39] [INFO ] Deduced a trap composed of 228 places in 278 ms of which 1 ms to minimize.
[2023-03-22 00:23:40] [INFO ] Deduced a trap composed of 236 places in 280 ms of which 1 ms to minimize.
[2023-03-22 00:23:40] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 0 ms to minimize.
[2023-03-22 00:23:40] [INFO ] Deduced a trap composed of 236 places in 280 ms of which 0 ms to minimize.
[2023-03-22 00:23:41] [INFO ] Deduced a trap composed of 234 places in 275 ms of which 1 ms to minimize.
[2023-03-22 00:23:41] [INFO ] Deduced a trap composed of 232 places in 269 ms of which 0 ms to minimize.
[2023-03-22 00:23:41] [INFO ] Deduced a trap composed of 226 places in 279 ms of which 1 ms to minimize.
[2023-03-22 00:23:42] [INFO ] Deduced a trap composed of 232 places in 288 ms of which 1 ms to minimize.
[2023-03-22 00:23:42] [INFO ] Deduced a trap composed of 228 places in 278 ms of which 1 ms to minimize.
[2023-03-22 00:23:43] [INFO ] Deduced a trap composed of 232 places in 272 ms of which 0 ms to minimize.
[2023-03-22 00:23:43] [INFO ] Deduced a trap composed of 224 places in 259 ms of which 0 ms to minimize.
[2023-03-22 00:23:43] [INFO ] Deduced a trap composed of 224 places in 278 ms of which 1 ms to minimize.
[2023-03-22 00:23:44] [INFO ] Deduced a trap composed of 224 places in 264 ms of which 1 ms to minimize.
[2023-03-22 00:23:45] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 1 ms to minimize.
[2023-03-22 00:23:45] [INFO ] Deduced a trap composed of 220 places in 251 ms of which 1 ms to minimize.
[2023-03-22 00:23:45] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 0 ms to minimize.
[2023-03-22 00:23:46] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 1 ms to minimize.
[2023-03-22 00:23:46] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 1 ms to minimize.
[2023-03-22 00:23:55] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 24715 ms
[2023-03-22 00:23:55] [INFO ] After 24924ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:23:55] [INFO ] After 25404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72477 resets, run finished after 9704 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9025 resets, run finished after 1865 ms. (steps per millisecond=536 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5174153 steps, run timeout after 33001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 5174153 steps, saw 890645 distinct states, run finished after 33003 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:24:40] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-22 00:24:40] [INFO ] Invariant cache hit.
[2023-03-22 00:24:40] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-22 00:24:40] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-22 00:24:40] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:24:40] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-22 00:24:40] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-22 00:24:40] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:24:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:24:40] [INFO ] After 108ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:24:41] [INFO ] Deduced a trap composed of 230 places in 278 ms of which 0 ms to minimize.
[2023-03-22 00:24:41] [INFO ] Deduced a trap composed of 236 places in 277 ms of which 1 ms to minimize.
[2023-03-22 00:24:41] [INFO ] Deduced a trap composed of 232 places in 274 ms of which 1 ms to minimize.
[2023-03-22 00:24:42] [INFO ] Deduced a trap composed of 226 places in 278 ms of which 0 ms to minimize.
[2023-03-22 00:24:42] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 0 ms to minimize.
[2023-03-22 00:24:42] [INFO ] Deduced a trap composed of 232 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:24:43] [INFO ] Deduced a trap composed of 230 places in 290 ms of which 1 ms to minimize.
[2023-03-22 00:24:43] [INFO ] Deduced a trap composed of 241 places in 274 ms of which 0 ms to minimize.
[2023-03-22 00:24:43] [INFO ] Deduced a trap composed of 242 places in 274 ms of which 1 ms to minimize.
[2023-03-22 00:24:44] [INFO ] Deduced a trap composed of 230 places in 278 ms of which 1 ms to minimize.
[2023-03-22 00:24:44] [INFO ] Deduced a trap composed of 228 places in 278 ms of which 1 ms to minimize.
[2023-03-22 00:24:44] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 0 ms to minimize.
[2023-03-22 00:24:45] [INFO ] Deduced a trap composed of 232 places in 277 ms of which 0 ms to minimize.
[2023-03-22 00:24:45] [INFO ] Deduced a trap composed of 232 places in 280 ms of which 1 ms to minimize.
[2023-03-22 00:24:45] [INFO ] Deduced a trap composed of 230 places in 269 ms of which 0 ms to minimize.
[2023-03-22 00:24:46] [INFO ] Deduced a trap composed of 239 places in 277 ms of which 0 ms to minimize.
[2023-03-22 00:24:46] [INFO ] Deduced a trap composed of 238 places in 285 ms of which 0 ms to minimize.
[2023-03-22 00:24:46] [INFO ] Deduced a trap composed of 234 places in 289 ms of which 0 ms to minimize.
[2023-03-22 00:24:47] [INFO ] Deduced a trap composed of 239 places in 300 ms of which 0 ms to minimize.
[2023-03-22 00:24:47] [INFO ] Deduced a trap composed of 226 places in 265 ms of which 0 ms to minimize.
[2023-03-22 00:24:48] [INFO ] Deduced a trap composed of 232 places in 275 ms of which 0 ms to minimize.
[2023-03-22 00:24:48] [INFO ] Deduced a trap composed of 234 places in 292 ms of which 3 ms to minimize.
[2023-03-22 00:24:48] [INFO ] Deduced a trap composed of 234 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:24:49] [INFO ] Deduced a trap composed of 226 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:24:49] [INFO ] Deduced a trap composed of 228 places in 286 ms of which 0 ms to minimize.
[2023-03-22 00:24:49] [INFO ] Deduced a trap composed of 236 places in 284 ms of which 0 ms to minimize.
[2023-03-22 00:24:50] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 1 ms to minimize.
[2023-03-22 00:24:50] [INFO ] Deduced a trap composed of 236 places in 256 ms of which 1 ms to minimize.
[2023-03-22 00:24:50] [INFO ] Deduced a trap composed of 232 places in 289 ms of which 1 ms to minimize.
[2023-03-22 00:24:51] [INFO ] Deduced a trap composed of 236 places in 287 ms of which 1 ms to minimize.
[2023-03-22 00:24:51] [INFO ] Deduced a trap composed of 234 places in 286 ms of which 0 ms to minimize.
[2023-03-22 00:24:51] [INFO ] Deduced a trap composed of 232 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:24:52] [INFO ] Deduced a trap composed of 226 places in 293 ms of which 0 ms to minimize.
[2023-03-22 00:24:52] [INFO ] Deduced a trap composed of 232 places in 286 ms of which 1 ms to minimize.
[2023-03-22 00:24:53] [INFO ] Deduced a trap composed of 228 places in 282 ms of which 1 ms to minimize.
[2023-03-22 00:24:53] [INFO ] Deduced a trap composed of 232 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:24:53] [INFO ] Deduced a trap composed of 224 places in 284 ms of which 1 ms to minimize.
[2023-03-22 00:24:54] [INFO ] Deduced a trap composed of 224 places in 300 ms of which 0 ms to minimize.
[2023-03-22 00:24:54] [INFO ] Deduced a trap composed of 224 places in 271 ms of which 1 ms to minimize.
[2023-03-22 00:24:55] [INFO ] Deduced a trap composed of 228 places in 285 ms of which 0 ms to minimize.
[2023-03-22 00:24:55] [INFO ] Deduced a trap composed of 220 places in 260 ms of which 1 ms to minimize.
[2023-03-22 00:24:56] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 1 ms to minimize.
[2023-03-22 00:24:56] [INFO ] Deduced a trap composed of 236 places in 262 ms of which 0 ms to minimize.
[2023-03-22 00:24:56] [INFO ] Deduced a trap composed of 234 places in 281 ms of which 0 ms to minimize.
[2023-03-22 00:25:05] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 24929 ms
[2023-03-22 00:25:05] [INFO ] After 25172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:25:05] [INFO ] After 25692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 23 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 22 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2023-03-22 00:25:05] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-22 00:25:05] [INFO ] Invariant cache hit.
[2023-03-22 00:25:06] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-22 00:25:06] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-22 00:25:06] [INFO ] Invariant cache hit.
[2023-03-22 00:25:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:25:09] [INFO ] Implicit Places using invariants and state equation in 3068 ms returned []
Implicit Place search using SMT with State Equation took 3605 ms to find 0 implicit places.
[2023-03-22 00:25:09] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-22 00:25:09] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-22 00:25:09] [INFO ] Invariant cache hit.
[2023-03-22 00:25:10] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4217 ms. Remains : 580/580 places, 1251/1251 transitions.
Incomplete random walk after 100000 steps, including 7291 resets, run finished after 974 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:25:11] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-22 00:25:11] [INFO ] Invariant cache hit.
[2023-03-22 00:25:11] [INFO ] [Real]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-22 00:25:11] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-22 00:25:11] [INFO ] After 284ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:25:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:25:11] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:25:11] [INFO ] After 68ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:25:11] [INFO ] After 469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:25:11] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-22 00:25:11] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-22 00:25:12] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:25:12] [INFO ] After 74ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:25:12] [INFO ] Deduced a trap composed of 230 places in 292 ms of which 2 ms to minimize.
[2023-03-22 00:25:12] [INFO ] Deduced a trap composed of 236 places in 278 ms of which 2 ms to minimize.
[2023-03-22 00:25:13] [INFO ] Deduced a trap composed of 232 places in 281 ms of which 1 ms to minimize.
[2023-03-22 00:25:13] [INFO ] Deduced a trap composed of 226 places in 289 ms of which 0 ms to minimize.
[2023-03-22 00:25:13] [INFO ] Deduced a trap composed of 232 places in 287 ms of which 1 ms to minimize.
[2023-03-22 00:25:14] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 0 ms to minimize.
[2023-03-22 00:25:14] [INFO ] Deduced a trap composed of 230 places in 282 ms of which 0 ms to minimize.
[2023-03-22 00:25:14] [INFO ] Deduced a trap composed of 241 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:25:15] [INFO ] Deduced a trap composed of 242 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:25:15] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 1 ms to minimize.
[2023-03-22 00:25:15] [INFO ] Deduced a trap composed of 228 places in 288 ms of which 1 ms to minimize.
[2023-03-22 00:25:16] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 0 ms to minimize.
[2023-03-22 00:25:16] [INFO ] Deduced a trap composed of 232 places in 283 ms of which 1 ms to minimize.
[2023-03-22 00:25:16] [INFO ] Deduced a trap composed of 232 places in 267 ms of which 1 ms to minimize.
[2023-03-22 00:25:17] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 1 ms to minimize.
[2023-03-22 00:25:17] [INFO ] Deduced a trap composed of 239 places in 291 ms of which 3 ms to minimize.
[2023-03-22 00:25:17] [INFO ] Deduced a trap composed of 238 places in 279 ms of which 0 ms to minimize.
[2023-03-22 00:25:18] [INFO ] Deduced a trap composed of 234 places in 283 ms of which 0 ms to minimize.
[2023-03-22 00:25:18] [INFO ] Deduced a trap composed of 239 places in 277 ms of which 1 ms to minimize.
[2023-03-22 00:25:19] [INFO ] Deduced a trap composed of 226 places in 297 ms of which 0 ms to minimize.
[2023-03-22 00:25:19] [INFO ] Deduced a trap composed of 232 places in 277 ms of which 1 ms to minimize.
[2023-03-22 00:25:19] [INFO ] Deduced a trap composed of 234 places in 275 ms of which 1 ms to minimize.
[2023-03-22 00:25:20] [INFO ] Deduced a trap composed of 234 places in 274 ms of which 1 ms to minimize.
[2023-03-22 00:25:20] [INFO ] Deduced a trap composed of 226 places in 281 ms of which 0 ms to minimize.
[2023-03-22 00:25:20] [INFO ] Deduced a trap composed of 228 places in 279 ms of which 1 ms to minimize.
[2023-03-22 00:25:21] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 0 ms to minimize.
[2023-03-22 00:25:21] [INFO ] Deduced a trap composed of 228 places in 272 ms of which 1 ms to minimize.
[2023-03-22 00:25:21] [INFO ] Deduced a trap composed of 236 places in 273 ms of which 0 ms to minimize.
[2023-03-22 00:25:22] [INFO ] Deduced a trap composed of 232 places in 254 ms of which 0 ms to minimize.
[2023-03-22 00:25:22] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 0 ms to minimize.
[2023-03-22 00:25:22] [INFO ] Deduced a trap composed of 234 places in 275 ms of which 1 ms to minimize.
[2023-03-22 00:25:23] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 1 ms to minimize.
[2023-03-22 00:25:23] [INFO ] Deduced a trap composed of 226 places in 280 ms of which 0 ms to minimize.
[2023-03-22 00:25:23] [INFO ] Deduced a trap composed of 232 places in 286 ms of which 1 ms to minimize.
[2023-03-22 00:25:24] [INFO ] Deduced a trap composed of 228 places in 270 ms of which 1 ms to minimize.
[2023-03-22 00:25:24] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 0 ms to minimize.
[2023-03-22 00:25:24] [INFO ] Deduced a trap composed of 224 places in 289 ms of which 1 ms to minimize.
[2023-03-22 00:25:25] [INFO ] Deduced a trap composed of 224 places in 266 ms of which 0 ms to minimize.
[2023-03-22 00:25:25] [INFO ] Deduced a trap composed of 224 places in 276 ms of which 1 ms to minimize.
[2023-03-22 00:25:26] [INFO ] Deduced a trap composed of 228 places in 283 ms of which 1 ms to minimize.
[2023-03-22 00:25:27] [INFO ] Deduced a trap composed of 220 places in 281 ms of which 1 ms to minimize.
[2023-03-22 00:25:27] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 1 ms to minimize.
[2023-03-22 00:25:27] [INFO ] Deduced a trap composed of 236 places in 262 ms of which 1 ms to minimize.
[2023-03-22 00:25:27] [INFO ] Deduced a trap composed of 234 places in 269 ms of which 1 ms to minimize.
[2023-03-22 00:25:36] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 24779 ms
[2023-03-22 00:25:37] [INFO ] After 24972ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:25:37] [INFO ] After 25472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 732 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 458281 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 458281 steps, saw 74200 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:25:40] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-22 00:25:40] [INFO ] Invariant cache hit.
[2023-03-22 00:25:40] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-22 00:25:40] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-22 00:25:40] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:25:40] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-22 00:25:40] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-22 00:25:41] [INFO ] After 531ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:25:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:25:41] [INFO ] After 126ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:25:41] [INFO ] Deduced a trap composed of 228 places in 287 ms of which 0 ms to minimize.
[2023-03-22 00:25:41] [INFO ] Deduced a trap composed of 230 places in 269 ms of which 1 ms to minimize.
[2023-03-22 00:25:42] [INFO ] Deduced a trap composed of 232 places in 276 ms of which 0 ms to minimize.
[2023-03-22 00:25:42] [INFO ] Deduced a trap composed of 230 places in 296 ms of which 0 ms to minimize.
[2023-03-22 00:25:42] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 1 ms to minimize.
[2023-03-22 00:25:43] [INFO ] Deduced a trap composed of 232 places in 268 ms of which 1 ms to minimize.
[2023-03-22 00:25:43] [INFO ] Deduced a trap composed of 234 places in 283 ms of which 0 ms to minimize.
[2023-03-22 00:25:43] [INFO ] Deduced a trap composed of 234 places in 271 ms of which 1 ms to minimize.
[2023-03-22 00:25:44] [INFO ] Deduced a trap composed of 226 places in 290 ms of which 1 ms to minimize.
[2023-03-22 00:25:44] [INFO ] Deduced a trap composed of 224 places in 283 ms of which 1 ms to minimize.
[2023-03-22 00:25:44] [INFO ] Deduced a trap composed of 234 places in 291 ms of which 0 ms to minimize.
[2023-03-22 00:25:45] [INFO ] Deduced a trap composed of 232 places in 295 ms of which 0 ms to minimize.
[2023-03-22 00:25:45] [INFO ] Deduced a trap composed of 232 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:25:46] [INFO ] Deduced a trap composed of 236 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:25:46] [INFO ] Deduced a trap composed of 226 places in 281 ms of which 1 ms to minimize.
[2023-03-22 00:25:46] [INFO ] Deduced a trap composed of 236 places in 286 ms of which 1 ms to minimize.
[2023-03-22 00:25:47] [INFO ] Deduced a trap composed of 236 places in 273 ms of which 0 ms to minimize.
[2023-03-22 00:25:47] [INFO ] Deduced a trap composed of 226 places in 283 ms of which 0 ms to minimize.
[2023-03-22 00:25:47] [INFO ] Deduced a trap composed of 226 places in 270 ms of which 1 ms to minimize.
[2023-03-22 00:25:48] [INFO ] Deduced a trap composed of 230 places in 284 ms of which 0 ms to minimize.
[2023-03-22 00:25:48] [INFO ] Deduced a trap composed of 238 places in 275 ms of which 1 ms to minimize.
[2023-03-22 00:25:48] [INFO ] Deduced a trap composed of 234 places in 289 ms of which 0 ms to minimize.
[2023-03-22 00:25:49] [INFO ] Deduced a trap composed of 230 places in 271 ms of which 1 ms to minimize.
[2023-03-22 00:25:49] [INFO ] Deduced a trap composed of 230 places in 290 ms of which 1 ms to minimize.
[2023-03-22 00:25:50] [INFO ] Deduced a trap composed of 228 places in 277 ms of which 1 ms to minimize.
[2023-03-22 00:25:50] [INFO ] Deduced a trap composed of 226 places in 292 ms of which 0 ms to minimize.
[2023-03-22 00:25:51] [INFO ] Deduced a trap composed of 228 places in 269 ms of which 0 ms to minimize.
[2023-03-22 00:25:51] [INFO ] Deduced a trap composed of 230 places in 278 ms of which 0 ms to minimize.
[2023-03-22 00:25:52] [INFO ] Deduced a trap composed of 228 places in 272 ms of which 0 ms to minimize.
[2023-03-22 00:25:52] [INFO ] Deduced a trap composed of 232 places in 267 ms of which 0 ms to minimize.
[2023-03-22 00:25:53] [INFO ] Deduced a trap composed of 232 places in 287 ms of which 1 ms to minimize.
[2023-03-22 00:25:54] [INFO ] Deduced a trap composed of 232 places in 266 ms of which 1 ms to minimize.
[2023-03-22 00:26:03] [INFO ] Deduced a trap composed of 236 places in 287 ms of which 0 ms to minimize.
[2023-03-22 00:26:03] [INFO ] Deduced a trap composed of 228 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:26:04] [INFO ] Deduced a trap composed of 236 places in 282 ms of which 1 ms to minimize.
[2023-03-22 00:26:04] [INFO ] Deduced a trap composed of 232 places in 285 ms of which 1 ms to minimize.
[2023-03-22 00:26:04] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 0 ms to minimize.
[2023-03-22 00:26:05] [INFO ] Deduced a trap composed of 222 places in 273 ms of which 1 ms to minimize.
[2023-03-22 00:26:05] [INFO ] Deduced a trap composed of 230 places in 297 ms of which 0 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
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:26:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:26:05] [INFO ] After 25089ms 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 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 23 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2023-03-22 00:26:05] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-22 00:26:05] [INFO ] Invariant cache hit.
[2023-03-22 00:26:06] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 527 ms. Remains : 580/580 places, 1251/1251 transitions.
Incomplete random walk after 10000 steps, including 760 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 92 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 458965 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 458965 steps, saw 74309 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:26:09] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-22 00:26:09] [INFO ] Invariant cache hit.
[2023-03-22 00:26:09] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-22 00:26:09] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-22 00:26:09] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:26:09] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-22 00:26:09] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-22 00:26:09] [INFO ] After 370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:26:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:26:09] [INFO ] After 127ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:26:10] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 1 ms to minimize.
[2023-03-22 00:26:10] [INFO ] Deduced a trap composed of 230 places in 273 ms of which 0 ms to minimize.
[2023-03-22 00:26:10] [INFO ] Deduced a trap composed of 232 places in 276 ms of which 0 ms to minimize.
[2023-03-22 00:26:11] [INFO ] Deduced a trap composed of 230 places in 284 ms of which 1 ms to minimize.
[2023-03-22 00:26:11] [INFO ] Deduced a trap composed of 236 places in 287 ms of which 0 ms to minimize.
[2023-03-22 00:26:11] [INFO ] Deduced a trap composed of 232 places in 273 ms of which 1 ms to minimize.
[2023-03-22 00:26:12] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 0 ms to minimize.
[2023-03-22 00:26:12] [INFO ] Deduced a trap composed of 234 places in 279 ms of which 1 ms to minimize.
[2023-03-22 00:26:12] [INFO ] Deduced a trap composed of 226 places in 259 ms of which 1 ms to minimize.
[2023-03-22 00:26:13] [INFO ] Deduced a trap composed of 224 places in 271 ms of which 0 ms to minimize.
[2023-03-22 00:26:13] [INFO ] Deduced a trap composed of 234 places in 274 ms of which 1 ms to minimize.
[2023-03-22 00:26:13] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 1 ms to minimize.
[2023-03-22 00:26:14] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 1 ms to minimize.
[2023-03-22 00:26:14] [INFO ] Deduced a trap composed of 236 places in 284 ms of which 0 ms to minimize.
[2023-03-22 00:26:14] [INFO ] Deduced a trap composed of 226 places in 287 ms of which 0 ms to minimize.
[2023-03-22 00:26:15] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 1 ms to minimize.
[2023-03-22 00:26:15] [INFO ] Deduced a trap composed of 236 places in 288 ms of which 1 ms to minimize.
[2023-03-22 00:26:15] [INFO ] Deduced a trap composed of 226 places in 290 ms of which 1 ms to minimize.
[2023-03-22 00:26:16] [INFO ] Deduced a trap composed of 226 places in 285 ms of which 1 ms to minimize.
[2023-03-22 00:26:16] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 1 ms to minimize.
[2023-03-22 00:26:16] [INFO ] Deduced a trap composed of 238 places in 265 ms of which 0 ms to minimize.
[2023-03-22 00:26:17] [INFO ] Deduced a trap composed of 234 places in 277 ms of which 0 ms to minimize.
[2023-03-22 00:26:17] [INFO ] Deduced a trap composed of 230 places in 278 ms of which 1 ms to minimize.
[2023-03-22 00:26:18] [INFO ] Deduced a trap composed of 230 places in 273 ms of which 1 ms to minimize.
[2023-03-22 00:26:18] [INFO ] Deduced a trap composed of 228 places in 268 ms of which 0 ms to minimize.
[2023-03-22 00:26:19] [INFO ] Deduced a trap composed of 226 places in 278 ms of which 1 ms to minimize.
[2023-03-22 00:26:19] [INFO ] Deduced a trap composed of 228 places in 271 ms of which 1 ms to minimize.
[2023-03-22 00:26:20] [INFO ] Deduced a trap composed of 230 places in 282 ms of which 0 ms to minimize.
[2023-03-22 00:26:20] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 0 ms to minimize.
[2023-03-22 00:26:20] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 0 ms to minimize.
[2023-03-22 00:26:21] [INFO ] Deduced a trap composed of 232 places in 277 ms of which 1 ms to minimize.
[2023-03-22 00:26:23] [INFO ] Deduced a trap composed of 232 places in 275 ms of which 1 ms to minimize.
[2023-03-22 00:26:31] [INFO ] Deduced a trap composed of 236 places in 307 ms of which 1 ms to minimize.
[2023-03-22 00:26:32] [INFO ] Deduced a trap composed of 228 places in 283 ms of which 1 ms to minimize.
[2023-03-22 00:26:32] [INFO ] Deduced a trap composed of 236 places in 279 ms of which 1 ms to minimize.
[2023-03-22 00:26:33] [INFO ] Deduced a trap composed of 232 places in 279 ms of which 1 ms to minimize.
[2023-03-22 00:26:33] [INFO ] Deduced a trap composed of 232 places in 280 ms of which 1 ms to minimize.
[2023-03-22 00:26:33] [INFO ] Deduced a trap composed of 222 places in 275 ms of which 1 ms to minimize.
[2023-03-22 00:26:34] [INFO ] Deduced a trap composed of 230 places in 279 ms of which 1 ms to minimize.
[2023-03-22 00:26:34] [INFO ] Deduced a trap composed of 234 places in 278 ms of which 2 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
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:26:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:26:34] [INFO ] After 25186ms 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 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 22 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 21 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2023-03-22 00:26:34] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-22 00:26:34] [INFO ] Invariant cache hit.
[2023-03-22 00:26:34] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-03-22 00:26:34] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-22 00:26:34] [INFO ] Invariant cache hit.
[2023-03-22 00:26:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:26:37] [INFO ] Implicit Places using invariants and state equation in 2419 ms returned []
Implicit Place search using SMT with State Equation took 2873 ms to find 0 implicit places.
[2023-03-22 00:26:37] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-22 00:26:37] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-22 00:26:37] [INFO ] Invariant cache hit.
[2023-03-22 00:26:37] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3472 ms. Remains : 580/580 places, 1251/1251 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 580 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 580 transition count 1241
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 11 place count 579 transition count 1241
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1240
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 578 transition count 1230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 568 transition count 1230
Applied a total of 33 rules in 102 ms. Remains 568 /580 variables (removed 12) and now considering 1230/1251 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1230 rows 568 cols
[2023-03-22 00:26:38] [INFO ] Computed 82 place invariants in 20 ms
[2023-03-22 00:26:38] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-22 00:26:38] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-22 00:26:38] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:26:38] [INFO ] [Nat]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-22 00:26:38] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-22 00:26:39] [INFO ] After 938ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:26:39] [INFO ] Deduced a trap composed of 238 places in 247 ms of which 1 ms to minimize.
[2023-03-22 00:26:39] [INFO ] Deduced a trap composed of 228 places in 237 ms of which 0 ms to minimize.
[2023-03-22 00:26:40] [INFO ] Deduced a trap composed of 228 places in 240 ms of which 1 ms to minimize.
[2023-03-22 00:26:40] [INFO ] Deduced a trap composed of 228 places in 236 ms of which 1 ms to minimize.
[2023-03-22 00:26:40] [INFO ] Deduced a trap composed of 230 places in 244 ms of which 0 ms to minimize.
[2023-03-22 00:26:41] [INFO ] Deduced a trap composed of 236 places in 248 ms of which 0 ms to minimize.
[2023-03-22 00:26:41] [INFO ] Deduced a trap composed of 226 places in 247 ms of which 1 ms to minimize.
[2023-03-22 00:26:41] [INFO ] Deduced a trap composed of 236 places in 239 ms of which 1 ms to minimize.
[2023-03-22 00:26:41] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 0 ms to minimize.
[2023-03-22 00:26:42] [INFO ] Deduced a trap composed of 238 places in 251 ms of which 0 ms to minimize.
[2023-03-22 00:26:42] [INFO ] Deduced a trap composed of 236 places in 255 ms of which 1 ms to minimize.
[2023-03-22 00:26:42] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 1 ms to minimize.
[2023-03-22 00:26:43] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 1 ms to minimize.
[2023-03-22 00:26:43] [INFO ] Deduced a trap composed of 226 places in 255 ms of which 0 ms to minimize.
[2023-03-22 00:26:43] [INFO ] Deduced a trap composed of 226 places in 255 ms of which 1 ms to minimize.
[2023-03-22 00:26:44] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 0 ms to minimize.
[2023-03-22 00:26:44] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 0 ms to minimize.
[2023-03-22 00:26:44] [INFO ] Deduced a trap composed of 228 places in 249 ms of which 1 ms to minimize.
[2023-03-22 00:26:44] [INFO ] Deduced a trap composed of 224 places in 249 ms of which 0 ms to minimize.
[2023-03-22 00:26:45] [INFO ] Deduced a trap composed of 226 places in 247 ms of which 0 ms to minimize.
[2023-03-22 00:26:45] [INFO ] Deduced a trap composed of 224 places in 251 ms of which 0 ms to minimize.
[2023-03-22 00:26:45] [INFO ] Deduced a trap composed of 228 places in 260 ms of which 0 ms to minimize.
[2023-03-22 00:26:46] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 1 ms to minimize.
[2023-03-22 00:26:46] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 1 ms to minimize.
[2023-03-22 00:26:46] [INFO ] Deduced a trap composed of 228 places in 251 ms of which 1 ms to minimize.
[2023-03-22 00:26:47] [INFO ] Deduced a trap composed of 226 places in 256 ms of which 0 ms to minimize.
[2023-03-22 00:26:47] [INFO ] Deduced a trap composed of 226 places in 254 ms of which 0 ms to minimize.
[2023-03-22 00:26:47] [INFO ] Deduced a trap composed of 226 places in 249 ms of which 1 ms to minimize.
[2023-03-22 00:26:47] [INFO ] Deduced a trap composed of 228 places in 252 ms of which 1 ms to minimize.
[2023-03-22 00:26:48] [INFO ] Deduced a trap composed of 224 places in 249 ms of which 0 ms to minimize.
[2023-03-22 00:26:48] [INFO ] Deduced a trap composed of 224 places in 250 ms of which 0 ms to minimize.
[2023-03-22 00:26:48] [INFO ] Deduced a trap composed of 224 places in 252 ms of which 1 ms to minimize.
[2023-03-22 00:26:49] [INFO ] Deduced a trap composed of 226 places in 242 ms of which 1 ms to minimize.
[2023-03-22 00:26:49] [INFO ] Deduced a trap composed of 228 places in 239 ms of which 1 ms to minimize.
[2023-03-22 00:26:49] [INFO ] Deduced a trap composed of 228 places in 236 ms of which 1 ms to minimize.
[2023-03-22 00:26:49] [INFO ] Deduced a trap composed of 224 places in 237 ms of which 0 ms to minimize.
[2023-03-22 00:26:50] [INFO ] Deduced a trap composed of 228 places in 246 ms of which 1 ms to minimize.
[2023-03-22 00:26:50] [INFO ] Deduced a trap composed of 238 places in 239 ms of which 0 ms to minimize.
[2023-03-22 00:26:50] [INFO ] Deduced a trap composed of 232 places in 239 ms of which 0 ms to minimize.
[2023-03-22 00:26:51] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 1 ms to minimize.
[2023-03-22 00:26:51] [INFO ] Deduced a trap composed of 232 places in 237 ms of which 0 ms to minimize.
[2023-03-22 00:26:51] [INFO ] Deduced a trap composed of 226 places in 245 ms of which 0 ms to minimize.
[2023-03-22 00:26:51] [INFO ] Deduced a trap composed of 226 places in 240 ms of which 0 ms to minimize.
[2023-03-22 00:26:52] [INFO ] Deduced a trap composed of 228 places in 242 ms of which 1 ms to minimize.
[2023-03-22 00:26:52] [INFO ] Deduced a trap composed of 228 places in 238 ms of which 1 ms to minimize.
[2023-03-22 00:26:52] [INFO ] Deduced a trap composed of 226 places in 250 ms of which 0 ms to minimize.
[2023-03-22 00:26:53] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 1 ms to minimize.
[2023-03-22 00:26:53] [INFO ] Deduced a trap composed of 232 places in 249 ms of which 0 ms to minimize.
[2023-03-22 00:26:53] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 0 ms to minimize.
[2023-03-22 00:26:54] [INFO ] Deduced a trap composed of 244 places in 249 ms of which 1 ms to minimize.
[2023-03-22 00:26:54] [INFO ] Deduced a trap composed of 230 places in 251 ms of which 0 ms to minimize.
[2023-03-22 00:26:54] [INFO ] Deduced a trap composed of 228 places in 243 ms of which 0 ms to minimize.
[2023-03-22 00:26:54] [INFO ] Deduced a trap composed of 226 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:26:55] [INFO ] Deduced a trap composed of 232 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:26:55] [INFO ] Deduced a trap composed of 228 places in 225 ms of which 0 ms to minimize.
[2023-03-22 00:26:55] [INFO ] Deduced a trap composed of 226 places in 241 ms of which 1 ms to minimize.
[2023-03-22 00:26:56] [INFO ] Deduced a trap composed of 228 places in 243 ms of which 1 ms to minimize.
[2023-03-22 00:26:56] [INFO ] Deduced a trap composed of 226 places in 240 ms of which 0 ms to minimize.
[2023-03-22 00:26:56] [INFO ] Deduced a trap composed of 230 places in 241 ms of which 1 ms to minimize.
[2023-03-22 00:26:56] [INFO ] Deduced a trap composed of 228 places in 241 ms of which 1 ms to minimize.
[2023-03-22 00:26:57] [INFO ] Deduced a trap composed of 230 places in 241 ms of which 1 ms to minimize.
[2023-03-22 00:26:57] [INFO ] Deduced a trap composed of 230 places in 244 ms of which 0 ms to minimize.
[2023-03-22 00:26:57] [INFO ] Deduced a trap composed of 228 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:26:58] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 1 ms to minimize.
[2023-03-22 00:26:58] [INFO ] Deduced a trap composed of 226 places in 235 ms of which 0 ms to minimize.
[2023-03-22 00:26:58] [INFO ] Deduced a trap composed of 228 places in 234 ms of which 0 ms to minimize.
[2023-03-22 00:26:59] [INFO ] Deduced a trap composed of 226 places in 259 ms of which 1 ms to minimize.
[2023-03-22 00:26:59] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 1 ms to minimize.
[2023-03-22 00:26:59] [INFO ] Deduced a trap composed of 224 places in 251 ms of which 1 ms to minimize.
[2023-03-22 00:26:59] [INFO ] Deduced a trap composed of 224 places in 246 ms of which 0 ms to minimize.
[2023-03-22 00:27:00] [INFO ] Deduced a trap composed of 224 places in 238 ms of which 1 ms to minimize.
[2023-03-22 00:27:00] [INFO ] Deduced a trap composed of 226 places in 272 ms of which 1 ms to minimize.
[2023-03-22 00:27:00] [INFO ] Deduced a trap composed of 224 places in 231 ms of which 0 ms to minimize.
[2023-03-22 00:27:01] [INFO ] Deduced a trap composed of 224 places in 230 ms of which 1 ms to minimize.
[2023-03-22 00:27:01] [INFO ] Deduced a trap composed of 224 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:27:01] [INFO ] Deduced a trap composed of 228 places in 243 ms of which 1 ms to minimize.
[2023-03-22 00:27:01] [INFO ] Deduced a trap composed of 224 places in 255 ms of which 0 ms to minimize.
[2023-03-22 00:27:02] [INFO ] Deduced a trap composed of 224 places in 285 ms of which 1 ms to minimize.
[2023-03-22 00:27:02] [INFO ] Deduced a trap composed of 230 places in 238 ms of which 1 ms to minimize.
[2023-03-22 00:27:02] [INFO ] Deduced a trap composed of 228 places in 254 ms of which 0 ms to minimize.
[2023-03-22 00:27:03] [INFO ] Deduced a trap composed of 224 places in 242 ms of which 1 ms to minimize.
[2023-03-22 00:27:03] [INFO ] Deduced a trap composed of 228 places in 252 ms of which 0 ms to minimize.
[2023-03-22 00:27:03] [INFO ] Deduced a trap composed of 228 places in 252 ms of which 1 ms to minimize.
[2023-03-22 00:27:03] [INFO ] Deduced a trap composed of 224 places in 256 ms of which 0 ms to minimize.
[2023-03-22 00:27:04] [INFO ] Deduced a trap composed of 230 places in 237 ms of which 0 ms to minimize.
[2023-03-22 00:27:04] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 1 ms to minimize.
[2023-03-22 00:27:04] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 0 ms to minimize.
[2023-03-22 00:27:05] [INFO ] Deduced a trap composed of 232 places in 244 ms of which 1 ms to minimize.
[2023-03-22 00:27:05] [INFO ] Deduced a trap composed of 234 places in 252 ms of which 1 ms to minimize.
[2023-03-22 00:27:05] [INFO ] Deduced a trap composed of 234 places in 254 ms of which 1 ms to minimize.
[2023-03-22 00:27:06] [INFO ] Deduced a trap composed of 228 places in 251 ms of which 1 ms to minimize.
[2023-03-22 00:27:06] [INFO ] Deduced a trap composed of 226 places in 251 ms of which 0 ms to minimize.
[2023-03-22 00:27:07] [INFO ] Deduced a trap composed of 226 places in 230 ms of which 1 ms to minimize.
[2023-03-22 00:27:09] [INFO ] Deduced a trap composed of 226 places in 229 ms of which 0 ms to minimize.
[2023-03-22 00:27:09] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 0 ms to minimize.
[2023-03-22 00:27:11] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 0 ms to minimize.
[2023-03-22 00:27:11] [INFO ] Deduced a trap composed of 232 places in 245 ms of which 0 ms to minimize.
[2023-03-22 00:27:11] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 1 ms to minimize.
[2023-03-22 00:27:15] [INFO ] Deduced a trap composed of 226 places in 252 ms of which 0 ms to minimize.
[2023-03-22 00:27:15] [INFO ] Deduced a trap composed of 224 places in 250 ms of which 1 ms to minimize.
[2023-03-22 00:27:15] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 1 ms to minimize.
[2023-03-22 00:27:16] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 1 ms to minimize.
[2023-03-22 00:27:16] [INFO ] Deduced a trap composed of 228 places in 246 ms of which 0 ms to minimize.
[2023-03-22 00:27:16] [INFO ] Deduced a trap composed of 224 places in 241 ms of which 0 ms to minimize.
[2023-03-22 00:27:17] [INFO ] Deduced a trap composed of 224 places in 231 ms of which 0 ms to minimize.
[2023-03-22 00:27:17] [INFO ] Deduced a trap composed of 230 places in 231 ms of which 1 ms to minimize.
[2023-03-22 00:27:17] [INFO ] Deduced a trap composed of 232 places in 239 ms of which 1 ms to minimize.
[2023-03-22 00:27:18] [INFO ] Deduced a trap composed of 226 places in 243 ms of which 1 ms to minimize.
[2023-03-22 00:27:19] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 0 ms to minimize.
[2023-03-22 00:27:20] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 1 ms to minimize.
[2023-03-22 00:27:20] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 0 ms to minimize.
[2023-03-22 00:27:21] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 0 ms to minimize.
[2023-03-22 00:27:21] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 1 ms to minimize.
[2023-03-22 00:27:21] [INFO ] Deduced a trap composed of 228 places in 255 ms of which 1 ms to minimize.
[2023-03-22 00:27:22] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 0 ms to minimize.
[2023-03-22 00:27:22] [INFO ] Deduced a trap composed of 232 places in 248 ms of which 1 ms to minimize.
[2023-03-22 00:27:22] [INFO ] Deduced a trap composed of 226 places in 252 ms of which 0 ms to minimize.
[2023-03-22 00:27:23] [INFO ] Deduced a trap composed of 226 places in 255 ms of which 0 ms to minimize.
[2023-03-22 00:27:32] [INFO ] Trap strengthening (SAT) tested/added 118/118 trap constraints in 53674 ms
[2023-03-22 00:27:33] [INFO ] After 55121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:27:33] [INFO ] After 55241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 580 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 580 transition count 1241
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 11 place count 579 transition count 1241
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1240
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 578 transition count 1230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 568 transition count 1230
Applied a total of 33 rules in 105 ms. Remains 568 /580 variables (removed 12) and now considering 1230/1251 (removed 21) transitions.
Running SMT prover for 1 properties.
[2023-03-22 00:27:33] [INFO ] Invariant cache hit.
[2023-03-22 00:27:33] [INFO ] [Real]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-22 00:27:33] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-22 00:27:33] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:27:33] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-22 00:27:33] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-22 00:27:34] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:27:34] [INFO ] Deduced a trap composed of 222 places in 271 ms of which 0 ms to minimize.
[2023-03-22 00:27:34] [INFO ] Deduced a trap composed of 232 places in 245 ms of which 0 ms to minimize.
[2023-03-22 00:27:35] [INFO ] Deduced a trap composed of 222 places in 263 ms of which 0 ms to minimize.
[2023-03-22 00:27:35] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 0 ms to minimize.
[2023-03-22 00:27:35] [INFO ] Deduced a trap composed of 226 places in 240 ms of which 1 ms to minimize.
[2023-03-22 00:27:35] [INFO ] Deduced a trap composed of 220 places in 223 ms of which 0 ms to minimize.
[2023-03-22 00:27:36] [INFO ] Deduced a trap composed of 232 places in 238 ms of which 0 ms to minimize.
[2023-03-22 00:27:36] [INFO ] Deduced a trap composed of 228 places in 230 ms of which 1 ms to minimize.
[2023-03-22 00:27:36] [INFO ] Deduced a trap composed of 228 places in 241 ms of which 1 ms to minimize.
[2023-03-22 00:27:37] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 0 ms to minimize.
[2023-03-22 00:27:37] [INFO ] Deduced a trap composed of 222 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:27:37] [INFO ] Deduced a trap composed of 222 places in 235 ms of which 0 ms to minimize.
[2023-03-22 00:27:37] [INFO ] Deduced a trap composed of 224 places in 229 ms of which 1 ms to minimize.
[2023-03-22 00:27:38] [INFO ] Deduced a trap composed of 226 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:27:38] [INFO ] Deduced a trap composed of 216 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:27:38] [INFO ] Deduced a trap composed of 224 places in 237 ms of which 1 ms to minimize.
[2023-03-22 00:27:39] [INFO ] Deduced a trap composed of 218 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:27:39] [INFO ] Deduced a trap composed of 234 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:27:39] [INFO ] Deduced a trap composed of 220 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:27:39] [INFO ] Deduced a trap composed of 220 places in 238 ms of which 1 ms to minimize.
[2023-03-22 00:27:40] [INFO ] Deduced a trap composed of 220 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:27:40] [INFO ] Deduced a trap composed of 222 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:27:40] [INFO ] Deduced a trap composed of 222 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:27:41] [INFO ] Deduced a trap composed of 224 places in 238 ms of which 1 ms to minimize.
[2023-03-22 00:27:41] [INFO ] Deduced a trap composed of 226 places in 229 ms of which 0 ms to minimize.
[2023-03-22 00:27:41] [INFO ] Deduced a trap composed of 228 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:27:41] [INFO ] Deduced a trap composed of 232 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:27:42] [INFO ] Deduced a trap composed of 220 places in 244 ms of which 0 ms to minimize.
[2023-03-22 00:27:42] [INFO ] Deduced a trap composed of 222 places in 249 ms of which 1 ms to minimize.
[2023-03-22 00:27:42] [INFO ] Deduced a trap composed of 222 places in 245 ms of which 1 ms to minimize.
[2023-03-22 00:27:42] [INFO ] Deduced a trap composed of 226 places in 240 ms of which 1 ms to minimize.
[2023-03-22 00:27:43] [INFO ] Deduced a trap composed of 226 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:27:43] [INFO ] Deduced a trap composed of 222 places in 230 ms of which 1 ms to minimize.
[2023-03-22 00:27:43] [INFO ] Deduced a trap composed of 235 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:27:44] [INFO ] Deduced a trap composed of 223 places in 239 ms of which 1 ms to minimize.
[2023-03-22 00:27:44] [INFO ] Deduced a trap composed of 232 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:27:44] [INFO ] Deduced a trap composed of 214 places in 241 ms of which 1 ms to minimize.
[2023-03-22 00:27:44] [INFO ] Deduced a trap composed of 222 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:27:45] [INFO ] Deduced a trap composed of 224 places in 229 ms of which 0 ms to minimize.
[2023-03-22 00:31:18] [INFO ] Trap strengthening (SAT) tested/added 39/39 trap constraints in 224619 ms
[2023-03-22 00:31:18] [INFO ] After 224919ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:31:18] [INFO ] After 225023ms 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 2 ms.
Working with output stream class java.io.PrintStream
Total runtime 666342 ms.
starting LoLA
BK_INPUT PolyORBNT-COL-S10J30
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: 16393216 kB
MemFree: 15114400 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16148132 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: 694, Transitions: 12080
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 t81
lola: LAUNCH SYMM
sara: try reading problem file stateEquationProblem-QuasiLiveness-991.sara.
lola: reporting
lola: not produced: 1167
lola: find path: 185
lola: goal oriented search: 13
lola: high level: 10715
lola: reporting
lola: not produced: 1167
lola: find path: 185
lola: goal oriented search: 13
lola: high level: 10715
lola: reporting
lola: not produced: 1167
lola: find path: 185
lola: goal oriented search: 13
lola: high level: 10715
lola: reporting
lola: not produced: 1167
lola: find path: 185
lola: goal oriented search: 13
lola: high level: 10715
lola: reporting
lola: not produced: 1167
lola: find path: 185
lola: goal oriented search: 13
lola: high level: 10715
lola: reporting
lola: not produced: 1167
lola: find path: 185
lola: goal oriented search: 13
lola: high level: 10715
lola: reporting
lola: not produced: 1167
lola: find path: 185
lola: goal oriented search: 13
lola: high level: 10715
lola: reporting
lola: not produced: 1167
lola: find path: 185
lola: goal oriented search: 13
lola: high level: 10715
lola: reporting
lola: not produced: 1167
lola: find path: 185
lola: goal oriented search: 13
lola: high level: 10715
lola: reporting
lola: not produced: 1167
lola: find path: 185
lola: goal oriented search: 13
lola: high level: 10715
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
sara: place or transition ordering is non-deterministic
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843

lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: SARA FINISHED
lola: STATE EQUATION TRIES TRANSITION t95
sara: try reading problem file stateEquationProblem-QuasiLiveness-1035.sara.
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
sara: place or transition ordering is non-deterministic
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843

lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: reporting
lola: not produced: 1034
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10843
lola: SARA FINISHED
lola: STATE EQUATION TRIES TRANSITION t538
sara: try reading problem file stateEquationProblem-QuasiLiveness-10088.sara.
lola: reporting
lola: not produced: 1003
lola: state equation: 1
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1003
lola: state equation: 1
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1003
lola: state equation: 1
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1003
lola: state equation: 1
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1003
lola: state equation: 1
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1003
lola: state equation: 1
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1003
lola: state equation: 1
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1003
lola: state equation: 1
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1003
lola: state equation: 1
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1003
lola: state equation: 1
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1003
lola: state equation: 1
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1003
lola: state equation: 1
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
sara: place or transition ordering is non-deterministic

lola: reporting
lola: not produced: 1003
lola: state equation: 1
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1003
lola: state equation: 1
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1003
lola: state equation: 1
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: SARA FINISHED
lola: STATE EQUATION TRIES TRANSITION t953
sara: try reading problem file stateEquationProblem-QuasiLiveness-1273.sara.
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
sara: place or transition ordering is non-deterministic
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: reporting
lola: not produced: 1002
lola: state equation: 2
lola: find path: 185
lola: goal oriented search: 18
lola: high level: 10873
lola: caught signal Terminated - aborting LoLA

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY


Time elapsed: 1131 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J30"
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-S10J30, 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-167873963000427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J30.tgz
mv PolyORBNT-COL-S10J30 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 ;