MCC'2024- Execution of r166-smll-171636274400123

About the Execution of GreatSPN+red for EisenbergMcGuire-PT-09

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
11559.644	1800000.00	4955386.00	2164.10	[undef]	Time out reached

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r166-smll-171636274400123.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is EisenbergMcGuire-PT-09, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-171636274400123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.3M May 18 16:42 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 StableMarking

=== Now, execution of the tool begins

BK_START 1716487306123

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 18:01:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-23 18:01:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 18:01:48] [INFO ] Load time of PNML (sax parser for PT used): 493 ms
[2024-05-23 18:01:48] [INFO ] Transformed 891 places.
[2024-05-23 18:01:48] [INFO ] Transformed 3888 transitions.
[2024-05-23 18:01:48] [INFO ] Found NUPN structural information;
[2024-05-23 18:01:48] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 705 ms.
RANDOM walk for 40000 steps (8 resets) in 3483 ms. (11 steps per ms) remains 291/891 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 25 ms. (15 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 291/291 properties
[2024-05-23 18:01:50] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
// Phase 1: matrix 1809 rows 891 cols
[2024-05-23 18:01:50] [INFO ] Computed 28 invariants in 36 ms
[2024-05-23 18:01:50] [INFO ] State equation strengthened by 932 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 291/291 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 291/2700 variables, and 291 constraints, problems are : Problem set: 0 solved, 291 unsolved in 5091 ms.
Refiners :[Domain max(s): 291/891 constraints, Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/891 constraints, ReadFeed: 0/932 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 291/291 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/291 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 573/864 variables, 18/309 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/864 variables, 573/882 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 864/2700 variables, and 882 constraints, problems are : Problem set: 0 solved, 291 unsolved in 5040 ms.
Refiners :[Domain max(s): 864/891 constraints, Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/891 constraints, ReadFeed: 0/932 constraints, PredecessorRefiner: 0/291 constraints, Known Traps: 0/0 constraints]
After SMT, in 10542ms problems are : Problem set: 0 solved, 291 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 291 out of 891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 891 transition count 3879
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 882 transition count 3879
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 18 place count 882 transition count 3699
Deduced a syphon composed of 180 places in 7 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 378 place count 702 transition count 3699
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 450 place count 630 transition count 3051
Iterating global reduction 2 with 72 rules applied. Total rules applied 522 place count 630 transition count 3051
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 6 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 656 place count 563 transition count 2984
Applied a total of 656 rules in 706 ms. Remains 563 /891 variables (removed 328) and now considering 2984/3888 (removed 904) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 724 ms. Remains : 563/891 places, 2984/3888 transitions.
RANDOM walk for 4000000 steps (8 resets) in 97287 ms. (41 steps per ms) remains 278/291 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 278/278 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 278/278 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 278/278 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 278/278 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 277/278 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 277/277 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 277/277 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 277/277 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 277/277 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 277/277 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 277/277 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 277/277 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 277/277 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 276/277 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 275/276 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 275/275 properties
Interrupted probabilistic random walk after 3534500 steps, run timeout after 81001 ms. (steps per millisecond=43 ) properties seen :254 out of 275
Probabilistic random walk after 3534500 steps, saw 1675964 distinct states, run finished after 81017 ms. (steps per millisecond=43 ) properties seen :254
[2024-05-23 18:03:49] [INFO ] Flow matrix only has 905 transitions (discarded 2079 similar events)
// Phase 1: matrix 905 rows 563 cols
[2024-05-23 18:03:49] [INFO ] Computed 28 invariants in 9 ms
[2024-05-23 18:03:50] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 396/417 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 14/431 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 704/1135 variables, 431/452 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1135 variables, 140/592 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1135 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 41/1176 variables, 9/601 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1176 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1176 variables, 75/677 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1176 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 48/1224 variables, 22/699 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1224 variables, 20/719 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1224 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 97/1321 variables, 4/723 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1321 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (OVERLAPS) 4/1325 variables, 2/725 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1325 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 19 (OVERLAPS) 143/1468 variables, 101/826 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1468 variables, 121/947 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1468 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 22 (OVERLAPS) 0/1468 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1468/1468 variables, and 947 constraints, problems are : Problem set: 0 solved, 21 unsolved in 6201 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 563/563 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 396/417 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 14/431 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 18:03:57] [INFO ] Deduced a trap composed of 50 places in 642 ms of which 47 ms to minimize.
[2024-05-23 18:03:57] [INFO ] Deduced a trap composed of 3 places in 417 ms of which 5 ms to minimize.
[2024-05-23 18:03:58] [INFO ] Deduced a trap composed of 127 places in 391 ms of which 4 ms to minimize.
[2024-05-23 18:03:58] [INFO ] Deduced a trap composed of 69 places in 366 ms of which 4 ms to minimize.
[2024-05-23 18:03:59] [INFO ] Deduced a trap composed of 21 places in 282 ms of which 4 ms to minimize.
[2024-05-23 18:03:59] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 3 ms to minimize.
[2024-05-23 18:03:59] [INFO ] Deduced a trap composed of 3 places in 211 ms of which 3 ms to minimize.
[2024-05-23 18:03:59] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 5 ms to minimize.
[2024-05-23 18:04:00] [INFO ] Deduced a trap composed of 3 places in 419 ms of which 5 ms to minimize.
[2024-05-23 18:04:00] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 2 ms to minimize.
[2024-05-23 18:04:00] [INFO ] Deduced a trap composed of 64 places in 124 ms of which 2 ms to minimize.
[2024-05-23 18:04:00] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 3 ms to minimize.
[2024-05-23 18:04:00] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-05-23 18:04:01] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 3 ms to minimize.
[2024-05-23 18:04:01] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 4 ms to minimize.
[2024-05-23 18:04:01] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 3 ms to minimize.
[2024-05-23 18:04:02] [INFO ] Deduced a trap composed of 48 places in 276 ms of which 4 ms to minimize.
[2024-05-23 18:04:02] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 2 ms to minimize.
[2024-05-23 18:04:02] [INFO ] Deduced a trap composed of 50 places in 274 ms of which 3 ms to minimize.
[2024-05-23 18:04:02] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 18:04:03] [INFO ] Deduced a trap composed of 35 places in 359 ms of which 4 ms to minimize.
[2024-05-23 18:04:03] [INFO ] Deduced a trap composed of 13 places in 277 ms of which 3 ms to minimize.
[2024-05-23 18:04:03] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 3 ms to minimize.
[2024-05-23 18:04:03] [INFO ] Deduced a trap composed of 31 places in 360 ms of which 4 ms to minimize.
[2024-05-23 18:04:04] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 3 ms to minimize.
[2024-05-23 18:04:04] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 3 ms to minimize.
[2024-05-23 18:04:04] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 2 ms to minimize.
[2024-05-23 18:04:05] [INFO ] Deduced a trap composed of 54 places in 182 ms of which 2 ms to minimize.
[2024-05-23 18:04:05] [INFO ] Deduced a trap composed of 21 places in 275 ms of which 3 ms to minimize.
[2024-05-23 18:04:05] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 2 ms to minimize.
[2024-05-23 18:04:05] [INFO ] Deduced a trap composed of 44 places in 184 ms of which 3 ms to minimize.
[2024-05-23 18:04:05] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2024-05-23 18:04:06] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 3 ms to minimize.
[2024-05-23 18:04:06] [INFO ] Deduced a trap composed of 21 places in 261 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 18:04:07] [INFO ] Deduced a trap composed of 48 places in 183 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 18:04:08] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 704/1135 variables, 431/488 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1135 variables, 140/628 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 18:04:09] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1135 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 18:04:11] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1135 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 18:04:13] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 3 ms to minimize.
[2024-05-23 18:04:13] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1135 variables, 2/632 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1135 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 41/1176 variables, 9/641 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1176 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1176 variables, 75/717 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1176 variables, 12/729 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1176 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 20 (OVERLAPS) 48/1224 variables, 22/751 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1224 variables, 20/771 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 18:04:20] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1224 variables, 1/772 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1224 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 24 (OVERLAPS) 97/1321 variables, 4/776 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1321 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 26 (OVERLAPS) 4/1325 variables, 2/778 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1325 variables, 9/787 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 18:04:26] [INFO ] Deduced a trap composed of 59 places in 197 ms of which 2 ms to minimize.
[2024-05-23 18:04:26] [INFO ] Deduced a trap composed of 68 places in 195 ms of which 2 ms to minimize.
[2024-05-23 18:04:27] [INFO ] Deduced a trap composed of 27 places in 768 ms of which 8 ms to minimize.
[2024-05-23 18:04:28] [INFO ] Deduced a trap composed of 29 places in 746 ms of which 8 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1325 variables, 4/791 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1325 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 30 (OVERLAPS) 143/1468 variables, 101/892 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1468 variables, 121/1013 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1468 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 33 (OVERLAPS) 0/1468 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1468/1468 variables, and 1013 constraints, problems are : Problem set: 0 solved, 21 unsolved in 40519 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 563/563 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 45/45 constraints]
After SMT, in 46780ms problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 4 properties in 3901 ms.
Support contains 17 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 2984/2984 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 563 transition count 2912
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 491 transition count 2912
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 154 place count 486 transition count 2907
Applied a total of 154 rules in 241 ms. Remains 486 /563 variables (removed 77) and now considering 2907/2984 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 486/563 places, 2907/2984 transitions.
RANDOM walk for 4000000 steps (8 resets) in 24231 ms. (165 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 398 ms. (1002 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 401 ms. (995 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 398 ms. (1002 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 403 ms. (990 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 440 ms. (907 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 491 ms. (813 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 507 ms. (787 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 396 ms. (1007 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 395 ms. (1010 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 404 ms. (987 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 403 ms. (990 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 385 ms. (1036 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 392 ms. (1017 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 393 ms. (1015 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 389 ms. (1025 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 396 ms. (1007 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 390 ms. (1023 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 1064070 steps, run timeout after 24001 ms. (steps per millisecond=44 ) properties seen :3 out of 17
Probabilistic random walk after 1064070 steps, saw 589380 distinct states, run finished after 24002 ms. (steps per millisecond=44 ) properties seen :3
[2024-05-23 18:05:13] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-23 18:05:13] [INFO ] Computed 28 invariants in 5 ms
[2024-05-23 18:05:13] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 292/306 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 12/318 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 552/870 variables, 318/336 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/870 variables, 102/438 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/870 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 57/927 variables, 9/447 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/927 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/927 variables, 64/512 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/927 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 72/999 variables, 33/545 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/999 variables, 27/572 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/999 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 120/1119 variables, 6/578 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1119 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 6/1125 variables, 3/581 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1125 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 189/1314 variables, 126/707 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 163/870 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 14 unsolved in 4286 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 292/306 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 12/318 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 18:05:18] [INFO ] Deduced a trap composed of 3 places in 473 ms of which 6 ms to minimize.
[2024-05-23 18:05:18] [INFO ] Deduced a trap composed of 3 places in 380 ms of which 5 ms to minimize.
[2024-05-23 18:05:19] [INFO ] Deduced a trap composed of 3 places in 338 ms of which 4 ms to minimize.
[2024-05-23 18:05:19] [INFO ] Deduced a trap composed of 58 places in 304 ms of which 4 ms to minimize.
[2024-05-23 18:05:19] [INFO ] Deduced a trap composed of 25 places in 296 ms of which 4 ms to minimize.
[2024-05-23 18:05:20] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 3 ms to minimize.
[2024-05-23 18:05:20] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 3 ms to minimize.
[2024-05-23 18:05:20] [INFO ] Deduced a trap composed of 3 places in 320 ms of which 3 ms to minimize.
[2024-05-23 18:05:21] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 2 ms to minimize.
[2024-05-23 18:05:21] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2024-05-23 18:05:21] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 3 ms to minimize.
[2024-05-23 18:05:21] [INFO ] Deduced a trap composed of 37 places in 326 ms of which 9 ms to minimize.
[2024-05-23 18:05:22] [INFO ] Deduced a trap composed of 31 places in 308 ms of which 3 ms to minimize.
[2024-05-23 18:05:22] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 3 ms to minimize.
[2024-05-23 18:05:22] [INFO ] Deduced a trap composed of 21 places in 244 ms of which 3 ms to minimize.
[2024-05-23 18:05:22] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 2 ms to minimize.
[2024-05-23 18:05:23] [INFO ] Deduced a trap composed of 29 places in 316 ms of which 4 ms to minimize.
[2024-05-23 18:05:23] [INFO ] Deduced a trap composed of 46 places in 233 ms of which 3 ms to minimize.
[2024-05-23 18:05:23] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 3 ms to minimize.
[2024-05-23 18:05:23] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 18:05:24] [INFO ] Deduced a trap composed of 30 places in 364 ms of which 4 ms to minimize.
[2024-05-23 18:05:24] [INFO ] Deduced a trap composed of 39 places in 275 ms of which 4 ms to minimize.
[2024-05-23 18:05:24] [INFO ] Deduced a trap composed of 27 places in 315 ms of which 4 ms to minimize.
[2024-05-23 18:05:24] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 2 ms to minimize.
[2024-05-23 18:05:25] [INFO ] Deduced a trap composed of 67 places in 311 ms of which 3 ms to minimize.
[2024-05-23 18:05:25] [INFO ] Deduced a trap composed of 17 places in 305 ms of which 4 ms to minimize.
[2024-05-23 18:05:25] [INFO ] Deduced a trap composed of 52 places in 225 ms of which 3 ms to minimize.
[2024-05-23 18:05:26] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 2 ms to minimize.
[2024-05-23 18:05:26] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 2 ms to minimize.
[2024-05-23 18:05:26] [INFO ] Deduced a trap composed of 54 places in 267 ms of which 3 ms to minimize.
[2024-05-23 18:05:26] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 2 ms to minimize.
[2024-05-23 18:05:26] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 3 ms to minimize.
[2024-05-23 18:05:27] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 18:05:27] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 3 ms to minimize.
[2024-05-23 18:05:27] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 552/870 variables, 318/371 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/870 variables, 102/473 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/870 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 57/927 variables, 9/482 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/927 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 64/547 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/927 variables, 9/556 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/927 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 72/999 variables, 33/589 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/999 variables, 27/616 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/999 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 120/1119 variables, 6/622 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1119 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (OVERLAPS) 6/1125 variables, 3/625 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1125 variables, 5/630 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 18:05:32] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 1 ms to minimize.
[2024-05-23 18:05:32] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 2 ms to minimize.
[2024-05-23 18:05:32] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-23 18:05:32] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 2 ms to minimize.
[2024-05-23 18:05:32] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
[2024-05-23 18:05:33] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 1 ms to minimize.
[2024-05-23 18:05:33] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 2 ms to minimize.
[2024-05-23 18:05:33] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 1 ms to minimize.
[2024-05-23 18:05:33] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 1 ms to minimize.
[2024-05-23 18:05:33] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 2 ms to minimize.
[2024-05-23 18:05:33] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2024-05-23 18:05:34] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 1 ms to minimize.
[2024-05-23 18:05:34] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
[2024-05-23 18:05:34] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1125 variables, 14/644 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1125 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 25 (OVERLAPS) 189/1314 variables, 126/770 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1314 variables, 163/933 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1314 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 28 (OVERLAPS) 0/1314 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 933 constraints, problems are : Problem set: 0 solved, 14 unsolved in 19794 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 49/49 constraints]
After SMT, in 24133ms problems are : Problem set: 0 solved, 14 unsolved
Parikh walk visited 4 properties in 9796 ms.
Support contains 10 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 125 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 4000000 steps (8 resets) in 19154 ms. (208 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3600 ms. (1110 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3557 ms. (1124 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3571 ms. (1119 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3563 ms. (1122 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3683 ms. (1085 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3535 ms. (1131 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4505 ms. (887 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3863 ms. (1035 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3401 ms. (1175 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3390 ms. (1179 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 2434010 steps, run timeout after 48001 ms. (steps per millisecond=50 ) properties seen :1 out of 10
Probabilistic random walk after 2434010 steps, saw 1203819 distinct states, run finished after 48001 ms. (steps per millisecond=50 ) properties seen :1
[2024-05-23 18:06:52] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:06:52] [INFO ] Invariant cache hit.
[2024-05-23 18:06:52] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 246/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 10/265 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 460/725 variables, 265/280 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 70/350 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 73/798 variables, 9/359 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/798 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/798 variables, 53/413 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/798 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 96/894 variables, 44/457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/894 variables, 32/489 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/894 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 160/1054 variables, 8/497 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1054 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 8/1062 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1062 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 252/1314 variables, 168/669 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 201/870 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1818 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 246/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 10/265 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 18:06:54] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 3 ms to minimize.
[2024-05-23 18:06:54] [INFO ] Deduced a trap composed of 3 places in 253 ms of which 3 ms to minimize.
[2024-05-23 18:06:54] [INFO ] Deduced a trap composed of 3 places in 279 ms of which 3 ms to minimize.
[2024-05-23 18:06:55] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 3 ms to minimize.
[2024-05-23 18:06:55] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 2 ms to minimize.
[2024-05-23 18:06:55] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
[2024-05-23 18:06:55] [INFO ] Deduced a trap composed of 57 places in 172 ms of which 2 ms to minimize.
[2024-05-23 18:06:55] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 3 ms to minimize.
[2024-05-23 18:06:56] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 2 ms to minimize.
[2024-05-23 18:06:56] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-05-23 18:06:56] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
[2024-05-23 18:06:56] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-23 18:06:56] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-05-23 18:06:56] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:06:56] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 1 ms to minimize.
[2024-05-23 18:06:56] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 18:06:57] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-23 18:06:57] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 1 ms to minimize.
[2024-05-23 18:06:57] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 1 ms to minimize.
[2024-05-23 18:06:57] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 460/725 variables, 265/300 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/725 variables, 70/370 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/725 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 73/798 variables, 9/379 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/798 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/798 variables, 53/433 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/798 variables, 8/441 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 18:06:58] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-05-23 18:06:58] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/798 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/798 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 96/894 variables, 44/487 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/894 variables, 32/519 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/894 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 160/1054 variables, 8/527 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 18:07:00] [INFO ] Deduced a trap composed of 65 places in 523 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1054 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 18:07:01] [INFO ] Deduced a trap composed of 72 places in 517 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1054 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 18:07:01] [INFO ] Deduced a trap composed of 127 places in 523 ms of which 6 ms to minimize.
[2024-05-23 18:07:02] [INFO ] Deduced a trap composed of 86 places in 545 ms of which 4 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1054 variables, 2/531 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1054 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 8/1062 variables, 4/535 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1062 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 18:07:03] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-23 18:07:03] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 2 ms to minimize.
[2024-05-23 18:07:03] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 1 ms to minimize.
[2024-05-23 18:07:04] [INFO ] Deduced a trap composed of 91 places in 596 ms of which 5 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1062 variables, 4/540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 18:07:04] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-05-23 18:07:05] [INFO ] Deduced a trap composed of 84 places in 544 ms of which 4 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1062 variables, 2/542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1062 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 252/1314 variables, 168/710 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1314 variables, 201/911 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1314 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (OVERLAPS) 0/1314 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 911 constraints, problems are : Problem set: 0 solved, 9 unsolved in 13593 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 32/32 constraints]
After SMT, in 15460ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 4287 ms.
Support contains 9 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 121 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 4000000 steps (8 resets) in 20791 ms. (192 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3371 ms. (1186 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3276 ms. (1220 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3334 ms. (1199 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3452 ms. (1158 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3278 ms. (1219 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3342 ms. (1196 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3374 ms. (1185 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3378 ms. (1183 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3373 ms. (1185 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 1977120 steps, run timeout after 39001 ms. (steps per millisecond=50 ) properties seen :0 out of 9
Probabilistic random walk after 1977120 steps, saw 1007574 distinct states, run finished after 39001 ms. (steps per millisecond=50 ) properties seen :0
[2024-05-23 18:08:04] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:08:04] [INFO ] Invariant cache hit.
[2024-05-23 18:08:04] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 246/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 10/265 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 460/725 variables, 265/280 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 70/350 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 73/798 variables, 9/359 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/798 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/798 variables, 53/413 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/798 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 96/894 variables, 44/457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/894 variables, 32/489 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/894 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 160/1054 variables, 8/497 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1054 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 8/1062 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1062 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 252/1314 variables, 168/669 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 201/870 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2500 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 246/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 10/265 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 18:08:07] [INFO ] Deduced a trap composed of 3 places in 375 ms of which 4 ms to minimize.
[2024-05-23 18:08:07] [INFO ] Deduced a trap composed of 3 places in 377 ms of which 4 ms to minimize.
[2024-05-23 18:08:08] [INFO ] Deduced a trap composed of 3 places in 279 ms of which 3 ms to minimize.
[2024-05-23 18:08:08] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 3 ms to minimize.
[2024-05-23 18:08:08] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 2 ms to minimize.
[2024-05-23 18:08:08] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-05-23 18:08:09] [INFO ] Deduced a trap composed of 57 places in 218 ms of which 3 ms to minimize.
[2024-05-23 18:08:09] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 3 ms to minimize.
[2024-05-23 18:08:09] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 3 ms to minimize.
[2024-05-23 18:08:09] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 2 ms to minimize.
[2024-05-23 18:08:09] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
[2024-05-23 18:08:09] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 2 ms to minimize.
[2024-05-23 18:08:10] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-05-23 18:08:10] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 2 ms to minimize.
[2024-05-23 18:08:10] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 2 ms to minimize.
[2024-05-23 18:08:10] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 18:08:10] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 4 ms to minimize.
[2024-05-23 18:08:10] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 3 ms to minimize.
[2024-05-23 18:08:11] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 3 ms to minimize.
[2024-05-23 18:08:11] [INFO ] Deduced a trap composed of 13 places in 314 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 460/725 variables, 265/300 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/725 variables, 70/370 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 18:08:12] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/725 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/725 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 73/798 variables, 9/380 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/798 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/798 variables, 53/434 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/798 variables, 8/442 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/798 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 96/894 variables, 44/486 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/894 variables, 32/518 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 18:08:14] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/894 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/894 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 160/1054 variables, 8/527 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1054 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 8/1062 variables, 4/531 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1062 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 18:08:15] [INFO ] Deduced a trap composed of 3 places in 643 ms of which 6 ms to minimize.
[2024-05-23 18:08:16] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1062 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1062 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 252/1314 variables, 168/702 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1314 variables, 201/903 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1314 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 0/1314 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 903 constraints, problems are : Problem set: 0 solved, 9 unsolved in 12072 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 24/24 constraints]
After SMT, in 14597ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 6623 ms.
Support contains 9 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 131 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 112 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-23 18:08:25] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:08:25] [INFO ] Invariant cache hit.
[2024-05-23 18:08:26] [INFO ] Implicit Places using invariants in 815 ms returned []
[2024-05-23 18:08:26] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:08:26] [INFO ] Invariant cache hit.
[2024-05-23 18:08:27] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-23 18:08:30] [INFO ] Implicit Places using invariants and state equation in 4013 ms returned []
Implicit Place search using SMT with State Equation took 4844 ms to find 0 implicit places.
[2024-05-23 18:08:30] [INFO ] Redundant transitions in 215 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-23 18:08:30] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:08:30] [INFO ] Invariant cache hit.
[2024-05-23 18:08:30] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32483ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32529ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37727 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 400000 steps (8 resets) in 3810 ms. (104 steps per ms) remains 9/9 properties
Running SMT prover for 9 properties.
[2024-05-23 18:09:04] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:09:04] [INFO ] Invariant cache hit.
[2024-05-23 18:09:04] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-05-23 18:09:04] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-23 18:09:04] [INFO ] After 350ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9
[2024-05-23 18:09:04] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-23 18:09:05] [INFO ] After 139ms SMT Verify possible using 356 Read/Feed constraints in real domain returned unsat :0 sat :9
TRAPS : Iteration 0
[2024-05-23 18:09:05] [INFO ] After 794ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-23 18:09:05] [INFO ] After 1321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-23 18:09:05] [INFO ] [Nat]Absence check using 19 positive place invariants in 20 ms returned sat
[2024-05-23 18:09:05] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2024-05-23 18:09:06] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-23 18:09:06] [INFO ] After 202ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :9
TRAPS : Iteration 0
[2024-05-23 18:09:06] [INFO ] Deduced a trap composed of 15 places in 273 ms of which 4 ms to minimize.
[2024-05-23 18:09:07] [INFO ] Deduced a trap composed of 3 places in 304 ms of which 4 ms to minimize.
[2024-05-23 18:09:07] [INFO ] Deduced a trap composed of 3 places in 323 ms of which 3 ms to minimize.
[2024-05-23 18:09:07] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 3 ms to minimize.
[2024-05-23 18:09:08] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 2 ms to minimize.
[2024-05-23 18:09:08] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 2 ms to minimize.
[2024-05-23 18:09:08] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-05-23 18:09:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1994 ms
[2024-05-23 18:09:08] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-05-23 18:09:09] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 2 ms to minimize.
[2024-05-23 18:09:09] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-05-23 18:09:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 576 ms
[2024-05-23 18:09:09] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 2 ms to minimize.
[2024-05-23 18:09:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2024-05-23 18:09:10] [INFO ] Deduced a trap composed of 46 places in 144 ms of which 2 ms to minimize.
[2024-05-23 18:09:10] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2024-05-23 18:09:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 445 ms
TRAPS : Iteration 1
[2024-05-23 18:09:11] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2024-05-23 18:09:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
TRAPS : Iteration 2
[2024-05-23 18:09:11] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 2 ms to minimize.
[2024-05-23 18:09:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2024-05-23 18:09:12] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 2 ms to minimize.
[2024-05-23 18:09:12] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 2 ms to minimize.
[2024-05-23 18:09:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 458 ms
[2024-05-23 18:09:12] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 2 ms to minimize.
[2024-05-23 18:09:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
TRAPS : Iteration 3
[2024-05-23 18:09:13] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 2 ms to minimize.
[2024-05-23 18:09:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
TRAPS : Iteration 4
[2024-05-23 18:09:15] [INFO ] After 9024ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
[2024-05-23 18:09:15] [INFO ] After 9748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
RANDOM walk for 4000000 steps (8 resets) in 18616 ms. (214 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3263 ms. (1225 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3260 ms. (1226 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3265 ms. (1224 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3264 ms. (1225 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3262 ms. (1225 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3278 ms. (1219 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3265 ms. (1224 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3642 ms. (1097 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3277 ms. (1220 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 2157710 steps, run timeout after 39001 ms. (steps per millisecond=55 ) properties seen :0 out of 9
Probabilistic random walk after 2157710 steps, saw 1081859 distinct states, run finished after 39002 ms. (steps per millisecond=55 ) properties seen :0
[2024-05-23 18:10:07] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:10:07] [INFO ] Invariant cache hit.
[2024-05-23 18:10:07] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 246/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 10/265 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 460/725 variables, 265/280 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 70/350 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 73/798 variables, 9/359 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/798 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/798 variables, 53/413 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/798 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 96/894 variables, 44/457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/894 variables, 32/489 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/894 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 160/1054 variables, 8/497 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1054 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 8/1062 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1062 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 252/1314 variables, 168/669 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 201/870 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2664 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 246/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 10/265 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 18:10:11] [INFO ] Deduced a trap composed of 3 places in 409 ms of which 4 ms to minimize.
[2024-05-23 18:10:11] [INFO ] Deduced a trap composed of 3 places in 405 ms of which 5 ms to minimize.
[2024-05-23 18:10:12] [INFO ] Deduced a trap composed of 3 places in 317 ms of which 4 ms to minimize.
[2024-05-23 18:10:12] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 3 ms to minimize.
[2024-05-23 18:10:12] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 2 ms to minimize.
[2024-05-23 18:10:12] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-05-23 18:10:12] [INFO ] Deduced a trap composed of 57 places in 142 ms of which 2 ms to minimize.
[2024-05-23 18:10:12] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 2 ms to minimize.
[2024-05-23 18:10:13] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2024-05-23 18:10:13] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 1 ms to minimize.
[2024-05-23 18:10:13] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-23 18:10:13] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:10:13] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-23 18:10:13] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-05-23 18:10:13] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 2 ms to minimize.
[2024-05-23 18:10:13] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 18:10:13] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 1 ms to minimize.
[2024-05-23 18:10:14] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 1 ms to minimize.
[2024-05-23 18:10:14] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 1 ms to minimize.
[2024-05-23 18:10:14] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 460/725 variables, 265/300 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/725 variables, 70/370 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/725 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 73/798 variables, 9/379 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/798 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/798 variables, 53/433 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/798 variables, 8/441 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 18:10:15] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-23 18:10:15] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/798 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/798 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 96/894 variables, 44/487 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/894 variables, 32/519 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/894 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 160/1054 variables, 8/527 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1054 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 8/1062 variables, 4/531 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1062 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 18:10:16] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1062 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1062 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 252/1314 variables, 168/701 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1314 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1314 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (OVERLAPS) 0/1314 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 902 constraints, problems are : Problem set: 0 solved, 9 unsolved in 7525 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 23/23 constraints]
After SMT, in 10224ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 5053 ms.
Support contains 9 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 120 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 106 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-23 18:10:23] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:10:23] [INFO ] Invariant cache hit.
[2024-05-23 18:10:24] [INFO ] Implicit Places using invariants in 841 ms returned []
[2024-05-23 18:10:24] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:10:24] [INFO ] Invariant cache hit.
[2024-05-23 18:10:24] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-23 18:10:27] [INFO ] Implicit Places using invariants and state equation in 3443 ms returned []
Implicit Place search using SMT with State Equation took 4290 ms to find 0 implicit places.
[2024-05-23 18:10:27] [INFO ] Redundant transitions in 229 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-23 18:10:28] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:10:28] [INFO ] Invariant cache hit.
[2024-05-23 18:10:28] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32177ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32212ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36852 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 400000 steps (8 resets) in 2462 ms. (162 steps per ms) remains 9/9 properties
Running SMT prover for 9 properties.
[2024-05-23 18:11:01] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:11:01] [INFO ] Invariant cache hit.
[2024-05-23 18:11:01] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2024-05-23 18:11:01] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-23 18:11:01] [INFO ] After 322ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9
[2024-05-23 18:11:01] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-23 18:11:01] [INFO ] After 126ms SMT Verify possible using 356 Read/Feed constraints in real domain returned unsat :0 sat :9
TRAPS : Iteration 0
[2024-05-23 18:11:02] [INFO ] After 694ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-23 18:11:02] [INFO ] After 1166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-23 18:11:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-05-23 18:11:02] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-23 18:11:02] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-23 18:11:02] [INFO ] After 151ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :9
TRAPS : Iteration 0
[2024-05-23 18:11:03] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 2 ms to minimize.
[2024-05-23 18:11:03] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 3 ms to minimize.
[2024-05-23 18:11:03] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 2 ms to minimize.
[2024-05-23 18:11:03] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 2 ms to minimize.
[2024-05-23 18:11:03] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 2 ms to minimize.
[2024-05-23 18:11:04] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:11:04] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-23 18:11:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1326 ms
[2024-05-23 18:11:04] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2024-05-23 18:11:04] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-23 18:11:04] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-23 18:11:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 360 ms
[2024-05-23 18:11:04] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:11:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2024-05-23 18:11:05] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
[2024-05-23 18:11:05] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-23 18:11:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
TRAPS : Iteration 1
[2024-05-23 18:11:05] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-23 18:11:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
TRAPS : Iteration 2
[2024-05-23 18:11:06] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 1 ms to minimize.
[2024-05-23 18:11:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2024-05-23 18:11:06] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
[2024-05-23 18:11:06] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
[2024-05-23 18:11:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2024-05-23 18:11:06] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-23 18:11:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
TRAPS : Iteration 3
[2024-05-23 18:11:07] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
[2024-05-23 18:11:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
TRAPS : Iteration 4
[2024-05-23 18:11:08] [INFO ] After 5733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
[2024-05-23 18:11:08] [INFO ] After 6267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
RANDOM walk for 40000 steps (8 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 357170 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 1
Probabilistic random walk after 357170 steps, saw 222294 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
[2024-05-23 18:11:11] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:11:11] [INFO ] Invariant cache hit.
[2024-05-23 18:11:11] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 32/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 313/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 32/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 504/1314 variables, 336/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 313/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:11:13] [INFO ] Deduced a trap composed of 25 places in 268 ms of which 3 ms to minimize.
[2024-05-23 18:11:13] [INFO ] Deduced a trap composed of 3 places in 212 ms of which 2 ms to minimize.
[2024-05-23 18:11:13] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 2 ms to minimize.
[2024-05-23 18:11:13] [INFO ] Deduced a trap composed of 19 places in 359 ms of which 4 ms to minimize.
[2024-05-23 18:11:13] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 2 ms to minimize.
[2024-05-23 18:11:14] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 6/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1314 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 877 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2067 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2647ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 98 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 109 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 360250 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 360250 steps, saw 224050 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
[2024-05-23 18:11:17] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:11:17] [INFO ] Invariant cache hit.
[2024-05-23 18:11:17] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 32/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 313/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 556 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 32/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 504/1314 variables, 336/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 313/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:11:18] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 3 ms to minimize.
[2024-05-23 18:11:19] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 2 ms to minimize.
[2024-05-23 18:11:19] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 2 ms to minimize.
[2024-05-23 18:11:19] [INFO ] Deduced a trap composed of 19 places in 387 ms of which 3 ms to minimize.
[2024-05-23 18:11:19] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 2 ms to minimize.
[2024-05-23 18:11:20] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 6/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1314 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 877 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2077 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2660ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 110 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 106 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-23 18:11:20] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:11:20] [INFO ] Invariant cache hit.
[2024-05-23 18:11:21] [INFO ] Implicit Places using invariants in 894 ms returned []
[2024-05-23 18:11:21] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:11:21] [INFO ] Invariant cache hit.
[2024-05-23 18:11:21] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-23 18:11:24] [INFO ] Implicit Places using invariants and state equation in 3590 ms returned []
Implicit Place search using SMT with State Equation took 4486 ms to find 0 implicit places.
[2024-05-23 18:11:25] [INFO ] Redundant transitions in 105 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-23 18:11:25] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:11:25] [INFO ] Invariant cache hit.
[2024-05-23 18:11:25] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32040ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32073ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36790 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 5 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 76 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2024-05-23 18:11:57] [INFO ] Computed 19 invariants in 1 ms
[2024-05-23 18:11:57] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:11:57] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-23 18:11:57] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 18:11:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 18:11:57] [INFO ] After 8ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 18:11:57] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 18:11:57] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 253 ms.
RANDOM walk for 40000 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 360420 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 360420 steps, saw 224157 distinct states, run finished after 3004 ms. (steps per millisecond=119 ) properties seen :0
[2024-05-23 18:12:00] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-23 18:12:00] [INFO ] Computed 28 invariants in 4 ms
[2024-05-23 18:12:00] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:12:01] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:12:01] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/810 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 504/1314 variables, 336/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 314/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:12:01] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 1 ms to minimize.
[2024-05-23 18:12:01] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 2/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1314 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 875 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1095 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1650ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 106 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 361610 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 361610 steps, saw 224868 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
[2024-05-23 18:12:05] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:12:05] [INFO ] Invariant cache hit.
[2024-05-23 18:12:05] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:12:06] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:12:06] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/810 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 504/1314 variables, 336/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 314/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:12:06] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
[2024-05-23 18:12:06] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 2/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1314 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 875 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1079 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1606ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 87 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 106 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 103 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-23 18:12:07] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:12:07] [INFO ] Invariant cache hit.
[2024-05-23 18:12:08] [INFO ] Implicit Places using invariants in 945 ms returned []
[2024-05-23 18:12:08] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:12:08] [INFO ] Invariant cache hit.
[2024-05-23 18:12:08] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-23 18:12:12] [INFO ] Implicit Places using invariants and state equation in 3847 ms returned []
Implicit Place search using SMT with State Equation took 4798 ms to find 0 implicit places.
[2024-05-23 18:12:12] [INFO ] Redundant transitions in 103 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-23 18:12:12] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:12:12] [INFO ] Invariant cache hit.
[2024-05-23 18:12:12] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32299ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32329ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37346 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 3 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 1 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 75 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2024-05-23 18:12:44] [INFO ] Computed 19 invariants in 2 ms
[2024-05-23 18:12:44] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:12:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-23 18:12:44] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 18:12:44] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 18:12:44] [INFO ] After 15ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 18:12:44] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 18:12:44] [INFO ] After 196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 328 ms.
RANDOM walk for 40000 steps (8 resets) in 200 ms. (199 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 323280 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 1
Probabilistic random walk after 323280 steps, saw 203287 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
[2024-05-23 18:12:48] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-23 18:12:48] [INFO ] Computed 28 invariants in 9 ms
[2024-05-23 18:12:48] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 790 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:12:48] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:12:49] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/810 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 504/1314 variables, 336/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 314/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1149 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1971ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 117 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 188 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 230 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 302000 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 1
Probabilistic random walk after 302000 steps, saw 190754 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2024-05-23 18:12:53] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:12:53] [INFO ] Invariant cache hit.
[2024-05-23 18:12:53] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 576 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:12:54] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 504/1314 variables, 336/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 314/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1314 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1165 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1757ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 104 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 164 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 162 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-23 18:12:55] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:12:55] [INFO ] Invariant cache hit.
[2024-05-23 18:12:56] [INFO ] Implicit Places using invariants in 1308 ms returned []
[2024-05-23 18:12:56] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:12:56] [INFO ] Invariant cache hit.
[2024-05-23 18:12:57] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-23 18:13:01] [INFO ] Implicit Places using invariants and state equation in 4853 ms returned []
Implicit Place search using SMT with State Equation took 6166 ms to find 0 implicit places.
[2024-05-23 18:13:01] [INFO ] Redundant transitions in 132 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-23 18:13:01] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:13:01] [INFO ] Invariant cache hit.
[2024-05-23 18:13:01] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32236ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32272ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38755 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 3 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 52 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2024-05-23 18:13:34] [INFO ] Computed 19 invariants in 2 ms
[2024-05-23 18:13:34] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:13:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-23 18:13:34] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 18:13:34] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 18:13:34] [INFO ] After 14ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 18:13:34] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 18:13:34] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 303 ms.
RANDOM walk for 40000 steps (8 resets) in 264 ms. (150 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 315290 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 1
Probabilistic random walk after 315290 steps, saw 198612 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
[2024-05-23 18:13:37] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-23 18:13:37] [INFO ] Computed 28 invariants in 4 ms
[2024-05-23 18:13:37] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:13:38] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:13:38] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/810 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 504/1314 variables, 336/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 314/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1086 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1601ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 67 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 165 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 290 ms. (137 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 366360 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 1
Probabilistic random walk after 366360 steps, saw 227425 distinct states, run finished after 3004 ms. (steps per millisecond=121 ) properties seen :0
[2024-05-23 18:13:42] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:13:42] [INFO ] Invariant cache hit.
[2024-05-23 18:13:42] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:13:44] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 1/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1314 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1201 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1922ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 162 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 161 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-23 18:13:44] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:13:44] [INFO ] Invariant cache hit.
[2024-05-23 18:13:46] [INFO ] Implicit Places using invariants in 1305 ms returned []
[2024-05-23 18:13:46] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:13:46] [INFO ] Invariant cache hit.
[2024-05-23 18:13:46] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-23 18:13:51] [INFO ] Implicit Places using invariants and state equation in 5441 ms returned []
Implicit Place search using SMT with State Equation took 6754 ms to find 0 implicit places.
[2024-05-23 18:13:51] [INFO ] Redundant transitions in 170 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-23 18:13:51] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:13:51] [INFO ] Invariant cache hit.
[2024-05-23 18:13:51] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32403ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32451ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39553 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 45 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2024-05-23 18:14:24] [INFO ] Computed 19 invariants in 2 ms
[2024-05-23 18:14:24] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:14:24] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-23 18:14:24] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 18:14:24] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 18:14:24] [INFO ] After 14ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 18:14:24] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 18:14:24] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 289 ms.
RANDOM walk for 40000 steps (8 resets) in 269 ms. (148 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 334790 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 334790 steps, saw 209523 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-23 18:14:27] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-23 18:14:27] [INFO ] Computed 28 invariants in 6 ms
[2024-05-23 18:14:27] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:14:29] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 3 ms to minimize.
[2024-05-23 18:14:29] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 2/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1330 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2065ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 114 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 163 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 348090 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 348090 steps, saw 217072 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2024-05-23 18:14:33] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:14:33] [INFO ] Invariant cache hit.
[2024-05-23 18:14:33] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 734 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:14:34] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 504/1314 variables, 336/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 314/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:14:34] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1296 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2050ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 111 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 177 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 162 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-23 18:14:35] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:14:35] [INFO ] Invariant cache hit.
[2024-05-23 18:14:36] [INFO ] Implicit Places using invariants in 1076 ms returned []
[2024-05-23 18:14:36] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:14:36] [INFO ] Invariant cache hit.
[2024-05-23 18:14:37] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-23 18:14:41] [INFO ] Implicit Places using invariants and state equation in 4526 ms returned []
Implicit Place search using SMT with State Equation took 5604 ms to find 0 implicit places.
[2024-05-23 18:14:41] [INFO ] Redundant transitions in 167 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-23 18:14:41] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:14:41] [INFO ] Invariant cache hit.
[2024-05-23 18:14:41] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32302ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32349ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38302 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 1 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 52 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2024-05-23 18:15:13] [INFO ] Computed 19 invariants in 1 ms
[2024-05-23 18:15:13] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:15:13] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-23 18:15:14] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 18:15:14] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 18:15:14] [INFO ] After 14ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 18:15:14] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 18:15:14] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 282 ms.
RANDOM walk for 40000 steps (8 resets) in 253 ms. (157 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 349950 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 1
Probabilistic random walk after 349950 steps, saw 218097 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
[2024-05-23 18:15:17] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-23 18:15:17] [INFO ] Computed 28 invariants in 3 ms
[2024-05-23 18:15:17] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:15:17] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:15:18] [INFO ] Deduced a trap composed of 74 places in 785 ms of which 8 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/810 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 504/1314 variables, 336/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 314/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1854 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2359ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7671 steps, including 268 resets, run visited all 1 properties in 46 ms. (steps per millisecond=166 )
Parikh walk visited 1 properties in 62 ms.
RANDOM walk for 40000 steps (8 resets) in 389 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 324470 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 324470 steps, saw 203980 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
[2024-05-23 18:15:22] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:15:22] [INFO ] Invariant cache hit.
[2024-05-23 18:15:22] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:15:23] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 2 ms to minimize.
[2024-05-23 18:15:24] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 504/1314 variables, 336/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 314/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:15:24] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 874 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1484 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 2049ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 163 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 342250 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 342250 steps, saw 213791 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
[2024-05-23 18:15:28] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:15:28] [INFO ] Invariant cache hit.
[2024-05-23 18:15:28] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:15:29] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2024-05-23 18:15:29] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 504/1314 variables, 336/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 314/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:15:29] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 874 constraints, problems are : Problem set: 0 solved, 1 unsolved in 967 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1652ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 97 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 98 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-23 18:15:30] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:15:30] [INFO ] Invariant cache hit.
[2024-05-23 18:15:30] [INFO ] Implicit Places using invariants in 770 ms returned []
[2024-05-23 18:15:30] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:15:30] [INFO ] Invariant cache hit.
[2024-05-23 18:15:31] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-23 18:15:34] [INFO ] Implicit Places using invariants and state equation in 3781 ms returned []
Implicit Place search using SMT with State Equation took 4556 ms to find 0 implicit places.
[2024-05-23 18:15:34] [INFO ] Redundant transitions in 103 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-23 18:15:34] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:15:34] [INFO ] Invariant cache hit.
[2024-05-23 18:15:34] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32061ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32090ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36859 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 47 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2024-05-23 18:16:06] [INFO ] Computed 19 invariants in 1 ms
[2024-05-23 18:16:06] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:16:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-23 18:16:07] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 18:16:07] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 18:16:07] [INFO ] After 12ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 18:16:07] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 18:16:07] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 279 ms.
RANDOM walk for 40000 steps (8 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 360930 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 360930 steps, saw 224442 distinct states, run finished after 3002 ms. (steps per millisecond=120 ) properties seen :0
[2024-05-23 18:16:10] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-23 18:16:10] [INFO ] Computed 28 invariants in 4 ms
[2024-05-23 18:16:10] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 513 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:16:10] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 504/1314 variables, 336/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 314/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1314 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1267ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 147 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 355990 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 1
Probabilistic random walk after 355990 steps, saw 221715 distinct states, run finished after 3005 ms. (steps per millisecond=118 ) properties seen :0
[2024-05-23 18:16:14] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:16:14] [INFO ] Invariant cache hit.
[2024-05-23 18:16:14] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:16:15] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:16:15] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
[2024-05-23 18:16:15] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/810 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 504/1314 variables, 336/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 314/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 874 constraints, problems are : Problem set: 0 solved, 1 unsolved in 905 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1451ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 99 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 102 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-23 18:16:16] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:16:16] [INFO ] Invariant cache hit.
[2024-05-23 18:16:17] [INFO ] Implicit Places using invariants in 996 ms returned []
[2024-05-23 18:16:17] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:16:17] [INFO ] Invariant cache hit.
[2024-05-23 18:16:17] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-23 18:16:21] [INFO ] Implicit Places using invariants and state equation in 4012 ms returned []
Implicit Place search using SMT with State Equation took 5011 ms to find 0 implicit places.
[2024-05-23 18:16:21] [INFO ] Redundant transitions in 109 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-23 18:16:21] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-23 18:16:21] [INFO ] Invariant cache hit.
[2024-05-23 18:16:21] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32171ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32201ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37436 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 39 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2024-05-23 18:16:53] [INFO ] Computed 19 invariants in 1 ms
[2024-05-23 18:16:53] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:16:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-23 18:16:54] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 18:16:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 18:16:54] [INFO ] After 13ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 18:16:54] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 18:16:54] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 299 ms.
RANDOM walk for 40000 steps (8 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 355890 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 1
Probabilistic random walk after 355890 steps, saw 221665 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
[2024-05-23 18:16:57] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-23 18:16:57] [INFO ] Computed 28 invariants in 7 ms
[2024-05-23 18:16:57] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:16:58] [INFO ] Deduced a trap composed of 90 places in 509 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 504/1314 variables, 336/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 314/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1314 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1708ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 50 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 1 ms.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2709 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Deduced a syphon composed of 135 places in 0 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 514 place count 153 transition count 360
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 586 place count 153 transition count 288
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 604 place count 144 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 613 place count 144 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 622 place count 144 transition count 270
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 694 place count 144 transition count 198
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 766 place count 72 transition count 198
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 775 place count 72 transition count 198
Applied a total of 775 rules in 34 ms. Remains 72 /486 variables (removed 414) and now considering 198/2907 (removed 2709) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 198 rows 72 cols
[2024-05-23 18:16:58] [INFO ] Computed 19 invariants in 1 ms
[2024-05-23 18:16:59] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-23 18:16:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-23 18:16:59] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-23 18:16:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 18:16:59] [INFO ] After 71ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :9
TRAPS : Iteration 0
[2024-05-23 18:16:59] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
[2024-05-23 18:16:59] [INFO ] After 441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Over-approximation ignoring read arcs solved 0 properties in 549 ms.
Unable to solve all queries for examination StableMarking. Remains :9 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 9 properties from file /home/mcc/execution/StableMarking.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 911637 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running EisenbergMcGuire-PT-09

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 891
TRANSITIONS: 3888
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 18792
NUPN UNITS: 23
LOADING TIME: 2.855

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.18
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 3.864
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1730
MODEL NAME: /home/mcc/execution/model
891 places, 3888 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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="EisenbergMcGuire-PT-09"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is EisenbergMcGuire-PT-09, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r166-smll-171636274400123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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