About the Execution of 2024-gold for DoubleExponent-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15691.420 | 1800000.00 | 2797897.00 | 3531.70 | [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/mcc2025-input.r084-tall-174860080400307.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is DoubleExponent-PT-010, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080400307
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 169K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1748736366820
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 00:06:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-01 00:06:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 00:06:08] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2025-06-01 00:06:08] [INFO ] Transformed 534 places.
[2025-06-01 00:06:08] [INFO ] Transformed 498 transitions.
[2025-06-01 00:06:08] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 206 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 534/534 places, 498/498 transitions.
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 530 transition count 378
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 244 place count 410 transition count 378
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 244 place count 410 transition count 358
Deduced a syphon composed of 20 places in 17 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 284 place count 390 transition count 358
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 3 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 472 place count 296 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 508 place count 278 transition count 264
Applied a total of 508 rules in 113 ms. Remains 278 /534 variables (removed 256) and now considering 264/498 (removed 234) transitions.
// Phase 1: matrix 264 rows 278 cols
[2025-06-01 00:06:08] [INFO ] Computed 51 invariants in 46 ms
[2025-06-01 00:06:09] [INFO ] Implicit Places using invariants in 557 ms returned [229, 230]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 594 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 276/534 places, 264/498 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 276 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 275 transition count 263
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 272 transition count 260
Applied a total of 8 rules in 11 ms. Remains 272 /276 variables (removed 4) and now considering 260/264 (removed 4) transitions.
// Phase 1: matrix 260 rows 272 cols
[2025-06-01 00:06:09] [INFO ] Computed 49 invariants in 11 ms
[2025-06-01 00:06:09] [INFO ] Implicit Places using invariants in 275 ms returned []
[2025-06-01 00:06:09] [INFO ] Invariant cache hit.
[2025-06-01 00:06:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 00:06:10] [INFO ] Implicit Places using invariants and state equation in 995 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 272/534 places, 260/498 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 2009 ms. Remains : 272/534 places, 260/498 transitions.
Discarding 58 transitions out of 260. Remains 202
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (4897 resets) in 2552 ms. (15 steps per ms) remains 181/201 properties
BEST_FIRST walk for 401 steps (31 resets) in 13 ms. (28 steps per ms) remains 181/181 properties
BEST_FIRST walk for 402 steps (29 resets) in 16 ms. (23 steps per ms) remains 181/181 properties
BEST_FIRST walk for 402 steps (29 resets) in 11 ms. (33 steps per ms) remains 181/181 properties
BEST_FIRST walk for 402 steps (25 resets) in 12 ms. (30 steps per ms) remains 181/181 properties
BEST_FIRST walk for 401 steps (31 resets) in 20 ms. (19 steps per ms) remains 181/181 properties
BEST_FIRST walk for 404 steps (29 resets) in 12 ms. (31 steps per ms) remains 181/181 properties
BEST_FIRST walk for 400 steps (28 resets) in 14 ms. (26 steps per ms) remains 181/181 properties
BEST_FIRST walk for 401 steps (29 resets) in 20 ms. (19 steps per ms) remains 181/181 properties
BEST_FIRST walk for 401 steps (25 resets) in 11 ms. (33 steps per ms) remains 181/181 properties
BEST_FIRST walk for 403 steps (29 resets) in 13 ms. (28 steps per ms) remains 181/181 properties
BEST_FIRST walk for 401 steps (30 resets) in 22 ms. (17 steps per ms) remains 181/181 properties
BEST_FIRST walk for 403 steps (28 resets) in 10 ms. (36 steps per ms) remains 181/181 properties
BEST_FIRST walk for 401 steps (28 resets) in 27 ms. (14 steps per ms) remains 181/181 properties
BEST_FIRST walk for 401 steps (30 resets) in 11 ms. (33 steps per ms) remains 181/181 properties
BEST_FIRST walk for 401 steps (29 resets) in 9 ms. (40 steps per ms) remains 181/181 properties
BEST_FIRST walk for 400 steps (29 resets) in 9 ms. (40 steps per ms) remains 181/181 properties
BEST_FIRST walk for 400 steps (32 resets) in 8 ms. (44 steps per ms) remains 181/181 properties
BEST_FIRST walk for 400 steps (29 resets) in 7 ms. (50 steps per ms) remains 181/181 properties
BEST_FIRST walk for 400 steps (28 resets) in 7 ms. (50 steps per ms) remains 181/181 properties
BEST_FIRST walk for 403 steps (30 resets) in 8 ms. (44 steps per ms) remains 181/181 properties
BEST_FIRST walk for 402 steps (29 resets) in 8 ms. (44 steps per ms) remains 181/181 properties
BEST_FIRST walk for 400 steps (30 resets) in 9 ms. (40 steps per ms) remains 181/181 properties
BEST_FIRST walk for 402 steps (30 resets) in 8 ms. (44 steps per ms) remains 181/181 properties
BEST_FIRST walk for 401 steps (23 resets) in 9 ms. (40 steps per ms) remains 181/181 properties
BEST_FIRST walk for 402 steps (31 resets) in 13 ms. (28 steps per ms) remains 181/181 properties
BEST_FIRST walk for 403 steps (30 resets) in 12 ms. (31 steps per ms) remains 181/181 properties
BEST_FIRST walk for 402 steps (27 resets) in 15 ms. (25 steps per ms) remains 181/181 properties
BEST_FIRST walk for 401 steps (29 resets) in 9 ms. (40 steps per ms) remains 181/181 properties
BEST_FIRST walk for 401 steps (27 resets) in 7 ms. (50 steps per ms) remains 181/181 properties
BEST_FIRST walk for 401 steps (31 resets) in 6 ms. (57 steps per ms) remains 181/181 properties
BEST_FIRST walk for 401 steps (27 resets) in 8 ms. (44 steps per ms) remains 181/181 properties
BEST_FIRST walk for 401 steps (27 resets) in 7 ms. (50 steps per ms) remains 181/181 properties
BEST_FIRST walk for 400 steps (32 resets) in 7 ms. (50 steps per ms) remains 181/181 properties
BEST_FIRST walk for 401 steps (30 resets) in 7 ms. (50 steps per ms) remains 181/181 properties
BEST_FIRST walk for 402 steps (28 resets) in 7 ms. (50 steps per ms) remains 181/181 properties
BEST_FIRST walk for 402 steps (32 resets) in 12 ms. (30 steps per ms) remains 181/181 properties
BEST_FIRST walk for 401 steps (26 resets) in 9 ms. (40 steps per ms) remains 181/181 properties
BEST_FIRST walk for 402 steps (30 resets) in 8 ms. (44 steps per ms) remains 181/181 properties
BEST_FIRST walk for 401 steps (30 resets) in 8 ms. (44 steps per ms) remains 181/181 properties
BEST_FIRST walk for 402 steps (31 resets) in 11 ms. (33 steps per ms) remains 181/181 properties
BEST_FIRST walk for 400 steps (31 resets) in 8 ms. (44 steps per ms) remains 181/181 properties
BEST_FIRST walk for 403 steps (28 resets) in 7 ms. (50 steps per ms) remains 181/181 properties
BEST_FIRST walk for 401 steps (28 resets) in 8 ms. (44 steps per ms) remains 181/181 properties
BEST_FIRST walk for 402 steps (30 resets) in 8 ms. (44 steps per ms) remains 181/181 properties
BEST_FIRST walk for 401 steps (26 resets) in 8 ms. (44 steps per ms) remains 181/181 properties
BEST_FIRST walk for 402 steps (31 resets) in 9 ms. (40 steps per ms) remains 181/181 properties
BEST_FIRST walk for 402 steps (24 resets) in 6 ms. (57 steps per ms) remains 181/181 properties
BEST_FIRST walk for 401 steps (28 resets) in 10 ms. (36 steps per ms) remains 181/181 properties
BEST_FIRST walk for 402 steps (29 resets) in 8 ms. (44 steps per ms) remains 181/181 properties
BEST_FIRST walk for 402 steps (29 resets) in 8 ms. (44 steps per ms) remains 181/181 properties
[2025-06-01 00:06:11] [INFO ] Invariant cache hit.
[2025-06-01 00:06:11] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 3/250 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 18/268 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 00:06:15] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 268/532 variables, and 50 constraints, problems are : Problem set: 0 solved, 181 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/272 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 3/250 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 18/268 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 260/528 variables, 268/318 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 20/338 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 167/505 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/532 variables, and 505 constraints, problems are : Problem set: 0 solved, 181 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 268/272 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 167/181 constraints, Known Traps: 1/1 constraints]
After SMT, in 10113ms problems are : Problem set: 0 solved, 181 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 247 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 260/260 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 260
Applied a total of 2 rules in 20 ms. Remains 272 /272 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 272/272 places, 260/260 transitions.
RANDOM walk for 4000000 steps (444302 resets) in 43617 ms. (91 steps per ms) remains 173/181 properties
BEST_FIRST walk for 40003 steps (3138 resets) in 352 ms. (113 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40000 steps (3139 resets) in 317 ms. (125 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40002 steps (3074 resets) in 311 ms. (128 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (2992 resets) in 356 ms. (112 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3101 resets) in 321 ms. (124 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40003 steps (3112 resets) in 394 ms. (101 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3052 resets) in 320 ms. (124 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3091 resets) in 317 ms. (125 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3032 resets) in 310 ms. (128 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3068 resets) in 305 ms. (130 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40003 steps (3068 resets) in 313 ms. (127 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40002 steps (3101 resets) in 322 ms. (123 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40000 steps (3094 resets) in 304 ms. (131 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3064 resets) in 312 ms. (127 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40000 steps (3057 resets) in 313 ms. (127 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3082 resets) in 310 ms. (128 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3039 resets) in 317 ms. (125 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3083 resets) in 311 ms. (128 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40002 steps (3060 resets) in 347 ms. (114 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3028 resets) in 321 ms. (124 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40003 steps (3159 resets) in 307 ms. (129 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3110 resets) in 306 ms. (130 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40000 steps (3043 resets) in 307 ms. (129 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40000 steps (3054 resets) in 302 ms. (132 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3062 resets) in 360 ms. (110 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3136 resets) in 323 ms. (123 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40002 steps (3023 resets) in 301 ms. (132 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40000 steps (3101 resets) in 307 ms. (129 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40003 steps (3117 resets) in 306 ms. (130 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40003 steps (3043 resets) in 303 ms. (131 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40002 steps (3097 resets) in 306 ms. (130 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40002 steps (3061 resets) in 299 ms. (133 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40000 steps (3047 resets) in 295 ms. (135 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3087 resets) in 303 ms. (131 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40002 steps (3080 resets) in 305 ms. (130 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3055 resets) in 300 ms. (132 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3086 resets) in 306 ms. (130 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3078 resets) in 300 ms. (132 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40002 steps (3073 resets) in 298 ms. (133 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40002 steps (3022 resets) in 305 ms. (130 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3134 resets) in 305 ms. (130 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40000 steps (3059 resets) in 295 ms. (135 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3141 resets) in 306 ms. (130 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40000 steps (3053 resets) in 301 ms. (132 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40003 steps (3020 resets) in 295 ms. (135 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40002 steps (3081 resets) in 302 ms. (132 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3044 resets) in 298 ms. (133 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40000 steps (3109 resets) in 301 ms. (132 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40000 steps (3036 resets) in 301 ms. (132 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (3074 resets) in 298 ms. (133 steps per ms) remains 173/173 properties
Probably explored full state space saw : 893829 states, properties seen :28
Probabilistic random walk after 1787750 steps, saw 893829 distinct states, run finished after 30783 ms. (steps per millisecond=58 ) properties seen :28
Interrupted probabilistic random walk after 3003728 steps, run timeout after 45001 ms. (steps per millisecond=66 ) properties seen :12 out of 145
Exhaustive walk after 3003728 steps, saw 1502080 distinct states, run finished after 45017 ms. (steps per millisecond=66 ) properties seen :12
// Phase 1: matrix 260 rows 272 cols
[2025-06-01 00:07:53] [INFO ] Computed 49 invariants in 12 ms
[2025-06-01 00:07:53] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 40/223 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 33/256 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 4/260 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 4/264 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 260/524 variables, 264/313 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/524 variables, 22/335 constraints. Problems are: Problem set: 0 solved, 133 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 8/532 variables, 8/343 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2025-06-01 00:08:03] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 3 ms to minimize.
[2025-06-01 00:08:03] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2025-06-01 00:08:03] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2025-06-01 00:08:03] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 10 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/532 variables, 4/347 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/532 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 16 (OVERLAPS) 0/532 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 347 constraints, problems are : Problem set: 0 solved, 133 unsolved in 17787 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 272/272 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 40/223 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 33/256 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 4/260 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2025-06-01 00:08:12] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 4/264 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2025-06-01 00:08:14] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2025-06-01 00:08:14] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (OVERLAPS) 260/524 variables, 264/316 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 22/338 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 123/461 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/524 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 16 (OVERLAPS) 8/532 variables, 8/469 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 10/479 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 4/483 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 483 constraints, problems are : Problem set: 0 solved, 133 unsolved in 45021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 272/272 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 7/7 constraints]
After SMT, in 62855ms problems are : Problem set: 0 solved, 133 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 183 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 260/260 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 272 transition count 253
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 265 transition count 253
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 265 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 264 transition count 252
Applied a total of 25 rules in 33 ms. Remains 264 /272 variables (removed 8) and now considering 252/260 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 264/272 places, 252/260 transitions.
RANDOM walk for 4000000 steps (512597 resets) in 51482 ms. (77 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3403 resets) in 415 ms. (96 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3403 resets) in 517 ms. (77 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3379 resets) in 515 ms. (77 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3406 resets) in 476 ms. (83 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3402 resets) in 474 ms. (84 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3387 resets) in 382 ms. (104 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3409 resets) in 477 ms. (83 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3425 resets) in 409 ms. (97 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3405 resets) in 410 ms. (97 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3335 resets) in 407 ms. (98 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3398 resets) in 479 ms. (83 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3382 resets) in 438 ms. (91 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3397 resets) in 401 ms. (99 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3331 resets) in 513 ms. (77 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3368 resets) in 453 ms. (88 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3409 resets) in 405 ms. (98 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3321 resets) in 412 ms. (96 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3358 resets) in 427 ms. (93 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3383 resets) in 384 ms. (103 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3435 resets) in 449 ms. (88 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3347 resets) in 442 ms. (90 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3428 resets) in 443 ms. (90 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3408 resets) in 560 ms. (71 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3394 resets) in 451 ms. (88 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3388 resets) in 429 ms. (93 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3413 resets) in 481 ms. (82 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3370 resets) in 415 ms. (96 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3417 resets) in 409 ms. (97 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3421 resets) in 408 ms. (97 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3396 resets) in 410 ms. (97 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3323 resets) in 429 ms. (93 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3393 resets) in 408 ms. (97 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3361 resets) in 401 ms. (99 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3367 resets) in 503 ms. (79 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3335 resets) in 432 ms. (92 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3400 resets) in 503 ms. (79 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3386 resets) in 469 ms. (85 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3397 resets) in 514 ms. (77 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3428 resets) in 463 ms. (86 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3363 resets) in 462 ms. (86 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3384 resets) in 498 ms. (80 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3349 resets) in 417 ms. (95 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3348 resets) in 451 ms. (88 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3434 resets) in 451 ms. (88 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3426 resets) in 470 ms. (84 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3384 resets) in 446 ms. (89 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3424 resets) in 487 ms. (81 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3306 resets) in 479 ms. (83 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3338 resets) in 501 ms. (79 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3369 resets) in 514 ms. (77 steps per ms) remains 133/133 properties
Probably explored full state space saw : 656378 states, properties seen :0
Probabilistic random walk after 1312810 steps, saw 656378 distinct states, run finished after 25955 ms. (steps per millisecond=50 ) properties seen :0
Interrupted probabilistic random walk after 3339878 steps, run timeout after 66001 ms. (steps per millisecond=50 ) properties seen :0 out of 133
Exhaustive walk after 3339878 steps, saw 1670124 distinct states, run finished after 66002 ms. (steps per millisecond=50 ) properties seen :0
// Phase 1: matrix 252 rows 264 cols
[2025-06-01 00:10:50] [INFO ] Computed 49 invariants in 16 ms
[2025-06-01 00:10:50] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 34/217 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 31/248 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 5/253 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2025-06-01 00:10:53] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 251/504 variables, 253/301 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 24/325 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 133 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 11/515 variables, 10/335 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/515 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 15 (OVERLAPS) 1/516 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 17 (OVERLAPS) 0/516 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 338 constraints, problems are : Problem set: 0 solved, 133 unsolved in 19863 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 264/264 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 34/217 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 31/248 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 5/253 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 251/504 variables, 253/301 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 24/325 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 123/448 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/504 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 11/515 variables, 10/458 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 2/460 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/515 variables, 10/470 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/515 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 17 (OVERLAPS) 1/516 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2025-06-01 00:12:05] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
[2025-06-01 00:12:06] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
[2025-06-01 00:12:06] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/516 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/516 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 20 (OVERLAPS) 0/516 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 516/516 variables, and 474 constraints, problems are : Problem set: 0 solved, 133 unsolved in 75013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 264/264 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 4/4 constraints]
After SMT, in 94916ms problems are : Problem set: 0 solved, 133 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 183 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 252/252 transitions.
Applied a total of 0 rules in 8 ms. Remains 264 /264 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 264/264 places, 252/252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 252/252 transitions.
Applied a total of 0 rules in 8 ms. Remains 264 /264 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2025-06-01 00:12:25] [INFO ] Invariant cache hit.
[2025-06-01 00:12:25] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-01 00:12:25] [INFO ] Invariant cache hit.
[2025-06-01 00:12:25] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 00:12:25] [INFO ] Implicit Places using invariants and state equation in 395 ms returned [146, 216, 255, 261]
[2025-06-01 00:12:25] [INFO ] Actually due to overlaps returned [216, 146]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 521 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 262/264 places, 252/252 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 262 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 261 transition count 251
Applied a total of 2 rules in 19 ms. Remains 261 /262 variables (removed 1) and now considering 251/252 (removed 1) transitions.
// Phase 1: matrix 251 rows 261 cols
[2025-06-01 00:12:26] [INFO ] Computed 47 invariants in 21 ms
[2025-06-01 00:12:26] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-01 00:12:26] [INFO ] Invariant cache hit.
[2025-06-01 00:12:26] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 00:12:26] [INFO ] Implicit Places using invariants and state equation in 605 ms returned [252, 258]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 738 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 259/264 places, 251/252 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 259 transition count 250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 258 transition count 250
Applied a total of 2 rules in 19 ms. Remains 258 /259 variables (removed 1) and now considering 250/251 (removed 1) transitions.
// Phase 1: matrix 250 rows 258 cols
[2025-06-01 00:12:26] [INFO ] Computed 45 invariants in 13 ms
[2025-06-01 00:12:26] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-01 00:12:26] [INFO ] Invariant cache hit.
[2025-06-01 00:12:27] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 00:12:27] [INFO ] Implicit Places using invariants and state equation in 765 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 258/264 places, 250/252 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2237 ms. Remains : 258/264 places, 250/252 transitions.
RANDOM walk for 4000000 steps (577131 resets) in 60810 ms. (65 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3652 resets) in 380 ms. (104 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3615 resets) in 322 ms. (123 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3675 resets) in 421 ms. (94 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3598 resets) in 441 ms. (90 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3625 resets) in 394 ms. (101 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3696 resets) in 403 ms. (99 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3662 resets) in 484 ms. (82 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3629 resets) in 519 ms. (76 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3753 resets) in 505 ms. (79 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (3660 resets) in 550 ms. (72 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3689 resets) in 345 ms. (115 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3660 resets) in 329 ms. (121 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (3621 resets) in 407 ms. (98 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3606 resets) in 384 ms. (103 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3632 resets) in 391 ms. (102 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3733 resets) in 396 ms. (100 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3704 resets) in 343 ms. (116 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3626 resets) in 406 ms. (98 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3638 resets) in 453 ms. (88 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3695 resets) in 372 ms. (107 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3619 resets) in 353 ms. (113 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3654 resets) in 411 ms. (97 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3670 resets) in 488 ms. (81 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3727 resets) in 373 ms. (106 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3654 resets) in 365 ms. (109 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3706 resets) in 352 ms. (113 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3683 resets) in 379 ms. (105 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3682 resets) in 341 ms. (116 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3636 resets) in 414 ms. (96 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3602 resets) in 390 ms. (102 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3674 resets) in 366 ms. (108 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3653 resets) in 391 ms. (102 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3572 resets) in 529 ms. (75 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3698 resets) in 446 ms. (89 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3604 resets) in 387 ms. (103 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3638 resets) in 480 ms. (83 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3640 resets) in 401 ms. (99 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3587 resets) in 418 ms. (95 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3632 resets) in 412 ms. (96 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3650 resets) in 394 ms. (101 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3651 resets) in 481 ms. (82 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3656 resets) in 358 ms. (111 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3617 resets) in 357 ms. (111 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3637 resets) in 497 ms. (80 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3684 resets) in 455 ms. (87 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3673 resets) in 385 ms. (103 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3662 resets) in 467 ms. (85 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3664 resets) in 402 ms. (99 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3684 resets) in 445 ms. (89 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3632 resets) in 517 ms. (77 steps per ms) remains 133/133 properties
Interrupted probabilistic random walk after 3976763 steps, run timeout after 72001 ms. (steps per millisecond=55 ) properties seen :2 out of 133
Probabilistic random walk after 3976763 steps, saw 1988214 distinct states, run finished after 72001 ms. (steps per millisecond=55 ) properties seen :2
[2025-06-01 00:14:03] [INFO ] Invariant cache hit.
[2025-06-01 00:14:03] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 42/222 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 25/247 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-06-01 00:14:05] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 249/496 variables, 247/291 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 24/315 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 11/507 variables, 10/325 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (OVERLAPS) 1/508 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-06-01 00:14:17] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/508 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 16 (OVERLAPS) 0/508 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/508 variables, and 329 constraints, problems are : Problem set: 0 solved, 131 unsolved in 18389 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 258/258 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 42/222 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 25/247 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 249/496 variables, 247/291 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 24/315 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 122/437 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 11/507 variables, 10/447 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 9/458 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/507 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (OVERLAPS) 1/508 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/508 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-06-01 00:15:25] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/508 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/508 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 19 (OVERLAPS) 0/508 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 508/508 variables, and 461 constraints, problems are : Problem set: 0 solved, 131 unsolved in 90014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 258/258 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 constraints]
After SMT, in 108431ms problems are : Problem set: 0 solved, 131 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 180 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 250/250 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 258 transition count 248
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 256 transition count 248
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 256 transition count 248
Applied a total of 5 rules in 18 ms. Remains 256 /258 variables (removed 2) and now considering 248/250 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 256/258 places, 248/250 transitions.
RANDOM walk for 4000000 steps (577956 resets) in 61483 ms. (65 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3710 resets) in 355 ms. (112 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3716 resets) in 377 ms. (105 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3670 resets) in 366 ms. (109 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3603 resets) in 376 ms. (106 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40004 steps (3669 resets) in 447 ms. (89 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3635 resets) in 496 ms. (80 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3595 resets) in 353 ms. (113 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3636 resets) in 368 ms. (108 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3617 resets) in 516 ms. (77 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3630 resets) in 408 ms. (97 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3554 resets) in 368 ms. (108 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3631 resets) in 486 ms. (82 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3630 resets) in 344 ms. (115 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3675 resets) in 371 ms. (107 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3600 resets) in 447 ms. (89 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3705 resets) in 502 ms. (79 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3670 resets) in 369 ms. (108 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3627 resets) in 383 ms. (104 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3652 resets) in 339 ms. (117 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3664 resets) in 478 ms. (83 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3638 resets) in 395 ms. (101 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3660 resets) in 397 ms. (100 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3695 resets) in 384 ms. (103 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3644 resets) in 480 ms. (83 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3675 resets) in 368 ms. (108 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3628 resets) in 379 ms. (105 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3702 resets) in 401 ms. (99 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3617 resets) in 319 ms. (125 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3667 resets) in 699 ms. (57 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3605 resets) in 396 ms. (100 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3689 resets) in 509 ms. (78 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3706 resets) in 363 ms. (109 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3638 resets) in 427 ms. (93 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3677 resets) in 413 ms. (96 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3653 resets) in 502 ms. (79 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3662 resets) in 384 ms. (103 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3645 resets) in 377 ms. (105 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3669 resets) in 478 ms. (83 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3701 resets) in 363 ms. (109 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3613 resets) in 377 ms. (105 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3617 resets) in 442 ms. (90 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3632 resets) in 339 ms. (117 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3697 resets) in 491 ms. (81 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3674 resets) in 422 ms. (94 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3684 resets) in 329 ms. (121 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3620 resets) in 403 ms. (99 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3622 resets) in 381 ms. (104 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3639 resets) in 387 ms. (103 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3602 resets) in 352 ms. (113 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3671 resets) in 418 ms. (95 steps per ms) remains 131/131 properties
Probably explored full state space saw : 259289 states, properties seen :0
Probabilistic random walk after 518586 steps, saw 259289 distinct states, run finished after 8977 ms. (steps per millisecond=57 ) properties seen :0
Interrupted probabilistic random walk after 4069778 steps, run timeout after 75001 ms. (steps per millisecond=54 ) properties seen :0 out of 131
Exhaustive walk after 4069778 steps, saw 2034956 distinct states, run finished after 75001 ms. (steps per millisecond=54 ) properties seen :0
// Phase 1: matrix 248 rows 256 cols
[2025-06-01 00:17:42] [INFO ] Computed 45 invariants in 9 ms
[2025-06-01 00:17:42] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 42/222 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 24/246 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-06-01 00:17:44] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 247/493 variables, 246/290 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 24/314 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/493 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 10/503 variables, 9/323 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/503 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (OVERLAPS) 1/504 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (OVERLAPS) 0/504 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 326 constraints, problems are : Problem set: 0 solved, 131 unsolved in 18162 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 256/256 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 42/222 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 24/246 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 247/493 variables, 246/290 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 24/314 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/493 variables, 122/436 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/493 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 10/503 variables, 9/445 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/503 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 9/456 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/503 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (OVERLAPS) 1/504 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-06-01 00:19:11] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:19:11] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2025-06-01 00:19:14] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2025-06-01 00:19:14] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/504 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-06-01 00:19:23] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2025-06-01 00:19:24] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
[2025-06-01 00:19:24] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2025-06-01 00:19:24] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2025-06-01 00:19:25] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2025-06-01 00:19:27] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 6/467 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-06-01 00:19:37] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2025-06-01 00:19:39] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2025-06-01 00:19:41] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2025-06-01 00:19:42] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 4/471 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 471 constraints, problems are : Problem set: 0 solved, 131 unsolved in 105017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 256/256 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 15/15 constraints]
After SMT, in 123216ms problems are : Problem set: 0 solved, 131 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 180 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 248/248 transitions.
Applied a total of 0 rules in 6 ms. Remains 256 /256 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 256/256 places, 248/248 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 248/248 transitions.
Applied a total of 0 rules in 5 ms. Remains 256 /256 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2025-06-01 00:19:45] [INFO ] Invariant cache hit.
[2025-06-01 00:19:45] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-01 00:19:45] [INFO ] Invariant cache hit.
[2025-06-01 00:19:45] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 00:19:45] [INFO ] Implicit Places using invariants and state equation in 442 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 535 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 255/256 places, 248/248 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 255 transition count 248
Applied a total of 1 rules in 15 ms. Remains 255 /255 variables (removed 0) and now considering 248/248 (removed 0) transitions.
// Phase 1: matrix 248 rows 255 cols
[2025-06-01 00:19:45] [INFO ] Computed 44 invariants in 14 ms
[2025-06-01 00:19:45] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-01 00:19:45] [INFO ] Invariant cache hit.
[2025-06-01 00:19:46] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 00:19:46] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 255/256 places, 248/248 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1091 ms. Remains : 255/256 places, 248/248 transitions.
RANDOM walk for 4000000 steps (576575 resets) in 37908 ms. (105 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3667 resets) in 349 ms. (114 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3695 resets) in 334 ms. (119 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3634 resets) in 451 ms. (88 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3703 resets) in 344 ms. (115 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3686 resets) in 479 ms. (83 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3635 resets) in 461 ms. (86 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3630 resets) in 317 ms. (125 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3680 resets) in 379 ms. (105 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3620 resets) in 374 ms. (106 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3663 resets) in 502 ms. (79 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3659 resets) in 336 ms. (118 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3673 resets) in 514 ms. (77 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3702 resets) in 391 ms. (102 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3569 resets) in 481 ms. (82 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3661 resets) in 364 ms. (109 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3650 resets) in 421 ms. (94 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3654 resets) in 347 ms. (114 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3671 resets) in 636 ms. (62 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3648 resets) in 544 ms. (73 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3617 resets) in 539 ms. (74 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3668 resets) in 392 ms. (101 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3655 resets) in 390 ms. (102 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3642 resets) in 367 ms. (108 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3626 resets) in 506 ms. (78 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3624 resets) in 475 ms. (84 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3685 resets) in 364 ms. (109 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3676 resets) in 402 ms. (99 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3664 resets) in 394 ms. (101 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3614 resets) in 376 ms. (106 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3615 resets) in 358 ms. (111 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3649 resets) in 420 ms. (95 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3675 resets) in 373 ms. (106 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3656 resets) in 345 ms. (115 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3613 resets) in 398 ms. (100 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3595 resets) in 393 ms. (101 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3646 resets) in 405 ms. (98 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3637 resets) in 386 ms. (103 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3646 resets) in 449 ms. (88 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3664 resets) in 535 ms. (74 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3630 resets) in 441 ms. (90 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3685 resets) in 361 ms. (110 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3677 resets) in 376 ms. (106 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3686 resets) in 402 ms. (99 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3657 resets) in 394 ms. (101 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40004 steps (3703 resets) in 415 ms. (96 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3655 resets) in 435 ms. (91 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3632 resets) in 398 ms. (100 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3524 resets) in 375 ms. (106 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3680 resets) in 393 ms. (101 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3690 resets) in 365 ms. (109 steps per ms) remains 131/131 properties
Interrupted probabilistic random walk after 2877149 steps, run timeout after 51001 ms. (steps per millisecond=56 ) properties seen :0 out of 131
Probabilistic random walk after 2877149 steps, saw 1438535 distinct states, run finished after 51001 ms. (steps per millisecond=56 ) properties seen :0
[2025-06-01 00:20:54] [INFO ] Invariant cache hit.
[2025-06-01 00:20:54] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 46/226 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 19/245 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 247/492 variables, 245/287 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 24/311 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10/502 variables, 9/320 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/502 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 1/503 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (OVERLAPS) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 323 constraints, problems are : Problem set: 0 solved, 131 unsolved in 17492 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 46/226 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 19/245 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-06-01 00:21:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 247/492 variables, 245/288 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 24/312 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 122/434 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 10/502 variables, 9/443 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/502 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 9/454 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/502 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (OVERLAPS) 1/503 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-06-01 00:22:07] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2025-06-01 00:22:10] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2025-06-01 00:22:10] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2025-06-01 00:22:10] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/503 variables, 4/459 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/503 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 18 (OVERLAPS) 0/503 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 459 constraints, problems are : Problem set: 0 solved, 131 unsolved in 81536 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 5/5 constraints]
After SMT, in 99059ms problems are : Problem set: 0 solved, 131 unsolved
Parikh walk visited 0 properties in 30005 ms.
Support contains 180 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Applied a total of 0 rules in 6 ms. Remains 255 /255 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 255/255 places, 248/248 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Applied a total of 0 rules in 6 ms. Remains 255 /255 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2025-06-01 00:23:03] [INFO ] Invariant cache hit.
[2025-06-01 00:23:03] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-01 00:23:03] [INFO ] Invariant cache hit.
[2025-06-01 00:23:03] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 00:23:04] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2025-06-01 00:23:04] [INFO ] Redundant transitions in 10 ms returned []
Running 247 sub problems to find dead transitions.
[2025-06-01 00:23:04] [INFO ] Invariant cache hit.
[2025-06-01 00:23:04] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/502 variables, 254/298 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 24/322 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 247 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/503 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (OVERLAPS) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 323 constraints, problems are : Problem set: 0 solved, 247 unsolved in 16149 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/502 variables, 254/298 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 24/322 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 247/569 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 1/503 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/503 variables, and 570 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints]
After SMT, in 46220ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 46223ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46778 ms. Remains : 255/255 places, 248/248 transitions.
RANDOM walk for 400000 steps (57709 resets) in 8719 ms. (45 steps per ms) remains 180/180 properties
Running SMT prover for 180 properties.
[2025-06-01 00:23:53] [INFO ] Invariant cache hit.
[2025-06-01 00:23:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 00:23:53] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 13 ms returned sat
[2025-06-01 00:23:53] [INFO ] After 530ms SMT Verify possible using state equation in real domain returned unsat :0 sat :180
[2025-06-01 00:23:53] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 00:23:54] [INFO ] After 707ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :180
TRAPS : Iteration 0
[2025-06-01 00:23:58] [INFO ] After 5092ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:180
[2025-06-01 00:23:58] [INFO ] After 5813ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:180
[2025-06-01 00:23:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 00:23:58] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 13 ms returned sat
[2025-06-01 00:23:59] [INFO ] After 563ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :180
[2025-06-01 00:24:01] [INFO ] After 1482ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :180
TRAPS : Iteration 0
[2025-06-01 00:24:01] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2025-06-01 00:24:01] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2025-06-01 00:24:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2025-06-01 00:24:01] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2025-06-01 00:24:01] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:24:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2025-06-01 00:24:01] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2025-06-01 00:24:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2025-06-01 00:24:02] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2025-06-01 00:24:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2025-06-01 00:24:02] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2025-06-01 00:24:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2025-06-01 00:24:02] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2025-06-01 00:24:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2025-06-01 00:24:02] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2025-06-01 00:24:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2025-06-01 00:24:02] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2025-06-01 00:24:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2025-06-01 00:24:02] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2025-06-01 00:24:02] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2025-06-01 00:24:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2025-06-01 00:24:03] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2025-06-01 00:24:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2025-06-01 00:24:03] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2025-06-01 00:24:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2025-06-01 00:24:03] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:24:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2025-06-01 00:24:03] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 2 ms to minimize.
[2025-06-01 00:24:03] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2025-06-01 00:24:03] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2025-06-01 00:24:03] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 0 ms to minimize.
[2025-06-01 00:24:03] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2025-06-01 00:24:03] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2025-06-01 00:24:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 395 ms
[2025-06-01 00:24:04] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 5 ms to minimize.
[2025-06-01 00:24:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2025-06-01 00:24:04] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2025-06-01 00:24:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2025-06-01 00:24:04] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:24:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2025-06-01 00:24:05] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2025-06-01 00:24:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2025-06-01 00:24:06] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2025-06-01 00:24:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2025-06-01 00:24:07] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2025-06-01 00:24:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
TRAPS : Iteration 1
[2025-06-01 00:24:07] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2025-06-01 00:24:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2025-06-01 00:24:09] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2025-06-01 00:24:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2025-06-01 00:24:09] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2025-06-01 00:24:09] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2025-06-01 00:24:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
TRAPS : Iteration 2
[2025-06-01 00:24:15] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:24:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 350 ms
TRAPS : Iteration 3
[2025-06-01 00:24:21] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2025-06-01 00:24:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
TRAPS : Iteration 4
[2025-06-01 00:24:25] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2025-06-01 00:24:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
TRAPS : Iteration 5
[2025-06-01 00:24:32] [INFO ] After 32600ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :180
[2025-06-01 00:24:34] [INFO ] After 35636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :180
RANDOM walk for 4000000 steps (577344 resets) in 62009 ms. (64 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3679 resets) in 376 ms. (106 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3682 resets) in 362 ms. (110 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3694 resets) in 409 ms. (97 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3694 resets) in 529 ms. (75 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3652 resets) in 399 ms. (100 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3667 resets) in 421 ms. (94 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3656 resets) in 380 ms. (104 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3697 resets) in 382 ms. (104 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3634 resets) in 329 ms. (121 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3668 resets) in 583 ms. (68 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3696 resets) in 427 ms. (93 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3658 resets) in 353 ms. (113 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3659 resets) in 336 ms. (118 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3631 resets) in 437 ms. (91 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3663 resets) in 453 ms. (88 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3675 resets) in 407 ms. (98 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3681 resets) in 532 ms. (75 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3674 resets) in 375 ms. (106 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3650 resets) in 430 ms. (92 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3674 resets) in 591 ms. (67 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3639 resets) in 406 ms. (98 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3633 resets) in 609 ms. (65 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3651 resets) in 405 ms. (98 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3660 resets) in 363 ms. (109 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3699 resets) in 485 ms. (82 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3684 resets) in 415 ms. (96 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3599 resets) in 452 ms. (88 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3664 resets) in 392 ms. (101 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3619 resets) in 363 ms. (109 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3683 resets) in 401 ms. (99 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3623 resets) in 364 ms. (109 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3705 resets) in 416 ms. (95 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3708 resets) in 386 ms. (103 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3643 resets) in 374 ms. (106 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3588 resets) in 372 ms. (107 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3657 resets) in 388 ms. (102 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3625 resets) in 449 ms. (88 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3647 resets) in 388 ms. (102 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3691 resets) in 380 ms. (104 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3645 resets) in 520 ms. (76 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3658 resets) in 371 ms. (107 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3692 resets) in 372 ms. (107 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3714 resets) in 375 ms. (106 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3660 resets) in 378 ms. (105 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3670 resets) in 397 ms. (100 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3663 resets) in 370 ms. (107 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3626 resets) in 331 ms. (120 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3681 resets) in 423 ms. (94 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3654 resets) in 375 ms. (106 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3646 resets) in 354 ms. (112 steps per ms) remains 131/131 properties
Interrupted probabilistic random walk after 3676844 steps, run timeout after 69001 ms. (steps per millisecond=53 ) properties seen :0 out of 131
Probabilistic random walk after 3676844 steps, saw 1838305 distinct states, run finished after 69002 ms. (steps per millisecond=53 ) properties seen :0
[2025-06-01 00:26:06] [INFO ] Invariant cache hit.
[2025-06-01 00:26:06] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 46/226 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 19/245 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 247/492 variables, 245/287 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 24/311 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10/502 variables, 9/320 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/502 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 1/503 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (OVERLAPS) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 323 constraints, problems are : Problem set: 0 solved, 131 unsolved in 17363 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 46/226 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 19/245 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-06-01 00:26:25] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 247/492 variables, 245/288 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 24/312 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 122/434 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 10/502 variables, 9/443 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/502 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 9/454 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/502 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (OVERLAPS) 1/503 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-06-01 00:27:18] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2025-06-01 00:27:21] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2025-06-01 00:27:21] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2025-06-01 00:27:21] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/503 variables, 4/459 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/503 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 18 (OVERLAPS) 0/503 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 459 constraints, problems are : Problem set: 0 solved, 131 unsolved in 81830 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 5/5 constraints]
After SMT, in 99214ms problems are : Problem set: 0 solved, 131 unsolved
Parikh walk visited 0 properties in 30001 ms.
Support contains 180 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Applied a total of 0 rules in 26 ms. Remains 255 /255 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 255/255 places, 248/248 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Applied a total of 0 rules in 4 ms. Remains 255 /255 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2025-06-01 00:28:15] [INFO ] Invariant cache hit.
[2025-06-01 00:28:16] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-01 00:28:16] [INFO ] Invariant cache hit.
[2025-06-01 00:28:16] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 00:28:16] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2025-06-01 00:28:16] [INFO ] Redundant transitions in 5 ms returned []
Running 247 sub problems to find dead transitions.
[2025-06-01 00:28:16] [INFO ] Invariant cache hit.
[2025-06-01 00:28:16] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/502 variables, 254/298 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 24/322 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 247 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/503 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (OVERLAPS) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 323 constraints, problems are : Problem set: 0 solved, 247 unsolved in 16285 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/502 variables, 254/298 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 24/322 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 247/569 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 1/503 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2025-06-01 00:29:02] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/503 variables, and 571 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 1/1 constraints]
After SMT, in 46357ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 46360ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46893 ms. Remains : 255/255 places, 248/248 transitions.
RANDOM walk for 400000 steps (57718 resets) in 6293 ms. (63 steps per ms) remains 180/180 properties
Running SMT prover for 180 properties.
[2025-06-01 00:29:04] [INFO ] Invariant cache hit.
[2025-06-01 00:29:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 00:29:04] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 13 ms returned sat
[2025-06-01 00:29:05] [INFO ] After 522ms SMT Verify possible using state equation in real domain returned unsat :0 sat :180
[2025-06-01 00:29:05] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 00:29:06] [INFO ] After 711ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :180
TRAPS : Iteration 0
[2025-06-01 00:29:10] [INFO ] After 5126ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:180
[2025-06-01 00:29:10] [INFO ] After 5826ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:180
[2025-06-01 00:29:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 00:29:10] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 13 ms returned sat
[2025-06-01 00:29:11] [INFO ] After 560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :180
[2025-06-01 00:29:12] [INFO ] After 1456ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :180
TRAPS : Iteration 0
[2025-06-01 00:29:12] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2025-06-01 00:29:13] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2025-06-01 00:29:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2025-06-01 00:29:13] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2025-06-01 00:29:13] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2025-06-01 00:29:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2025-06-01 00:29:13] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2025-06-01 00:29:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2025-06-01 00:29:13] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2025-06-01 00:29:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2025-06-01 00:29:13] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2025-06-01 00:29:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2025-06-01 00:29:14] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2025-06-01 00:29:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2025-06-01 00:29:14] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2025-06-01 00:29:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2025-06-01 00:29:14] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2025-06-01 00:29:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2025-06-01 00:29:14] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2025-06-01 00:29:14] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2025-06-01 00:29:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2025-06-01 00:29:14] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2025-06-01 00:29:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2025-06-01 00:29:14] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2025-06-01 00:29:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2025-06-01 00:29:15] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2025-06-01 00:29:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2025-06-01 00:29:15] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 0 ms to minimize.
[2025-06-01 00:29:15] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2025-06-01 00:29:15] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2025-06-01 00:29:15] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2025-06-01 00:29:15] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2025-06-01 00:29:15] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2025-06-01 00:29:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 367 ms
[2025-06-01 00:29:15] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2025-06-01 00:29:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2025-06-01 00:29:16] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2025-06-01 00:29:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2025-06-01 00:29:16] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2025-06-01 00:29:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2025-06-01 00:29:17] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2025-06-01 00:29:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2025-06-01 00:29:17] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
[2025-06-01 00:29:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2025-06-01 00:29:18] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2025-06-01 00:29:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
TRAPS : Iteration 1
[2025-06-01 00:29:19] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2025-06-01 00:29:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2025-06-01 00:29:20] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 0 ms to minimize.
[2025-06-01 00:29:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2025-06-01 00:29:21] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2025-06-01 00:29:21] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2025-06-01 00:29:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
TRAPS : Iteration 2
[2025-06-01 00:29:26] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2025-06-01 00:29:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 379 ms
TRAPS : Iteration 3
[2025-06-01 00:29:32] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:29:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
TRAPS : Iteration 4
[2025-06-01 00:29:36] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2025-06-01 00:29:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
TRAPS : Iteration 5
[2025-06-01 00:29:43] [INFO ] After 32394ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :180
[2025-06-01 00:29:46] [INFO ] After 35505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :180
RANDOM walk for 40000 steps (5786 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3652 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 689957 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :0 out of 1
Probabilistic random walk after 689957 steps, saw 345051 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
[2025-06-01 00:29:49] [INFO ] Invariant cache hit.
[2025-06-01 00:29:49] [INFO ] State equation strengthened by 24 read => feed constraints.
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) 99/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/193 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/221 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 238/459 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 22/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/496 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/498 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/503 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/503 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 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) 99/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/193 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:29:49] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/221 variables, 9/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 238/459 variables, 221/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 22/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/496 variables, 28/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/498 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/498 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 5/503 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/503 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/503 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/503 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 754ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 1 with 26 rules applied. Total rules applied 28 place count 254 transition count 221
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 228 transition count 221
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 2 with 30 rules applied. Total rules applied 84 place count 228 transition count 221
Applied a total of 84 rules in 29 ms. Remains 228 /255 variables (removed 27) and now considering 221/248 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 228/255 places, 221/248 transitions.
RANDOM walk for 40000 steps (5743 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3692 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 720017 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :0 out of 1
Probabilistic random walk after 720017 steps, saw 360088 distinct states, run finished after 3001 ms. (steps per millisecond=239 ) properties seen :0
// Phase 1: matrix 221 rows 228 cols
[2025-06-01 00:29:53] [INFO ] Computed 44 invariants in 16 ms
[2025-06-01 00:29:53] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/178 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/223 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:29:53] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:29:53] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:29:53] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2025-06-01 00:29:53] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 221/444 variables, 223/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 38/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/449 variables, 5/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/449 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/449 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 660 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 228/228 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/178 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/223 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:29:54] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:29:54] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
[2025-06-01 00:29:54] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:29:54] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2025-06-01 00:29:54] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 1 ms to minimize.
[2025-06-01 00:29:54] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 1 ms to minimize.
[2025-06-01 00:29:54] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2025-06-01 00:29:54] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:29:54] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 1 ms to minimize.
[2025-06-01 00:29:55] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2025-06-01 00:29:55] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2025-06-01 00:29:55] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2025-06-01 00:29:55] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 1 ms to minimize.
[2025-06-01 00:29:55] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:29:55] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:29:55] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 2 ms to minimize.
[2025-06-01 00:29:55] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 1 ms to minimize.
[2025-06-01 00:29:55] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2025-06-01 00:29:55] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2025-06-01 00:29:56] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:29:56] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 1 ms to minimize.
[2025-06-01 00:29:56] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:29:56] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
[2025-06-01 00:29:56] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 1 ms to minimize.
[2025-06-01 00:29:56] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 1 ms to minimize.
[2025-06-01 00:29:56] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:29:56] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2025-06-01 00:29:56] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2025-06-01 00:29:56] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 221/444 variables, 223/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 38/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/444 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/449 variables, 5/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/449 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/449 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/449 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3353 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 228/228 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 33/33 constraints]
After SMT, in 4052ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 6 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 228/228 places, 221/221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 6 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2025-06-01 00:29:57] [INFO ] Invariant cache hit.
[2025-06-01 00:29:57] [INFO ] Implicit Places using invariants in 280 ms returned [25, 46, 51, 73, 78, 98, 104, 125, 130, 150, 155, 176, 182]
[2025-06-01 00:29:57] [INFO ] Actually due to overlaps returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 296 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 227/228 places, 221/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 226 transition count 220
Applied a total of 2 rules in 12 ms. Remains 226 /227 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 226 cols
[2025-06-01 00:29:57] [INFO ] Computed 43 invariants in 10 ms
[2025-06-01 00:29:57] [INFO ] Implicit Places using invariants in 243 ms returned [44, 49, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
[2025-06-01 00:29:57] [INFO ] Actually due to overlaps returned [49, 44]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 245 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 224/228 places, 220/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 219
Applied a total of 2 rules in 13 ms. Remains 223 /224 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 223 cols
[2025-06-01 00:29:57] [INFO ] Computed 41 invariants in 9 ms
[2025-06-01 00:29:58] [INFO ] Implicit Places using invariants in 224 ms returned [68, 73, 93, 99, 120, 125, 145, 150, 171, 177]
[2025-06-01 00:29:58] [INFO ] Actually due to overlaps returned [73, 68]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 226 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 221/228 places, 219/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 220 transition count 218
Applied a total of 2 rules in 12 ms. Remains 220 /221 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 220 cols
[2025-06-01 00:29:58] [INFO ] Computed 39 invariants in 9 ms
[2025-06-01 00:29:58] [INFO ] Implicit Places using invariants in 214 ms returned [90, 96, 117, 122, 142, 147, 168, 174]
[2025-06-01 00:29:58] [INFO ] Actually due to overlaps returned [96, 90]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 215 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 218/228 places, 218/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 217
Applied a total of 2 rules in 12 ms. Remains 217 /218 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 217 cols
[2025-06-01 00:29:58] [INFO ] Computed 37 invariants in 13 ms
[2025-06-01 00:29:58] [INFO ] Implicit Places using invariants in 202 ms returned [114, 119, 139, 144, 165, 171]
[2025-06-01 00:29:58] [INFO ] Actually due to overlaps returned [119, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 204 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 215/228 places, 217/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 216
Applied a total of 2 rules in 11 ms. Remains 214 /215 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 214 cols
[2025-06-01 00:29:58] [INFO ] Computed 35 invariants in 12 ms
[2025-06-01 00:29:58] [INFO ] Implicit Places using invariants in 195 ms returned [136, 141, 162, 168]
[2025-06-01 00:29:58] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 196 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 212/228 places, 216/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 215
Applied a total of 2 rules in 23 ms. Remains 211 /212 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 211 cols
[2025-06-01 00:29:58] [INFO ] Computed 33 invariants in 8 ms
[2025-06-01 00:29:59] [INFO ] Implicit Places using invariants in 273 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 275 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 209/228 places, 215/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 214
Applied a total of 2 rules in 10 ms. Remains 208 /209 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 208 cols
[2025-06-01 00:29:59] [INFO ] Computed 31 invariants in 9 ms
[2025-06-01 00:29:59] [INFO ] Implicit Places using invariants in 299 ms returned []
[2025-06-01 00:29:59] [INFO ] Invariant cache hit.
[2025-06-01 00:29:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 00:30:00] [INFO ] Implicit Places using invariants and state equation in 995 ms returned []
Implicit Place search using SMT with State Equation took 1297 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 208/228 places, 214/221 transitions.
Finished structural reductions in REACHABILITY mode , in 8 iterations and 3056 ms. Remains : 208/228 places, 214/221 transitions.
RANDOM walk for 40000 steps (5759 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3626 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 726322 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 1
Probabilistic random walk after 726322 steps, saw 363247 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
[2025-06-01 00:30:03] [INFO ] Invariant cache hit.
[2025-06-01 00:30:03] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 100/101 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/149 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/203 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:30:03] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2025-06-01 00:30:03] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2025-06-01 00:30:03] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2025-06-01 00:30:03] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 214/417 variables, 203/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 38/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/422 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/422 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 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) 100/101 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/149 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:30:04] [INFO ] Deduced a trap composed of 90 places in 67 ms of which 1 ms to minimize.
[2025-06-01 00:30:04] [INFO ] Deduced a trap composed of 93 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 54/203 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:30:04] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2025-06-01 00:30:04] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 214/417 variables, 203/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 38/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/422 variables, 5/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/422 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 647 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 1184ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 87 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2025-06-01 00:30:04] [INFO ] Invariant cache hit.
[2025-06-01 00:30:04] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-01 00:30:04] [INFO ] Invariant cache hit.
[2025-06-01 00:30:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 00:30:05] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 1213 ms to find 0 implicit places.
[2025-06-01 00:30:05] [INFO ] Redundant transitions in 2 ms returned []
Running 213 sub problems to find dead transitions.
[2025-06-01 00:30:05] [INFO ] Invariant cache hit.
[2025-06-01 00:30:05] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 277 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9527 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 213/490 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2025-06-01 00:30:22] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2025-06-01 00:30:22] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 1 ms to minimize.
[2025-06-01 00:30:22] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:30:23] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 1 ms to minimize.
[2025-06-01 00:30:23] [INFO ] Deduced a trap composed of 80 places in 73 ms of which 1 ms to minimize.
[2025-06-01 00:30:23] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 6/496 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2025-06-01 00:30:30] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
[2025-06-01 00:30:30] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 2/498 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2025-06-01 00:30:36] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2025-06-01 00:30:36] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2025-06-01 00:30:37] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2025-06-01 00:30:37] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2025-06-01 00:30:38] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 4 ms to minimize.
[2025-06-01 00:30:38] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2025-06-01 00:30:38] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2025-06-01 00:30:38] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2025-06-01 00:30:39] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2025-06-01 00:30:39] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2025-06-01 00:30:39] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 2 ms to minimize.
[2025-06-01 00:30:39] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2025-06-01 00:30:39] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2025-06-01 00:30:39] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2025-06-01 00:30:39] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2025-06-01 00:30:40] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2025-06-01 00:30:41] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 1 ms to minimize.
[2025-06-01 00:30:41] [INFO ] Deduced a trap composed of 76 places in 75 ms of which 1 ms to minimize.
[2025-06-01 00:30:41] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 19/517 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 517 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 27/27 constraints]
After SMT, in 39628ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39631ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40857 ms. Remains : 208/208 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 27 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2025-06-01 00:30:45] [INFO ] Computed 31 invariants in 8 ms
[2025-06-01 00:30:45] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-06-01 00:30:45] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2025-06-01 00:30:45] [INFO ] After 76ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 00:30:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:30:45] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:30:45] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2025-06-01 00:30:45] [INFO ] After 103ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:30:45] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:30:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2025-06-01 00:30:45] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2025-06-01 00:30:45] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:30:45] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:30:46] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2025-06-01 00:30:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
TRAPS : Iteration 1
[2025-06-01 00:30:46] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:30:46] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 519 ms.
RANDOM walk for 40000 steps (5721 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3633 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 713843 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :0 out of 1
Probabilistic random walk after 713843 steps, saw 357004 distinct states, run finished after 3001 ms. (steps per millisecond=237 ) properties seen :0
// Phase 1: matrix 248 rows 255 cols
[2025-06-01 00:30:49] [INFO ] Computed 44 invariants in 18 ms
[2025-06-01 00:30:49] [INFO ] State equation strengthened by 24 read => feed constraints.
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) 99/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/193 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/221 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 238/459 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 22/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/496 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/498 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/503 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/503 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 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) 99/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/193 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/221 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 238/459 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 22/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/496 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/498 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/503 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/503 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/503 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 636ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 17 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 227/255 places, 220/248 transitions.
RANDOM walk for 40000 steps (5685 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3653 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 726963 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 1
Probabilistic random walk after 726963 steps, saw 363563 distinct states, run finished after 3004 ms. (steps per millisecond=241 ) properties seen :0
// Phase 1: matrix 220 rows 227 cols
[2025-06-01 00:30:52] [INFO ] Computed 44 invariants in 15 ms
[2025-06-01 00:30:52] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 79/80 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:30:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/194 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/222 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 220/442 variables, 222/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 38/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:30:53] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/447 variables, 5/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/447 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 227/227 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 79/80 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/194 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/222 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 220/442 variables, 222/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 38/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:30:53] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2025-06-01 00:30:53] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/442 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/447 variables, 5/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/447 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/447 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/447 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 447/447 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 548 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 227/227 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 944ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2025-06-01 00:30:53] [INFO ] Invariant cache hit.
[2025-06-01 00:30:54] [INFO ] Implicit Places using invariants in 277 ms returned [25, 46, 51, 72, 77, 97, 103, 124, 129, 149, 154, 175, 181]
[2025-06-01 00:30:54] [INFO ] Actually due to overlaps returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 279 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 226/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 219
Applied a total of 2 rules in 9 ms. Remains 225 /226 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 225 cols
[2025-06-01 00:30:54] [INFO ] Computed 43 invariants in 8 ms
[2025-06-01 00:30:54] [INFO ] Implicit Places using invariants in 261 ms returned [44, 49, 70, 75, 95, 101, 122, 127, 147, 152, 173, 179]
[2025-06-01 00:30:54] [INFO ] Actually due to overlaps returned [49, 44]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 263 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 223/227 places, 219/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 218
Applied a total of 2 rules in 9 ms. Remains 222 /223 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 222 cols
[2025-06-01 00:30:54] [INFO ] Computed 41 invariants in 12 ms
[2025-06-01 00:30:54] [INFO ] Implicit Places using invariants in 246 ms returned [67, 72, 92, 98, 119, 124, 144, 149, 170, 176]
[2025-06-01 00:30:54] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 261 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 220/227 places, 218/220 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 220 transition count 218
Applied a total of 2 rules in 7 ms. Remains 220 /220 variables (removed 0) and now considering 218/218 (removed 0) transitions.
// Phase 1: matrix 218 rows 220 cols
[2025-06-01 00:30:54] [INFO ] Computed 39 invariants in 10 ms
[2025-06-01 00:30:55] [INFO ] Implicit Places using invariants in 220 ms returned [90, 96, 117, 122, 142, 147, 168, 174]
[2025-06-01 00:30:55] [INFO ] Actually due to overlaps returned [96, 90]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 222 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 218/227 places, 218/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 217
Applied a total of 2 rules in 8 ms. Remains 217 /218 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 217 cols
[2025-06-01 00:30:55] [INFO ] Computed 37 invariants in 12 ms
[2025-06-01 00:30:55] [INFO ] Implicit Places using invariants in 231 ms returned [114, 119, 139, 144, 165, 171]
[2025-06-01 00:30:55] [INFO ] Actually due to overlaps returned [119, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 236 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 215/227 places, 217/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 216
Applied a total of 2 rules in 7 ms. Remains 214 /215 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 214 cols
[2025-06-01 00:30:55] [INFO ] Computed 35 invariants in 12 ms
[2025-06-01 00:30:55] [INFO ] Implicit Places using invariants in 174 ms returned [136, 141, 162, 168]
[2025-06-01 00:30:55] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 176 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 212/227 places, 216/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 215
Applied a total of 2 rules in 6 ms. Remains 211 /212 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 211 cols
[2025-06-01 00:30:55] [INFO ] Computed 33 invariants in 9 ms
[2025-06-01 00:30:55] [INFO ] Implicit Places using invariants in 161 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 162 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 209/227 places, 215/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 214
Applied a total of 2 rules in 7 ms. Remains 208 /209 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 208 cols
[2025-06-01 00:30:55] [INFO ] Computed 31 invariants in 13 ms
[2025-06-01 00:30:55] [INFO ] Implicit Places using invariants in 191 ms returned []
[2025-06-01 00:30:55] [INFO ] Invariant cache hit.
[2025-06-01 00:30:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 00:30:57] [INFO ] Implicit Places using invariants and state equation in 1288 ms returned []
Implicit Place search using SMT with State Equation took 1483 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 208/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 8 iterations and 3143 ms. Remains : 208/227 places, 214/220 transitions.
RANDOM walk for 40000 steps (5805 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3660 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 732263 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :0 out of 1
Probabilistic random walk after 732263 steps, saw 366220 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
[2025-06-01 00:31:00] [INFO ] Invariant cache hit.
[2025-06-01 00:31:00] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 124/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:31:00] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/149 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:31:00] [INFO ] Deduced a trap composed of 93 places in 65 ms of which 1 ms to minimize.
[2025-06-01 00:31:00] [INFO ] Deduced a trap composed of 93 places in 63 ms of which 1 ms to minimize.
[2025-06-01 00:31:00] [INFO ] Deduced a trap composed of 96 places in 63 ms of which 1 ms to minimize.
[2025-06-01 00:31:00] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/203 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 214/417 variables, 203/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/422 variables, 5/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/422 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 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) 124/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/149 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/203 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:31:00] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2025-06-01 00:31:00] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2025-06-01 00:31:01] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2025-06-01 00:31:01] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 1 ms to minimize.
[2025-06-01 00:31:01] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2025-06-01 00:31:01] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 1 ms to minimize.
[2025-06-01 00:31:01] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2025-06-01 00:31:01] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 1 ms to minimize.
[2025-06-01 00:31:01] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2025-06-01 00:31:01] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2025-06-01 00:31:01] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2025-06-01 00:31:01] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2025-06-01 00:31:01] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
[2025-06-01 00:31:01] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2025-06-01 00:31:02] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 3 ms to minimize.
[2025-06-01 00:31:02] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 2 ms to minimize.
[2025-06-01 00:31:02] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 2 ms to minimize.
[2025-06-01 00:31:02] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2025-06-01 00:31:02] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2025-06-01 00:31:02] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:31:02] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 1 ms to minimize.
[2025-06-01 00:31:02] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2025-06-01 00:31:02] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2025-06-01 00:31:02] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 1 ms to minimize.
[2025-06-01 00:31:02] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 2 ms to minimize.
[2025-06-01 00:31:02] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2025-06-01 00:31:03] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
[2025-06-01 00:31:03] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2025-06-01 00:31:03] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2025-06-01 00:31:03] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
[2025-06-01 00:31:03] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2025-06-01 00:31:03] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2025-06-01 00:31:03] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 214/417 variables, 203/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 38/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:31:04] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2025-06-01 00:31:04] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/422 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/422 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/422 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3501 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 40/40 constraints]
After SMT, in 4042ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 135 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2025-06-01 00:31:04] [INFO ] Invariant cache hit.
[2025-06-01 00:31:04] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-01 00:31:04] [INFO ] Invariant cache hit.
[2025-06-01 00:31:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 00:31:05] [INFO ] Implicit Places using invariants and state equation in 1277 ms returned []
Implicit Place search using SMT with State Equation took 1449 ms to find 0 implicit places.
[2025-06-01 00:31:05] [INFO ] Redundant transitions in 3 ms returned []
Running 213 sub problems to find dead transitions.
[2025-06-01 00:31:05] [INFO ] Invariant cache hit.
[2025-06-01 00:31:05] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 277 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9052 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 213/490 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2025-06-01 00:31:23] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2025-06-01 00:31:25] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2025-06-01 00:31:25] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2025-06-01 00:31:25] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 1 ms to minimize.
[2025-06-01 00:31:25] [INFO ] Deduced a trap composed of 90 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 5/495 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2025-06-01 00:31:35] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2025-06-01 00:31:39] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 497 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 7/7 constraints]
After SMT, in 39172ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39175ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40641 ms. Remains : 208/208 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 208 transition count 197
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 191 transition count 197
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 182 transition count 188
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 182 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 11 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 179 cols
[2025-06-01 00:31:45] [INFO ] Computed 31 invariants in 13 ms
[2025-06-01 00:31:45] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 00:31:45] [INFO ] [Real]Absence check using 5 positive and 26 generalized place invariants in 15 ms returned sat
[2025-06-01 00:31:45] [INFO ] After 77ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 00:31:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:31:45] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:31:45] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
TRAPS : Iteration 1
[2025-06-01 00:31:45] [INFO ] After 106ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:31:45] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:31:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 00:31:45] [INFO ] [Nat]Absence check using 5 positive and 26 generalized place invariants in 6 ms returned sat
[2025-06-01 00:31:45] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:31:45] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:31:45] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
[2025-06-01 00:31:45] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 1 ms to minimize.
[2025-06-01 00:31:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
TRAPS : Iteration 1
[2025-06-01 00:31:45] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:31:45] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 627 ms.
RANDOM walk for 40000 steps (5726 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3611 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 720099 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :0 out of 1
Probabilistic random walk after 720099 steps, saw 360130 distinct states, run finished after 3001 ms. (steps per millisecond=239 ) properties seen :0
// Phase 1: matrix 248 rows 255 cols
[2025-06-01 00:31:48] [INFO ] Computed 44 invariants in 13 ms
[2025-06-01 00:31:48] [INFO ] State equation strengthened by 24 read => feed constraints.
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) 99/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/193 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/221 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 238/459 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 22/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/496 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/498 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/503 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/503 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 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) 99/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/193 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/221 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 238/459 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 22/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/496 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/498 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/503 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/503 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/503 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 730ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 254 transition count 222
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 229 transition count 222
Partial Free-agglomeration rule applied 29 times.
Drop transitions (Partial Free agglomeration) removed 29 transitions
Iterating global reduction 2 with 29 rules applied. Total rules applied 81 place count 229 transition count 222
Applied a total of 81 rules in 14 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 229/255 places, 222/248 transitions.
RANDOM walk for 40000 steps (5800 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3670 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 749719 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :0 out of 1
Probabilistic random walk after 749719 steps, saw 374941 distinct states, run finished after 3001 ms. (steps per millisecond=249 ) properties seen :0
// Phase 1: matrix 222 rows 229 cols
[2025-06-01 00:31:52] [INFO ] Computed 44 invariants in 19 ms
[2025-06-01 00:31:52] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 133/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:31:52] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 29/163 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 61/224 variables, 24/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:31:52] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 2 ms to minimize.
[2025-06-01 00:31:52] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2025-06-01 00:31:53] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2025-06-01 00:31:53] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2025-06-01 00:31:53] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:31:53] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:31:53] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2025-06-01 00:31:53] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2025-06-01 00:31:53] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2025-06-01 00:31:53] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2025-06-01 00:31:53] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2025-06-01 00:31:53] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:31:53] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2025-06-01 00:31:53] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:31:53] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2025-06-01 00:31:53] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2025-06-01 00:31:53] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2025-06-01 00:31:54] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 222/446 variables, 224/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 38/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/451 variables, 5/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/451 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 330 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1649 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 229/229 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 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) 133/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 29/163 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 61/224 variables, 24/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 222/446 variables, 224/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 38/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/451 variables, 5/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/451 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/451 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 331 constraints, problems are : Problem set: 0 solved, 1 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 229/229 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 2016ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 229/229 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2025-06-01 00:31:54] [INFO ] Invariant cache hit.
[2025-06-01 00:31:54] [INFO ] Implicit Places using invariants in 209 ms returned [25, 45, 73, 78, 99, 105, 126, 131, 151, 156, 177, 183]
[2025-06-01 00:31:54] [INFO ] Actually due to overlaps returned [78, 25, 73]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 211 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 226/229 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 220
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 224 transition count 220
Applied a total of 4 rules in 8 ms. Remains 224 /226 variables (removed 2) and now considering 220/222 (removed 2) transitions.
// Phase 1: matrix 220 rows 224 cols
[2025-06-01 00:31:54] [INFO ] Computed 41 invariants in 9 ms
[2025-06-01 00:31:55] [INFO ] Implicit Places using invariants in 187 ms returned [43, 94, 100, 121, 126, 146, 151, 172, 178]
[2025-06-01 00:31:55] [INFO ] Actually due to overlaps returned [100, 43, 94]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 188 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 221/229 places, 220/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 220 transition count 219
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 220 transition count 219
Applied a total of 3 rules in 11 ms. Remains 220 /221 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 220 cols
[2025-06-01 00:31:55] [INFO ] Computed 38 invariants in 12 ms
[2025-06-01 00:31:55] [INFO ] Implicit Places using invariants in 188 ms returned [117, 122, 142, 147, 168, 174]
[2025-06-01 00:31:55] [INFO ] Actually due to overlaps returned [122, 117]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 190 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 218/229 places, 219/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 218
Applied a total of 2 rules in 7 ms. Remains 217 /218 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 217 cols
[2025-06-01 00:31:55] [INFO ] Computed 36 invariants in 12 ms
[2025-06-01 00:31:55] [INFO ] Implicit Places using invariants in 186 ms returned [139, 144, 165, 171]
[2025-06-01 00:31:55] [INFO ] Actually due to overlaps returned [144, 139]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 188 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 215/229 places, 218/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 217
Applied a total of 2 rules in 7 ms. Remains 214 /215 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 214 cols
[2025-06-01 00:31:55] [INFO ] Computed 34 invariants in 11 ms
[2025-06-01 00:31:55] [INFO ] Implicit Places using invariants in 158 ms returned [162, 168]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 159 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 212/229 places, 217/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 216
Applied a total of 2 rules in 7 ms. Remains 211 /212 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 211 cols
[2025-06-01 00:31:55] [INFO ] Computed 32 invariants in 11 ms
[2025-06-01 00:31:55] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-01 00:31:55] [INFO ] Invariant cache hit.
[2025-06-01 00:31:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 00:31:56] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 211/229 places, 216/222 transitions.
Finished structural reductions in REACHABILITY mode , in 6 iterations and 2199 ms. Remains : 211/229 places, 216/222 transitions.
RANDOM walk for 40000 steps (5756 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3632 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 748482 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :0 out of 1
Probabilistic random walk after 748482 steps, saw 374318 distinct states, run finished after 3001 ms. (steps per millisecond=249 ) properties seen :0
[2025-06-01 00:31:59] [INFO ] Invariant cache hit.
[2025-06-01 00:31:59] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 129/130 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/152 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/206 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:32:00] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 2 ms to minimize.
[2025-06-01 00:32:00] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2025-06-01 00:32:00] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 3 ms to minimize.
[2025-06-01 00:32:00] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 216/422 variables, 206/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 38/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/427 variables, 5/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/427 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 563 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 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) 129/130 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/152 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/206 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 216/422 variables, 206/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 38/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/427 variables, 5/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/427 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/427 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 806ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 77 ms.
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 211/211 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2025-06-01 00:32:00] [INFO ] Invariant cache hit.
[2025-06-01 00:32:00] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-01 00:32:00] [INFO ] Invariant cache hit.
[2025-06-01 00:32:01] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 00:32:02] [INFO ] Implicit Places using invariants and state equation in 1074 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
[2025-06-01 00:32:02] [INFO ] Redundant transitions in 1 ms returned []
Running 215 sub problems to find dead transitions.
[2025-06-01 00:32:02] [INFO ] Invariant cache hit.
[2025-06-01 00:32:02] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/211 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/427 variables, 211/243 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 38/281 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/427 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 281 constraints, problems are : Problem set: 0 solved, 215 unsolved in 9591 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/211 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/427 variables, 211/243 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 38/281 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 215/496 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2025-06-01 00:32:18] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2025-06-01 00:32:20] [INFO ] Deduced a trap composed of 92 places in 69 ms of which 1 ms to minimize.
[2025-06-01 00:32:20] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 3/499 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2025-06-01 00:32:25] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2025-06-01 00:32:25] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2025-06-01 00:32:25] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 2 ms to minimize.
[2025-06-01 00:32:25] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2025-06-01 00:32:25] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:32:25] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:32:25] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2025-06-01 00:32:25] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:32:25] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 2 ms to minimize.
[2025-06-01 00:32:25] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
[2025-06-01 00:32:26] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 2 ms to minimize.
[2025-06-01 00:32:26] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 1 ms to minimize.
[2025-06-01 00:32:26] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2025-06-01 00:32:26] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 1 ms to minimize.
[2025-06-01 00:32:26] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 1 ms to minimize.
[2025-06-01 00:32:26] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2025-06-01 00:32:26] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:32:26] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 18/517 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/427 variables, and 517 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 21/21 constraints]
After SMT, in 39671ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 39675ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40905 ms. Remains : 211/211 places, 216/216 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 211 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 193 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 185 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 185 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 184 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 184 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 187
Applied a total of 58 rules in 11 ms. Remains 182 /211 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 182 cols
[2025-06-01 00:32:41] [INFO ] Computed 32 invariants in 12 ms
[2025-06-01 00:32:41] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-01 00:32:41] [INFO ] [Real]Absence check using 7 positive and 25 generalized place invariants in 14 ms returned sat
[2025-06-01 00:32:41] [INFO ] After 81ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 00:32:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:32:41] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:32:41] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2025-06-01 00:32:42] [INFO ] After 91ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:32:42] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:32:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-01 00:32:42] [INFO ] [Nat]Absence check using 7 positive and 25 generalized place invariants in 6 ms returned sat
[2025-06-01 00:32:42] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:32:42] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:32:42] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2025-06-01 00:32:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
TRAPS : Iteration 1
[2025-06-01 00:32:42] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:32:42] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 463 ms.
RANDOM walk for 40000 steps (5761 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3627 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 695971 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :0 out of 1
Probabilistic random walk after 695971 steps, saw 348061 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :0
// Phase 1: matrix 248 rows 255 cols
[2025-06-01 00:32:45] [INFO ] Computed 44 invariants in 13 ms
[2025-06-01 00:32:45] [INFO ] State equation strengthened by 24 read => feed constraints.
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) 106/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/193 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/221 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 238/459 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 22/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/496 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/498 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/503 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/503 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 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) 106/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/193 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/221 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 238/459 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 22/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/496 variables, 28/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/498 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/503 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:32:46] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/503 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/503 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/503 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 606 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 969ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 11 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 227/255 places, 220/248 transitions.
RANDOM walk for 40000 steps (5752 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3675 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 727200 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 1
Probabilistic random walk after 727200 steps, saw 363683 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
// Phase 1: matrix 220 rows 227 cols
[2025-06-01 00:32:49] [INFO ] Computed 44 invariants in 16 ms
[2025-06-01 00:32:49] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 30/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/184 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:32:49] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2025-06-01 00:32:49] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2025-06-01 00:32:49] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2025-06-01 00:32:49] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2025-06-01 00:32:49] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2025-06-01 00:32:49] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:32:50] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2025-06-01 00:32:50] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2025-06-01 00:32:50] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2025-06-01 00:32:50] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2025-06-01 00:32:50] [INFO ] Deduced a trap composed of 88 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/220 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:32:50] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2025-06-01 00:32:50] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/222 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 220/442 variables, 222/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 38/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/442 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/447 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/447 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/447 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/447 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1304 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 227/227 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 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) 30/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/184 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:32:50] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2025-06-01 00:32:50] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2025-06-01 00:32:50] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/220 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:32:51] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2025-06-01 00:32:51] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/222 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 220/442 variables, 222/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 38/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/442 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/442 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/447 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/447 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/447 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/447 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 447/447 variables, and 328 constraints, problems are : Problem set: 0 solved, 1 unsolved in 637 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 227/227 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints]
After SMT, in 1969ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2025-06-01 00:32:51] [INFO ] Invariant cache hit.
[2025-06-01 00:32:51] [INFO ] Implicit Places using invariants in 250 ms returned [25, 51, 72, 77, 97, 103, 124, 129, 149, 154, 175, 181]
[2025-06-01 00:32:51] [INFO ] Actually due to overlaps returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 260 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 226/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 219
Applied a total of 2 rules in 6 ms. Remains 225 /226 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 225 cols
[2025-06-01 00:32:51] [INFO ] Computed 43 invariants in 11 ms
[2025-06-01 00:32:51] [INFO ] Implicit Places using invariants in 240 ms returned [49, 70, 75, 95, 101, 122, 127, 147, 152, 173, 179]
[2025-06-01 00:32:51] [INFO ] Actually due to overlaps returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 241 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 224/227 places, 219/220 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 219
Applied a total of 1 rules in 6 ms. Remains 224 /224 variables (removed 0) and now considering 219/219 (removed 0) transitions.
// Phase 1: matrix 219 rows 224 cols
[2025-06-01 00:32:51] [INFO ] Computed 42 invariants in 14 ms
[2025-06-01 00:32:52] [INFO ] Implicit Places using invariants in 253 ms returned [69, 74, 94, 100, 121, 126, 146, 151, 172, 178]
[2025-06-01 00:32:52] [INFO ] Actually due to overlaps returned [74, 69]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 255 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 222/227 places, 219/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 218
Applied a total of 2 rules in 6 ms. Remains 221 /222 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 221 cols
[2025-06-01 00:32:52] [INFO ] Computed 40 invariants in 7 ms
[2025-06-01 00:32:52] [INFO ] Implicit Places using invariants in 188 ms returned [91, 97, 118, 123, 143, 148, 169, 175]
[2025-06-01 00:32:52] [INFO ] Actually due to overlaps returned [97, 91]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 189 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 219/227 places, 218/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 217
Applied a total of 2 rules in 6 ms. Remains 218 /219 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 218 cols
[2025-06-01 00:32:52] [INFO ] Computed 38 invariants in 10 ms
[2025-06-01 00:32:52] [INFO ] Implicit Places using invariants in 183 ms returned [115, 120, 140, 145, 166, 172]
[2025-06-01 00:32:52] [INFO ] Actually due to overlaps returned [120, 115]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 184 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 216/227 places, 217/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 216
Applied a total of 2 rules in 7 ms. Remains 215 /216 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 215 cols
[2025-06-01 00:32:52] [INFO ] Computed 36 invariants in 9 ms
[2025-06-01 00:32:52] [INFO ] Implicit Places using invariants in 175 ms returned [137, 142, 163, 169]
[2025-06-01 00:32:52] [INFO ] Actually due to overlaps returned [142, 137]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 176 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 213/227 places, 216/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 215
Applied a total of 2 rules in 6 ms. Remains 212 /213 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 212 cols
[2025-06-01 00:32:52] [INFO ] Computed 34 invariants in 7 ms
[2025-06-01 00:32:52] [INFO ] Implicit Places using invariants in 160 ms returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 161 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 210/227 places, 215/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 214
Applied a total of 2 rules in 6 ms. Remains 209 /210 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 209 cols
[2025-06-01 00:32:52] [INFO ] Computed 32 invariants in 9 ms
[2025-06-01 00:32:53] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-01 00:32:53] [INFO ] Invariant cache hit.
[2025-06-01 00:32:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 00:32:54] [INFO ] Implicit Places using invariants and state equation in 1359 ms returned []
Implicit Place search using SMT with State Equation took 1517 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 209/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 8 iterations and 3035 ms. Remains : 209/227 places, 214/220 transitions.
RANDOM walk for 40000 steps (5811 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3626 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 723705 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :0 out of 1
Probabilistic random walk after 723705 steps, saw 361940 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
[2025-06-01 00:32:57] [INFO ] Invariant cache hit.
[2025-06-01 00:32:57] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 82/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/150 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/204 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:32:57] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 214/418 variables, 204/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 38/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/423 variables, 5/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/423 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 82/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/150 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:32:57] [INFO ] Deduced a trap composed of 100 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 54/204 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 214/418 variables, 204/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 38/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:32:58] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/423 variables, 5/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/423 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 794ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2025-06-01 00:32:58] [INFO ] Invariant cache hit.
[2025-06-01 00:32:58] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-06-01 00:32:58] [INFO ] Invariant cache hit.
[2025-06-01 00:32:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 00:32:59] [INFO ] Implicit Places using invariants and state equation in 1363 ms returned []
Implicit Place search using SMT with State Equation took 1529 ms to find 0 implicit places.
[2025-06-01 00:32:59] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2025-06-01 00:32:59] [INFO ] Invariant cache hit.
[2025-06-01 00:32:59] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 279 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9564 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 213/492 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2025-06-01 00:33:17] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2025-06-01 00:33:18] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 1 ms to minimize.
[2025-06-01 00:33:18] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2025-06-01 00:33:18] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2025-06-01 00:33:18] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2025-06-01 00:33:18] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2025-06-01 00:33:19] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2025-06-01 00:33:20] [INFO ] Deduced a trap composed of 85 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:33:20] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 2 ms to minimize.
[2025-06-01 00:33:21] [INFO ] Deduced a trap composed of 91 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 10/502 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2025-06-01 00:33:25] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2025-06-01 00:33:25] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2025-06-01 00:33:25] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:33:25] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2025-06-01 00:33:25] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2025-06-01 00:33:25] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2025-06-01 00:33:26] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2025-06-01 00:33:26] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2025-06-01 00:33:26] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2025-06-01 00:33:26] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 1 ms to minimize.
[2025-06-01 00:33:26] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 1 ms to minimize.
[2025-06-01 00:33:26] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 1 ms to minimize.
[2025-06-01 00:33:27] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2025-06-01 00:33:27] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2025-06-01 00:33:27] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2025-06-01 00:33:27] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2025-06-01 00:33:27] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2025-06-01 00:33:27] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2025-06-01 00:33:27] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
[2025-06-01 00:33:28] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 20/522 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 522 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 30/30 constraints]
After SMT, in 39659ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39663ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41204 ms. Remains : 209/209 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 185
Applied a total of 58 rules in 31 ms. Remains 180 /209 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 180 cols
[2025-06-01 00:33:39] [INFO ] Computed 32 invariants in 15 ms
[2025-06-01 00:33:39] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2025-06-01 00:33:39] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 3 ms returned sat
[2025-06-01 00:33:39] [INFO ] After 87ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 00:33:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:33:39] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:33:39] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2025-06-01 00:33:39] [INFO ] After 114ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:33:39] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:33:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2025-06-01 00:33:39] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 3 ms returned sat
[2025-06-01 00:33:40] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:33:40] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:33:40] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2025-06-01 00:33:40] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2025-06-01 00:33:40] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2025-06-01 00:33:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 251 ms
TRAPS : Iteration 1
[2025-06-01 00:33:40] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:33:40] [INFO ] After 439ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 750 ms.
RANDOM walk for 40000 steps (5701 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3634 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 721031 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :0 out of 1
Probabilistic random walk after 721031 steps, saw 360596 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :0
// Phase 1: matrix 248 rows 255 cols
[2025-06-01 00:33:43] [INFO ] Computed 44 invariants in 17 ms
[2025-06-01 00:33:43] [INFO ] State equation strengthened by 24 read => feed constraints.
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) 100/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 92/193 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/221 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 238/459 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 22/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/496 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/498 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/503 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/503 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 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) 100/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 92/193 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:33:43] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/221 variables, 9/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 238/459 variables, 221/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 22/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 37/496 variables, 28/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/498 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/498 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 5/503 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/503 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/503 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/503 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 900ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 254 transition count 222
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 229 transition count 222
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 229 transition count 222
Applied a total of 80 rules in 14 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 229/255 places, 222/248 transitions.
RANDOM walk for 40000 steps (5735 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3599 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 741957 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :0 out of 1
Probabilistic random walk after 741957 steps, saw 371064 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
// Phase 1: matrix 222 rows 229 cols
[2025-06-01 00:33:47] [INFO ] Computed 44 invariants in 17 ms
[2025-06-01 00:33:47] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 132/133 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/224 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:33:47] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
[2025-06-01 00:33:47] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 222/446 variables, 224/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 38/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/451 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/451 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 229/229 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 132/133 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:33:47] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 91/224 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:33:48] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2025-06-01 00:33:48] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 222/446 variables, 224/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 38/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/451 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/451 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 229/229 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1003ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 229/229 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2025-06-01 00:33:48] [INFO ] Invariant cache hit.
[2025-06-01 00:33:48] [INFO ] Implicit Places using invariants in 226 ms returned [25, 74, 79, 99, 105, 126, 131, 151, 156, 177, 183]
[2025-06-01 00:33:48] [INFO ] Actually due to overlaps returned [79, 74, 25]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 227 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 226/229 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 220
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 224 transition count 220
Applied a total of 4 rules in 7 ms. Remains 224 /226 variables (removed 2) and now considering 220/222 (removed 2) transitions.
// Phase 1: matrix 220 rows 224 cols
[2025-06-01 00:33:48] [INFO ] Computed 41 invariants in 13 ms
[2025-06-01 00:33:48] [INFO ] Implicit Places using invariants in 197 ms returned [94, 100, 121, 126, 146, 151, 172, 178]
[2025-06-01 00:33:48] [INFO ] Actually due to overlaps returned [100, 94]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 198 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 222/229 places, 220/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 219
Applied a total of 2 rules in 7 ms. Remains 221 /222 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 221 cols
[2025-06-01 00:33:48] [INFO ] Computed 39 invariants in 6 ms
[2025-06-01 00:33:49] [INFO ] Implicit Places using invariants in 170 ms returned [118, 123, 143, 148, 169, 175]
[2025-06-01 00:33:49] [INFO ] Actually due to overlaps returned [123, 118]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 171 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 219/229 places, 219/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 218
Applied a total of 2 rules in 10 ms. Remains 218 /219 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 218 cols
[2025-06-01 00:33:49] [INFO ] Computed 37 invariants in 14 ms
[2025-06-01 00:33:49] [INFO ] Implicit Places using invariants in 176 ms returned [140, 145, 166, 172]
[2025-06-01 00:33:49] [INFO ] Actually due to overlaps returned [145, 140]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 177 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 216/229 places, 218/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 217
Applied a total of 2 rules in 6 ms. Remains 215 /216 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 215 cols
[2025-06-01 00:33:49] [INFO ] Computed 35 invariants in 14 ms
[2025-06-01 00:33:49] [INFO ] Implicit Places using invariants in 168 ms returned [163, 169]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 169 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 213/229 places, 217/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 216
Applied a total of 2 rules in 7 ms. Remains 212 /213 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 212 cols
[2025-06-01 00:33:49] [INFO ] Computed 33 invariants in 12 ms
[2025-06-01 00:33:49] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-01 00:33:49] [INFO ] Invariant cache hit.
[2025-06-01 00:33:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 00:33:50] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 212/229 places, 216/222 transitions.
Finished structural reductions in REACHABILITY mode , in 6 iterations and 2229 ms. Remains : 212/229 places, 216/222 transitions.
RANDOM walk for 40000 steps (5716 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3629 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 753941 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 1
Probabilistic random walk after 753941 steps, saw 377054 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
[2025-06-01 00:33:53] [INFO ] Invariant cache hit.
[2025-06-01 00:33:53] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 112/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 78/207 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:33:53] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 2 ms to minimize.
[2025-06-01 00:33:53] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2025-06-01 00:33:54] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2025-06-01 00:33:54] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2025-06-01 00:33:54] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2025-06-01 00:33:54] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:33:54] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2025-06-01 00:33:54] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2025-06-01 00:33:54] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2025-06-01 00:33:54] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 216/423 variables, 207/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 38/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/428 variables, 5/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/428 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 212/212 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 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) 112/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 78/207 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:33:54] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 216/423 variables, 207/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 38/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/428 variables, 5/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/428 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 212/212 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 1386ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 212/212 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2025-06-01 00:33:55] [INFO ] Invariant cache hit.
[2025-06-01 00:33:55] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-01 00:33:55] [INFO ] Invariant cache hit.
[2025-06-01 00:33:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 00:33:56] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
[2025-06-01 00:33:56] [INFO ] Redundant transitions in 2 ms returned []
Running 215 sub problems to find dead transitions.
[2025-06-01 00:33:56] [INFO ] Invariant cache hit.
[2025-06-01 00:33:56] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/212 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/428 variables, 212/245 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 38/283 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/428 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 283 constraints, problems are : Problem set: 0 solved, 215 unsolved in 9825 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 212/212 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/212 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/428 variables, 212/245 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 38/283 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 215/498 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2025-06-01 00:34:13] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2025-06-01 00:34:13] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 1 ms to minimize.
[2025-06-01 00:34:13] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
[2025-06-01 00:34:14] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 1 ms to minimize.
[2025-06-01 00:34:14] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 5/503 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2025-06-01 00:34:21] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2025-06-01 00:34:21] [INFO ] Deduced a trap composed of 95 places in 70 ms of which 1 ms to minimize.
[2025-06-01 00:34:22] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 1 ms to minimize.
[2025-06-01 00:34:23] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 2 ms to minimize.
[2025-06-01 00:34:24] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 5/508 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2025-06-01 00:34:34] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2025-06-01 00:34:34] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/428 variables, and 510 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 212/212 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 12/12 constraints]
After SMT, in 39901ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 39906ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41113 ms. Remains : 212/212 places, 216/216 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 212 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 194 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 186 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 186 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 185 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 185 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 183 transition count 187
Applied a total of 58 rules in 9 ms. Remains 183 /212 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 183 cols
[2025-06-01 00:34:36] [INFO ] Computed 33 invariants in 8 ms
[2025-06-01 00:34:36] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-01 00:34:36] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 6 ms returned sat
[2025-06-01 00:34:36] [INFO ] After 72ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 00:34:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:34:36] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:34:36] [INFO ] After 20ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-06-01 00:34:36] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 170 ms.
RANDOM walk for 40000 steps (5809 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3628 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2031 steps, run visited all 1 properties in 12 ms. (steps per millisecond=169 )
Probabilistic random walk after 2031 steps, saw 1030 distinct states, run finished after 15 ms. (steps per millisecond=135 ) properties seen :1
RANDOM walk for 40000 steps (5771 resets) in 270 ms. (147 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3635 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 713921 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :0 out of 1
Probabilistic random walk after 713921 steps, saw 357041 distinct states, run finished after 3001 ms. (steps per millisecond=237 ) properties seen :0
// Phase 1: matrix 248 rows 255 cols
[2025-06-01 00:34:39] [INFO ] Computed 44 invariants in 13 ms
[2025-06-01 00:34:39] [INFO ] State equation strengthened by 24 read => feed constraints.
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) 99/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/193 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/221 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 238/459 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 22/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/496 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/498 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/503 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/503 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 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) 99/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/193 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/221 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 238/459 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 22/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/496 variables, 28/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/498 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/503 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/503 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/503 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 682ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 11 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 226/255 places, 219/248 transitions.
RANDOM walk for 40000 steps (5866 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3702 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 732483 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :0 out of 1
Probabilistic random walk after 732483 steps, saw 366325 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
// Phase 1: matrix 219 rows 226 cols
[2025-06-01 00:34:43] [INFO ] Computed 44 invariants in 18 ms
[2025-06-01 00:34:43] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 129/130 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/138 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/221 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:34:43] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2025-06-01 00:34:43] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2025-06-01 00:34:43] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2025-06-01 00:34:43] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2025-06-01 00:34:44] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2025-06-01 00:34:44] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2025-06-01 00:34:44] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2025-06-01 00:34:44] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2025-06-01 00:34:44] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2025-06-01 00:34:44] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2025-06-01 00:34:44] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2025-06-01 00:34:44] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
[2025-06-01 00:34:44] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 219/440 variables, 221/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 38/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/445 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/445 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/445 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 226/226 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 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) 129/130 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/138 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/221 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 219/440 variables, 221/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 38/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/445 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/445 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/445 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 226/226 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 1474ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2025-06-01 00:34:45] [INFO ] Invariant cache hit.
[2025-06-01 00:34:45] [INFO ] Implicit Places using invariants in 257 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
[2025-06-01 00:34:45] [INFO ] Actually due to overlaps returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 258 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 225/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 218
Applied a total of 2 rules in 7 ms. Remains 224 /225 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 224 cols
[2025-06-01 00:34:45] [INFO ] Computed 43 invariants in 11 ms
[2025-06-01 00:34:45] [INFO ] Implicit Places using invariants in 245 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 146, 151, 172, 178]
[2025-06-01 00:34:45] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 246 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 222/226 places, 218/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 217
Applied a total of 2 rules in 7 ms. Remains 221 /222 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 221 cols
[2025-06-01 00:34:45] [INFO ] Computed 41 invariants in 8 ms
[2025-06-01 00:34:45] [INFO ] Implicit Places using invariants in 216 ms returned [66, 71, 91, 97, 118, 123, 143, 148, 169, 175]
[2025-06-01 00:34:45] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 217 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 219/226 places, 217/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 216
Applied a total of 2 rules in 7 ms. Remains 218 /219 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 218 cols
[2025-06-01 00:34:45] [INFO ] Computed 39 invariants in 10 ms
[2025-06-01 00:34:46] [INFO ] Implicit Places using invariants in 198 ms returned [88, 94, 115, 120, 140, 145, 166, 172]
[2025-06-01 00:34:46] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 199 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 216/226 places, 216/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 215
Applied a total of 2 rules in 8 ms. Remains 215 /216 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 215 cols
[2025-06-01 00:34:46] [INFO ] Computed 37 invariants in 9 ms
[2025-06-01 00:34:46] [INFO ] Implicit Places using invariants in 186 ms returned [112, 117, 137, 142, 163, 169]
[2025-06-01 00:34:46] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 187 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 213/226 places, 215/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 214
Applied a total of 2 rules in 6 ms. Remains 212 /213 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 212 cols
[2025-06-01 00:34:46] [INFO ] Computed 35 invariants in 10 ms
[2025-06-01 00:34:46] [INFO ] Implicit Places using invariants in 175 ms returned [134, 139, 160, 166]
[2025-06-01 00:34:46] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 176 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 210/226 places, 214/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 213
Applied a total of 2 rules in 6 ms. Remains 209 /210 variables (removed 1) and now considering 213/214 (removed 1) transitions.
// Phase 1: matrix 213 rows 209 cols
[2025-06-01 00:34:46] [INFO ] Computed 33 invariants in 9 ms
[2025-06-01 00:34:46] [INFO ] Implicit Places using invariants in 155 ms returned [157, 163]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 156 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 207/226 places, 213/219 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 212
Applied a total of 2 rules in 6 ms. Remains 206 /207 variables (removed 1) and now considering 212/213 (removed 1) transitions.
// Phase 1: matrix 212 rows 206 cols
[2025-06-01 00:34:46] [INFO ] Computed 31 invariants in 10 ms
[2025-06-01 00:34:46] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-01 00:34:46] [INFO ] Invariant cache hit.
[2025-06-01 00:34:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 00:34:48] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 1450 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 8 iterations and 2942 ms. Remains : 206/226 places, 212/219 transitions.
RANDOM walk for 40000 steps (5773 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3711 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 736619 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :0 out of 1
Probabilistic random walk after 736619 steps, saw 368391 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
[2025-06-01 00:34:51] [INFO ] Invariant cache hit.
[2025-06-01 00:34:51] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 122/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:34:51] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/147 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:34:51] [INFO ] Deduced a trap composed of 91 places in 63 ms of which 1 ms to minimize.
[2025-06-01 00:34:51] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 1 ms to minimize.
[2025-06-01 00:34:51] [INFO ] Deduced a trap composed of 89 places in 59 ms of which 1 ms to minimize.
[2025-06-01 00:34:51] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2025-06-01 00:34:51] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/201 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:34:51] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-06-01 00:34:51] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2025-06-01 00:34:51] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2025-06-01 00:34:51] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2025-06-01 00:34:51] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 2 ms to minimize.
[2025-06-01 00:34:51] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2025-06-01 00:34:52] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2025-06-01 00:34:52] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2025-06-01 00:34:52] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2025-06-01 00:34:52] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:34:52] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 212/413 variables, 201/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 38/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/418 variables, 5/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/418 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 292 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1369 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 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) 122/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/147 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:34:52] [INFO ] Deduced a trap composed of 91 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 54/201 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:34:52] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2025-06-01 00:34:52] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2025-06-01 00:34:52] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2025-06-01 00:34:52] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2025-06-01 00:34:52] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2025-06-01 00:34:52] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2025-06-01 00:34:52] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2025-06-01 00:34:53] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2025-06-01 00:34:53] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 212/413 variables, 201/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 38/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/418 variables, 5/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/418 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/418 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/418 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 825 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 27/27 constraints]
After SMT, in 2204ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2025-06-01 00:34:53] [INFO ] Invariant cache hit.
[2025-06-01 00:34:53] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-01 00:34:53] [INFO ] Invariant cache hit.
[2025-06-01 00:34:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 00:34:54] [INFO ] Implicit Places using invariants and state equation in 1264 ms returned []
Implicit Place search using SMT with State Equation took 1406 ms to find 0 implicit places.
[2025-06-01 00:34:54] [INFO ] Redundant transitions in 1 ms returned []
Running 211 sub problems to find dead transitions.
[2025-06-01 00:34:54] [INFO ] Invariant cache hit.
[2025-06-01 00:34:54] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/418 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 211 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 275 constraints, problems are : Problem set: 0 solved, 211 unsolved in 8984 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/418 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 211/486 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-06-01 00:35:11] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2025-06-01 00:35:12] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 2/488 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-06-01 00:35:26] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2025-06-01 00:35:27] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 1 ms to minimize.
[2025-06-01 00:35:27] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:35:28] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2025-06-01 00:35:28] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 1 ms to minimize.
[2025-06-01 00:35:28] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:35:28] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/418 variables, 7/495 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-06-01 00:35:33] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 0)
(s2 0)
(s3 0)
(s4 4529)
(s5 4527)
(s6 0)
(s7 4529)
(s8 1)
(s9 3)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 2)
(s33 3)
(s34 3)
(s35 2)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 8)
(s53 8)
(s54 8)
(s55 1)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 14)
(s76 13)
(s77 14)
(s78 1)
(s79 2)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 15)
(s99 15)
(s100 15)
(s101 2)
(s102 2)
(s103 2)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 4)
(s121 1)
(s122 4)
(s123 2)
(s124 5)
(s125 2)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 7)
(s145 9)
(s146 8)
(s147 0)
(s148 2)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 2)
(s167 2)
(s168 2)
(s169 2)
(s170 2)
(s171 2)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 496 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 10/10 constraints]
After SMT, in 39084ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 39086ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40506 ms. Remains : 206/206 places, 212/212 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 9 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2025-06-01 00:35:33] [INFO ] Computed 31 invariants in 7 ms
[2025-06-01 00:35:33] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-01 00:35:33] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2025-06-01 00:35:34] [INFO ] After 77ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 00:35:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:35:34] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:35:34] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2025-06-01 00:35:34] [INFO ] After 97ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:35:34] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:35:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-01 00:35:34] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2025-06-01 00:35:34] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:35:34] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:35:34] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:35:34] [INFO ] After 150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 396 ms.
RANDOM walk for 40000 steps (5732 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3598 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 706761 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :0 out of 1
Probabilistic random walk after 706761 steps, saw 353465 distinct states, run finished after 3001 ms. (steps per millisecond=235 ) properties seen :0
// Phase 1: matrix 248 rows 255 cols
[2025-06-01 00:35:37] [INFO ] Computed 44 invariants in 12 ms
[2025-06-01 00:35:37] [INFO ] State equation strengthened by 24 read => feed constraints.
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) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/128 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:35:37] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/193 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/221 variables, 9/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 238/459 variables, 221/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 22/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 37/496 variables, 28/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/496 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/498 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/498 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/498 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/503 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/503 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/503 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/503 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/128 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/193 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/221 variables, 9/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 238/459 variables, 221/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 22/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/459 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 37/496 variables, 28/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/496 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/496 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/498 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/498 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/498 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 5/503 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/503 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/503 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/503 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 613ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 10 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 227/255 places, 220/248 transitions.
RANDOM walk for 40000 steps (5775 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3646 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 730980 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :0 out of 1
Probabilistic random walk after 730980 steps, saw 365569 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
// Phase 1: matrix 220 rows 227 cols
[2025-06-01 00:35:41] [INFO ] Computed 44 invariants in 15 ms
[2025-06-01 00:35:41] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/163 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:35:41] [INFO ] Deduced a trap composed of 108 places in 64 ms of which 2 ms to minimize.
[2025-06-01 00:35:41] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2025-06-01 00:35:41] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2025-06-01 00:35:41] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2025-06-01 00:35:41] [INFO ] Deduced a trap composed of 104 places in 57 ms of which 2 ms to minimize.
[2025-06-01 00:35:41] [INFO ] Deduced a trap composed of 109 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 57/220 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:35:41] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2025-06-01 00:35:41] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2025-06-01 00:35:41] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2025-06-01 00:35:41] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/222 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 220/442 variables, 222/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 38/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/442 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/447 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/447 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/447 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/447 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 319 constraints, problems are : Problem set: 0 solved, 1 unsolved in 935 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 227/227 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/163 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 57/220 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/222 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:35:42] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2025-06-01 00:35:42] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 220/442 variables, 222/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/442 variables, 38/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/442 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/447 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/447 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/447 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/447 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 447/447 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 227/227 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 1390ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2025-06-01 00:35:42] [INFO ] Invariant cache hit.
[2025-06-01 00:35:42] [INFO ] Implicit Places using invariants in 210 ms returned [25, 45, 72, 77, 97, 103, 124, 129, 149, 154, 175, 181]
[2025-06-01 00:35:42] [INFO ] Actually due to overlaps returned [77, 25, 72]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 212 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 224/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 224 transition count 218
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 222 transition count 218
Applied a total of 4 rules in 6 ms. Remains 222 /224 variables (removed 2) and now considering 218/220 (removed 2) transitions.
// Phase 1: matrix 218 rows 222 cols
[2025-06-01 00:35:42] [INFO ] Computed 41 invariants in 12 ms
[2025-06-01 00:35:42] [INFO ] Implicit Places using invariants in 191 ms returned [43, 92, 98, 119, 124, 144, 149, 170, 176]
[2025-06-01 00:35:42] [INFO ] Actually due to overlaps returned [98, 43, 92]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 192 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 219/227 places, 218/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 217
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 218 transition count 217
Applied a total of 3 rules in 8 ms. Remains 218 /219 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 218 cols
[2025-06-01 00:35:42] [INFO ] Computed 38 invariants in 10 ms
[2025-06-01 00:35:43] [INFO ] Implicit Places using invariants in 177 ms returned [115, 120, 140, 145, 166, 172]
[2025-06-01 00:35:43] [INFO ] Actually due to overlaps returned [120, 115]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 178 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 216/227 places, 217/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 216
Applied a total of 2 rules in 6 ms. Remains 215 /216 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 215 cols
[2025-06-01 00:35:43] [INFO ] Computed 36 invariants in 10 ms
[2025-06-01 00:35:43] [INFO ] Implicit Places using invariants in 168 ms returned [137, 142, 163, 169]
[2025-06-01 00:35:43] [INFO ] Actually due to overlaps returned [142, 137]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 168 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 213/227 places, 216/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 215
Applied a total of 2 rules in 6 ms. Remains 212 /213 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 212 cols
[2025-06-01 00:35:43] [INFO ] Computed 34 invariants in 9 ms
[2025-06-01 00:35:43] [INFO ] Implicit Places using invariants in 154 ms returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 154 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 210/227 places, 215/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 214
Applied a total of 2 rules in 6 ms. Remains 209 /210 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 209 cols
[2025-06-01 00:35:43] [INFO ] Computed 32 invariants in 10 ms
[2025-06-01 00:35:43] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-06-01 00:35:43] [INFO ] Invariant cache hit.
[2025-06-01 00:35:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 00:35:44] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 209/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 6 iterations and 2192 ms. Remains : 209/227 places, 214/220 transitions.
RANDOM walk for 40000 steps (5788 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3623 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 732008 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :0 out of 1
Probabilistic random walk after 732008 steps, saw 366089 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
[2025-06-01 00:35:47] [INFO ] Invariant cache hit.
[2025-06-01 00:35:47] [INFO ] State equation strengthened by 38 read => feed constraints.
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) 82/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/150 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:35:47] [INFO ] Deduced a trap composed of 99 places in 55 ms of which 1 ms to minimize.
[2025-06-01 00:35:47] [INFO ] Deduced a trap composed of 101 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 54/204 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 214/418 variables, 204/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 38/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/423 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/423 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 82/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/150 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:35:48] [INFO ] Deduced a trap composed of 104 places in 58 ms of which 1 ms to minimize.
[2025-06-01 00:35:48] [INFO ] Deduced a trap composed of 95 places in 50 ms of which 1 ms to minimize.
[2025-06-01 00:35:48] [INFO ] Deduced a trap composed of 101 places in 50 ms of which 1 ms to minimize.
[2025-06-01 00:35:48] [INFO ] Deduced a trap composed of 93 places in 58 ms of which 5 ms to minimize.
[2025-06-01 00:35:48] [INFO ] Deduced a trap composed of 100 places in 53 ms of which 1 ms to minimize.
[2025-06-01 00:35:48] [INFO ] Deduced a trap composed of 97 places in 57 ms of which 2 ms to minimize.
[2025-06-01 00:35:48] [INFO ] Deduced a trap composed of 103 places in 50 ms of which 1 ms to minimize.
[2025-06-01 00:35:48] [INFO ] Deduced a trap composed of 102 places in 50 ms of which 2 ms to minimize.
[2025-06-01 00:35:48] [INFO ] Deduced a trap composed of 101 places in 51 ms of which 1 ms to minimize.
[2025-06-01 00:35:48] [INFO ] Deduced a trap composed of 99 places in 51 ms of which 1 ms to minimize.
[2025-06-01 00:35:48] [INFO ] Deduced a trap composed of 101 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/204 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:35:48] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2025-06-01 00:35:49] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2025-06-01 00:35:49] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2025-06-01 00:35:49] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
[2025-06-01 00:35:49] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2025-06-01 00:35:49] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2025-06-01 00:35:49] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2025-06-01 00:35:49] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2025-06-01 00:35:49] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2025-06-01 00:35:49] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2025-06-01 00:35:49] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2025-06-01 00:35:49] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 214/418 variables, 204/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 38/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/423 variables, 5/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/423 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 25/25 constraints]
After SMT, in 2381ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2025-06-01 00:35:50] [INFO ] Invariant cache hit.
[2025-06-01 00:35:50] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-01 00:35:50] [INFO ] Invariant cache hit.
[2025-06-01 00:35:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 00:35:51] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
[2025-06-01 00:35:51] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2025-06-01 00:35:51] [INFO ] Invariant cache hit.
[2025-06-01 00:35:51] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 279 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9641 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
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 QuasiLiveness -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="DoubleExponent-PT-010"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is DoubleExponent-PT-010, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r084-tall-174860080400307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-010.tgz
mv DoubleExponent-PT-010 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.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 '
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;