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.r021-oct2-167813609000307.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutoFlight-PT-24b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-167813609000307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 6.1K Feb 25 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 18:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 18:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 18:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 538K Mar 5 18:22 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 1678932263498

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=AutoFlight-PT-24b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-16 02:04:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-16 02:04:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 02:04:27] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2023-03-16 02:04:27] [INFO ] Transformed 2230 places.
[2023-03-16 02:04:27] [INFO ] Transformed 2228 transitions.
[2023-03-16 02:04:27] [INFO ] Found NUPN structural information;
[2023-03-16 02:04:28] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 429 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Drop transitions removed 892 transitions
Trivial Post-agglo rules discarded 892 transitions
Performed 892 trivial Post agglomeration. Transition count delta: 892
Iterating post reduction 0 with 892 rules applied. Total rules applied 892 place count 2230 transition count 1336
Reduce places removed 892 places and 0 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 1060 rules applied. Total rules applied 1952 place count 1338 transition count 1168
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 2000 place count 1290 transition count 1168
Performed 295 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 295 Pre rules applied. Total rules applied 2000 place count 1290 transition count 873
Deduced a syphon composed of 295 places in 20 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 3 with 590 rules applied. Total rules applied 2590 place count 995 transition count 873
Performed 434 Post agglomeration using F-continuation condition.Transition count delta: 434
Deduced a syphon composed of 434 places in 1 ms
Reduce places removed 434 places and 0 transitions.
Iterating global reduction 3 with 868 rules applied. Total rules applied 3458 place count 561 transition count 439
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 3458 rules in 338 ms. Remains 561 /2230 variables (removed 1669) and now considering 439/2228 (removed 1789) transitions.
// Phase 1: matrix 439 rows 561 cols
[2023-03-16 02:04:28] [INFO ] Computed 148 place invariants in 19 ms
[2023-03-16 02:04:31] [INFO ] Implicit Places using invariants in 2728 ms returned [560]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2764 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 560/2230 places, 439/2228 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 52 rules applied. Total rules applied 52 place count 534 transition count 413
Applied a total of 52 rules in 14 ms. Remains 534 /560 variables (removed 26) and now considering 413/439 (removed 26) transitions.
// Phase 1: matrix 413 rows 534 cols
[2023-03-16 02:04:31] [INFO ] Computed 147 place invariants in 3 ms
[2023-03-16 02:04:33] [INFO ] Implicit Places using invariants in 2015 ms returned [171, 174, 177, 180, 183, 186, 189, 192, 195, 198, 201, 204, 207, 210, 213, 216, 219, 222, 225, 228, 231, 234, 237, 240]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 2020 ms to find 24 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 510/2230 places, 413/2228 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 510 transition count 389
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 486 transition count 389
Applied a total of 48 rules in 16 ms. Remains 486 /510 variables (removed 24) and now considering 389/413 (removed 24) transitions.
// Phase 1: matrix 389 rows 486 cols
[2023-03-16 02:04:33] [INFO ] Computed 123 place invariants in 6 ms
[2023-03-16 02:04:33] [INFO ] Implicit Places using invariants in 771 ms returned []
[2023-03-16 02:04:33] [INFO ] Invariant cache hit.
[2023-03-16 02:04:34] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-16 02:04:39] [INFO ] Implicit Places using invariants and state equation in 5806 ms returned []
Implicit Place search using SMT with State Equation took 6609 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 486/2230 places, 389/2228 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 11762 ms. Remains : 486/2230 places, 389/2228 transitions.
Discarding 96 transitions out of 389. Remains 293
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 126 resets, run finished after 688 ms. (steps per millisecond=14 ) properties (out of 292) seen :138
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 154) seen :0
Running SMT prover for 154 properties.
[2023-03-16 02:04:40] [INFO ] Invariant cache hit.
[2023-03-16 02:04:45] [INFO ] [Real]Absence check using 123 positive place invariants in 70 ms returned sat
[2023-03-16 02:04:56] [INFO ] After 16291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:154
[2023-03-16 02:04:59] [INFO ] [Nat]Absence check using 123 positive place invariants in 292 ms returned sat
[2023-03-16 02:05:14] [INFO ] After 10755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :154
[2023-03-16 02:05:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-16 02:05:22] [INFO ] After 7368ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :153
[2023-03-16 02:05:22] [INFO ] After 7371ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :153
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-16 02:05:22] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :153
Parikh walk visited 121 properties in 25875 ms.
Support contains 66 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 389/389 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 461 transition count 364
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 461 transition count 364
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 98 place count 461 transition count 316
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 146 place count 413 transition count 316
Applied a total of 146 rules in 94 ms. Remains 413 /486 variables (removed 73) and now considering 316/389 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 413/486 places, 316/389 transitions.
Interrupted random walk after 716074 steps, including 7081 resets, run timeout after 30001 ms. (steps per millisecond=23 ) properties seen 8
Incomplete Best-First random walk after 100001 steps, including 55 resets, run finished after 480 ms. (steps per millisecond=208 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 71 resets, run finished after 518 ms. (steps per millisecond=193 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 76 resets, run finished after 528 ms. (steps per millisecond=189 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100000 steps, including 69 resets, run finished after 551 ms. (steps per millisecond=181 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 70 resets, run finished after 554 ms. (steps per millisecond=180 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 78 resets, run finished after 554 ms. (steps per millisecond=180 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 70 resets, run finished after 560 ms. (steps per millisecond=178 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 71 resets, run finished after 553 ms. (steps per millisecond=180 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 73 resets, run finished after 543 ms. (steps per millisecond=184 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 74 resets, run finished after 480 ms. (steps per millisecond=208 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 73 resets, run finished after 558 ms. (steps per millisecond=179 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100000 steps, including 74 resets, run finished after 545 ms. (steps per millisecond=183 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 75 resets, run finished after 532 ms. (steps per millisecond=187 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 64 resets, run finished after 554 ms. (steps per millisecond=180 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 73 resets, run finished after 542 ms. (steps per millisecond=184 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 73 resets, run finished after 535 ms. (steps per millisecond=186 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 69 resets, run finished after 503 ms. (steps per millisecond=198 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 73 resets, run finished after 511 ms. (steps per millisecond=195 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 67 resets, run finished after 529 ms. (steps per millisecond=189 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 70 resets, run finished after 590 ms. (steps per millisecond=169 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 75 resets, run finished after 689 ms. (steps per millisecond=145 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 65 resets, run finished after 522 ms. (steps per millisecond=191 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 74 resets, run finished after 503 ms. (steps per millisecond=198 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 71 resets, run finished after 507 ms. (steps per millisecond=197 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 75 resets, run finished after 500 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
// Phase 1: matrix 316 rows 413 cols
[2023-03-16 02:06:31] [INFO ] Computed 123 place invariants in 2 ms
[2023-03-16 02:06:31] [INFO ] [Real]Absence check using 123 positive place invariants in 27 ms returned sat
[2023-03-16 02:06:34] [INFO ] After 3180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-16 02:06:34] [INFO ] [Nat]Absence check using 123 positive place invariants in 35 ms returned sat
[2023-03-16 02:06:36] [INFO ] After 1123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-16 02:06:36] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-16 02:06:38] [INFO ] After 2406ms SMT Verify possible using 168 Read/Feed constraints in natural domain returned unsat :0 sat :25
[2023-03-16 02:06:42] [INFO ] After 6168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 2703 ms.
[2023-03-16 02:06:45] [INFO ] After 10484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Parikh walk visited 0 properties in 1221 ms.
Support contains 50 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 316/316 transitions.
Applied a total of 0 rules in 14 ms. Remains 413 /413 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 413/413 places, 316/316 transitions.
Interrupted random walk after 684018 steps, including 6776 resets, run timeout after 30001 ms. (steps per millisecond=22 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 58 resets, run finished after 730 ms. (steps per millisecond=136 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100000 steps, including 68 resets, run finished after 864 ms. (steps per millisecond=115 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 77 resets, run finished after 599 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 72 resets, run finished after 538 ms. (steps per millisecond=185 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 74 resets, run finished after 555 ms. (steps per millisecond=180 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 74 resets, run finished after 560 ms. (steps per millisecond=178 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 69 resets, run finished after 557 ms. (steps per millisecond=179 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 71 resets, run finished after 553 ms. (steps per millisecond=180 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 72 resets, run finished after 547 ms. (steps per millisecond=182 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 69 resets, run finished after 556 ms. (steps per millisecond=179 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 70 resets, run finished after 545 ms. (steps per millisecond=183 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 72 resets, run finished after 540 ms. (steps per millisecond=185 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 74 resets, run finished after 551 ms. (steps per millisecond=181 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 75 resets, run finished after 540 ms. (steps per millisecond=185 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 77 resets, run finished after 544 ms. (steps per millisecond=183 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 76 resets, run finished after 531 ms. (steps per millisecond=188 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 71 resets, run finished after 514 ms. (steps per millisecond=194 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 70 resets, run finished after 508 ms. (steps per millisecond=196 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100000 steps, including 73 resets, run finished after 511 ms. (steps per millisecond=195 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 76 resets, run finished after 544 ms. (steps per millisecond=183 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 74 resets, run finished after 549 ms. (steps per millisecond=182 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 74 resets, run finished after 537 ms. (steps per millisecond=186 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 72 resets, run finished after 534 ms. (steps per millisecond=187 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 76 resets, run finished after 541 ms. (steps per millisecond=184 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 73 resets, run finished after 550 ms. (steps per millisecond=181 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 6775461 steps, run timeout after 132001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 6775461 steps, saw 2151526 distinct states, run finished after 132005 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 25 properties.
[2023-03-16 02:09:42] [INFO ] Invariant cache hit.
[2023-03-16 02:09:42] [INFO ] [Real]Absence check using 123 positive place invariants in 64 ms returned sat
[2023-03-16 02:09:44] [INFO ] After 2531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-16 02:09:46] [INFO ] [Nat]Absence check using 123 positive place invariants in 35 ms returned sat
[2023-03-16 02:09:47] [INFO ] After 1320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-16 02:09:47] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-16 02:09:50] [INFO ] After 2242ms SMT Verify possible using 168 Read/Feed constraints in natural domain returned unsat :0 sat :25
[2023-03-16 02:09:53] [INFO ] After 5538ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 2474 ms.
[2023-03-16 02:09:55] [INFO ] After 10996ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Parikh walk visited 0 properties in 1459 ms.
Support contains 50 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 316/316 transitions.
Applied a total of 0 rules in 14 ms. Remains 413 /413 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 413/413 places, 316/316 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 316/316 transitions.
Applied a total of 0 rules in 14 ms. Remains 413 /413 variables (removed 0) and now considering 316/316 (removed 0) transitions.
[2023-03-16 02:09:57] [INFO ] Invariant cache hit.
[2023-03-16 02:10:01] [INFO ] Implicit Places using invariants in 4330 ms returned [1, 2, 6, 7, 11, 12, 16, 17, 21, 22, 26, 27, 31, 32, 36, 37, 41, 42, 46, 47, 51, 52, 56, 57, 61, 62, 66, 67, 71, 72, 76, 77, 81, 82, 86, 87, 91, 92, 96, 97, 101, 102, 106, 107, 111, 112, 116, 117, 243, 316, 320, 324, 328, 332, 336, 340, 344, 348, 352, 356, 360, 364, 368, 372, 376, 380, 384, 388, 392, 396, 400, 404, 408]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 4345 ms to find 73 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 340/413 places, 316/316 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 340 transition count 270
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 294 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 293 transition count 269
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 94 place count 293 transition count 244
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 144 place count 268 transition count 244
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 167 place count 245 transition count 221
Iterating global reduction 3 with 23 rules applied. Total rules applied 190 place count 245 transition count 221
Applied a total of 190 rules in 66 ms. Remains 245 /340 variables (removed 95) and now considering 221/316 (removed 95) transitions.
// Phase 1: matrix 221 rows 245 cols
[2023-03-16 02:10:01] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-16 02:10:02] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-16 02:10:02] [INFO ] Invariant cache hit.
[2023-03-16 02:10:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:10:02] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 245/413 places, 221/316 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5312 ms. Remains : 245/413 places, 221/316 transitions.
Interrupted random walk after 699842 steps, including 10885 resets, run timeout after 30001 ms. (steps per millisecond=23 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 63 resets, run finished after 389 ms. (steps per millisecond=257 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 88 resets, run finished after 315 ms. (steps per millisecond=317 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 83 resets, run finished after 352 ms. (steps per millisecond=284 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 76 resets, run finished after 364 ms. (steps per millisecond=274 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 80 resets, run finished after 344 ms. (steps per millisecond=290 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100000 steps, including 83 resets, run finished after 337 ms. (steps per millisecond=296 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 79 resets, run finished after 356 ms. (steps per millisecond=280 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 77 resets, run finished after 355 ms. (steps per millisecond=281 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 77 resets, run finished after 356 ms. (steps per millisecond=280 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 85 resets, run finished after 349 ms. (steps per millisecond=286 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 80 resets, run finished after 353 ms. (steps per millisecond=283 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 82 resets, run finished after 350 ms. (steps per millisecond=285 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 83 resets, run finished after 331 ms. (steps per millisecond=302 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 84 resets, run finished after 334 ms. (steps per millisecond=299 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 85 resets, run finished after 341 ms. (steps per millisecond=293 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 83 resets, run finished after 350 ms. (steps per millisecond=285 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 76 resets, run finished after 353 ms. (steps per millisecond=283 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 84 resets, run finished after 333 ms. (steps per millisecond=300 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 78 resets, run finished after 356 ms. (steps per millisecond=280 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 78 resets, run finished after 350 ms. (steps per millisecond=285 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 82 resets, run finished after 345 ms. (steps per millisecond=289 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 83 resets, run finished after 345 ms. (steps per millisecond=289 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 87 resets, run finished after 339 ms. (steps per millisecond=294 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 84 resets, run finished after 344 ms. (steps per millisecond=290 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 76 resets, run finished after 356 ms. (steps per millisecond=280 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 14606857 steps, run timeout after 114001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 14606857 steps, saw 1842572 distinct states, run finished after 114002 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 25 properties.
[2023-03-16 02:12:35] [INFO ] Invariant cache hit.
[2023-03-16 02:12:35] [INFO ] [Real]Absence check using 50 positive place invariants in 14 ms returned sat
[2023-03-16 02:12:36] [INFO ] After 1140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-16 02:12:36] [INFO ] [Nat]Absence check using 50 positive place invariants in 20 ms returned sat
[2023-03-16 02:12:38] [INFO ] After 957ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-16 02:12:38] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:12:39] [INFO ] After 666ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :25
[2023-03-16 02:12:40] [INFO ] After 1751ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 631 ms.
[2023-03-16 02:12:40] [INFO ] After 4369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Parikh walk visited 0 properties in 1875 ms.
Support contains 50 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Applied a total of 0 rules in 7 ms. Remains 245 /245 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 245/245 places, 221/221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Applied a total of 0 rules in 5 ms. Remains 245 /245 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2023-03-16 02:12:42] [INFO ] Invariant cache hit.
[2023-03-16 02:12:42] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-16 02:12:43] [INFO ] Invariant cache hit.
[2023-03-16 02:12:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:12:43] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2023-03-16 02:12:43] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-16 02:12:43] [INFO ] Invariant cache hit.
[2023-03-16 02:12:43] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 690 ms. Remains : 245/245 places, 221/221 transitions.
Incomplete random walk after 100000 steps, including 1535 resets, run finished after 4692 ms. (steps per millisecond=21 ) properties (out of 50) seen :25
Running SMT prover for 25 properties.
[2023-03-16 02:12:48] [INFO ] Invariant cache hit.
[2023-03-16 02:12:48] [INFO ] [Real]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-16 02:12:48] [INFO ] After 74ms SMT Verify possible using state equation in real domain returned unsat :0 sat :25
[2023-03-16 02:12:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:12:48] [INFO ] After 57ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :25
[2023-03-16 02:12:49] [INFO ] After 1075ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-16 02:12:49] [INFO ] After 1217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-16 02:12:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 13 ms returned sat
[2023-03-16 02:12:49] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-16 02:12:49] [INFO ] After 111ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :25
[2023-03-16 02:12:50] [INFO ] After 988ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 243 ms.
[2023-03-16 02:12:51] [INFO ] After 1541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Interrupted random walk after 648876 steps, including 9971 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 58 resets, run finished after 293 ms. (steps per millisecond=341 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 79 resets, run finished after 320 ms. (steps per millisecond=312 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 81 resets, run finished after 319 ms. (steps per millisecond=313 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100000 steps, including 81 resets, run finished after 319 ms. (steps per millisecond=313 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 85 resets, run finished after 321 ms. (steps per millisecond=311 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 81 resets, run finished after 328 ms. (steps per millisecond=304 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 82 resets, run finished after 321 ms. (steps per millisecond=311 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 81 resets, run finished after 318 ms. (steps per millisecond=314 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 87 resets, run finished after 305 ms. (steps per millisecond=327 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 79 resets, run finished after 330 ms. (steps per millisecond=303 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 82 resets, run finished after 326 ms. (steps per millisecond=306 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 82 resets, run finished after 309 ms. (steps per millisecond=323 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 80 resets, run finished after 318 ms. (steps per millisecond=314 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 81 resets, run finished after 335 ms. (steps per millisecond=298 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 80 resets, run finished after 308 ms. (steps per millisecond=324 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 77 resets, run finished after 364 ms. (steps per millisecond=274 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 86 resets, run finished after 403 ms. (steps per millisecond=248 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 78 resets, run finished after 338 ms. (steps per millisecond=295 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 82 resets, run finished after 334 ms. (steps per millisecond=299 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 78 resets, run finished after 345 ms. (steps per millisecond=289 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 84 resets, run finished after 341 ms. (steps per millisecond=293 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 79 resets, run finished after 356 ms. (steps per millisecond=280 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 86 resets, run finished after 333 ms. (steps per millisecond=300 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 85 resets, run finished after 346 ms. (steps per millisecond=289 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 81 resets, run finished after 342 ms. (steps per millisecond=292 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 14255513 steps, run timeout after 114001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 14255513 steps, saw 1811695 distinct states, run finished after 114001 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 25 properties.
[2023-03-16 02:15:23] [INFO ] Invariant cache hit.
[2023-03-16 02:15:23] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-16 02:15:24] [INFO ] After 1032ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-16 02:15:24] [INFO ] [Nat]Absence check using 50 positive place invariants in 21 ms returned sat
[2023-03-16 02:15:25] [INFO ] After 665ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-16 02:15:25] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:15:26] [INFO ] After 599ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :25
[2023-03-16 02:15:27] [INFO ] After 1664ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 543 ms.
[2023-03-16 02:15:27] [INFO ] After 3372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Parikh walk visited 0 properties in 2100 ms.
Support contains 50 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Applied a total of 0 rules in 5 ms. Remains 245 /245 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 245/245 places, 221/221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Applied a total of 0 rules in 5 ms. Remains 245 /245 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2023-03-16 02:15:29] [INFO ] Invariant cache hit.
[2023-03-16 02:15:29] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-16 02:15:29] [INFO ] Invariant cache hit.
[2023-03-16 02:15:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:15:30] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2023-03-16 02:15:30] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 02:15:30] [INFO ] Invariant cache hit.
[2023-03-16 02:15:30] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 708 ms. Remains : 245/245 places, 221/221 transitions.
Incomplete random walk after 100000 steps, including 1553 resets, run finished after 4620 ms. (steps per millisecond=21 ) properties (out of 50) seen :25
Running SMT prover for 25 properties.
[2023-03-16 02:15:35] [INFO ] Invariant cache hit.
[2023-03-16 02:15:35] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-16 02:15:35] [INFO ] After 78ms SMT Verify possible using state equation in real domain returned unsat :0 sat :25
[2023-03-16 02:15:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:15:35] [INFO ] After 59ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :25
[2023-03-16 02:15:36] [INFO ] After 1043ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-16 02:15:36] [INFO ] After 1190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-16 02:15:36] [INFO ] [Nat]Absence check using 50 positive place invariants in 14 ms returned sat
[2023-03-16 02:15:36] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-16 02:15:36] [INFO ] After 72ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :25
[2023-03-16 02:15:37] [INFO ] After 923ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-16 02:15:37] [INFO ] After 1280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Incomplete random walk after 10000 steps, including 148 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1255466 steps, run timeout after 3001 ms. (steps per millisecond=418 ) properties seen :{}
Probabilistic random walk after 1255466 steps, saw 190509 distinct states, run finished after 3001 ms. (steps per millisecond=418 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:15:40] [INFO ] Invariant cache hit.
[2023-03-16 02:15:40] [INFO ] [Real]Absence check using 50 positive place invariants in 17 ms returned sat
[2023-03-16 02:15:40] [INFO ] After 89ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 02:15:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:15:40] [INFO ] After 16ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:15:40] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:15:40] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-16 02:15:41] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:15:41] [INFO ] After 33ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:15:41] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-16 02:15:41] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 244 transition count 220
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 75 place count 244 transition count 147
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 294 edges and 171 vertex of which 123 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.4 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 173 place count 123 transition count 123
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 197 place count 123 transition count 99
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 198 place count 123 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 199 place count 122 transition count 98
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 95 edges and 98 vertex of which 48 / 98 are part of one of the 1 SCC in 4 ms
Free SCC test removed 47 places
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 2 with 70 rules applied. Total rules applied 269 place count 51 transition count 53
Reduce places removed 45 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 94 rules applied. Total rules applied 363 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 364 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 364 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 366 place count 4 transition count 3
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 367 place count 4 transition count 3
Applied a total of 367 rules in 59 ms. Remains 4 /245 variables (removed 241) and now considering 3/221 (removed 218) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 4/245 places, 3/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 154 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1290290 steps, run timeout after 3001 ms. (steps per millisecond=429 ) properties seen :{}
Probabilistic random walk after 1290290 steps, saw 195289 distinct states, run finished after 3001 ms. (steps per millisecond=429 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:15:44] [INFO ] Invariant cache hit.
[2023-03-16 02:15:44] [INFO ] [Real]Absence check using 50 positive place invariants in 17 ms returned sat
[2023-03-16 02:15:44] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:15:44] [INFO ] [Nat]Absence check using 50 positive place invariants in 16 ms returned sat
[2023-03-16 02:15:44] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:15:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:15:44] [INFO ] After 24ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:15:44] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-16 02:15:44] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 49 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 154 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1254554 steps, run timeout after 3001 ms. (steps per millisecond=418 ) properties seen :{}
Probabilistic random walk after 1254554 steps, saw 190397 distinct states, run finished after 3001 ms. (steps per millisecond=418 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:15:47] [INFO ] Invariant cache hit.
[2023-03-16 02:15:48] [INFO ] [Real]Absence check using 50 positive place invariants in 17 ms returned sat
[2023-03-16 02:15:48] [INFO ] After 130ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 02:15:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:15:48] [INFO ] After 39ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:15:48] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:15:48] [INFO ] [Nat]Absence check using 50 positive place invariants in 15 ms returned sat
[2023-03-16 02:15:48] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:15:48] [INFO ] After 23ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:15:48] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-16 02:15:48] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 1 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 45 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 165 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1300880 steps, run timeout after 3001 ms. (steps per millisecond=433 ) properties seen :{}
Probabilistic random walk after 1300880 steps, saw 196681 distinct states, run finished after 3001 ms. (steps per millisecond=433 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:15:51] [INFO ] Invariant cache hit.
[2023-03-16 02:15:52] [INFO ] [Real]Absence check using 50 positive place invariants in 181 ms returned sat
[2023-03-16 02:15:52] [INFO ] After 103ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 02:15:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:15:52] [INFO ] After 20ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:15:52] [INFO ] After 473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:15:52] [INFO ] [Nat]Absence check using 50 positive place invariants in 98 ms returned sat
[2023-03-16 02:15:52] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:15:52] [INFO ] After 18ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:15:52] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-16 02:15:52] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 37 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 160 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1246771 steps, run timeout after 3001 ms. (steps per millisecond=415 ) properties seen :{}
Probabilistic random walk after 1246771 steps, saw 189519 distinct states, run finished after 3001 ms. (steps per millisecond=415 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:15:55] [INFO ] Invariant cache hit.
[2023-03-16 02:15:55] [INFO ] [Real]Absence check using 50 positive place invariants in 19 ms returned sat
[2023-03-16 02:15:55] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:15:56] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-16 02:15:56] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:15:56] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:15:56] [INFO ] After 23ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:15:56] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-16 02:15:56] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 1 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 36 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 152 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1285456 steps, run timeout after 3001 ms. (steps per millisecond=428 ) properties seen :{}
Probabilistic random walk after 1285456 steps, saw 194778 distinct states, run finished after 3013 ms. (steps per millisecond=426 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:15:59] [INFO ] Invariant cache hit.
[2023-03-16 02:15:59] [INFO ] [Real]Absence check using 50 positive place invariants in 174 ms returned sat
[2023-03-16 02:15:59] [INFO ] After 92ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 02:15:59] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:15:59] [INFO ] After 26ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:15:59] [INFO ] After 399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:15:59] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-16 02:15:59] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:15:59] [INFO ] After 24ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:00] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-16 02:16:00] [INFO ] After 274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 35 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 153 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1374110 steps, run timeout after 3001 ms. (steps per millisecond=457 ) properties seen :{}
Probabilistic random walk after 1374110 steps, saw 205319 distinct states, run finished after 3001 ms. (steps per millisecond=457 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:16:03] [INFO ] Invariant cache hit.
[2023-03-16 02:16:03] [INFO ] [Real]Absence check using 50 positive place invariants in 16 ms returned sat
[2023-03-16 02:16:03] [INFO ] After 109ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 02:16:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:16:03] [INFO ] After 36ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:03] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:03] [INFO ] [Nat]Absence check using 50 positive place invariants in 68 ms returned sat
[2023-03-16 02:16:03] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:03] [INFO ] After 30ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:03] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-16 02:16:04] [INFO ] After 662ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 27 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 154 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1349433 steps, run timeout after 3001 ms. (steps per millisecond=449 ) properties seen :{}
Probabilistic random walk after 1349433 steps, saw 201931 distinct states, run finished after 3001 ms. (steps per millisecond=449 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:16:07] [INFO ] Invariant cache hit.
[2023-03-16 02:16:07] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-16 02:16:07] [INFO ] After 95ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 02:16:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:16:07] [INFO ] After 18ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:07] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:07] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-16 02:16:07] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:07] [INFO ] After 22ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:07] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-16 02:16:07] [INFO ] After 344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 20 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 163 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1320144 steps, run timeout after 3001 ms. (steps per millisecond=439 ) properties seen :{}
Probabilistic random walk after 1320144 steps, saw 198865 distinct states, run finished after 3001 ms. (steps per millisecond=439 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:16:10] [INFO ] Invariant cache hit.
[2023-03-16 02:16:10] [INFO ] [Real]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-16 02:16:10] [INFO ] After 98ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 02:16:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:16:10] [INFO ] After 20ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:10] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:11] [INFO ] [Nat]Absence check using 50 positive place invariants in 16 ms returned sat
[2023-03-16 02:16:11] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:11] [INFO ] After 22ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:11] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-16 02:16:11] [INFO ] After 310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 1 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 31 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 159 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1348117 steps, run timeout after 3001 ms. (steps per millisecond=449 ) properties seen :{}
Probabilistic random walk after 1348117 steps, saw 201729 distinct states, run finished after 3001 ms. (steps per millisecond=449 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:16:14] [INFO ] Invariant cache hit.
[2023-03-16 02:16:14] [INFO ] [Real]Absence check using 50 positive place invariants in 18 ms returned sat
[2023-03-16 02:16:14] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-16 02:16:14] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:14] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:16:14] [INFO ] After 17ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:14] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-16 02:16:14] [INFO ] After 302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 33 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 155 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1298514 steps, run timeout after 3001 ms. (steps per millisecond=432 ) properties seen :{}
Probabilistic random walk after 1298514 steps, saw 196411 distinct states, run finished after 3001 ms. (steps per millisecond=432 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:16:18] [INFO ] Invariant cache hit.
[2023-03-16 02:16:18] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2023-03-16 02:16:18] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:18] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-16 02:16:18] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:18] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:16:18] [INFO ] After 21ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:18] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-16 02:16:18] [INFO ] After 386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 37 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 150 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1343859 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :{}
Probabilistic random walk after 1343859 steps, saw 201205 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:16:21] [INFO ] Invariant cache hit.
[2023-03-16 02:16:21] [INFO ] [Real]Absence check using 50 positive place invariants in 15 ms returned sat
[2023-03-16 02:16:22] [INFO ] After 145ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 02:16:22] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:16:22] [INFO ] After 23ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:22] [INFO ] After 316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:22] [INFO ] [Nat]Absence check using 50 positive place invariants in 20 ms returned sat
[2023-03-16 02:16:22] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:22] [INFO ] After 22ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:22] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-16 02:16:22] [INFO ] After 308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 34 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 164 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1265429 steps, run timeout after 3001 ms. (steps per millisecond=421 ) properties seen :{}
Probabilistic random walk after 1265429 steps, saw 192003 distinct states, run finished after 3011 ms. (steps per millisecond=420 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:16:25] [INFO ] Invariant cache hit.
[2023-03-16 02:16:25] [INFO ] [Real]Absence check using 50 positive place invariants in 331 ms returned sat
[2023-03-16 02:16:26] [INFO ] After 157ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 02:16:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:16:26] [INFO ] After 21ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:26] [INFO ] After 673ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-16 02:16:26] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:26] [INFO ] After 20ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:26] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-16 02:16:26] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 17 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 150 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1364376 steps, run timeout after 3001 ms. (steps per millisecond=454 ) properties seen :{}
Probabilistic random walk after 1364376 steps, saw 203957 distinct states, run finished after 3001 ms. (steps per millisecond=454 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:16:29] [INFO ] Invariant cache hit.
[2023-03-16 02:16:29] [INFO ] [Real]Absence check using 50 positive place invariants in 19 ms returned sat
[2023-03-16 02:16:29] [INFO ] After 148ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 02:16:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:16:29] [INFO ] After 50ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:29] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:29] [INFO ] [Nat]Absence check using 50 positive place invariants in 14 ms returned sat
[2023-03-16 02:16:30] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:30] [INFO ] After 25ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:30] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-16 02:16:30] [INFO ] After 339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 14 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 150 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1331790 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :{}
Probabilistic random walk after 1331790 steps, saw 199943 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:16:33] [INFO ] Invariant cache hit.
[2023-03-16 02:16:33] [INFO ] [Real]Absence check using 50 positive place invariants in 16 ms returned sat
[2023-03-16 02:16:33] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:33] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2023-03-16 02:16:33] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:16:33] [INFO ] After 18ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:33] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-16 02:16:33] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 17 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 151 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1351684 steps, run timeout after 3001 ms. (steps per millisecond=450 ) properties seen :{}
Probabilistic random walk after 1351684 steps, saw 202255 distinct states, run finished after 3002 ms. (steps per millisecond=450 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:16:36] [INFO ] Invariant cache hit.
[2023-03-16 02:16:36] [INFO ] [Real]Absence check using 50 positive place invariants in 15 ms returned sat
[2023-03-16 02:16:37] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 23 ms returned sat
[2023-03-16 02:16:37] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:16:37] [INFO ] After 24ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:37] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-16 02:16:37] [INFO ] After 296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 31 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 147 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1419757 steps, run timeout after 3001 ms. (steps per millisecond=473 ) properties seen :{}
Probabilistic random walk after 1419757 steps, saw 213211 distinct states, run finished after 3001 ms. (steps per millisecond=473 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:16:40] [INFO ] Invariant cache hit.
[2023-03-16 02:16:40] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2023-03-16 02:16:40] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:40] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-16 02:16:41] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:16:41] [INFO ] After 21ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:41] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-16 02:16:41] [INFO ] After 383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 40 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 155 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1409125 steps, run timeout after 3001 ms. (steps per millisecond=469 ) properties seen :{}
Probabilistic random walk after 1409125 steps, saw 211029 distinct states, run finished after 3001 ms. (steps per millisecond=469 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:16:44] [INFO ] Invariant cache hit.
[2023-03-16 02:16:44] [INFO ] [Real]Absence check using 50 positive place invariants in 16 ms returned sat
[2023-03-16 02:16:44] [INFO ] After 96ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 02:16:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:16:44] [INFO ] After 18ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:44] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:44] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2023-03-16 02:16:44] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:44] [INFO ] After 19ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:44] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-16 02:16:44] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 1 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 36 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 154 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1372800 steps, run timeout after 3001 ms. (steps per millisecond=457 ) properties seen :{}
Probabilistic random walk after 1372800 steps, saw 205161 distinct states, run finished after 3001 ms. (steps per millisecond=457 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:16:47] [INFO ] Invariant cache hit.
[2023-03-16 02:16:47] [INFO ] [Real]Absence check using 50 positive place invariants in 15 ms returned sat
[2023-03-16 02:16:48] [INFO ] After 112ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 02:16:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:16:48] [INFO ] After 17ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:48] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:48] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-16 02:16:48] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:48] [INFO ] After 20ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:48] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-16 02:16:48] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 1 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 32 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 155 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1346255 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :{}
Probabilistic random walk after 1346255 steps, saw 201497 distinct states, run finished after 3004 ms. (steps per millisecond=448 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:16:51] [INFO ] Invariant cache hit.
[2023-03-16 02:16:51] [INFO ] [Real]Absence check using 50 positive place invariants in 16 ms returned sat
[2023-03-16 02:16:51] [INFO ] After 109ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 02:16:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:16:51] [INFO ] After 27ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:51] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:51] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2023-03-16 02:16:51] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:51] [INFO ] After 23ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:51] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-16 02:16:51] [INFO ] After 310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 30 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 151 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1393031 steps, run timeout after 3001 ms. (steps per millisecond=464 ) properties seen :{}
Probabilistic random walk after 1393031 steps, saw 208431 distinct states, run finished after 3001 ms. (steps per millisecond=464 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:16:55] [INFO ] Invariant cache hit.
[2023-03-16 02:16:55] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2023-03-16 02:16:55] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:55] [INFO ] [Nat]Absence check using 50 positive place invariants in 14 ms returned sat
[2023-03-16 02:16:55] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:16:55] [INFO ] After 33ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:55] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-16 02:16:55] [INFO ] After 352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 1 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 35 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 157 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1418639 steps, run timeout after 3001 ms. (steps per millisecond=472 ) properties seen :{}
Probabilistic random walk after 1418639 steps, saw 213011 distinct states, run finished after 3001 ms. (steps per millisecond=472 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:16:58] [INFO ] Invariant cache hit.
[2023-03-16 02:16:58] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-16 02:16:58] [INFO ] After 116ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 02:16:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:16:59] [INFO ] After 24ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:59] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:16:59] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-16 02:16:59] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:59] [INFO ] After 34ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:16:59] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-16 02:16:59] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 1 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 28 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 155 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1372124 steps, run timeout after 3001 ms. (steps per millisecond=457 ) properties seen :{}
Probabilistic random walk after 1372124 steps, saw 205087 distinct states, run finished after 3001 ms. (steps per millisecond=457 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:17:02] [INFO ] Invariant cache hit.
[2023-03-16 02:17:02] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-16 02:17:02] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:17:02] [INFO ] [Nat]Absence check using 50 positive place invariants in 16 ms returned sat
[2023-03-16 02:17:03] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:17:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:17:03] [INFO ] After 43ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:17:03] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-16 02:17:03] [INFO ] After 382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 36 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 155 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1335336 steps, run timeout after 3001 ms. (steps per millisecond=444 ) properties seen :{}
Probabilistic random walk after 1335336 steps, saw 200249 distinct states, run finished after 3001 ms. (steps per millisecond=444 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:17:06] [INFO ] Invariant cache hit.
[2023-03-16 02:17:06] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-16 02:17:06] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:17:06] [INFO ] [Nat]Absence check using 50 positive place invariants in 13 ms returned sat
[2023-03-16 02:17:06] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:17:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:17:06] [INFO ] After 21ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:17:06] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-16 02:17:06] [INFO ] After 283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 92 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 47 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 69 rules applied. Total rules applied 271 place count 49 transition count 52
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 93 rules applied. Total rules applied 364 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 30 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 150 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1383412 steps, run timeout after 3001 ms. (steps per millisecond=460 ) properties seen :{}
Probabilistic random walk after 1383412 steps, saw 207089 distinct states, run finished after 3001 ms. (steps per millisecond=460 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:17:09] [INFO ] Invariant cache hit.
[2023-03-16 02:17:09] [INFO ] [Real]Absence check using 50 positive place invariants in 16 ms returned sat
[2023-03-16 02:17:10] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:17:10] [INFO ] [Nat]Absence check using 50 positive place invariants in 14 ms returned sat
[2023-03-16 02:17:10] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:17:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-16 02:17:10] [INFO ] After 24ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:17:10] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-16 02:17:10] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 243 transition count 219
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 77 place count 243 transition count 146
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 293 edges and 170 vertex of which 122 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 98 rules applied. Total rules applied 175 place count 122 transition count 122
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 199 place count 122 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 122 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 121 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 120 transition count 96
Reduce places removed 24 places and 0 transitions.
Graph (trivial) has 93 edges and 96 vertex of which 48 / 96 are part of one of the 1 SCC in 1 ms
Free SCC test removed 47 places
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 3 with 70 rules applied. Total rules applied 272 place count 49 transition count 51
Reduce places removed 45 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 4 with 93 rules applied. Total rules applied 365 place count 4 transition count 3
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 366 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 2 transition count 2
Applied a total of 368 rules in 28 ms. Remains 2 /245 variables (removed 243) and now considering 2/221 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 2/245 places, 2/221 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Graph (complete) has 464 edges and 245 vertex of which 221 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 221 transition count 199
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 199 transition count 199
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 45 place count 199 transition count 198
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 198 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 197 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 197 transition count 197
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 2 with 48 rules applied. Total rules applied 97 place count 197 transition count 197
Applied a total of 97 rules in 23 ms. Remains 197 /245 variables (removed 48) and now considering 197/221 (removed 24) transitions.
Running SMT prover for 25 properties.
// Phase 1: matrix 197 rows 197 cols
[2023-03-16 02:17:10] [INFO ] Computed 26 place invariants in 5 ms
[2023-03-16 02:17:10] [INFO ] [Real]Absence check using 26 positive place invariants in 13 ms returned sat
[2023-03-16 02:17:11] [INFO ] After 1082ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-16 02:17:11] [INFO ] [Nat]Absence check using 26 positive place invariants in 83 ms returned sat
[2023-03-16 02:17:12] [INFO ] After 465ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-16 02:17:13] [INFO ] After 1284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 463 ms.
[2023-03-16 02:17:13] [INFO ] After 2258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Unable to solve all queries for examination QuasiLiveness. Remains :25 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 25 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 766282 ms.
starting LoLA
BK_INPUT AutoFlight-PT-24b
BK_EXAMINATION: QuasiLiveness
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
GlobalProperty: QuasiLiveness

FORMULA QuasiLiveness TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678933034414

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: STATE EQUATION TRIES TRANSITION t2192
lola: LAUNCH SYMM
lola: The net is quasilive
sara: try reading problem file stateEquationProblem-QuasiLiveness-301.sara.
sara: place or transition ordering is non-deterministic

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="AutoFlight-PT-24b"
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 AutoFlight-PT-24b, 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 r021-oct2-167813609000307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-24b.tgz
mv AutoFlight-PT-24b 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 ;