About the Execution of 2024-gold for ASLink-PT-05a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15685.270 | 1800000.00 | 3092612.00 | 3194.10 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r014-tall-174853743600218.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 ASLink-PT-05a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743600218
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 932K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 516K 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 1748545994070
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-05a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 19:13:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-29 19:13:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:13:15] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2025-05-29 19:13:15] [INFO ] Transformed 1211 places.
[2025-05-29 19:13:15] [INFO ] Transformed 1827 transitions.
[2025-05-29 19:13:15] [INFO ] Found NUPN structural information;
[2025-05-29 19:13:15] [INFO ] Parsed PT model containing 1211 places and 1827 transitions and 6877 arcs in 270 ms.
Structural test allowed to assert that 137 places are NOT stable. Took 12 ms.
Ensure Unique test removed 19 transitions
Reduce redundant transitions removed 19 transitions.
RANDOM walk for 40000 steps (246 resets) in 2721 ms. (14 steps per ms) remains 403/1074 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 29 ms. (13 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 403/403 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 403/403 properties
// Phase 1: matrix 1808 rows 1211 cols
[2025-05-29 19:13:17] [INFO ] Computed 232 invariants in 139 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 403/403 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 18/421 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 403/3019 variables, and 421 constraints, problems are : Problem set: 0 solved, 403 unsolved in 5058 ms.
Refiners :[Domain max(s): 403/1211 constraints, Positive P Invariants (semi-flows): 0/56 constraints, Generalized P Invariants (flows): 18/176 constraints, State Equation: 0/1211 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 403/403 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 18/421 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (OVERLAPS) 74/477 variables, 43/464 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 74/538 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 5/543 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/3019 variables, and 543 constraints, problems are : Problem set: 0 solved, 403 unsolved in 5012 ms.
Refiners :[Domain max(s): 477/1211 constraints, Positive P Invariants (semi-flows): 43/56 constraints, Generalized P Invariants (flows): 23/176 constraints, State Equation: 0/1211 constraints, PredecessorRefiner: 0/403 constraints, Known Traps: 0/0 constraints]
After SMT, in 10444ms problems are : Problem set: 0 solved, 403 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 403 out of 1211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1211/1211 places, 1808/1808 transitions.
Ensure Unique test removed 5 places
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 1197 transition count 1733
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 164 place count 1122 transition count 1733
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 164 place count 1122 transition count 1637
Deduced a syphon composed of 96 places in 7 ms
Ensure Unique test removed 35 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 227 rules applied. Total rules applied 391 place count 991 transition count 1637
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 392 place count 991 transition count 1636
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 393 place count 990 transition count 1636
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 395 place count 988 transition count 1626
Iterating global reduction 4 with 2 rules applied. Total rules applied 397 place count 988 transition count 1626
Ensure Unique test 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 401 place count 987 transition count 1623
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 403 place count 985 transition count 1623
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 404 place count 984 transition count 1615
Iterating global reduction 6 with 1 rules applied. Total rules applied 405 place count 984 transition count 1615
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 406 place count 983 transition count 1607
Iterating global reduction 6 with 1 rules applied. Total rules applied 407 place count 983 transition count 1607
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 408 place count 982 transition count 1599
Iterating global reduction 6 with 1 rules applied. Total rules applied 409 place count 982 transition count 1599
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 410 place count 981 transition count 1591
Iterating global reduction 6 with 1 rules applied. Total rules applied 411 place count 981 transition count 1591
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 412 place count 980 transition count 1583
Iterating global reduction 6 with 1 rules applied. Total rules applied 413 place count 980 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 414 place count 979 transition count 1575
Iterating global reduction 6 with 1 rules applied. Total rules applied 415 place count 979 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 416 place count 978 transition count 1567
Iterating global reduction 6 with 1 rules applied. Total rules applied 417 place count 978 transition count 1567
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 418 place count 977 transition count 1559
Iterating global reduction 6 with 1 rules applied. Total rules applied 419 place count 977 transition count 1559
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 420 place count 976 transition count 1551
Iterating global reduction 6 with 1 rules applied. Total rules applied 421 place count 976 transition count 1551
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 422 place count 975 transition count 1543
Iterating global reduction 6 with 1 rules applied. Total rules applied 423 place count 975 transition count 1543
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 424 place count 974 transition count 1535
Iterating global reduction 6 with 1 rules applied. Total rules applied 425 place count 974 transition count 1535
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 426 place count 973 transition count 1527
Iterating global reduction 6 with 1 rules applied. Total rules applied 427 place count 973 transition count 1527
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 428 place count 972 transition count 1519
Iterating global reduction 6 with 1 rules applied. Total rules applied 429 place count 972 transition count 1519
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 430 place count 971 transition count 1511
Iterating global reduction 6 with 1 rules applied. Total rules applied 431 place count 971 transition count 1511
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 432 place count 970 transition count 1503
Iterating global reduction 6 with 1 rules applied. Total rules applied 433 place count 970 transition count 1503
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 434 place count 969 transition count 1495
Iterating global reduction 6 with 1 rules applied. Total rules applied 435 place count 969 transition count 1495
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 485 place count 944 transition count 1470
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 488 place count 944 transition count 1467
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 491 place count 941 transition count 1467
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 492 place count 940 transition count 1466
Applied a total of 492 rules in 804 ms. Remains 940 /1211 variables (removed 271) and now considering 1466/1808 (removed 342) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 815 ms. Remains : 940/1211 places, 1466/1808 transitions.
RANDOM walk for 4000000 steps (40897 resets) in 82639 ms. (48 steps per ms) remains 256/403 properties
BEST_FIRST walk for 40004 steps (79 resets) in 174 ms. (228 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (83 resets) in 171 ms. (232 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (80 resets) in 190 ms. (209 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (76 resets) in 182 ms. (218 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (75 resets) in 178 ms. (223 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (85 resets) in 168 ms. (236 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (75 resets) in 174 ms. (228 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (77 resets) in 166 ms. (239 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (81 resets) in 160 ms. (248 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40001 steps (74 resets) in 167 ms. (238 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40002 steps (81 resets) in 162 ms. (245 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (79 resets) in 170 ms. (233 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (78 resets) in 162 ms. (245 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (76 resets) in 174 ms. (228 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (75 resets) in 174 ms. (228 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (81 resets) in 156 ms. (254 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40002 steps (81 resets) in 172 ms. (231 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (77 resets) in 215 ms. (185 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40002 steps (72 resets) in 174 ms. (228 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (77 resets) in 171 ms. (232 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (77 resets) in 168 ms. (236 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (76 resets) in 172 ms. (231 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40002 steps (81 resets) in 172 ms. (231 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40002 steps (76 resets) in 163 ms. (243 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (82 resets) in 164 ms. (242 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (85 resets) in 230 ms. (173 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (78 resets) in 165 ms. (240 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (85 resets) in 156 ms. (254 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40002 steps (79 resets) in 168 ms. (236 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (76 resets) in 168 ms. (236 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (78 resets) in 167 ms. (238 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40002 steps (78 resets) in 169 ms. (235 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (77 resets) in 166 ms. (239 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40002 steps (85 resets) in 167 ms. (238 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (79 resets) in 167 ms. (238 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (74 resets) in 176 ms. (226 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (76 resets) in 167 ms. (238 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (84 resets) in 160 ms. (248 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (76 resets) in 168 ms. (236 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (80 resets) in 165 ms. (240 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (79 resets) in 168 ms. (236 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (84 resets) in 162 ms. (245 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (75 resets) in 169 ms. (235 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (74 resets) in 173 ms. (229 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40002 steps (78 resets) in 164 ms. (242 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (76 resets) in 167 ms. (238 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (79 resets) in 172 ms. (231 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (79 resets) in 160 ms. (248 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (75 resets) in 167 ms. (238 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40002 steps (73 resets) in 177 ms. (224 steps per ms) remains 256/256 properties
// Phase 1: matrix 1466 rows 940 cols
[2025-05-29 19:13:51] [INFO ] Computed 182 invariants in 72 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 33/289 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/290 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 253/543 variables, 43/93 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 8/551 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/551 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 11 (OVERLAPS) 169/720 variables, 26/127 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/720 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 13 (OVERLAPS) 76/796 variables, 14/141 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/796 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 15 (OVERLAPS) 8/804 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/804 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 17 (OVERLAPS) 133/937 variables, 35/179 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/937 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 19 (OVERLAPS) 1/938 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/938 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 21 (OVERLAPS) 2/940 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/940 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 23 (OVERLAPS) 1466/2406 variables, 940/1122 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2406/2406 variables, and 1122 constraints, problems are : Problem set: 0 solved, 256 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 121/121 constraints, State Equation: 940/940 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 33/289 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/290 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 253/543 variables, 43/93 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2025-05-29 19:14:41] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 18 ms to minimize.
[2025-05-29 19:14:42] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 3 ms to minimize.
[2025-05-29 19:14:43] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2025-05-29 19:14:44] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2025-05-29 19:14:44] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 1 ms to minimize.
[2025-05-29 19:14:45] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2025-05-29 19:14:50] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 11 (OVERLAPS) 8/551 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/551 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 13 (OVERLAPS) 169/720 variables, 26/134 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/720 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 15 (OVERLAPS) 76/796 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/796 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 17 (OVERLAPS) 8/804 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/804 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 19 (OVERLAPS) 133/937 variables, 35/186 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 937/2406 variables, and 186 constraints, problems are : Problem set: 0 solved, 256 unsolved in 45016 ms.
Refiners :[Positive P Invariants (semi-flows): 60/61 constraints, Generalized P Invariants (flows): 119/121 constraints, State Equation: 0/940 constraints, PredecessorRefiner: 0/256 constraints, Known Traps: 7/7 constraints]
After SMT, in 90219ms problems are : Problem set: 0 solved, 256 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 256 out of 940 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 940/940 places, 1466/1466 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 935 transition count 1459
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 925 transition count 1459
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 22 place count 925 transition count 1451
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 38 place count 917 transition count 1451
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 915 transition count 1451
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 42 place count 913 transition count 1439
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 913 transition count 1439
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 912 transition count 1439
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 69 place count 900 transition count 1427
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 71 place count 898 transition count 1425
Iterating global reduction 4 with 2 rules applied. Total rules applied 73 place count 898 transition count 1425
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 76 place count 898 transition count 1422
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 80 place count 895 transition count 1421
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 81 place count 895 transition count 1421
Applied a total of 81 rules in 127 ms. Remains 895 /940 variables (removed 45) and now considering 1421/1466 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 895/940 places, 1421/1466 transitions.
RANDOM walk for 4000000 steps (47620 resets) in 67253 ms. (59 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (86 resets) in 177 ms. (224 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (87 resets) in 211 ms. (188 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (91 resets) in 232 ms. (171 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (84 resets) in 272 ms. (146 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40001 steps (92 resets) in 206 ms. (193 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (87 resets) in 314 ms. (126 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (88 resets) in 215 ms. (185 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (86 resets) in 204 ms. (195 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (86 resets) in 300 ms. (132 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (84 resets) in 217 ms. (183 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (85 resets) in 212 ms. (187 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (86 resets) in 292 ms. (136 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (86 resets) in 271 ms. (147 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (87 resets) in 222 ms. (179 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (81 resets) in 269 ms. (148 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (90 resets) in 224 ms. (177 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (87 resets) in 351 ms. (113 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (91 resets) in 263 ms. (151 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (89 resets) in 340 ms. (117 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (91 resets) in 242 ms. (164 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (87 resets) in 392 ms. (101 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (92 resets) in 198 ms. (201 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (89 resets) in 384 ms. (103 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (82 resets) in 329 ms. (121 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (92 resets) in 239 ms. (166 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (88 resets) in 247 ms. (161 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (87 resets) in 336 ms. (118 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (89 resets) in 331 ms. (120 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (92 resets) in 248 ms. (160 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (85 resets) in 373 ms. (106 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (87 resets) in 336 ms. (118 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (88 resets) in 351 ms. (113 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (91 resets) in 233 ms. (170 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (90 resets) in 327 ms. (121 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (81 resets) in 325 ms. (122 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (85 resets) in 217 ms. (183 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (89 resets) in 214 ms. (186 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (93 resets) in 358 ms. (111 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (87 resets) in 226 ms. (176 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40001 steps (91 resets) in 315 ms. (126 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (88 resets) in 242 ms. (164 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (92 resets) in 243 ms. (163 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (87 resets) in 396 ms. (100 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (93 resets) in 297 ms. (134 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (90 resets) in 231 ms. (172 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (85 resets) in 312 ms. (127 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (90 resets) in 254 ms. (156 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (88 resets) in 252 ms. (158 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (88 resets) in 210 ms. (189 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (87 resets) in 415 ms. (96 steps per ms) remains 256/256 properties
Interrupted probabilistic random walk after 3093069 steps, run timeout after 66001 ms. (steps per millisecond=46 ) properties seen :16 out of 256
Probabilistic random walk after 3093069 steps, saw 928674 distinct states, run finished after 66009 ms. (steps per millisecond=46 ) properties seen :16
// Phase 1: matrix 1421 rows 895 cols
[2025-05-29 19:16:50] [INFO ] Computed 171 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 28/268 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 198/466 variables, 35/81 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 22/488 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 139/627 variables, 31/121 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/627 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (OVERLAPS) 18/645 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/645 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 13 (OVERLAPS) 105/750 variables, 11/136 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/750 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 15 (OVERLAPS) 54/804 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/804 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 17 (OVERLAPS) 2/806 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/806 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 19 (OVERLAPS) 87/893 variables, 25/169 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/893 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 21 (OVERLAPS) 1/894 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/894 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 23 (OVERLAPS) 1/895 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/895 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 25 (OVERLAPS) 1421/2316 variables, 895/1066 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2316 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 27 (OVERLAPS) 0/2316 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2316/2316 variables, and 1066 constraints, problems are : Problem set: 0 solved, 240 unsolved in 64939 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 118/118 constraints, State Equation: 895/895 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 28/268 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 198/466 variables, 35/81 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2025-05-29 19:17:58] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2025-05-29 19:17:59] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2025-05-29 19:17:59] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2025-05-29 19:18:00] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2025-05-29 19:18:01] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 22/488 variables, 9/95 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (OVERLAPS) 139/627 variables, 31/126 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/627 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (OVERLAPS) 18/645 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/645 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 14 (OVERLAPS) 105/750 variables, 11/141 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/750 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 16 (OVERLAPS) 54/804 variables, 6/147 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/804 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 18 (OVERLAPS) 2/806 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/806 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 20 (OVERLAPS) 87/893 variables, 25/174 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/893 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 22 (OVERLAPS) 1/894 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/894 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 24 (OVERLAPS) 1/895 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/895 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 26 (OVERLAPS) 1421/2316 variables, 895/1071 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2316 variables, 240/1311 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2316/2316 variables, and 1311 constraints, problems are : Problem set: 0 solved, 240 unsolved in 75022 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 118/118 constraints, State Equation: 895/895 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 5/5 constraints]
After SMT, in 140051ms problems are : Problem set: 0 solved, 240 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 240 out of 895 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 895/895 places, 1421/1421 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 3 place count 895 transition count 1418
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 892 transition count 1418
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 892 transition count 1415
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 887 transition count 1415
Applied a total of 14 rules in 37 ms. Remains 887 /895 variables (removed 8) and now considering 1415/1421 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 887/895 places, 1415/1421 transitions.
RANDOM walk for 4000000 steps (47634 resets) in 63554 ms. (62 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (86 resets) in 184 ms. (216 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (88 resets) in 194 ms. (205 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (87 resets) in 211 ms. (188 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (94 resets) in 192 ms. (207 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (84 resets) in 223 ms. (178 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40001 steps (90 resets) in 276 ms. (144 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (88 resets) in 201 ms. (198 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (89 resets) in 280 ms. (142 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (82 resets) in 264 ms. (150 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (85 resets) in 239 ms. (166 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (89 resets) in 241 ms. (165 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (88 resets) in 257 ms. (155 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (87 resets) in 231 ms. (172 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (93 resets) in 324 ms. (123 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (90 resets) in 301 ms. (132 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (88 resets) in 247 ms. (161 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (87 resets) in 232 ms. (171 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (91 resets) in 334 ms. (119 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (95 resets) in 205 ms. (194 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (87 resets) in 231 ms. (172 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (89 resets) in 245 ms. (162 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (87 resets) in 238 ms. (167 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (94 resets) in 357 ms. (111 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (96 resets) in 245 ms. (162 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (88 resets) in 232 ms. (171 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (91 resets) in 204 ms. (195 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (89 resets) in 301 ms. (132 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (92 resets) in 211 ms. (188 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (95 resets) in 202 ms. (197 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (93 resets) in 236 ms. (168 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (88 resets) in 231 ms. (172 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (86 resets) in 213 ms. (186 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (92 resets) in 186 ms. (213 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (91 resets) in 278 ms. (143 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (86 resets) in 232 ms. (171 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (89 resets) in 291 ms. (137 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (89 resets) in 258 ms. (154 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (97 resets) in 194 ms. (205 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (88 resets) in 361 ms. (110 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (87 resets) in 215 ms. (185 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (89 resets) in 336 ms. (118 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (90 resets) in 224 ms. (177 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (88 resets) in 261 ms. (152 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (87 resets) in 240 ms. (165 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (88 resets) in 198 ms. (201 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (89 resets) in 285 ms. (139 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40001 steps (87 resets) in 208 ms. (191 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (91 resets) in 307 ms. (129 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (88 resets) in 313 ms. (127 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (89 resets) in 221 ms. (180 steps per ms) remains 240/240 properties
Interrupted probabilistic random walk after 2515996 steps, run timeout after 60001 ms. (steps per millisecond=41 ) properties seen :0 out of 240
Probabilistic random walk after 2515996 steps, saw 815225 distinct states, run finished after 60001 ms. (steps per millisecond=41 ) properties seen :0
// Phase 1: matrix 1415 rows 887 cols
[2025-05-29 19:20:31] [INFO ] Computed 169 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 28/268 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 198/466 variables, 35/81 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 14/480 variables, 7/88 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 139/619 variables, 31/119 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/619 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (OVERLAPS) 18/637 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/637 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 13 (OVERLAPS) 105/742 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/742 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 15 (OVERLAPS) 54/796 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/796 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 17 (OVERLAPS) 2/798 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/798 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 19 (OVERLAPS) 87/885 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/885 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 21 (OVERLAPS) 1/886 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/886 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 23 (OVERLAPS) 1/887 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/887 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 25 (OVERLAPS) 1415/2302 variables, 887/1056 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2302 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 27 (OVERLAPS) 0/2302 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2302/2302 variables, and 1056 constraints, problems are : Problem set: 0 solved, 240 unsolved in 66544 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 118/118 constraints, State Equation: 887/887 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 28/268 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 198/466 variables, 35/81 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2025-05-29 19:21:41] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2025-05-29 19:21:41] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2025-05-29 19:21:42] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2025-05-29 19:21:43] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2025-05-29 19:21:43] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 14/480 variables, 7/93 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (OVERLAPS) 139/619 variables, 31/124 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/619 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (OVERLAPS) 18/637 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/637 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 14 (OVERLAPS) 105/742 variables, 11/139 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/742 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 16 (OVERLAPS) 54/796 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/796 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 18 (OVERLAPS) 2/798 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/798 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 20 (OVERLAPS) 87/885 variables, 25/172 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/885 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 22 (OVERLAPS) 1/886 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/886 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 24 (OVERLAPS) 1/887 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/887 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 26 (OVERLAPS) 1415/2302 variables, 887/1061 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2302 variables, 240/1301 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2302/2302 variables, and 1301 constraints, problems are : Problem set: 0 solved, 240 unsolved in 90030 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 118/118 constraints, State Equation: 887/887 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 5/5 constraints]
After SMT, in 156656ms problems are : Problem set: 0 solved, 240 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 240 out of 887 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 887/887 places, 1415/1415 transitions.
Applied a total of 0 rules in 22 ms. Remains 887 /887 variables (removed 0) and now considering 1415/1415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 887/887 places, 1415/1415 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 887/887 places, 1415/1415 transitions.
Applied a total of 0 rules in 19 ms. Remains 887 /887 variables (removed 0) and now considering 1415/1415 (removed 0) transitions.
[2025-05-29 19:23:08] [INFO ] Invariant cache hit.
[2025-05-29 19:23:09] [INFO ] Implicit Places using invariants in 666 ms returned [20, 53, 71, 163, 180, 185, 186, 206, 224, 316, 330, 334, 335, 355, 373, 465, 479, 483, 484, 485, 503, 521, 597, 598, 610, 611, 612, 613, 631, 649, 668, 718, 719, 722, 733, 734, 735, 753, 755, 758, 776, 777, 778, 779, 791, 797, 803, 809, 815, 821, 827, 833, 839, 845, 851]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 676 ms to find 55 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 832/887 places, 1415/1415 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 832 transition count 1339
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 152 place count 756 transition count 1339
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 152 place count 756 transition count 1312
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 207 place count 728 transition count 1312
Discarding 5 places :
Implicit places reduction removed 5 places
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 2 with 13 rules applied. Total rules applied 220 place count 723 transition count 1304
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 228 place count 715 transition count 1304
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 243 place count 700 transition count 1289
Iterating global reduction 4 with 15 rules applied. Total rules applied 258 place count 700 transition count 1289
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 261 place count 700 transition count 1286
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 700 transition count 1285
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 699 transition count 1285
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 266 place count 696 transition count 1282
Iterating global reduction 5 with 3 rules applied. Total rules applied 269 place count 696 transition count 1282
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 270 place count 695 transition count 1281
Iterating global reduction 5 with 1 rules applied. Total rules applied 271 place count 695 transition count 1281
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 272 place count 694 transition count 1280
Iterating global reduction 5 with 1 rules applied. Total rules applied 273 place count 694 transition count 1280
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 353 place count 654 transition count 1240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 354 place count 654 transition count 1239
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 355 place count 654 transition count 1238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 356 place count 653 transition count 1238
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 7 with 12 rules applied. Total rules applied 368 place count 653 transition count 1226
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 381 place count 640 transition count 1226
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 382 place count 640 transition count 1225
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 397 place count 640 transition count 1225
Applied a total of 397 rules in 157 ms. Remains 640 /832 variables (removed 192) and now considering 1225/1415 (removed 190) transitions.
// Phase 1: matrix 1225 rows 640 cols
[2025-05-29 19:23:09] [INFO ] Computed 107 invariants in 11 ms
[2025-05-29 19:23:09] [INFO ] Implicit Places using invariants in 473 ms returned [122, 128, 131, 133, 134, 155, 156, 251, 257, 260, 262, 263, 281, 282, 376, 382, 385, 387, 388, 406, 407, 481, 487, 490, 492, 498, 499, 566, 572, 575, 577]
[2025-05-29 19:23:09] [INFO ] Actually due to overlaps returned [155, 281, 406, 498, 156, 282, 407, 499, 122, 128, 133, 251, 257, 262, 376, 382, 387, 481, 487, 492, 566, 572, 577, 134, 263, 388]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 478 ms to find 26 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 614/887 places, 1225/1415 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 594 transition count 1205
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 594 transition count 1205
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 589 transition count 1200
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 589 transition count 1200
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 584 transition count 1195
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 78 place count 584 transition count 1177
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 96 place count 566 transition count 1177
Applied a total of 96 rules in 59 ms. Remains 566 /614 variables (removed 48) and now considering 1177/1225 (removed 48) transitions.
// Phase 1: matrix 1177 rows 566 cols
[2025-05-29 19:23:09] [INFO ] Computed 81 invariants in 8 ms
[2025-05-29 19:23:10] [INFO ] Implicit Places using invariants in 409 ms returned []
[2025-05-29 19:23:10] [INFO ] Invariant cache hit.
[2025-05-29 19:23:10] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 566/887 places, 1177/1415 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2492 ms. Remains : 566/887 places, 1177/1415 transitions.
RANDOM walk for 4000000 steps (70385 resets) in 59303 ms. (67 steps per ms) remains 237/240 properties
BEST_FIRST walk for 40003 steps (175 resets) in 172 ms. (231 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (170 resets) in 157 ms. (253 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (177 resets) in 157 ms. (253 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (172 resets) in 155 ms. (256 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (172 resets) in 159 ms. (250 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (173 resets) in 165 ms. (240 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (165 resets) in 158 ms. (251 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (174 resets) in 188 ms. (211 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (173 resets) in 211 ms. (188 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (173 resets) in 314 ms. (126 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (165 resets) in 216 ms. (184 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (171 resets) in 217 ms. (183 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (177 resets) in 248 ms. (160 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (166 resets) in 237 ms. (168 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40001 steps (167 resets) in 199 ms. (200 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (163 resets) in 298 ms. (133 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (162 resets) in 235 ms. (169 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (169 resets) in 384 ms. (103 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (173 resets) in 367 ms. (108 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (175 resets) in 233 ms. (170 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (159 resets) in 423 ms. (94 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (163 resets) in 208 ms. (191 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (168 resets) in 356 ms. (112 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (173 resets) in 347 ms. (114 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (180 resets) in 327 ms. (121 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (172 resets) in 246 ms. (161 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (168 resets) in 361 ms. (110 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (170 resets) in 437 ms. (91 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (177 resets) in 213 ms. (186 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (160 resets) in 249 ms. (160 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (174 resets) in 315 ms. (126 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (169 resets) in 293 ms. (136 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (176 resets) in 214 ms. (186 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (169 resets) in 257 ms. (155 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (164 resets) in 271 ms. (147 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (176 resets) in 256 ms. (155 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (171 resets) in 425 ms. (93 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (172 resets) in 252 ms. (158 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (167 resets) in 220 ms. (181 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (170 resets) in 292 ms. (136 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (180 resets) in 231 ms. (172 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (172 resets) in 222 ms. (179 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (165 resets) in 282 ms. (141 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (176 resets) in 239 ms. (166 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (169 resets) in 319 ms. (125 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (163 resets) in 253 ms. (157 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (161 resets) in 265 ms. (150 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40001 steps (174 resets) in 263 ms. (151 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (166 resets) in 224 ms. (177 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (171 resets) in 242 ms. (164 steps per ms) remains 237/237 properties
Interrupted probabilistic random walk after 3056204 steps, run timeout after 60001 ms. (steps per millisecond=50 ) properties seen :8 out of 237
Probabilistic random walk after 3056204 steps, saw 1172112 distinct states, run finished after 60001 ms. (steps per millisecond=50 ) properties seen :8
[2025-05-29 19:24:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 10/239 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 97/336 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 15/351 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (OVERLAPS) 131/482 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 11 (OVERLAPS) 48/530 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/530 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 13 (OVERLAPS) 36/566 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 15 (OVERLAPS) 1177/1743 variables, 566/647 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1743 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 17 (OVERLAPS) 0/1743 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1743/1743 variables, and 647 constraints, problems are : Problem set: 0 solved, 229 unsolved in 32664 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 566/566 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 10/239 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2025-05-29 19:25:04] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:25:05] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2025-05-29 19:25:05] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2025-05-29 19:25:05] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 97/336 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (OVERLAPS) 15/351 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (OVERLAPS) 131/482 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2025-05-29 19:25:12] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/482 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/482 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 13 (OVERLAPS) 48/530 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/530 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 15 (OVERLAPS) 36/566 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/566 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 17 (OVERLAPS) 1177/1743 variables, 566/652 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1743 variables, 229/881 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1743/1743 variables, and 881 constraints, problems are : Problem set: 0 solved, 229 unsolved in 105014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 566/566 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 5/5 constraints]
After SMT, in 137729ms problems are : Problem set: 0 solved, 229 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 229 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 1177/1177 transitions.
Ensure Unique test 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 3 rules applied. Total rules applied 3 place count 565 transition count 1175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 563 transition count 1175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 563 transition count 1174
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 7 place count 562 transition count 1174
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 9 place count 560 transition count 1167
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 560 transition count 1167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 560 transition count 1166
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 3 with 2 rules applied. Total rules applied 14 place count 559 transition count 1165
Applied a total of 14 rules in 37 ms. Remains 559 /566 variables (removed 7) and now considering 1165/1177 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 559/566 places, 1165/1177 transitions.
RANDOM walk for 4000000 steps (70260 resets) in 58525 ms. (68 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40004 steps (169 resets) in 259 ms. (153 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40004 steps (169 resets) in 306 ms. (130 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40004 steps (181 resets) in 245 ms. (162 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40003 steps (154 resets) in 344 ms. (115 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40004 steps (179 resets) in 311 ms. (128 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40004 steps (174 resets) in 406 ms. (98 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40003 steps (163 resets) in 398 ms. (100 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40002 steps (172 resets) in 407 ms. (98 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40004 steps (173 resets) in 274 ms. (145 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40004 steps (175 resets) in 412 ms. (96 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40003 steps (165 resets) in 305 ms. (130 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40003 steps (167 resets) in 366 ms. (109 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40002 steps (172 resets) in 283 ms. (140 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40004 steps (166 resets) in 302 ms. (132 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40002 steps (180 resets) in 399 ms. (100 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40002 steps (166 resets) in 404 ms. (98 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40003 steps (175 resets) in 376 ms. (106 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40003 steps (177 resets) in 322 ms. (123 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40002 steps (165 resets) in 395 ms. (101 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40004 steps (176 resets) in 253 ms. (157 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40002 steps (174 resets) in 391 ms. (102 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40002 steps (167 resets) in 387 ms. (103 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40004 steps (174 resets) in 416 ms. (95 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40001 steps (165 resets) in 316 ms. (126 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40004 steps (175 resets) in 370 ms. (107 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40003 steps (174 resets) in 261 ms. (152 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40002 steps (165 resets) in 379 ms. (105 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40001 steps (168 resets) in 297 ms. (134 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40003 steps (171 resets) in 270 ms. (147 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40003 steps (173 resets) in 436 ms. (91 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40003 steps (168 resets) in 382 ms. (104 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40003 steps (176 resets) in 268 ms. (148 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40003 steps (168 resets) in 386 ms. (103 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40004 steps (175 resets) in 371 ms. (107 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40002 steps (175 resets) in 353 ms. (113 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40004 steps (162 resets) in 339 ms. (117 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40004 steps (166 resets) in 389 ms. (102 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40003 steps (172 resets) in 262 ms. (152 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40003 steps (170 resets) in 365 ms. (109 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40003 steps (186 resets) in 318 ms. (125 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40002 steps (158 resets) in 446 ms. (89 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40001 steps (168 resets) in 354 ms. (112 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40003 steps (164 resets) in 327 ms. (121 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40004 steps (166 resets) in 377 ms. (105 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40003 steps (169 resets) in 280 ms. (142 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40001 steps (172 resets) in 333 ms. (119 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40001 steps (187 resets) in 297 ms. (134 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40002 steps (169 resets) in 249 ms. (160 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40003 steps (171 resets) in 306 ms. (130 steps per ms) remains 229/229 properties
BEST_FIRST walk for 40003 steps (178 resets) in 284 ms. (140 steps per ms) remains 229/229 properties
Interrupted probabilistic random walk after 1754855 steps, run timeout after 60001 ms. (steps per millisecond=29 ) properties seen :64 out of 229
Probabilistic random walk after 1754855 steps, saw 1071754 distinct states, run finished after 60001 ms. (steps per millisecond=29 ) properties seen :64
// Phase 1: matrix 1165 rows 559 cols
[2025-05-29 19:28:09] [INFO ] Computed 80 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 8/173 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 80/253 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 4/257 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 98/355 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (OVERLAPS) 14/369 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 13 (OVERLAPS) 107/476 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 15 (OVERLAPS) 48/524 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/524 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 17 (OVERLAPS) 35/559 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/559 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 19 (OVERLAPS) 1165/1724 variables, 559/639 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1724 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 21 (OVERLAPS) 0/1724 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1724/1724 variables, and 639 constraints, problems are : Problem set: 0 solved, 165 unsolved in 19990 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 559/559 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 8/173 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2025-05-29 19:28:30] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2025-05-29 19:28:30] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 80/253 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2025-05-29 19:28:32] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 4/257 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (OVERLAPS) 98/355 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 13 (OVERLAPS) 14/369 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/369 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 15 (OVERLAPS) 107/476 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/476 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 17 (OVERLAPS) 48/524 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/524 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 19 (OVERLAPS) 35/559 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/559 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 21 (OVERLAPS) 1165/1724 variables, 559/642 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1724 variables, 165/807 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1724/1724 variables, and 807 constraints, problems are : Problem set: 0 solved, 165 unsolved in 120019 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 559/559 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 3/3 constraints]
After SMT, in 140063ms problems are : Problem set: 0 solved, 165 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 165 out of 559 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 559/559 places, 1165/1165 transitions.
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 556 transition count 1159
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 549 transition count 1159
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 16 place count 549 transition count 1152
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 540 transition count 1152
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 2 with 3 rules applied. Total rules applied 35 place count 539 transition count 1150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 537 transition count 1150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 37 place count 537 transition count 1149
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 39 place count 536 transition count 1149
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 41 place count 534 transition count 1147
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 534 transition count 1147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 44 place count 534 transition count 1146
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 5 with 2 rules applied. Total rules applied 46 place count 533 transition count 1145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 47 place count 533 transition count 1144
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 48 place count 533 transition count 1144
Applied a total of 48 rules in 65 ms. Remains 533 /559 variables (removed 26) and now considering 1144/1165 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 533/559 places, 1144/1165 transitions.
RANDOM walk for 4000000 steps (72809 resets) in 96942 ms. (41 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (172 resets) in 233 ms. (170 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (182 resets) in 338 ms. (118 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40001 steps (171 resets) in 247 ms. (161 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (175 resets) in 365 ms. (109 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (181 resets) in 321 ms. (124 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (181 resets) in 311 ms. (128 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (188 resets) in 232 ms. (171 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (183 resets) in 327 ms. (121 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (174 resets) in 324 ms. (123 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (179 resets) in 222 ms. (179 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (175 resets) in 344 ms. (115 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (175 resets) in 322 ms. (123 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40001 steps (180 resets) in 266 ms. (149 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (182 resets) in 323 ms. (123 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (179 resets) in 316 ms. (126 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (177 resets) in 269 ms. (148 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (177 resets) in 205 ms. (194 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (176 resets) in 383 ms. (104 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (178 resets) in 230 ms. (173 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (180 resets) in 228 ms. (174 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (180 resets) in 228 ms. (174 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (174 resets) in 298 ms. (133 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (171 resets) in 347 ms. (114 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (176 resets) in 290 ms. (137 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (177 resets) in 392 ms. (101 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (185 resets) in 318 ms. (125 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (178 resets) in 326 ms. (122 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (187 resets) in 328 ms. (121 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (185 resets) in 256 ms. (155 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (186 resets) in 223 ms. (178 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (181 resets) in 304 ms. (131 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (180 resets) in 299 ms. (133 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40001 steps (181 resets) in 387 ms. (103 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (174 resets) in 336 ms. (118 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (179 resets) in 330 ms. (120 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (180 resets) in 336 ms. (118 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (180 resets) in 272 ms. (146 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (188 resets) in 304 ms. (131 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (197 resets) in 245 ms. (162 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (182 resets) in 310 ms. (128 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (179 resets) in 212 ms. (187 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (177 resets) in 398 ms. (100 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (180 resets) in 358 ms. (111 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (186 resets) in 248 ms. (160 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (191 resets) in 316 ms. (126 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (177 resets) in 336 ms. (118 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (182 resets) in 237 ms. (168 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (176 resets) in 272 ms. (146 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (187 resets) in 318 ms. (125 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (184 resets) in 383 ms. (104 steps per ms) remains 165/165 properties
Interrupted probabilistic random walk after 3554501 steps, run timeout after 96001 ms. (steps per millisecond=37 ) properties seen :0 out of 165
Probabilistic random walk after 3554501 steps, saw 2311765 distinct states, run finished after 96001 ms. (steps per millisecond=37 ) properties seen :0
// Phase 1: matrix 1144 rows 533 cols
[2025-05-29 19:32:38] [INFO ] Computed 73 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 8/173 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 68/241 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 1/242 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 94/336 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (OVERLAPS) 14/350 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 13 (OVERLAPS) 3/353 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 15 (OVERLAPS) 13/366 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/366 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 17 (OVERLAPS) 33/399 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 19 (OVERLAPS) 100/499 variables, 13/68 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/499 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 21 (OVERLAPS) 18/517 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/517 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 23 (OVERLAPS) 16/533 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/533 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 25 (OVERLAPS) 1144/1677 variables, 533/606 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1677 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 27 (OVERLAPS) 0/1677 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1677/1677 variables, and 606 constraints, problems are : Problem set: 0 solved, 165 unsolved in 27182 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 54/54 constraints, State Equation: 533/533 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 8/173 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2025-05-29 19:33:06] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2025-05-29 19:33:06] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 68/241 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2025-05-29 19:33:08] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 1/242 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (OVERLAPS) 94/336 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 13 (OVERLAPS) 14/350 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 15 (OVERLAPS) 3/353 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 17 (OVERLAPS) 13/366 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/366 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 19 (OVERLAPS) 33/399 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/399 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 21 (OVERLAPS) 100/499 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/499 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 23 (OVERLAPS) 18/517 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/517 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 25 (OVERLAPS) 16/533 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/533 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 27 (OVERLAPS) 1144/1677 variables, 533/609 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1677 variables, 165/774 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1677/1677 variables, and 774 constraints, problems are : Problem set: 0 solved, 165 unsolved in 135017 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 54/54 constraints, State Equation: 533/533 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 3/3 constraints]
After SMT, in 162246ms problems are : Problem set: 0 solved, 165 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 165 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1144/1144 transitions.
Applied a total of 0 rules in 12 ms. Remains 533 /533 variables (removed 0) and now considering 1144/1144 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 533/533 places, 1144/1144 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1144/1144 transitions.
Applied a total of 0 rules in 12 ms. Remains 533 /533 variables (removed 0) and now considering 1144/1144 (removed 0) transitions.
[2025-05-29 19:35:20] [INFO ] Invariant cache hit.
[2025-05-29 19:35:20] [INFO ] Implicit Places using invariants in 246 ms returned [255, 308, 329, 385]
[2025-05-29 19:35:20] [INFO ] Actually due to overlaps returned [329, 255, 385]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 252 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 530/533 places, 1144/1144 transitions.
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 5 rules applied. Total rules applied 5 place count 530 transition count 1139
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 525 transition count 1139
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 2 with 2 rules applied. Total rules applied 12 place count 524 transition count 1138
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 524 transition count 1137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 523 transition count 1137
Applied a total of 14 rules in 33 ms. Remains 523 /530 variables (removed 7) and now considering 1137/1144 (removed 7) transitions.
// Phase 1: matrix 1137 rows 523 cols
[2025-05-29 19:35:21] [INFO ] Computed 70 invariants in 14 ms
[2025-05-29 19:35:21] [INFO ] Implicit Places using invariants in 243 ms returned [306]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 246 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 522/533 places, 1137/1144 transitions.
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 2 place count 521 transition count 1136
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 521 transition count 1135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 520 transition count 1135
Applied a total of 4 rules in 34 ms. Remains 520 /522 variables (removed 2) and now considering 1135/1137 (removed 2) transitions.
// Phase 1: matrix 1135 rows 520 cols
[2025-05-29 19:35:21] [INFO ] Computed 69 invariants in 12 ms
[2025-05-29 19:35:21] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-05-29 19:35:21] [INFO ] Invariant cache hit.
[2025-05-29 19:35:22] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 520/533 places, 1135/1144 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1482 ms. Remains : 520/533 places, 1135/1144 transitions.
RANDOM walk for 4000000 steps (72781 resets) in 104146 ms. (38 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (182 resets) in 263 ms. (151 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (173 resets) in 236 ms. (168 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (172 resets) in 369 ms. (108 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (179 resets) in 222 ms. (179 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (176 resets) in 352 ms. (113 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (185 resets) in 329 ms. (121 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (196 resets) in 251 ms. (158 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (181 resets) in 211 ms. (188 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (181 resets) in 270 ms. (147 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (187 resets) in 238 ms. (167 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (177 resets) in 328 ms. (121 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (180 resets) in 356 ms. (112 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (189 resets) in 291 ms. (136 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (184 resets) in 318 ms. (125 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (163 resets) in 305 ms. (130 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (175 resets) in 267 ms. (149 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (181 resets) in 309 ms. (129 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (176 resets) in 264 ms. (150 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (183 resets) in 240 ms. (165 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (180 resets) in 326 ms. (122 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (178 resets) in 253 ms. (157 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (185 resets) in 314 ms. (126 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (182 resets) in 224 ms. (177 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (186 resets) in 387 ms. (103 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (178 resets) in 286 ms. (139 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (192 resets) in 247 ms. (161 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (178 resets) in 299 ms. (133 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (177 resets) in 227 ms. (175 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (183 resets) in 279 ms. (142 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (184 resets) in 262 ms. (152 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (170 resets) in 330 ms. (120 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (173 resets) in 369 ms. (108 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (177 resets) in 238 ms. (167 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (179 resets) in 227 ms. (175 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (185 resets) in 325 ms. (122 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (187 resets) in 328 ms. (121 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (183 resets) in 339 ms. (117 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (173 resets) in 321 ms. (124 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (169 resets) in 268 ms. (148 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (178 resets) in 261 ms. (152 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (181 resets) in 348 ms. (114 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (177 resets) in 358 ms. (111 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (172 resets) in 261 ms. (152 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40001 steps (180 resets) in 225 ms. (176 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (176 resets) in 299 ms. (133 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (190 resets) in 322 ms. (123 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (187 resets) in 218 ms. (182 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (183 resets) in 251 ms. (158 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (174 resets) in 273 ms. (146 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (176 resets) in 261 ms. (152 steps per ms) remains 165/165 properties
Interrupted probabilistic random walk after 4863376 steps, run timeout after 96001 ms. (steps per millisecond=50 ) properties seen :69 out of 165
Probabilistic random walk after 4863376 steps, saw 1990444 distinct states, run finished after 96001 ms. (steps per millisecond=50 ) properties seen :69
[2025-05-29 19:37:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 23/119 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 94/213 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 4/217 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 117/334 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 7/341 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (OVERLAPS) 13/354 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (OVERLAPS) 33/387 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/387 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 17 (OVERLAPS) 100/487 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/487 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 19 (OVERLAPS) 22/509 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/509 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 21 (OVERLAPS) 11/520 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/520 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 23 (OVERLAPS) 1135/1655 variables, 520/589 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1655 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 25 (OVERLAPS) 0/1655 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1655/1655 variables, and 589 constraints, problems are : Problem set: 0 solved, 96 unsolved in 12782 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 23/119 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2025-05-29 19:37:43] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:37:43] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 94/213 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 4/217 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 117/334 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 7/341 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/341 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (OVERLAPS) 13/354 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 33/387 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/387 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 18 (OVERLAPS) 100/487 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/487 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 20 (OVERLAPS) 22/509 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/509 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 22 (OVERLAPS) 11/520 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/520 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 24 (OVERLAPS) 1135/1655 variables, 520/591 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1655 variables, 96/687 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1655 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2025-05-29 19:39:42] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
At refinement iteration 27 (OVERLAPS) 0/1655 variables, 1/688 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1655 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1655/1655 variables, and 688 constraints, problems are : Problem set: 0 solved, 96 unsolved in 150015 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 520/520 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 3/3 constraints]
After SMT, in 162829ms problems are : Problem set: 0 solved, 96 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 96 out of 520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 1135/1135 transitions.
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 517 transition count 1128
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 509 transition count 1128
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 18 place count 509 transition count 1120
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 36 place count 499 transition count 1120
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 2 with 3 rules applied. Total rules applied 39 place count 498 transition count 1118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 496 transition count 1118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 41 place count 496 transition count 1117
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 495 transition count 1117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 45 place count 493 transition count 1110
Iterating global reduction 4 with 2 rules applied. Total rules applied 47 place count 493 transition count 1110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 48 place count 493 transition count 1109
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 5 with 4 rules applied. Total rules applied 52 place count 491 transition count 1107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 53 place count 490 transition count 1106
Iterating global reduction 5 with 1 rules applied. Total rules applied 54 place count 490 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 55 place count 490 transition count 1105
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 56 place count 490 transition count 1105
Applied a total of 56 rules in 57 ms. Remains 490 /520 variables (removed 30) and now considering 1105/1135 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 490/520 places, 1105/1135 transitions.
RANDOM walk for 4000000 steps (74242 resets) in 78906 ms. (50 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1906 resets) in 2242 ms. (178 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (1884 resets) in 2539 ms. (157 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (1949 resets) in 2527 ms. (158 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (1908 resets) in 2485 ms. (160 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400001 steps (1880 resets) in 2445 ms. (163 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1909 resets) in 2533 ms. (157 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (1872 resets) in 2134 ms. (187 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (1915 resets) in 1945 ms. (205 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1905 resets) in 1929 ms. (207 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1880 resets) in 2126 ms. (188 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1907 resets) in 2215 ms. (180 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (1924 resets) in 2343 ms. (170 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1892 resets) in 2081 ms. (192 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (1886 resets) in 2113 ms. (189 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1902 resets) in 2500 ms. (159 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (1948 resets) in 2061 ms. (193 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (1888 resets) in 2006 ms. (199 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (1903 resets) in 2158 ms. (185 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1901 resets) in 2173 ms. (183 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1894 resets) in 2469 ms. (161 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400001 steps (1905 resets) in 2267 ms. (176 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (1911 resets) in 2790 ms. (143 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1882 resets) in 2845 ms. (140 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (1917 resets) in 2768 ms. (144 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1889 resets) in 2129 ms. (187 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (1877 resets) in 2054 ms. (194 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (1899 resets) in 2198 ms. (181 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (1905 resets) in 2031 ms. (196 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1902 resets) in 2224 ms. (179 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (1898 resets) in 2104 ms. (190 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (1905 resets) in 2326 ms. (171 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (1876 resets) in 2176 ms. (183 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1922 resets) in 2158 ms. (185 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (1902 resets) in 1914 ms. (208 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (1883 resets) in 2134 ms. (187 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (1933 resets) in 2071 ms. (193 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (1922 resets) in 2105 ms. (189 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1900 resets) in 2270 ms. (176 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1910 resets) in 2390 ms. (167 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1906 resets) in 2197 ms. (181 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1865 resets) in 2122 ms. (188 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (1869 resets) in 1862 ms. (214 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (1905 resets) in 2051 ms. (194 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1910 resets) in 2768 ms. (144 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1912 resets) in 2843 ms. (140 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (1914 resets) in 1950 ms. (205 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1928 resets) in 2125 ms. (188 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400001 steps (1911 resets) in 2018 ms. (198 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (1934 resets) in 2249 ms. (177 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (1916 resets) in 1968 ms. (203 steps per ms) remains 96/96 properties
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-05a"
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 ASLink-PT-05a, 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 r014-tall-174853743600218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-05a.tgz
mv ASLink-PT-05a 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 '
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 ;