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-174860080300303.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-004, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080300303
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K 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 67K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1748736311863

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 00:05:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 00:05:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 00:05:13] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2025-06-01 00:05:13] [INFO ] Transformed 216 places.
[2025-06-01 00:05:13] [INFO ] Transformed 198 transitions.
[2025-06-01 00:05:13] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 193 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 8 ms.
RANDOM walk for 40000 steps (1337 resets) in 1753 ms. (22 steps per ms) remains 161/205 properties
BEST_FIRST walk for 401 steps (12 resets) in 26 ms. (14 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (11 resets) in 34 ms. (11 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (11 resets) in 13 ms. (28 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (9 resets) in 38 ms. (10 steps per ms) remains 161/161 properties
BEST_FIRST walk for 401 steps (11 resets) in 36 ms. (10 steps per ms) remains 161/161 properties
BEST_FIRST walk for 401 steps (12 resets) in 27 ms. (14 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (12 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 401 steps (9 resets) in 9 ms. (40 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (12 resets) in 12 ms. (30 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (11 resets) in 13 ms. (28 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (11 resets) in 14 ms. (26 steps per ms) remains 161/161 properties
BEST_FIRST walk for 401 steps (11 resets) in 17 ms. (22 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (10 resets) in 9 ms. (40 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (11 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 401 steps (11 resets) in 12 ms. (30 steps per ms) remains 161/161 properties
BEST_FIRST walk for 401 steps (11 resets) in 9 ms. (40 steps per ms) remains 161/161 properties
BEST_FIRST walk for 401 steps (10 resets) in 10 ms. (36 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (12 resets) in 14 ms. (26 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (12 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (11 resets) in 9 ms. (40 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (12 resets) in 9 ms. (40 steps per ms) remains 161/161 properties
BEST_FIRST walk for 401 steps (10 resets) in 12 ms. (30 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (12 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 401 steps (11 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 401 steps (10 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (10 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (12 resets) in 11 ms. (33 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (11 resets) in 10 ms. (36 steps per ms) remains 161/161 properties
BEST_FIRST walk for 402 steps (11 resets) in 16 ms. (23 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (11 resets) in 9 ms. (40 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (11 resets) in 9 ms. (40 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (12 resets) in 9 ms. (40 steps per ms) remains 161/161 properties
BEST_FIRST walk for 401 steps (12 resets) in 10 ms. (36 steps per ms) remains 161/161 properties
BEST_FIRST walk for 401 steps (12 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 401 steps (10 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (10 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (10 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 401 steps (11 resets) in 9 ms. (40 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (10 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (9 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (12 resets) in 13 ms. (28 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (11 resets) in 9 ms. (40 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (12 resets) in 9 ms. (40 steps per ms) remains 161/161 properties
BEST_FIRST walk for 401 steps (11 resets) in 9 ms. (40 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (12 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (11 resets) in 7 ms. (50 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (12 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (11 resets) in 9 ms. (40 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (11 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 400 steps (11 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
// Phase 1: matrix 198 rows 216 cols
[2025-06-01 00:05:14] [INFO ] Computed 24 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 26/187 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 28/215 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 1/216 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 198/414 variables, 216/240 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/414 variables, and 240 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5184 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 26/187 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2025-06-01 00:05:20] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 23 ms to minimize.
[2025-06-01 00:05:21] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 2 ms to minimize.
[2025-06-01 00:05:21] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 2 ms to minimize.
[2025-06-01 00:05:21] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2025-06-01 00:05:21] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 1 ms to minimize.
[2025-06-01 00:05:21] [INFO ] Deduced a trap composed of 97 places in 61 ms of which 1 ms to minimize.
[2025-06-01 00:05:21] [INFO ] Deduced a trap composed of 54 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:05:21] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 2 ms to minimize.
[2025-06-01 00:05:21] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 2 ms to minimize.
[2025-06-01 00:05:21] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2025-06-01 00:05:22] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2025-06-01 00:05:23] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2025-06-01 00:05:23] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 2 ms to minimize.
[2025-06-01 00:05:23] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2025-06-01 00:05:23] [INFO ] Deduced a trap composed of 95 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2025-06-01 00:05:24] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 1 ms to minimize.
[2025-06-01 00:05:24] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 1 ms to minimize.
[2025-06-01 00:05:24] [INFO ] Deduced a trap composed of 68 places in 41 ms of which 1 ms to minimize.
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 Int declared 187/414 variables, and 35 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 14/21 constraints, State Equation: 0/216 constraints, PredecessorRefiner: 0/161 constraints, Known Traps: 18/18 constraints]
After SMT, in 10279ms problems are : Problem set: 0 solved, 161 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 161 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 216 transition count 189
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 207 transition count 189
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 207 transition count 187
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 205 transition count 187
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 50 place count 191 transition count 173
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 189 transition count 173
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 189 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 188 transition count 172
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 59 place count 188 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 187 transition count 171
Applied a total of 60 rules in 57 ms. Remains 187 /216 variables (removed 29) and now considering 171/198 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 187/216 places, 171/198 transitions.
RANDOM walk for 4000000 steps (510181 resets) in 36162 ms. (110 steps per ms) remains 123/161 properties
BEST_FIRST walk for 40001 steps (3369 resets) in 314 ms. (126 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3341 resets) in 356 ms. (112 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3341 resets) in 294 ms. (135 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3412 resets) in 393 ms. (101 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3411 resets) in 415 ms. (96 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3367 resets) in 289 ms. (137 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (3378 resets) in 296 ms. (134 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3337 resets) in 313 ms. (127 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (3406 resets) in 382 ms. (104 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3428 resets) in 305 ms. (130 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3354 resets) in 407 ms. (98 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3460 resets) in 393 ms. (101 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3364 resets) in 302 ms. (132 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (3416 resets) in 284 ms. (140 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3392 resets) in 295 ms. (135 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3440 resets) in 360 ms. (110 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3410 resets) in 336 ms. (118 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3289 resets) in 306 ms. (130 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3375 resets) in 311 ms. (128 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3393 resets) in 290 ms. (137 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3315 resets) in 286 ms. (139 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3408 resets) in 412 ms. (96 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3383 resets) in 301 ms. (132 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3384 resets) in 291 ms. (136 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3396 resets) in 311 ms. (128 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3347 resets) in 304 ms. (131 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (3395 resets) in 291 ms. (136 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3379 resets) in 314 ms. (126 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3433 resets) in 294 ms. (135 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3384 resets) in 319 ms. (125 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3357 resets) in 408 ms. (97 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3347 resets) in 333 ms. (119 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3365 resets) in 381 ms. (104 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3444 resets) in 299 ms. (133 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3457 resets) in 291 ms. (136 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3396 resets) in 317 ms. (125 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3457 resets) in 299 ms. (133 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3353 resets) in 249 ms. (160 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3355 resets) in 236 ms. (168 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3381 resets) in 242 ms. (164 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3323 resets) in 239 ms. (166 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3307 resets) in 242 ms. (164 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3265 resets) in 244 ms. (163 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3442 resets) in 299 ms. (133 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3396 resets) in 281 ms. (141 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3451 resets) in 415 ms. (96 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3369 resets) in 348 ms. (114 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3411 resets) in 266 ms. (149 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3437 resets) in 294 ms. (135 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3359 resets) in 281 ms. (141 steps per ms) remains 123/123 properties
// Phase 1: matrix 171 rows 187 cols
[2025-06-01 00:05:39] [INFO ] Computed 24 invariants in 10 ms
[2025-06-01 00:05:39] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 46/169 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 4/173 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 14/187 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 171/358 variables, 187/211 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/358 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 213 constraints, problems are : Problem set: 0 solved, 123 unsolved in 4794 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 187/187 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 46/169 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2025-06-01 00:05:44] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2025-06-01 00:05:45] [INFO ] Deduced a trap composed of 133 places in 66 ms of which 1 ms to minimize.
[2025-06-01 00:05:45] [INFO ] Deduced a trap composed of 125 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 4/173 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 14/187 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2025-06-01 00:05:46] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2025-06-01 00:05:46] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2025-06-01 00:05:46] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2025-06-01 00:05:46] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2025-06-01 00:05:46] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2025-06-01 00:05:46] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2025-06-01 00:05:47] [INFO ] Deduced a trap composed of 63 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:05:47] [INFO ] Deduced a trap composed of 91 places in 68 ms of which 2 ms to minimize.
[2025-06-01 00:05:47] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2025-06-01 00:05:47] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 2 ms to minimize.
[2025-06-01 00:05:47] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 2 ms to minimize.
[2025-06-01 00:05:47] [INFO ] Deduced a trap composed of 99 places in 62 ms of which 1 ms to minimize.
[2025-06-01 00:05:47] [INFO ] Deduced a trap composed of 106 places in 58 ms of which 2 ms to minimize.
[2025-06-01 00:05:47] [INFO ] Deduced a trap composed of 103 places in 52 ms of which 2 ms to minimize.
[2025-06-01 00:05:47] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 3 ms to minimize.
[2025-06-01 00:05:47] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 2 ms to minimize.
[2025-06-01 00:05:47] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:05:47] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2025-06-01 00:05:47] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2025-06-01 00:05:48] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2025-06-01 00:05:48] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 2 ms to minimize.
[2025-06-01 00:05:48] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
[2025-06-01 00:05:48] [INFO ] Deduced a trap composed of 98 places in 57 ms of which 2 ms to minimize.
[2025-06-01 00:05:48] [INFO ] Deduced a trap composed of 92 places in 54 ms of which 1 ms to minimize.
[2025-06-01 00:05:48] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 1 ms to minimize.
[2025-06-01 00:05:48] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2025-06-01 00:05:48] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 1 ms to minimize.
[2025-06-01 00:05:48] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 2 ms to minimize.
[2025-06-01 00:05:49] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 2 ms to minimize.
[2025-06-01 00:05:49] [INFO ] Deduced a trap composed of 80 places in 55 ms of which 2 ms to minimize.
[2025-06-01 00:05:49] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2025-06-01 00:05:49] [INFO ] Deduced a trap composed of 94 places in 59 ms of which 2 ms to minimize.
[2025-06-01 00:05:49] [INFO ] Deduced a trap composed of 92 places in 56 ms of which 1 ms to minimize.
[2025-06-01 00:05:49] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 2 ms to minimize.
[2025-06-01 00:05:49] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2025-06-01 00:05:50] [INFO ] Deduced a trap composed of 87 places in 62 ms of which 1 ms to minimize.
[2025-06-01 00:05:50] [INFO ] Deduced a trap composed of 104 places in 54 ms of which 1 ms to minimize.
[2025-06-01 00:05:50] [INFO ] Deduced a trap composed of 93 places in 57 ms of which 2 ms to minimize.
[2025-06-01 00:05:50] [INFO ] Deduced a trap composed of 88 places in 67 ms of which 1 ms to minimize.
[2025-06-01 00:05:50] [INFO ] Deduced a trap composed of 92 places in 55 ms of which 2 ms to minimize.
[2025-06-01 00:05:50] [INFO ] Deduced a trap composed of 75 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2025-06-01 00:05:51] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2025-06-01 00:05:52] [INFO ] Deduced a trap composed of 107 places in 61 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2025-06-01 00:05:52] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2025-06-01 00:05:53] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 1 ms to minimize.
[2025-06-01 00:05:53] [INFO ] Deduced a trap composed of 93 places in 55 ms of which 2 ms to minimize.
[2025-06-01 00:05:53] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2025-06-01 00:05:53] [INFO ] Deduced a trap composed of 66 places in 40 ms of which 1 ms to minimize.
[2025-06-01 00:05:53] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 1 ms to minimize.
[2025-06-01 00:05:53] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 1 ms to minimize.
[2025-06-01 00:05:54] [INFO ] Deduced a trap composed of 83 places in 56 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2025-06-01 00:05:54] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 1 ms to minimize.
[2025-06-01 00:05:54] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:05:54] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2025-06-01 00:05:54] [INFO ] Deduced a trap composed of 88 places in 58 ms of which 1 ms to minimize.
[2025-06-01 00:05:54] [INFO ] Deduced a trap composed of 80 places in 55 ms of which 1 ms to minimize.
[2025-06-01 00:05:54] [INFO ] Deduced a trap composed of 90 places in 53 ms of which 1 ms to minimize.
[2025-06-01 00:05:54] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 1 ms to minimize.
[2025-06-01 00:05:54] [INFO ] Deduced a trap composed of 89 places in 57 ms of which 2 ms to minimize.
[2025-06-01 00:05:55] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 1 ms to minimize.
[2025-06-01 00:05:55] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 1 ms to minimize.
[2025-06-01 00:05:55] [INFO ] Deduced a trap composed of 97 places in 52 ms of which 2 ms to minimize.
[2025-06-01 00:05:55] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 1 ms to minimize.
[2025-06-01 00:05:55] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 2 ms to minimize.
[2025-06-01 00:05:55] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 14/92 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2025-06-01 00:05:56] [INFO ] Deduced a trap composed of 106 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:05:56] [INFO ] Deduced a trap composed of 100 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:05:56] [INFO ] Deduced a trap composed of 95 places in 52 ms of which 2 ms to minimize.
[2025-06-01 00:05:56] [INFO ] Deduced a trap composed of 106 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:05:56] [INFO ] Deduced a trap composed of 98 places in 52 ms of which 1 ms to minimize.
[2025-06-01 00:05:56] [INFO ] Deduced a trap composed of 98 places in 52 ms of which 1 ms to minimize.
[2025-06-01 00:05:56] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 7/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2025-06-01 00:05:57] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2025-06-01 00:05:57] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2025-06-01 00:05:57] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 1 ms to minimize.
[2025-06-01 00:05:57] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 1 ms to minimize.
[2025-06-01 00:05:58] [INFO ] Deduced a trap composed of 91 places in 49 ms of which 1 ms to minimize.
[2025-06-01 00:05:58] [INFO ] Deduced a trap composed of 94 places in 48 ms of which 2 ms to minimize.
[2025-06-01 00:05:58] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2025-06-01 00:05:58] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
[2025-06-01 00:05:58] [INFO ] Deduced a trap composed of 75 places in 46 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2025-06-01 00:05:59] [INFO ] Deduced a trap composed of 91 places in 55 ms of which 2 ms to minimize.
[2025-06-01 00:05:59] [INFO ] Deduced a trap composed of 89 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:05:59] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/187 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/187 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 21 (OVERLAPS) 171/358 variables, 187/298 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/358 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/358 variables, 123/423 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2025-06-01 00:06:02] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 2 ms to minimize.
[2025-06-01 00:06:02] [INFO ] Deduced a trap composed of 95 places in 61 ms of which 1 ms to minimize.
[2025-06-01 00:06:02] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:06:02] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 2 ms to minimize.
[2025-06-01 00:06:02] [INFO ] Deduced a trap composed of 94 places in 61 ms of which 1 ms to minimize.
[2025-06-01 00:06:02] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2025-06-01 00:06:02] [INFO ] Deduced a trap composed of 93 places in 55 ms of which 2 ms to minimize.
[2025-06-01 00:06:02] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/358 variables, 8/431 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/358 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 26 (OVERLAPS) 0/358 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 431 constraints, problems are : Problem set: 0 solved, 123 unsolved in 31187 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 187/187 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 95/95 constraints]
After SMT, in 36034ms problems are : Problem set: 0 solved, 123 unsolved
Fused 123 Parikh solutions to 118 different solutions.
Parikh walk visited 0 properties in 10206 ms.
Support contains 123 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 171/171 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 187 transition count 163
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 179 transition count 163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 179 transition count 162
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 178 transition count 162
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 170 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 169 transition count 154
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 169 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 168 transition count 153
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 168 transition count 153
Applied a total of 42 rules in 26 ms. Remains 168 /187 variables (removed 19) and now considering 153/171 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 168/187 places, 153/171 transitions.
RANDOM walk for 4000000 steps (513469 resets) in 35513 ms. (112 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3413 resets) in 253 ms. (157 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3386 resets) in 241 ms. (165 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3383 resets) in 237 ms. (168 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3400 resets) in 242 ms. (164 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3405 resets) in 236 ms. (168 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3405 resets) in 236 ms. (168 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3405 resets) in 237 ms. (168 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3371 resets) in 232 ms. (171 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3364 resets) in 236 ms. (168 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3379 resets) in 231 ms. (172 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3344 resets) in 231 ms. (172 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3385 resets) in 287 ms. (138 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3398 resets) in 299 ms. (133 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3444 resets) in 317 ms. (125 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3340 resets) in 255 ms. (156 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3357 resets) in 241 ms. (165 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3405 resets) in 238 ms. (167 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3327 resets) in 238 ms. (167 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3366 resets) in 237 ms. (168 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3412 resets) in 233 ms. (170 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3397 resets) in 232 ms. (171 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3379 resets) in 237 ms. (168 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3407 resets) in 233 ms. (170 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3342 resets) in 236 ms. (168 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3344 resets) in 231 ms. (172 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3385 resets) in 231 ms. (172 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3438 resets) in 236 ms. (168 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3334 resets) in 228 ms. (174 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3336 resets) in 233 ms. (170 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3386 resets) in 230 ms. (173 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3397 resets) in 233 ms. (170 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3387 resets) in 240 ms. (165 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3396 resets) in 234 ms. (170 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3378 resets) in 238 ms. (167 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3431 resets) in 237 ms. (168 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3447 resets) in 235 ms. (169 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3362 resets) in 245 ms. (162 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3415 resets) in 237 ms. (168 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3415 resets) in 239 ms. (166 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3359 resets) in 243 ms. (163 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (3385 resets) in 241 ms. (165 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (3362 resets) in 248 ms. (160 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3403 resets) in 242 ms. (164 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3394 resets) in 245 ms. (162 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40000 steps (3379 resets) in 249 ms. (160 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3368 resets) in 241 ms. (165 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3343 resets) in 248 ms. (160 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3442 resets) in 243 ms. (163 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (3382 resets) in 245 ms. (162 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (3401 resets) in 247 ms. (161 steps per ms) remains 123/123 properties
Interrupted probabilistic random walk after 3359072 steps, run timeout after 39001 ms. (steps per millisecond=86 ) properties seen :104 out of 123
Probabilistic random walk after 3359072 steps, saw 1679594 distinct states, run finished after 39015 ms. (steps per millisecond=86 ) properties seen :104
// Phase 1: matrix 153 rows 168 cols
[2025-06-01 00:07:17] [INFO ] Computed 24 invariants in 5 ms
[2025-06-01 00:07:17] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 88/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 56/163 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 1/164 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 153/317 variables, 164/186 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 4/321 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/321 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/321 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 0/321 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 196 constraints, problems are : Problem set: 0 solved, 19 unsolved in 591 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 88/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 56/163 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-06-01 00:07:18] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2025-06-01 00:07:18] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2025-06-01 00:07:18] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2025-06-01 00:07:18] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2025-06-01 00:07:18] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2025-06-01 00:07:18] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2025-06-01 00:07:18] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2025-06-01 00:07:19] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 1 ms to minimize.
[2025-06-01 00:07:19] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2025-06-01 00:07:19] [INFO ] Deduced a trap composed of 79 places in 51 ms of which 1 ms to minimize.
[2025-06-01 00:07:19] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2025-06-01 00:07:19] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:07:19] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2025-06-01 00:07:19] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2025-06-01 00:07:19] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 0 ms to minimize.
[2025-06-01 00:07:19] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:07:19] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 17/38 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-06-01 00:07:19] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 1 ms to minimize.
[2025-06-01 00:07:19] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 2 ms to minimize.
[2025-06-01 00:07:19] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2025-06-01 00:07:19] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1/164 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 153/317 variables, 164/207 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 19/230 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 4/321 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/321 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 0/321 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 236 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2438 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 21/21 constraints]
After SMT, in 3042ms problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 1796 ms.
Support contains 19 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 153/153 transitions.
Graph (complete) has 354 edges and 168 vertex of which 165 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 165 transition count 127
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 139 transition count 127
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 53 place count 139 transition count 123
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 61 place count 135 transition count 123
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 93 place count 119 transition count 107
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 99 place count 116 transition count 107
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 107 place count 116 transition count 99
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 115 place count 108 transition count 99
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 123 place count 108 transition count 99
Applied a total of 123 rules in 35 ms. Remains 108 /168 variables (removed 60) and now considering 99/153 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 108/168 places, 99/153 transitions.
RANDOM walk for 4000000 steps (511968 resets) in 18770 ms. (213 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (34185 resets) in 1297 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (33860 resets) in 1264 ms. (316 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (33754 resets) in 1273 ms. (313 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (33933 resets) in 1280 ms. (312 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (33931 resets) in 1272 ms. (314 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400000 steps (33915 resets) in 1282 ms. (311 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (33748 resets) in 1292 ms. (309 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (34022 resets) in 1271 ms. (314 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (34091 resets) in 1298 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (34133 resets) in 1287 ms. (310 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (33936 resets) in 1270 ms. (314 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (33740 resets) in 1277 ms. (312 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (33768 resets) in 1275 ms. (313 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (34053 resets) in 1287 ms. (310 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (33959 resets) in 1278 ms. (312 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (33863 resets) in 1271 ms. (314 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400000 steps (33838 resets) in 1269 ms. (314 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (33820 resets) in 1267 ms. (315 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400000 steps (33716 resets) in 1247 ms. (320 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 3071801 steps, run timeout after 33001 ms. (steps per millisecond=93 ) properties seen :0 out of 19
Probabilistic random walk after 3071801 steps, saw 1535968 distinct states, run finished after 33001 ms. (steps per millisecond=93 ) properties seen :0
// Phase 1: matrix 99 rows 108 cols
[2025-06-01 00:08:07] [INFO ] Computed 22 invariants in 2 ms
[2025-06-01 00:08:07] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 29/48 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 55/103 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 1/104 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 99/203 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 4/207 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 142 constraints, problems are : Problem set: 0 solved, 19 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 108/108 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 29/48 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 55/103 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-06-01 00:08:08] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2025-06-01 00:08:08] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-06-01 00:08:08] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2025-06-01 00:08:08] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2025-06-01 00:08:08] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2025-06-01 00:08:08] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2025-06-01 00:08:08] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:08:08] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2025-06-01 00:08:08] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:08:08] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/104 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 99/203 variables, 104/134 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 12/146 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 19/165 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 4/207 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/207 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/207 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 0/207 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 171 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1241 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 108/108 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 10/10 constraints]
After SMT, in 1759ms problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 1660 ms.
Support contains 19 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 99/99 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 108/108 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2025-06-01 00:08:10] [INFO ] Invariant cache hit.
[2025-06-01 00:08:11] [INFO ] Implicit Places using invariants in 108 ms returned [20, 26, 41, 76, 81, 99, 105]
[2025-06-01 00:08:11] [INFO ] Actually due to overlaps returned [81, 76, 41]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 116 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 105/108 places, 99/99 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 104 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 104 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 103 transition count 97
Applied a total of 4 rules in 11 ms. Remains 103 /105 variables (removed 2) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 103 cols
[2025-06-01 00:08:11] [INFO ] Computed 19 invariants in 2 ms
[2025-06-01 00:08:11] [INFO ] Implicit Places using invariants in 81 ms returned [20, 26, 94, 100]
[2025-06-01 00:08:11] [INFO ] Actually due to overlaps returned [100, 94]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 83 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 101/108 places, 97/99 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 96
Applied a total of 2 rules in 7 ms. Remains 100 /101 variables (removed 1) and now considering 96/97 (removed 1) transitions.
// Phase 1: matrix 96 rows 100 cols
[2025-06-01 00:08:11] [INFO ] Computed 17 invariants in 1 ms
[2025-06-01 00:08:11] [INFO ] Implicit Places using invariants in 73 ms returned [20, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 74 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 98/108 places, 96/99 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 98 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 95
Applied a total of 2 rules in 6 ms. Remains 97 /98 variables (removed 1) and now considering 95/96 (removed 1) transitions.
// Phase 1: matrix 95 rows 97 cols
[2025-06-01 00:08:11] [INFO ] Computed 15 invariants in 3 ms
[2025-06-01 00:08:11] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-01 00:08:11] [INFO ] Invariant cache hit.
[2025-06-01 00:08:11] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:08:11] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 97/108 places, 95/99 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 576 ms. Remains : 97/108 places, 95/99 transitions.
RANDOM walk for 4000000 steps (576495 resets) in 19500 ms. (205 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400000 steps (36541 resets) in 1283 ms. (311 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (36576 resets) in 1268 ms. (315 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (36663 resets) in 1261 ms. (316 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (36645 resets) in 1260 ms. (317 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (36667 resets) in 1258 ms. (317 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (36496 resets) in 1264 ms. (316 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (36427 resets) in 1277 ms. (312 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (36633 resets) in 1272 ms. (314 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (36935 resets) in 1269 ms. (314 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400000 steps (36505 resets) in 1277 ms. (312 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (36617 resets) in 1279 ms. (312 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (36374 resets) in 1270 ms. (314 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (36547 resets) in 1273 ms. (313 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400000 steps (36706 resets) in 1275 ms. (313 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (36506 resets) in 1270 ms. (314 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400000 steps (36423 resets) in 1268 ms. (315 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (36356 resets) in 1257 ms. (317 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400000 steps (36792 resets) in 1240 ms. (322 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400000 steps (36656 resets) in 1231 ms. (324 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 3714616 steps, run timeout after 39001 ms. (steps per millisecond=95 ) properties seen :2 out of 19
Probabilistic random walk after 3714616 steps, saw 1857169 distinct states, run finished after 39001 ms. (steps per millisecond=95 ) properties seen :2
[2025-06-01 00:09:03] [INFO ] Invariant cache hit.
[2025-06-01 00:09:03] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 56/73 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/91 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 2/93 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 95/188 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 4/192 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 0/192 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 124 constraints, problems are : Problem set: 0 solved, 17 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 56/73 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2025-06-01 00:09:04] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/91 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2025-06-01 00:09:04] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-06-01 00:09:04] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2025-06-01 00:09:04] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2025-06-01 00:09:04] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 2/93 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2025-06-01 00:09:04] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2025-06-01 00:09:04] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 95/188 variables, 93/113 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 17/142 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2025-06-01 00:09:04] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2025-06-01 00:09:04] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/188 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2025-06-01 00:09:04] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/188 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/188 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 4/192 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/192 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/192 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 0/192 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 151 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1228 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 10/10 constraints]
After SMT, in 1681ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 1025 ms.
Support contains 17 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 95/95 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 96 transition count 94
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 3 place count 96 transition count 94
Applied a total of 3 rules in 7 ms. Remains 96 /97 variables (removed 1) and now considering 94/95 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 96/97 places, 94/95 transitions.
RANDOM walk for 4000000 steps (576760 resets) in 18113 ms. (220 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (36484 resets) in 1171 ms. (341 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (36611 resets) in 1169 ms. (341 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (36777 resets) in 1170 ms. (341 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (36685 resets) in 1175 ms. (340 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (36592 resets) in 1177 ms. (339 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (36464 resets) in 1168 ms. (342 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (36527 resets) in 1171 ms. (341 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (36603 resets) in 1174 ms. (340 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (36664 resets) in 1170 ms. (341 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (36522 resets) in 1147 ms. (348 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (36588 resets) in 1161 ms. (344 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (36468 resets) in 1154 ms. (346 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (36629 resets) in 1162 ms. (343 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (36514 resets) in 1188 ms. (336 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400000 steps (36543 resets) in 1208 ms. (330 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (36602 resets) in 1197 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (36631 resets) in 1193 ms. (335 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 2964516 steps, run timeout after 30001 ms. (steps per millisecond=98 ) properties seen :0 out of 17
Probabilistic random walk after 2964516 steps, saw 1482184 distinct states, run finished after 30001 ms. (steps per millisecond=98 ) properties seen :0
// Phase 1: matrix 94 rows 96 cols
[2025-06-01 00:09:47] [INFO ] Computed 15 invariants in 3 ms
[2025-06-01 00:09:47] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 55/72 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 20/92 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 94/186 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 4/190 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 17 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 55/72 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2025-06-01 00:09:47] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2025-06-01 00:09:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 20/92 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2025-06-01 00:09:47] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2025-06-01 00:09:47] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:09:47] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2025-06-01 00:09:47] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2025-06-01 00:09:48] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2025-06-01 00:09:48] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2025-06-01 00:09:48] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:09:48] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:09:48] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:09:48] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:09:48] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2025-06-01 00:09:48] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:09:48] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:09:48] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:09:48] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2025-06-01 00:09:48] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2025-06-01 00:09:48] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 94/186 variables, 92/124 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 17/153 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 4/190 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 0/190 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 159 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1416 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 19/19 constraints]
After SMT, in 1794ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 1189 ms.
Support contains 17 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 96/96 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Applied a total of 0 rules in 7 ms. Remains 96 /96 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2025-06-01 00:09:50] [INFO ] Invariant cache hit.
[2025-06-01 00:09:50] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-01 00:09:50] [INFO ] Invariant cache hit.
[2025-06-01 00:09:50] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:09:50] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2025-06-01 00:09:50] [INFO ] Redundant transitions in 1 ms returned []
Running 93 sub problems to find dead transitions.
[2025-06-01 00:09:50] [INFO ] Invariant cache hit.
[2025-06-01 00:09:50] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 2/96 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 94/190 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-01 00:09:51] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 93 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/190 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 124 constraints, problems are : Problem set: 0 solved, 93 unsolved in 2360 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 2/96 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 94/190 variables, 96/112 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 12/124 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 93/217 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-01 00:09:54] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2025-06-01 00:09:54] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-01 00:09:56] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2025-06-01 00:09:56] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:09:56] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2025-06-01 00:09:56] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/190 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-01 00:09:57] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 224 constraints, problems are : Problem set: 0 solved, 93 unsolved in 7001 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 8/8 constraints]
After SMT, in 9387ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 9394ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9721 ms. Remains : 96/96 places, 94/94 transitions.
RANDOM walk for 400000 steps (57692 resets) in 3278 ms. (121 steps per ms) remains 17/17 properties
Running SMT prover for 17 properties.
[2025-06-01 00:10:01] [INFO ] Invariant cache hit.
[2025-06-01 00:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-01 00:10:01] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 00:10:01] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :0 sat :17
[2025-06-01 00:10:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:10:01] [INFO ] After 31ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :17
TRAPS : Iteration 0
[2025-06-01 00:10:01] [INFO ] After 148ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:17
[2025-06-01 00:10:01] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2025-06-01 00:10:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-01 00:10:01] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 00:10:01] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2025-06-01 00:10:01] [INFO ] After 26ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :17
TRAPS : Iteration 0
[2025-06-01 00:10:01] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
[2025-06-01 00:10:01] [INFO ] After 276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
RANDOM walk for 4000000 steps (577098 resets) in 18306 ms. (218 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (36721 resets) in 1148 ms. (348 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (36483 resets) in 1146 ms. (348 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (36456 resets) in 1153 ms. (346 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (36685 resets) in 1148 ms. (348 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (36607 resets) in 1160 ms. (344 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400000 steps (36575 resets) in 1164 ms. (343 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (36669 resets) in 1161 ms. (344 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400000 steps (36508 resets) in 1152 ms. (346 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (36640 resets) in 1154 ms. (346 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (36564 resets) in 1159 ms. (344 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (36592 resets) in 1156 ms. (345 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (36490 resets) in 1159 ms. (344 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (36522 resets) in 1147 ms. (348 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (36502 resets) in 1152 ms. (346 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (36608 resets) in 1148 ms. (348 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (36458 resets) in 1131 ms. (353 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (36513 resets) in 1143 ms. (349 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 3048474 steps, run timeout after 30001 ms. (steps per millisecond=101 ) properties seen :0 out of 17
Probabilistic random walk after 3048474 steps, saw 1524164 distinct states, run finished after 30001 ms. (steps per millisecond=101 ) properties seen :0
[2025-06-01 00:10:42] [INFO ] Invariant cache hit.
[2025-06-01 00:10:42] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 55/72 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 20/92 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 94/186 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 4/190 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 17 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 55/72 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2025-06-01 00:10:42] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2025-06-01 00:10:42] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2025-06-01 00:10:42] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 20/92 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2025-06-01 00:10:42] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2025-06-01 00:10:42] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:10:42] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2025-06-01 00:10:42] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:10:42] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2025-06-01 00:10:43] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:10:43] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2025-06-01 00:10:43] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2025-06-01 00:10:43] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2025-06-01 00:10:43] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:10:43] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:10:43] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:10:43] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2025-06-01 00:10:43] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2025-06-01 00:10:43] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2025-06-01 00:10:43] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2025-06-01 00:10:43] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 94/186 variables, 92/125 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 17/154 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 4/190 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 0/190 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 160 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1472 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 20/20 constraints]
After SMT, in 1855ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 801 ms.
Support contains 17 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 96/96 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2025-06-01 00:10:44] [INFO ] Invariant cache hit.
[2025-06-01 00:10:44] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-01 00:10:44] [INFO ] Invariant cache hit.
[2025-06-01 00:10:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:10:45] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2025-06-01 00:10:45] [INFO ] Redundant transitions in 1 ms returned []
Running 93 sub problems to find dead transitions.
[2025-06-01 00:10:45] [INFO ] Invariant cache hit.
[2025-06-01 00:10:45] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 2/96 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 94/190 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-01 00:10:46] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 93 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/190 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 124 constraints, problems are : Problem set: 0 solved, 93 unsolved in 2347 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 2/96 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 94/190 variables, 96/112 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 12/124 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 93/217 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-01 00:10:48] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2025-06-01 00:10:48] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-01 00:10:50] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2025-06-01 00:10:50] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:10:50] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2025-06-01 00:10:50] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/190 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-01 00:10:51] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 224 constraints, problems are : Problem set: 0 solved, 93 unsolved in 6649 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 8/8 constraints]
After SMT, in 9018ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 9019ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9304 ms. Remains : 96/96 places, 94/94 transitions.
RANDOM walk for 400000 steps (57425 resets) in 1886 ms. (211 steps per ms) remains 17/17 properties
Running SMT prover for 17 properties.
[2025-06-01 00:10:54] [INFO ] Invariant cache hit.
[2025-06-01 00:10:54] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-01 00:10:54] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 00:10:54] [INFO ] After 37ms SMT Verify possible using state equation in real domain returned unsat :0 sat :17
[2025-06-01 00:10:54] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:10:54] [INFO ] After 31ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :17
TRAPS : Iteration 0
[2025-06-01 00:10:54] [INFO ] After 172ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:17
[2025-06-01 00:10:54] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2025-06-01 00:10:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-01 00:10:55] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 00:10:55] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2025-06-01 00:10:55] [INFO ] After 27ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :17
TRAPS : Iteration 0
[2025-06-01 00:10:55] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
[2025-06-01 00:10:55] [INFO ] After 255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
RANDOM walk for 40000 steps (5822 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3559 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1032484 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :0 out of 1
Probabilistic random walk after 1032484 steps, saw 516333 distinct states, run finished after 3001 ms. (steps per millisecond=344 ) properties seen :0
[2025-06-01 00:10:58] [INFO ] Invariant cache hit.
[2025-06-01 00:10:58] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/92 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/186 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/190 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 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) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:10:58] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 21/92 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:10:58] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-06-01 00:10:58] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2025-06-01 00:10:58] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 94/186 variables, 92/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 12/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/190 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 339ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 92 transition count 90
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 90 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 89 transition count 89
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 89 transition count 87
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 84 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 83 transition count 83
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 24 place count 83 transition count 83
Applied a total of 24 rules in 13 ms. Remains 83 /96 variables (removed 13) and now considering 83/94 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 83/96 places, 83/94 transitions.
RANDOM walk for 40000 steps (5850 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3626 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1092653 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :0 out of 1
Probabilistic random walk after 1092653 steps, saw 546432 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :0
// Phase 1: matrix 83 rows 83 cols
[2025-06-01 00:11:01] [INFO ] Computed 13 invariants in 4 ms
[2025-06-01 00:11:01] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/78 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/161 variables, 78/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 14/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/166 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/166 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 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) 59/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:01] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/78 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:01] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:11:01] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2025-06-01 00:11:01] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2025-06-01 00:11:02] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2025-06-01 00:11:02] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 83/161 variables, 78/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 14/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/166 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/166 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/166 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/166 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 117 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 399ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 83/83 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2025-06-01 00:11:02] [INFO ] Invariant cache hit.
[2025-06-01 00:11:02] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-01 00:11:02] [INFO ] Invariant cache hit.
[2025-06-01 00:11:02] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:11:02] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2025-06-01 00:11:02] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2025-06-01 00:11:02] [INFO ] Invariant cache hit.
[2025-06-01 00:11:02] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 83/166 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/166 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 110 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1371 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 83/166 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 82/192 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2025-06-01 00:11:05] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2025-06-01 00:11:05] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2025-06-01 00:11:05] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2025-06-01 00:11:06] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:11:06] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2025-06-01 00:11:06] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2025-06-01 00:11:06] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (OVERLAPS) 0/166 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 199 constraints, problems are : Problem set: 0 solved, 82 unsolved in 4783 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 7/7 constraints]
After SMT, in 6176ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 6177ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6421 ms. Remains : 83/83 places, 83/83 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 82 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 82 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 76 transition count 76
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 73 transition count 73
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 73 transition count 73
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 2 with 2 rules applied. Total rules applied 22 place count 72 transition count 72
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 72 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 71 transition count 71
Applied a total of 24 rules in 13 ms. Remains 71 /83 variables (removed 12) and now considering 71/83 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 71 rows 71 cols
[2025-06-01 00:11:08] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:11:08] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:11:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 00:11:08] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-01 00:11:08] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:11:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:11:08] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:11:08] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2025-06-01 00:11:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
TRAPS : Iteration 1
[2025-06-01 00:11:08] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:11:08] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 146 ms.
RANDOM walk for 40000 steps (5747 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3640 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1033016 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :0 out of 1
Probabilistic random walk after 1033016 steps, saw 516601 distinct states, run finished after 3003 ms. (steps per millisecond=343 ) properties seen :0
// Phase 1: matrix 94 rows 96 cols
[2025-06-01 00:11:11] [INFO ] Computed 15 invariants in 6 ms
[2025-06-01 00:11:11] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/72 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/92 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 94/186 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/190 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 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) 12/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/72 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:11] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 20/92 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 94/186 variables, 92/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/190 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/190 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 239ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 95 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 (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 95 transition count 91
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 92 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 92 transition count 90
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 91 transition count 90
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 88 transition count 87
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 88 transition count 84
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 85 transition count 84
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 85 transition count 84
Applied a total of 22 rules in 11 ms. Remains 85 /96 variables (removed 11) and now considering 84/94 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 85/96 places, 84/94 transitions.
RANDOM walk for 40000 steps (5810 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3608 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1075796 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :0 out of 1
Probabilistic random walk after 1075796 steps, saw 538000 distinct states, run finished after 3002 ms. (steps per millisecond=358 ) properties seen :0
// Phase 1: matrix 84 rows 85 cols
[2025-06-01 00:11:15] [INFO ] Computed 14 invariants in 4 ms
[2025-06-01 00:11:15] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/53 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/73 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 82/155 variables, 73/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 13/168 variables, 11/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/169 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/169 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/169 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/53 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/73 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:15] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 82/155 variables, 73/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/168 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/168 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/169 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/169 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/169 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 226ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 85/85 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2025-06-01 00:11:15] [INFO ] Invariant cache hit.
[2025-06-01 00:11:15] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-01 00:11:15] [INFO ] Invariant cache hit.
[2025-06-01 00:11:15] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:11:15] [INFO ] Implicit Places using invariants and state equation in 188 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 255 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 84/85 places, 84/84 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 84 transition count 84
Applied a total of 1 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 84 cols
[2025-06-01 00:11:15] [INFO ] Computed 13 invariants in 2 ms
[2025-06-01 00:11:15] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-01 00:11:15] [INFO ] Invariant cache hit.
[2025-06-01 00:11:15] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:11:15] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/85 places, 84/84 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 513 ms. Remains : 84/85 places, 84/84 transitions.
RANDOM walk for 40000 steps (5754 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3584 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1087571 steps, run timeout after 3001 ms. (steps per millisecond=362 ) properties seen :0 out of 1
Probabilistic random walk after 1087571 steps, saw 543893 distinct states, run finished after 3001 ms. (steps per millisecond=362 ) properties seen :0
[2025-06-01 00:11:19] [INFO ] Invariant cache hit.
[2025-06-01 00:11:19] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/66 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/72 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 82/154 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 13/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 13/167 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/168 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 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) 30/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/66 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:19] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/72 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 82/154 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 13/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/167 variables, 11/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/168 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/168 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 202ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 84/84 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2025-06-01 00:11:19] [INFO ] Invariant cache hit.
[2025-06-01 00:11:19] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-01 00:11:19] [INFO ] Invariant cache hit.
[2025-06-01 00:11:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:11:19] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2025-06-01 00:11:19] [INFO ] Redundant transitions in 2 ms returned []
Running 83 sub problems to find dead transitions.
[2025-06-01 00:11:19] [INFO ] Invariant cache hit.
[2025-06-01 00:11:19] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/167 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/168 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 111 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1625 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/167 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 83/193 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 1/168 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 194 constraints, problems are : Problem set: 0 solved, 83 unsolved in 4033 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 5681ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 5682ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5928 ms. Remains : 84/84 places, 84/84 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 84 transition count 77
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 77 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 74 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 74 transition count 74
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 22 place count 73 transition count 73
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 73 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 72 transition count 72
Applied a total of 24 rules in 6 ms. Remains 72 /84 variables (removed 12) and now considering 72/84 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 72 cols
[2025-06-01 00:11:25] [INFO ] Computed 13 invariants in 3 ms
[2025-06-01 00:11:25] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:11:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-01 00:11:25] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 3 ms returned sat
[2025-06-01 00:11:25] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:11:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:11:25] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:11:25] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:11:25] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 104 ms.
RANDOM walk for 40000 steps (5763 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3760 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1037042 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :0 out of 1
Probabilistic random walk after 1037042 steps, saw 518613 distinct states, run finished after 3001 ms. (steps per millisecond=345 ) properties seen :0
// Phase 1: matrix 94 rows 96 cols
[2025-06-01 00:11:28] [INFO ] Computed 15 invariants in 2 ms
[2025-06-01 00:11:28] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/92 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/186 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/190 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 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) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:28] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 21/92 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:28] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
[2025-06-01 00:11:28] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2025-06-01 00:11:28] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2025-06-01 00:11:28] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2025-06-01 00:11:28] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2025-06-01 00:11:28] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2025-06-01 00:11:28] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2025-06-01 00:11:28] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 94/186 variables, 92/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 12/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/190 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 515ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 96 transition count 90
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 92 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 92 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 91 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 88 transition count 86
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 88 transition count 83
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 85 transition count 83
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 85 transition count 83
Applied a total of 23 rules in 9 ms. Remains 85 /96 variables (removed 11) and now considering 83/94 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 85/96 places, 83/94 transitions.
RANDOM walk for 40000 steps (5843 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3659 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1093219 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :0 out of 1
Probabilistic random walk after 1093219 steps, saw 546711 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :0
// Phase 1: matrix 83 rows 85 cols
[2025-06-01 00:11:32] [INFO ] Computed 15 invariants in 3 ms
[2025-06-01 00:11:32] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/81 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/164 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/168 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/168 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 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) 59/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:32] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 21/81 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:32] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2025-06-01 00:11:32] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 83/164 variables, 81/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/168 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/168 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 118 constraints, problems are : Problem set: 0 solved, 1 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 279ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 67 ms.
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 85/85 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2025-06-01 00:11:32] [INFO ] Invariant cache hit.
[2025-06-01 00:11:32] [INFO ] Implicit Places using invariants in 71 ms returned [37, 47]
[2025-06-01 00:11:32] [INFO ] Actually due to overlaps returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 84/85 places, 83/83 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 82 transition count 81
Applied a total of 4 rules in 4 ms. Remains 82 /84 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 82 cols
[2025-06-01 00:11:32] [INFO ] Computed 14 invariants in 3 ms
[2025-06-01 00:11:32] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-01 00:11:32] [INFO ] Invariant cache hit.
[2025-06-01 00:11:32] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:11:32] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 82/85 places, 81/83 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 306 ms. Remains : 82/85 places, 81/83 transitions.
RANDOM walk for 40000 steps (5798 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3684 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1145873 steps, run timeout after 3001 ms. (steps per millisecond=381 ) properties seen :0 out of 1
Probabilistic random walk after 1145873 steps, saw 572931 distinct states, run finished after 3001 ms. (steps per millisecond=381 ) properties seen :0
[2025-06-01 00:11:35] [INFO ] Invariant cache hit.
[2025-06-01 00:11:35] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/78 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/159 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 14/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/163 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/163 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 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) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/78 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:35] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:11:35] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:11:35] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 81/159 variables, 78/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/163 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/163 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 283ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-06-01 00:11:36] [INFO ] Invariant cache hit.
[2025-06-01 00:11:36] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-01 00:11:36] [INFO ] Invariant cache hit.
[2025-06-01 00:11:36] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:11:36] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2025-06-01 00:11:36] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-01 00:11:36] [INFO ] Invariant cache hit.
[2025-06-01 00:11:36] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 2/82 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/163 variables, 82/96 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:11:37] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/163 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 111 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1831 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 2/82 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/163 variables, 82/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 80/191 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:11:39] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/163 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 192 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3064 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
After SMT, in 4920ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4923ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5179 ms. Remains : 82/82 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 82 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 76 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 73 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 73 transition count 72
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 20 place count 72 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 72 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 70 transition count 69
Applied a total of 24 rules in 10 ms. Remains 70 /82 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 70 cols
[2025-06-01 00:11:41] [INFO ] Computed 14 invariants in 2 ms
[2025-06-01 00:11:41] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:11:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 00:11:41] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-06-01 00:11:41] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:11:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:11:41] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:11:41] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2025-06-01 00:11:41] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2025-06-01 00:11:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
TRAPS : Iteration 1
[2025-06-01 00:11:41] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:11:41] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 194 ms.
RANDOM walk for 40000 steps (5775 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3599 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1093651 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :0 out of 1
Probabilistic random walk after 1093651 steps, saw 546927 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :0
// Phase 1: matrix 94 rows 96 cols
[2025-06-01 00:11:44] [INFO ] Computed 15 invariants in 4 ms
[2025-06-01 00:11:44] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/92 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/186 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/190 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 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) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:44] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 21/92 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:44] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-06-01 00:11:44] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2025-06-01 00:11:44] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2025-06-01 00:11:44] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2025-06-01 00:11:44] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2025-06-01 00:11:44] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 3 ms to minimize.
[2025-06-01 00:11:44] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2025-06-01 00:11:44] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2025-06-01 00:11:44] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 94/186 variables, 92/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/190 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 134 constraints, problems are : Problem set: 0 solved, 1 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 535ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 92 transition count 89
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 89 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 88 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 88 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 84 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 83 transition count 83
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 24 place count 83 transition count 83
Applied a total of 24 rules in 6 ms. Remains 83 /96 variables (removed 13) and now considering 83/94 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 83/96 places, 83/94 transitions.
RANDOM walk for 40000 steps (5742 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3663 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1118952 steps, run timeout after 3001 ms. (steps per millisecond=372 ) properties seen :0 out of 1
Probabilistic random walk after 1118952 steps, saw 559466 distinct states, run finished after 3001 ms. (steps per millisecond=372 ) properties seen :0
// Phase 1: matrix 83 rows 83 cols
[2025-06-01 00:11:48] [INFO ] Computed 13 invariants in 3 ms
[2025-06-01 00:11:48] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/78 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/161 variables, 78/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 14/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/166 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/166 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 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) 59/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/78 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:48] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2025-06-01 00:11:48] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2025-06-01 00:11:48] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 83/161 variables, 78/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/166 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/166 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/166 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/166 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 305ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 83/83 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2025-06-01 00:11:48] [INFO ] Invariant cache hit.
[2025-06-01 00:11:48] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-01 00:11:48] [INFO ] Invariant cache hit.
[2025-06-01 00:11:48] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:11:48] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2025-06-01 00:11:48] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2025-06-01 00:11:48] [INFO ] Invariant cache hit.
[2025-06-01 00:11:48] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 83/166 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/166 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 110 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1297 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 83/166 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 82/192 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2025-06-01 00:11:50] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2025-06-01 00:11:51] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:11:51] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2025-06-01 00:11:51] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:11:51] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:11:51] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 6/198 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/166 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 198 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3185 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 6/6 constraints]
After SMT, in 4500ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 4502ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4772 ms. Remains : 83/83 places, 83/83 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 82 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 82 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 76 transition count 76
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 73 transition count 73
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 73 transition count 73
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 2 with 2 rules applied. Total rules applied 22 place count 72 transition count 72
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 72 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 71 transition count 71
Applied a total of 24 rules in 8 ms. Remains 71 /83 variables (removed 12) and now considering 71/83 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 71 rows 71 cols
[2025-06-01 00:11:53] [INFO ] Computed 13 invariants in 0 ms
[2025-06-01 00:11:53] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:11:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 00:11:53] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2025-06-01 00:11:53] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:11:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:11:53] [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:11:53] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:11:53] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 117 ms.
RANDOM walk for 40000 steps (5672 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3603 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1083052 steps, run timeout after 3001 ms. (steps per millisecond=360 ) properties seen :0 out of 1
Probabilistic random walk after 1083052 steps, saw 541627 distinct states, run finished after 3001 ms. (steps per millisecond=360 ) properties seen :0
// Phase 1: matrix 94 rows 96 cols
[2025-06-01 00:11:56] [INFO ] Computed 15 invariants in 1 ms
[2025-06-01 00:11:56] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/92 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/186 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/190 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 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) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 21/92 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:56] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-06-01 00:11:56] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:11:56] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:11:56] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2025-06-01 00:11:56] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2025-06-01 00:11:56] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2025-06-01 00:11:56] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2025-06-01 00:11:56] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 94/186 variables, 92/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 12/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/190 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 491ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 92 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 89 transition count 89
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 89 transition count 87
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 84 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 83 transition count 83
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 83 transition count 83
Applied a total of 24 rules in 14 ms. Remains 83 /96 variables (removed 13) and now considering 83/94 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 83/96 places, 83/94 transitions.
RANDOM walk for 40000 steps (5713 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3656 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1069691 steps, run timeout after 3001 ms. (steps per millisecond=356 ) properties seen :0 out of 1
Probabilistic random walk after 1069691 steps, saw 534941 distinct states, run finished after 3001 ms. (steps per millisecond=356 ) properties seen :0
// Phase 1: matrix 83 rows 83 cols
[2025-06-01 00:12:00] [INFO ] Computed 13 invariants in 2 ms
[2025-06-01 00:12:00] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/78 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/161 variables, 78/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 14/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/166 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/166 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 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) 59/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/78 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:00] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2025-06-01 00:12:00] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2025-06-01 00:12:00] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 83/161 variables, 78/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/166 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/166 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/166 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/166 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 306ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 83/83 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2025-06-01 00:12:00] [INFO ] Invariant cache hit.
[2025-06-01 00:12:00] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-01 00:12:00] [INFO ] Invariant cache hit.
[2025-06-01 00:12:00] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:12:00] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2025-06-01 00:12:00] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2025-06-01 00:12:00] [INFO ] Invariant cache hit.
[2025-06-01 00:12:00] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 83/166 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/166 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 110 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1362 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 83/166 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 82/192 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2025-06-01 00:12:02] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2025-06-01 00:12:03] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2025-06-01 00:12:03] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2025-06-01 00:12:03] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2025-06-01 00:12:03] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2025-06-01 00:12:03] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 6/198 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/166 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 198 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3172 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 6/6 constraints]
After SMT, in 4554ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 4555ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4818 ms. Remains : 83/83 places, 83/83 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 82 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 82 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 76 transition count 76
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 73 transition count 73
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 73 transition count 73
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 2 with 2 rules applied. Total rules applied 22 place count 72 transition count 72
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 72 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 71 transition count 71
Applied a total of 24 rules in 9 ms. Remains 71 /83 variables (removed 12) and now considering 71/83 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 71 rows 71 cols
[2025-06-01 00:12:05] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:12:05] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:12:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 00:12:05] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2025-06-01 00:12:05] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:12:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:12:05] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:12:05] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:12:05] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 109 ms.
RANDOM walk for 40000 steps (5742 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3678 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1093507 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :0 out of 1
Probabilistic random walk after 1093507 steps, saw 546855 distinct states, run finished after 3003 ms. (steps per millisecond=364 ) properties seen :0
// Phase 1: matrix 94 rows 96 cols
[2025-06-01 00:12:08] [INFO ] Computed 15 invariants in 8 ms
[2025-06-01 00:12:08] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/92 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/186 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/190 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 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) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:08] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 21/92 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:08] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-06-01 00:12:08] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:12:08] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2025-06-01 00:12:08] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 94/186 variables, 92/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 12/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/190 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 129 constraints, problems are : Problem set: 0 solved, 1 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 389ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 88 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 88 transition count 86
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 86 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 84 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 83 transition count 83
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 83 transition count 83
Applied a total of 24 rules in 7 ms. Remains 83 /96 variables (removed 13) and now considering 83/94 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 83/96 places, 83/94 transitions.
RANDOM walk for 40000 steps (5762 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3646 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1115479 steps, run timeout after 3001 ms. (steps per millisecond=371 ) properties seen :0 out of 1
Probabilistic random walk after 1115479 steps, saw 557772 distinct states, run finished after 3003 ms. (steps per millisecond=371 ) properties seen :0
// Phase 1: matrix 83 rows 83 cols
[2025-06-01 00:12:11] [INFO ] Computed 13 invariants in 4 ms
[2025-06-01 00:12:11] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/78 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/161 variables, 78/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 14/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/166 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/166 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 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) 59/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:12] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/78 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:12:12] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:12:12] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 83/161 variables, 78/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/166 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/166 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/166 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/166 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 337ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 83/83 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2025-06-01 00:12:12] [INFO ] Invariant cache hit.
[2025-06-01 00:12:12] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-01 00:12:12] [INFO ] Invariant cache hit.
[2025-06-01 00:12:12] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:12:12] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2025-06-01 00:12:12] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2025-06-01 00:12:12] [INFO ] Invariant cache hit.
[2025-06-01 00:12:12] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 83/166 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/166 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 110 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1421 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 83/166 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 82/192 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2025-06-01 00:12:15] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/166 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 193 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2949 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 1/1 constraints]
After SMT, in 4389ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 4390ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4644 ms. Remains : 83/83 places, 83/83 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 82 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 82 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 76 transition count 76
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 73 transition count 73
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 73 transition count 73
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 2 with 2 rules applied. Total rules applied 22 place count 72 transition count 72
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 72 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 71 transition count 71
Applied a total of 24 rules in 8 ms. Remains 71 /83 variables (removed 12) and now considering 71/83 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 71 rows 71 cols
[2025-06-01 00:12:17] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:12:17] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:12:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 00:12:17] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-01 00:12:17] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:12:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:12:17] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:12:17] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2025-06-01 00:12:17] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:12:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
TRAPS : Iteration 1
[2025-06-01 00:12:17] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:12:17] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 187 ms.
RANDOM walk for 40000 steps (5741 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3679 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1085390 steps, run timeout after 3001 ms. (steps per millisecond=361 ) properties seen :0 out of 1
Probabilistic random walk after 1085390 steps, saw 542795 distinct states, run finished after 3001 ms. (steps per millisecond=361 ) properties seen :0
// Phase 1: matrix 94 rows 96 cols
[2025-06-01 00:12:20] [INFO ] Computed 15 invariants in 1 ms
[2025-06-01 00:12:20] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/92 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/186 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/190 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 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) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:20] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 21/92 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:20] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:12:20] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:12:20] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2025-06-01 00:12:20] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2025-06-01 00:12:20] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:12:20] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2025-06-01 00:12:20] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2025-06-01 00:12:20] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 94/186 variables, 92/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 12/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/190 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 509ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 88 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 87 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 85 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 83 transition count 83
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 83 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 9 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 81/96 places, 81/94 transitions.
RANDOM walk for 40000 steps (5793 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3645 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1082853 steps, run timeout after 3001 ms. (steps per millisecond=360 ) properties seen :0 out of 1
Probabilistic random walk after 1082853 steps, saw 541527 distinct states, run finished after 3001 ms. (steps per millisecond=360 ) properties seen :0
// Phase 1: matrix 81 rows 81 cols
[2025-06-01 00:12:23] [INFO ] Computed 13 invariants in 3 ms
[2025-06-01 00:12:23] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/157 variables, 76/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 14/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/162 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 108 constraints, problems are : Problem set: 0 solved, 1 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 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) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:24] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:24] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:12:24] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2025-06-01 00:12:24] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2025-06-01 00:12:24] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2025-06-01 00:12:24] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2025-06-01 00:12:24] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2025-06-01 00:12:24] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/157 variables, 76/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 14/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/162 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/162 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 117 constraints, problems are : Problem set: 0 solved, 1 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 457ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-06-01 00:12:24] [INFO ] Invariant cache hit.
[2025-06-01 00:12:24] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-01 00:12:24] [INFO ] Invariant cache hit.
[2025-06-01 00:12:24] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:12:24] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2025-06-01 00:12:24] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-01 00:12:24] [INFO ] Invariant cache hit.
[2025-06-01 00:12:24] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 108 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1358 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 80/188 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:12:26] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2025-06-01 00:12:26] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:12:27] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2025-06-01 00:12:27] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:12:27] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2025-06-01 00:12:27] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/162 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 194 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3259 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 6/6 constraints]
After SMT, in 4638ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4638ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4914 ms. Remains : 81/81 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
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 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 70 transition count 70
Applied a total of 22 rules in 10 ms. Remains 70 /81 variables (removed 11) and now considering 70/81 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2025-06-01 00:12:29] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:12:29] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:12:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 00:12:29] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 00:12:29] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:12:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:12:29] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:12:29] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:12:29] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 112 ms.
RANDOM walk for 40000 steps (5793 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3691 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1091758 steps, run timeout after 3001 ms. (steps per millisecond=363 ) properties seen :0 out of 1
Probabilistic random walk after 1091758 steps, saw 545980 distinct states, run finished after 3001 ms. (steps per millisecond=363 ) properties seen :0
// Phase 1: matrix 94 rows 96 cols
[2025-06-01 00:12:32] [INFO ] Computed 15 invariants in 4 ms
[2025-06-01 00:12:32] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/92 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/186 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/190 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 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) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:32] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 21/92 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:32] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-06-01 00:12:32] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2025-06-01 00:12:32] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2025-06-01 00:12:32] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2025-06-01 00:12:32] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2025-06-01 00:12:32] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2025-06-01 00:12:32] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 94/186 variables, 92/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/190 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 443ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 88 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 88 transition count 86
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 86 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 84 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 6 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 81/96 places, 81/94 transitions.
RANDOM walk for 40000 steps (5824 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3691 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1099335 steps, run timeout after 3001 ms. (steps per millisecond=366 ) properties seen :0 out of 1
Probabilistic random walk after 1099335 steps, saw 549770 distinct states, run finished after 3001 ms. (steps per millisecond=366 ) properties seen :0
// Phase 1: matrix 81 rows 81 cols
[2025-06-01 00:12:36] [INFO ] Computed 13 invariants in 3 ms
[2025-06-01 00:12:36] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/157 variables, 76/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 13/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/162 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 107 constraints, problems are : Problem set: 0 solved, 1 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 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) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:36] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2025-06-01 00:12:36] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/157 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 13/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/162 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:36] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/162 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 287ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-06-01 00:12:36] [INFO ] Invariant cache hit.
[2025-06-01 00:12:36] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-01 00:12:36] [INFO ] Invariant cache hit.
[2025-06-01 00:12:36] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 00:12:36] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2025-06-01 00:12:36] [INFO ] Redundant transitions in 9 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-01 00:12:36] [INFO ] Invariant cache hit.
[2025-06-01 00:12:36] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 107 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1330 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 80/187 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:12:38] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
[2025-06-01 00:12:38] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:12:38] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2025-06-01 00:12:39] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2025-06-01 00:12:39] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2025-06-01 00:12:39] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2025-06-01 00:12:39] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 7/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:12:40] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/162 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/162 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 195 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4572 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 8/8 constraints]
After SMT, in 5922ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 5923ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6165 ms. Remains : 81/81 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
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 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 70 transition count 70
Applied a total of 22 rules in 11 ms. Remains 70 /81 variables (removed 11) and now considering 70/81 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2025-06-01 00:12:42] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:12:42] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:12:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 00:12:42] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 00:12:42] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:12:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:12:42] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:12:42] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2025-06-01 00:12:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
TRAPS : Iteration 1
[2025-06-01 00:12:42] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:12:42] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 147 ms.
RANDOM walk for 40000 steps (5763 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3655 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 988086 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :0 out of 1
Probabilistic random walk after 988086 steps, saw 494137 distinct states, run finished after 3003 ms. (steps per millisecond=329 ) properties seen :0
// Phase 1: matrix 94 rows 96 cols
[2025-06-01 00:12:45] [INFO ] Computed 15 invariants in 4 ms
[2025-06-01 00:12:45] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/92 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/186 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/190 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 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) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 21/92 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 94/186 variables, 92/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/190 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 229ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 88 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 88 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 85 transition count 85
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 85 transition count 81
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 8 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 81/96 places, 81/94 transitions.
RANDOM walk for 40000 steps (5679 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3748 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1099548 steps, run timeout after 3001 ms. (steps per millisecond=366 ) properties seen :0 out of 1
Probabilistic random walk after 1099548 steps, saw 549877 distinct states, run finished after 3003 ms. (steps per millisecond=366 ) properties seen :0
// Phase 1: matrix 81 rows 81 cols
[2025-06-01 00:12:49] [INFO ] Computed 13 invariants in 4 ms
[2025-06-01 00:12:49] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/157 variables, 76/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 14/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/162 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 108 constraints, problems are : Problem set: 0 solved, 1 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 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) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 81/157 variables, 76/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/162 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/162 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 211ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-06-01 00:12:49] [INFO ] Invariant cache hit.
[2025-06-01 00:12:49] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-01 00:12:49] [INFO ] Invariant cache hit.
[2025-06-01 00:12:49] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:12:49] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2025-06-01 00:12:49] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-01 00:12:49] [INFO ] Invariant cache hit.
[2025-06-01 00:12:49] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 108 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1279 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 80/188 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:12:52] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:12:52] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 190 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4203 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
After SMT, in 5502ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 5503ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5734 ms. Remains : 81/81 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
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 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 70 transition count 70
Applied a total of 22 rules in 10 ms. Remains 70 /81 variables (removed 11) and now considering 70/81 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2025-06-01 00:12:55] [INFO ] Computed 13 invariants in 0 ms
[2025-06-01 00:12:55] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:12:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 00:12:55] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 00:12:55] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:12:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:12:55] [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:12:55] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2025-06-01 00:12:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
TRAPS : Iteration 1
[2025-06-01 00:12:55] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:12:55] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 154 ms.
RANDOM walk for 40000 steps (5781 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3676 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1092578 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :0 out of 1
Probabilistic random walk after 1092578 steps, saw 546392 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :0
// Phase 1: matrix 94 rows 96 cols
[2025-06-01 00:12:58] [INFO ] Computed 15 invariants in 4 ms
[2025-06-01 00:12:58] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/92 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/186 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/190 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 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) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 21/92 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:58] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:12:58] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2025-06-01 00:12:58] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:12:58] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2025-06-01 00:12:58] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2025-06-01 00:12:58] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:12:58] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2025-06-01 00:12:58] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2025-06-01 00:12:58] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2025-06-01 00:12:58] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 94/186 variables, 92/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 12/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/190 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 584ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 88 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 87 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 85 transition count 85
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 3 with 2 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 84 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 26 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 23 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 81/96 places, 81/94 transitions.
RANDOM walk for 40000 steps (5798 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3647 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1100464 steps, run timeout after 3001 ms. (steps per millisecond=366 ) properties seen :0 out of 1
Probabilistic random walk after 1100464 steps, saw 550334 distinct states, run finished after 3001 ms. (steps per millisecond=366 ) properties seen :0
// Phase 1: matrix 81 rows 81 cols
[2025-06-01 00:13:02] [INFO ] Computed 13 invariants in 3 ms
[2025-06-01 00:13:02] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/157 variables, 76/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 13/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/162 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 107 constraints, problems are : Problem set: 0 solved, 1 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 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) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:02] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2025-06-01 00:13:02] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2025-06-01 00:13:02] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2025-06-01 00:13:02] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2025-06-01 00:13:02] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2025-06-01 00:13:02] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2025-06-01 00:13:02] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/157 variables, 76/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/162 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/162 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 427ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-06-01 00:13:02] [INFO ] Invariant cache hit.
[2025-06-01 00:13:02] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-01 00:13:02] [INFO ] Invariant cache hit.
[2025-06-01 00:13:02] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 00:13:02] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2025-06-01 00:13:02] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-01 00:13:02] [INFO ] Invariant cache hit.
[2025-06-01 00:13:02] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:13:04] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/162 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 108 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1889 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/162 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 80/188 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:13:05] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 189 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2892 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
After SMT, in 4806ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4807ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5045 ms. Remains : 81/81 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
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 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 7 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2025-06-01 00:13:07] [INFO ] Computed 13 invariants in 3 ms
[2025-06-01 00:13:07] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:13:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 00:13:07] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2025-06-01 00:13:07] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:13:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:13:07] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:13:07] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2025-06-01 00:13:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
TRAPS : Iteration 1
[2025-06-01 00:13:07] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:13:07] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 132 ms.
RANDOM walk for 40000 steps (5715 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3589 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1094836 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :0 out of 1
Probabilistic random walk after 1094836 steps, saw 547518 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :0
// Phase 1: matrix 94 rows 96 cols
[2025-06-01 00:13:10] [INFO ] Computed 15 invariants in 2 ms
[2025-06-01 00:13:10] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/92 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/186 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/190 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 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) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 21/92 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 94/186 variables, 92/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 12/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/190 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 561ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 88 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 88 transition count 86
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 86 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 84 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 7 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 81/96 places, 81/94 transitions.
RANDOM walk for 40000 steps (5815 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3659 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1094882 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :0 out of 1
Probabilistic random walk after 1094882 steps, saw 547544 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :0
// Phase 1: matrix 81 rows 81 cols
[2025-06-01 00:13:14] [INFO ] Computed 13 invariants in 3 ms
[2025-06-01 00:13:14] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/157 variables, 76/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 13/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/162 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 107 constraints, problems are : Problem set: 0 solved, 1 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 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) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:14] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2025-06-01 00:13:14] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2025-06-01 00:13:14] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/157 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/162 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:14] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 357ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 82 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-06-01 00:13:14] [INFO ] Invariant cache hit.
[2025-06-01 00:13:15] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-01 00:13:15] [INFO ] Invariant cache hit.
[2025-06-01 00:13:15] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 00:13:15] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2025-06-01 00:13:15] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-01 00:13:15] [INFO ] Invariant cache hit.
[2025-06-01 00:13:15] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 107 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 80/187 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:13:17] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:13:17] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2025-06-01 00:13:17] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:13:17] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:13:18] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 192 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4048 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 5/5 constraints]
After SMT, in 5376ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 5378ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5624 ms. Remains : 81/81 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
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 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 7 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2025-06-01 00:13:20] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:13:20] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:13:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 00:13:20] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-01 00:13:20] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:13:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:13:20] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:13:20] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:13:20] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 93 ms.
RANDOM walk for 40000 steps (5780 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (3657 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1097631 steps, run timeout after 3001 ms. (steps per millisecond=365 ) properties seen :0 out of 1
Probabilistic random walk after 1097631 steps, saw 548915 distinct states, run finished after 3001 ms. (steps per millisecond=365 ) properties seen :0
// Phase 1: matrix 94 rows 96 cols
[2025-06-01 00:13:23] [INFO ] Computed 15 invariants in 3 ms
[2025-06-01 00:13:23] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/92 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/186 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/190 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 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) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:23] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 21/92 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 94/186 variables, 92/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/190 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 241ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 88 transition count 88
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 12 place count 88 transition count 85
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 85 transition count 85
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 2 with 2 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 84 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 7 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 81/96 places, 81/94 transitions.
RANDOM walk for 40000 steps (5827 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3646 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1102188 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :0 out of 1
Probabilistic random walk after 1102188 steps, saw 551197 distinct states, run finished after 3002 ms. (steps per millisecond=367 ) properties seen :0
// Phase 1: matrix 81 rows 81 cols
[2025-06-01 00:13:27] [INFO ] Computed 13 invariants in 3 ms
[2025-06-01 00:13:27] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/157 variables, 76/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 13/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/162 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 107 constraints, problems are : Problem set: 0 solved, 1 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 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) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:27] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 81/157 variables, 76/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 13/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:27] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:13:27] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/162 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/162 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 292ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 82 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-06-01 00:13:27] [INFO ] Invariant cache hit.
[2025-06-01 00:13:27] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-01 00:13:27] [INFO ] Invariant cache hit.
[2025-06-01 00:13:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 00:13:27] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2025-06-01 00:13:27] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-01 00:13:27] [INFO ] Invariant cache hit.
[2025-06-01 00:13:27] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 107 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1282 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 80/187 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:13:30] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2025-06-01 00:13:30] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:13:30] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2025-06-01 00:13:30] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/162 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 191 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3238 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 4/4 constraints]
After SMT, in 4545ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4547ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4816 ms. Remains : 81/81 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
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 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 7 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2025-06-01 00:13:32] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:13:32] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:13:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-01 00:13:32] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-01 00:13:32] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:13:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:13:32] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:13:32] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:13:32] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 110 ms.
RANDOM walk for 40000 steps (5739 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3687 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1097462 steps, run timeout after 3001 ms. (steps per millisecond=365 ) properties seen :0 out of 1
Probabilistic random walk after 1097462 steps, saw 548830 distinct states, run finished after 3001 ms. (steps per millisecond=365 ) properties seen :0
// Phase 1: matrix 94 rows 96 cols
[2025-06-01 00:13:35] [INFO ] Computed 15 invariants in 4 ms
[2025-06-01 00:13:35] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/92 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/186 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/190 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 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) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:35] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 21/92 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 94/186 variables, 92/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/190 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 225ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 92 transition count 87
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 87 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 85 transition count 85
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 2 with 2 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 84 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 82 transition count 82
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 82 transition count 82
Applied a total of 25 rules in 6 ms. Remains 82 /96 variables (removed 14) and now considering 82/94 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 82/96 places, 82/94 transitions.
RANDOM walk for 40000 steps (5755 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3665 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1101681 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :0 out of 1
Probabilistic random walk after 1101681 steps, saw 550947 distinct states, run finished after 3003 ms. (steps per millisecond=366 ) properties seen :0
// Phase 1: matrix 82 rows 82 cols
[2025-06-01 00:13:38] [INFO ] Computed 13 invariants in 7 ms
[2025-06-01 00:13:38] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/77 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/159 variables, 77/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 13/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/164 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/164 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 108 constraints, problems are : Problem set: 0 solved, 1 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 13/13 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) 58/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/77 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/159 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/164 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/164 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 203ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-01 00:13:39] [INFO ] Invariant cache hit.
[2025-06-01 00:13:39] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-01 00:13:39] [INFO ] Invariant cache hit.
[2025-06-01 00:13:39] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 00:13:39] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2025-06-01 00:13:39] [INFO ] Redundant transitions in 0 ms returned []
Running 81 sub problems to find dead transitions.
[2025-06-01 00:13:39] [INFO ] Invariant cache hit.
[2025-06-01 00:13:39] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 82/164 variables, 82/95 constraints. Problems are: Problem set: 0 solved, 81 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/164 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 108 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1235 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 82/164 variables, 82/95 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 81/189 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2025-06-01 00:13:41] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2025-06-01 00:13:42] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2025-06-01 00:13:43] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/164 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 13 (OVERLAPS) 0/164 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 192 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5178 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 3/3 constraints]
After SMT, in 6435ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 6437ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6669 ms. Remains : 82/82 places, 82/82 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 82 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 76 transition count 76
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 73 transition count 73
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 73 transition count 73
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 20 place count 72 transition count 72
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 72 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 70 transition count 70
Applied a total of 24 rules in 12 ms. Remains 70 /82 variables (removed 12) and now considering 70/82 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2025-06-01 00:13:45] [INFO ] Computed 13 invariants in 5 ms
[2025-06-01 00:13:45] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:13:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-01 00:13:45] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2025-06-01 00:13:45] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:13:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:13:45] [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:13:45] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:13:45] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 120 ms.
RANDOM walk for 40000 steps (5771 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3649 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1090300 steps, run timeout after 3001 ms. (steps per millisecond=363 ) properties seen :0 out of 1
Probabilistic random walk after 1090300 steps, saw 545250 distinct states, run finished after 3001 ms. (steps per millisecond=363 ) properties seen :0
// Phase 1: matrix 94 rows 96 cols
[2025-06-01 00:13:48] [INFO ] Computed 15 invariants in 3 ms
[2025-06-01 00:13:48] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/92 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/186 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/190 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 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) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 21/92 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 94/186 variables, 92/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/190 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 210ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 92 transition count 87
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 87 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 85 transition count 85
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 2 with 2 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 84 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 82 transition count 82
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 82 transition count 82
Applied a total of 25 rules in 7 ms. Remains 82 /96 variables (removed 14) and now considering 82/94 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 82/96 places, 82/94 transitions.
RANDOM walk for 40000 steps (5774 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3672 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1069203 steps, run timeout after 3001 ms. (steps per millisecond=356 ) properties seen :0 out of 1
Probabilistic random walk after 1069203 steps, saw 534701 distinct states, run finished after 3001 ms. (steps per millisecond=356 ) properties seen :0
// Phase 1: matrix 82 rows 82 cols
[2025-06-01 00:13:52] [INFO ] Computed 13 invariants in 4 ms
[2025-06-01 00:13:52] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/77 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/159 variables, 77/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 13/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/164 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/164 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 108 constraints, problems are : Problem set: 0 solved, 1 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 13/13 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) 58/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:52] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/77 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/159 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/164 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/164 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 201ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 82/82 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 0 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-01 00:13:52] [INFO ] Invariant cache hit.
[2025-06-01 00:13:52] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-01 00:13:52] [INFO ] Invariant cache hit.
[2025-06-01 00:13:52] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 00:13:52] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2025-06-01 00:13:52] [INFO ] Redundant transitions in 4 ms returned []
Running 81 sub problems to find dead transitions.
[2025-06-01 00:13:52] [INFO ] Invariant cache hit.
[2025-06-01 00:13:52] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 82/164 variables, 82/95 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2025-06-01 00:13:54] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2025-06-01 00:13:54] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/164 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2025-06-01 00:13:54] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/164 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (OVERLAPS) 0/164 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 111 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2833 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 82/164 variables, 82/98 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 13/111 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 81/192 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2025-06-01 00:13:56] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2025-06-01 00:13:56] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/164 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 194 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3119 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 5/5 constraints]
After SMT, in 5972ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 5973ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6240 ms. Remains : 82/82 places, 82/82 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 82 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 76 transition count 76
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 73 transition count 73
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 73 transition count 73
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 20 place count 72 transition count 72
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 72 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 70 transition count 70
Applied a total of 24 rules in 9 ms. Remains 70 /82 variables (removed 12) and now considering 70/82 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2025-06-01 00:13:58] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:13:58] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:13:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-01 00:13:58] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2025-06-01 00:13:58] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:13:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:13:58] [INFO ] After 2ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:13:58] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2025-06-01 00:13:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
TRAPS : Iteration 1
[2025-06-01 00:13:58] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:13:58] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 152 ms.
RANDOM walk for 40000 steps (5773 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3569 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1094973 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :0 out of 1
Probabilistic random walk after 1094973 steps, saw 547587 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :0
// Phase 1: matrix 94 rows 96 cols
[2025-06-01 00:14:01] [INFO ] Computed 15 invariants in 3 ms
[2025-06-01 00:14:01] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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) 40/71 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/92 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 94/186 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/190 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 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) 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) 40/71 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:14:02] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 21/92 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:14:02] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2025-06-01 00:14:02] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2025-06-01 00:14:02] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 94/186 variables, 92/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 12/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/190 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/190 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 392ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 94 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 93 transition count 88
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 88 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 88 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 87 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 85 transition count 85
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 85 transition count 81
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 12 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 81/96 places, 81/94 transitions.
RANDOM walk for 40000 steps (5750 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3674 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1107515 steps, run timeout after 3001 ms. (steps per millisecond=369 ) properties seen :0 out of 1
Probabilistic random walk after 1107515 steps, saw 553860 distinct states, run finished after 3001 ms. (steps per millisecond=369 ) properties seen :0
// Phase 1: matrix 81 rows 81 cols
[2025-06-01 00:14:05] [INFO ] Computed 13 invariants in 12 ms
[2025-06-01 00:14:05] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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) 20/61 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/134 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/158 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/159 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/159 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/159 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/162 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 108 constraints, problems are : Problem set: 0 solved, 1 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 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) 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) 20/61 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:14:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 73/134 variables, 61/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/158 variables, 16/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/159 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/159 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/159 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/162 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/162 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/162 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 240ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-06-01 00:14:05] [INFO ] Invariant cache hit.
[2025-06-01 00:14:05] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-01 00:14:05] [INFO ] Invariant cache hit.
[2025-06-01 00:14:05] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:14:06] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2025-06-01 00:14:06] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-01 00:14:06] [INFO ] Invariant cache hit.
[2025-06-01 00:14:06] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 81/161 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/162 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 108 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1564 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 81/161 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 80/187 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 1/162 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:14:10] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/162 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 189 constraints, problems are : Problem set: 0 solved, 80 unsolved in 5242 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 1/1 constraints]
After SMT, in 6825ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 6826ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7093 ms. Remains : 81/81 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
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 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 11 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2025-06-01 00:14:12] [INFO ] Computed 13 invariants in 2 ms
[2025-06-01 00:14:12] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:14:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 00:14:12] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 2 ms returned sat
[2025-06-01 00:14:12] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:14:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:14:12] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:14:12] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:14:12] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 116 ms.
RANDOM walk for 40000 steps (5717 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3677 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1047536 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :0 out of 1
Probabilistic random walk after 1047536 steps, saw 523859 distinct states, run finished after 3003 ms. (steps per millisecond=348 ) properties seen :0
// Phase 1: matrix 94 rows 96 cols
[2025-06-01 00:14:16] [INFO ] Computed 15 invariants in 5 ms
[2025-06-01 00:14:16] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/92 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/186 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/190 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 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) 70/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:14:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 21/92 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:14:16] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:14:16] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:14:16] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:14:16] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 94/186 variables, 92/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 12/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/190 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 129 constraints, problems are : Problem set: 0 solved, 1 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 399ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 95 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 (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 95 transition count 90
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 91 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 91 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 90 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 87 transition count 86
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 87 transition count 84
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 85 transition count 84
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 85 transition count 84
Applied a total of 22 rules in 6 ms. Remains 85 /96 variables (removed 11) and now considering 84/94 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 85/96 places, 84/94 transitions.
RANDOM walk for 40000 steps (5799 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3699 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1066071 steps, run timeout after 3001 ms. (steps per millisecond=355 ) properties seen :0 out of 1
Probabilistic random walk after 1066071 steps, saw 533128 distinct states, run finished after 3002 ms. (steps per millisecond=355 ) properties seen :0
// Phase 1: matrix 84 rows 85 cols
[2025-06-01 00:14:19] [INFO ] Computed 14 invariants in 4 ms
[2025-06-01 00:14:19] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/54 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/74 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 82/156 variables, 74/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/168 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/169 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/169 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/169 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 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) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/54 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/74 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:14:19] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 82/156 variables, 74/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 13/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/168 variables, 10/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/168 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/169 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/169 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/169 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 243ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 74 ms.
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 85/85 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2025-06-01 00:14:19] [INFO ] Invariant cache hit.
[2025-06-01 00:14:19] [INFO ] Implicit Places using invariants in 66 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 84/85 places, 84/84 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 82 transition count 82
Applied a total of 4 rules in 2 ms. Remains 82 /84 variables (removed 2) and now considering 82/84 (removed 2) transitions.
// Phase 1: matrix 82 rows 82 cols
[2025-06-01 00:14:19] [INFO ] Computed 13 invariants in 2 ms
[2025-06-01 00:14:20] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-01 00:14:20] [INFO ] Invariant cache hit.
[2025-06-01 00:14:20] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:14:20] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 82/85 places, 82/84 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 307 ms. Remains : 82/85 places, 82/84 transitions.
RANDOM walk for 40000 steps (5839 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3562 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1109788 steps, run timeout after 3001 ms. (steps per millisecond=369 ) properties seen :0 out of 1
Probabilistic random walk after 1109788 steps, saw 555000 distinct states, run finished after 3001 ms. (steps per millisecond=369 ) properties seen :0
[2025-06-01 00:14:23] [INFO ] Invariant cache hit.
[2025-06-01 00:14:23] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/30 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/72 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/86 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 69/155 variables, 67/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 14/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/158 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/158 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/164 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/164 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/164 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/164 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 109 constraints, problems are : Problem set: 0 solved, 1 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 27/30 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 42/72 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/86 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:14:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 69/155 variables, 67/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/155 variables, 14/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/155 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/158 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/158 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/158 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/164 variables, 6/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/164 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/164 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/164 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 242ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/82 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-01 00:14:23] [INFO ] Invariant cache hit.
[2025-06-01 00:14:23] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-01 00:14:23] [INFO ] Invariant cache hit.
[2025-06-01 00:14:23] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:14:23] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2025-06-01 00:14:23] [INFO ] Redundant transitions in 0 ms returned []
Running 81 sub problems to find dead transitions.
[2025-06-01 00:14:23] [INFO ] Invariant cache hit.
[2025-06-01 00:14:23] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 82/163 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 81 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/164 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/164 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 109 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1626 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 82/163 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 81/189 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 1/164 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 0/164 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 190 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3604 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
After SMT, in 5253ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 5254ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5507 ms. Remains : 82/82 places, 82/82 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 82 transition count 76
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 76 transition count 76
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 73 transition count 73
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 73 transition count 73
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 20 place count 72 transition count 72
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 72 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 70 transition count 70
Applied a total of 24 rules in 3 ms. Remains 70 /82 variables (removed 12) and now considering 70/82 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2025-06-01 00:14:29] [INFO ] Computed 13 invariants in 3 ms
[2025-06-01 00:14:29] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:14:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 00:14:29] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 3 ms returned sat
[2025-06-01 00:14:29] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:14:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:14:29] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:14:29] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2025-06-01 00:14:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
TRAPS : Iteration 1
[2025-06-01 00:14:29] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:14:29] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 146 ms.
RANDOM walk for 40000 steps (5781 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3639 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1077327 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :0 out of 1
Probabilistic random walk after 1077327 steps, saw 538766 distinct states, run finished after 3001 ms. (steps per millisecond=358 ) properties seen :0
// Phase 1: matrix 94 rows 96 cols
[2025-06-01 00:14:32] [INFO ] Computed 15 invariants in 3 ms
[2025-06-01 00:14:32] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/67 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/71 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/92 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 94/186 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/190 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 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) 66/67 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/71 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/92 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:14:32] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2025-06-01 00:14:32] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2025-06-01 00:14:32] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:14:32] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:14:32] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2025-06-01 00:14:32] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 94/186 variables, 92/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/190 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/190 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 130 constraints, problems are : Problem set: 0 solved, 1 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 425ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 94 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 93 transition count 89
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 89 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 88 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 88 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 87 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 21 place count 84 transition count 84
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 84 transition count 84
Applied a total of 22 rules in 6 ms. Remains 84 /96 variables (removed 12) and now considering 84/94 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 84/96 places, 84/94 transitions.
RANDOM walk for 40000 steps (5778 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3659 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1100601 steps, run timeout after 3001 ms. (steps per millisecond=366 ) properties seen :0 out of 1
Probabilistic random walk after 1100601 steps, saw 550407 distinct states, run finished after 3001 ms. (steps per millisecond=366 ) properties seen :0
// Phase 1: matrix 84 rows 84 cols
[2025-06-01 00:14:35] [INFO ] Computed 13 invariants in 4 ms
[2025-06-01 00:14:35] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/56 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/62 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 74/136 variables, 62/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 27/163 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/164 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/164 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/168 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 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) 27/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/56 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:14:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/62 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 74/136 variables, 62/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 27/163 variables, 17/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/164 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/164 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/164 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/168 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/168 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/168 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 234ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 84/84 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2025-06-01 00:14:36] [INFO ] Invariant cache hit.
[2025-06-01 00:14:36] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-01 00:14:36] [INFO ] Invariant cache hit.
[2025-06-01 00:14:36] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:14:36] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2025-06-01 00:14:36] [INFO ] Redundant transitions in 0 ms returned []
Running 83 sub problems to find dead transitions.
[2025-06-01 00:14:36] [INFO ] Invariant cache hit.
[2025-06-01 00:14:36] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/167 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 1/168 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 111 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1722 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/167 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 83/193 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 1/168 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 194 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3783 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 5522ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 5524ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5788 ms. Remains : 84/84 places, 84/84 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 84 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 83 transition count 83
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 83 transition count 77
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 77 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 74 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 74 transition count 74
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 2 with 2 rules applied. Total rules applied 22 place count 73 transition count 73
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 73 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 72 transition count 72
Applied a total of 24 rules in 11 ms. Remains 72 /84 variables (removed 12) and now considering 72/84 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 72 cols
[2025-06-01 00:14:41] [INFO ] Computed 13 invariants in 0 ms
[2025-06-01 00:14:41] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:14:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 00:14:42] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 3 ms returned sat
[2025-06-01 00:14:42] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:14:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:14:42] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:14:42] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:14:42] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 107 ms.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 96 transition count 88
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 90 transition count 88
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 87 transition count 85
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 87 transition count 85
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 20 place count 86 transition count 84
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 86 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 85 transition count 83
Applied a total of 22 rules in 6 ms. Remains 85 /96 variables (removed 11) and now considering 83/94 (removed 11) transitions.
Running SMT prover for 17 properties.
// Phase 1: matrix 83 rows 85 cols
[2025-06-01 00:14:42] [INFO ] Computed 15 invariants in 1 ms
[2025-06-01 00:14:42] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2025-06-01 00:14:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 00:14:42] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 3 ms returned sat
[2025-06-01 00:14:42] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2025-06-01 00:14:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:14:42] [INFO ] After 67ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :17
TRAPS : Iteration 0
[2025-06-01 00:14:42] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:14:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2025-06-01 00:14:42] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2025-06-01 00:14:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
TRAPS : Iteration 1
[2025-06-01 00:14:42] [INFO ] After 356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
[2025-06-01 00:14:42] [INFO ] After 610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Over-approximation ignoring read arcs solved 0 properties in 674 ms.
Unable to solve all queries for examination StableMarking. Remains :17 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 17 properties from file /home/mcc/execution/StableMarking.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 569386 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleExponent-PT-004

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 216
TRANSITIONS: 198
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.000s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

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

Process ID: 2662
MODEL NAME: /home/mcc/execution/model
216 places, 198 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Building monolithic NSF...
Convergence in 55 steps.
Creating all event NSFs..
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Convergence in 130 steps.
Start RS construction.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2257 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2257 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 4348 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2257 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 4348 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2257 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1748737082942

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-004"
export BK_EXAMINATION="StableMarking"
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-004, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r084-tall-174860080300303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-004.tgz
mv DoubleExponent-PT-004 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;