Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r016-oct2-177944372700193.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is ASLink-PT-02b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-oct2-177944372700193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 8.1K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 417K Mar 3 18:30 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 1779687274307

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2026-05-25 05:34:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-25 05:34:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 05:34:36] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2026-05-25 05:34:36] [INFO ] Transformed 1242 places.
[2026-05-25 05:34:36] [INFO ] Transformed 1621 transitions.
[2026-05-25 05:34:36] [INFO ] Found NUPN structural information;
[2026-05-25 05:34:36] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 308 ms.
Structural test allowed to assert that 146 places are NOT stable. Took 20 ms.
[2026-05-25 05:34:37] [INFO ] Flatten gal took : 288 ms
[2026-05-25 05:34:37] [INFO ] Flatten gal took : 152 ms
[2026-05-25 05:34:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9643123050208582170.gal : 65 ms
RANDOM walk for 40000 steps (157 resets) in 3503 ms. (11 steps per ms) remains 106/1096 properties
[2026-05-25 05:34:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4299561861762966759.prop : 1 ms
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 106/106 properties
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9643123050208582170.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4299561861762966759.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties

its-reach command run as :

BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
Loading property file /tmp/ReachabilityCardinality4299561861762966759.prop.
// Phase 1: matrix 1621 rows 1242 cols
[2026-05-25 05:34:37] [INFO ] Computed 121 invariants in 54 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
SDD proceeding with computation,106 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,106 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,106 properties remain. new max is 16
SDD size :8 after 14
SDD proceeding with computation,106 properties remain. new max is 32
SDD size :14 after 47
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
SDD proceeding with computation,106 properties remain. new max is 64
SDD size :47 after 194
At refinement iteration 3 (OVERLAPS) 72/178 variables, 7/115 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 72/187 constraints. Problems are: Problem set: 0 solved, 106 unsolved
SDD proceeding with computation,106 properties remain. new max is 128
SDD size :194 after 321
SDD proceeding with computation,106 properties remain. new max is 256
SDD size :321 after 964
SDD proceeding with computation,106 properties remain. new max is 512
SDD size :964 after 14485
SDD proceeding with computation,106 properties remain. new max is 1024
SDD size :14485 after 399017
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 227/405 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 227/434 constraints. Problems are: Problem set: 0 solved, 106 unsolved
SDD proceeding with computation,106 properties remain. new max is 2048
SDD size :399017 after 1.00084e+07
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 822/1227 variables, 87/521 constraints. Problems are: Problem set: 0 solved, 106 unsolved
SDD proceeding with computation,106 properties remain. new max is 4096
SDD size :1.00084e+07 after 6.03131e+09
At refinement iteration 10 (INCLUDED_ONLY) 0/1227 variables, 822/1343 constraints. Problems are: Problem set: 0 solved, 106 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 1227/2863 variables, and 1343 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5069 ms.
Refiners :[Domain max(s): 1227/1242 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 89/94 constraints, State Equation: 0/1242 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 72/178 variables, 7/115 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 72/187 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 227/405 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 227/434 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 106 unsolved
SMT process timed out in 10220ms, After SMT, problems are : Problem set: 0 solved, 106 unsolved
Fused 106 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 106 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1242 transition count 1369
Reduce places removed 252 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
SDD proceeding with computation,106 properties remain. new max is 8192
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 266 rules applied. Total rules applied 518 place count 990 transition count 1355
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 522 place count 986 transition count 1355
SDD size :6.03131e+09 after 7.20811e+13
Performed 261 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 261 Pre rules applied. Total rules applied 522 place count 986 transition count 1094
Deduced a syphon composed of 261 places in 2 ms
Ensure Unique test removed 21 places
Reduce places removed 282 places and 0 transitions.
Iterating global reduction 3 with 543 rules applied. Total rules applied 1065 place count 704 transition count 1094
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 16 rules applied. Total rules applied 1081 place count 703 transition count 1079
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 1096 place count 688 transition count 1079
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1096 place count 688 transition count 1072
Deduced a syphon composed of 7 places in 4 ms
Ensure Unique test removed 7 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 21 rules applied. Total rules applied 1117 place count 674 transition count 1072
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1117 place count 674 transition count 1065
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1131 place count 667 transition count 1065
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 1166 place count 632 transition count 1030
Iterating global reduction 5 with 35 rules applied. Total rules applied 1201 place count 632 transition count 1030
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1202 place count 632 transition count 1029
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1202 place count 632 transition count 1017
Deduced a syphon composed of 12 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 25 rules applied. Total rules applied 1227 place count 619 transition count 1017
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1227 place count 619 transition count 1016
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1230 place count 617 transition count 1016
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1233 place count 614 transition count 995
Iterating global reduction 6 with 3 rules applied. Total rules applied 1236 place count 614 transition count 995
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1236 place count 614 transition count 993
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1240 place count 612 transition count 993
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1241 place count 611 transition count 985
Iterating global reduction 6 with 1 rules applied. Total rules applied 1242 place count 611 transition count 985
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1243 place count 610 transition count 977
Iterating global reduction 6 with 1 rules applied. Total rules applied 1244 place count 610 transition count 977
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1245 place count 609 transition count 969
Iterating global reduction 6 with 1 rules applied. Total rules applied 1246 place count 609 transition count 969
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1247 place count 608 transition count 961
Iterating global reduction 6 with 1 rules applied. Total rules applied 1248 place count 608 transition count 961
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1249 place count 607 transition count 953
Iterating global reduction 6 with 1 rules applied. Total rules applied 1250 place count 607 transition count 953
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1251 place count 606 transition count 945
Iterating global reduction 6 with 1 rules applied. Total rules applied 1252 place count 606 transition count 945
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1253 place count 605 transition count 937
Iterating global reduction 6 with 1 rules applied. Total rules applied 1254 place count 605 transition count 937
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1255 place count 604 transition count 929
Iterating global reduction 6 with 1 rules applied. Total rules applied 1256 place count 604 transition count 929
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1257 place count 603 transition count 921
Iterating global reduction 6 with 1 rules applied. Total rules applied 1258 place count 603 transition count 921
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1259 place count 602 transition count 913
Iterating global reduction 6 with 1 rules applied. Total rules applied 1260 place count 602 transition count 913
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1261 place count 601 transition count 905
Iterating global reduction 6 with 1 rules applied. Total rules applied 1262 place count 601 transition count 905
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1263 place count 600 transition count 897
Iterating global reduction 6 with 1 rules applied. Total rules applied 1264 place count 600 transition count 897
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1265 place count 599 transition count 889
Iterating global reduction 6 with 1 rules applied. Total rules applied 1266 place count 599 transition count 889
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1267 place count 598 transition count 881
Iterating global reduction 6 with 1 rules applied. Total rules applied 1268 place count 598 transition count 881
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1269 place count 597 transition count 873
Iterating global reduction 6 with 1 rules applied. Total rules applied 1270 place count 597 transition count 873
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1271 place count 596 transition count 865
Iterating global reduction 6 with 1 rules applied. Total rules applied 1272 place count 596 transition count 865
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 6 with 118 rules applied. Total rules applied 1390 place count 537 transition count 806
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1391 place count 536 transition count 805
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 1393 place count 535 transition count 805
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1394 place count 534 transition count 804
Iterating global reduction 6 with 1 rules applied. Total rules applied 1395 place count 534 transition count 804
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 1397 place count 534 transition count 802
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1398 place count 533 transition count 802
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1400 place count 532 transition count 811
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1403 place count 532 transition count 808
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1406 place count 529 transition count 808
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1407 place count 528 transition count 807
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 4 rules applied. Total rules applied 1411 place count 525 transition count 806
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1412 place count 524 transition count 806
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 4 Pre rules applied. Total rules applied 1412 place count 524 transition count 802
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 1420 place count 520 transition count 802
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 11 with 2 rules applied. Total rules applied 1422 place count 518 transition count 802
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1430 place count 514 transition count 798
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1432 place count 512 transition count 796
Iterating global reduction 12 with 2 rules applied. Total rules applied 1434 place count 512 transition count 796
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1436 place count 512 transition count 794
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1438 place count 510 transition count 794
Applied a total of 1438 rules in 773 ms. Remains 510 /1242 variables (removed 732) and now considering 794/1621 (removed 827) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 787 ms. Remains : 510/1242 places, 794/1621 transitions.
SDD proceeding with computation,106 properties remain. new max is 16384
SDD size :7.20811e+13 after 7.24711e+13
SDD proceeding with computation,106 properties remain. new max is 32768
SDD size :7.24711e+13 after 7.27837e+13
RANDOM walk for 4000000 steps (64770 resets) in 39252 ms. (101 steps per ms) remains 66/106 properties
BEST_FIRST walk for 400002 steps (2225 resets) in 1526 ms. (261 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2233 resets) in 1481 ms. (269 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2180 resets) in 1629 ms. (245 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2227 resets) in 1748 ms. (228 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2206 resets) in 1500 ms. (266 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2214 resets) in 1497 ms. (267 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2253 resets) in 1424 ms. (280 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2252 resets) in 1548 ms. (258 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2180 resets) in 1614 ms. (247 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2204 resets) in 1603 ms. (249 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2206 resets) in 1480 ms. (270 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2212 resets) in 1664 ms. (240 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2228 resets) in 1867 ms. (214 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2173 resets) in 1588 ms. (251 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2270 resets) in 1704 ms. (234 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2160 resets) in 1644 ms. (243 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2231 resets) in 1476 ms. (270 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2221 resets) in 1725 ms. (231 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2239 resets) in 1480 ms. (270 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2205 resets) in 1571 ms. (254 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2244 resets) in 1553 ms. (257 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2251 resets) in 1618 ms. (247 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2218 resets) in 1513 ms. (264 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2226 resets) in 1694 ms. (235 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2223 resets) in 1619 ms. (246 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2244 resets) in 1651 ms. (242 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2220 resets) in 1771 ms. (225 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2214 resets) in 1633 ms. (244 steps per ms) remains 66/66 properties
SDD proceeding with computation,106 properties remain. new max is 65536
SDD size :7.27837e+13 after 8.14381e+13
BEST_FIRST walk for 400003 steps (2209 resets) in 1819 ms. (219 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2200 resets) in 1516 ms. (263 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2205 resets) in 1711 ms. (233 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2190 resets) in 1584 ms. (252 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2255 resets) in 1758 ms. (227 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2228 resets) in 1770 ms. (225 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2247 resets) in 1694 ms. (235 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2185 resets) in 1389 ms. (287 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2177 resets) in 1863 ms. (214 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2188 resets) in 1553 ms. (257 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2192 resets) in 1802 ms. (221 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2219 resets) in 1529 ms. (261 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2284 resets) in 1766 ms. (226 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2209 resets) in 1775 ms. (225 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2196 resets) in 1586 ms. (252 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2227 resets) in 1446 ms. (276 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2221 resets) in 1615 ms. (247 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2244 resets) in 1566 ms. (255 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2192 resets) in 1369 ms. (291 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2200 resets) in 1677 ms. (238 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2214 resets) in 1566 ms. (255 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2207 resets) in 1599 ms. (250 steps per ms) remains 66/66 properties
// Phase 1: matrix 794 rows 510 cols
[2026-05-25 05:35:27] [INFO ] Computed 84 invariants in 11 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 23/89 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 2/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 113/204 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 26/230 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 2/232 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 105/337 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/337 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 14 (OVERLAPS) 69/406 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/406 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 16 (OVERLAPS) 13/419 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 18 (OVERLAPS) 91/510 variables, 28/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/510 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 20 (OVERLAPS) 794/1304 variables, 510/594 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1304 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 22 (OVERLAPS) 0/1304 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1304/1304 variables, and 594 constraints, problems are : Problem set: 0 solved, 66 unsolved in 9249 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 23/89 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 2/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 113/204 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:35:38] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 26/230 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (OVERLAPS) 2/232 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:35:41] [INFO ] Deduced a trap composed of 9 places in 481 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 14 (OVERLAPS) 105/337 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 66 unsolved
SDD proceeding with computation,106 properties remain. new max is 131072
SDD size :8.14381e+13 after 9.19489e+13
At refinement iteration 15 (INCLUDED_ONLY) 0/337 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 16 (OVERLAPS) 69/406 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/406 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 18 (OVERLAPS) 13/419 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/419 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 20 (OVERLAPS) 91/510 variables, 28/86 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/510 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 22 (OVERLAPS) 794/1304 variables, 510/596 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1304 variables, 66/662 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:35:50] [INFO ] Deduced a trap composed of 175 places in 438 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:35:51] [INFO ] Deduced a trap composed of 177 places in 288 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:35:52] [INFO ] Deduced a trap composed of 180 places in 278 ms of which 88 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1304 variables, 3/665 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1304 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 26 (OVERLAPS) 0/1304 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1304/1304 variables, and 665 constraints, problems are : Problem set: 0 solved, 66 unsolved in 34061 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43356ms problems are : Problem set: 0 solved, 66 unsolved
Fused 66 Parikh solutions to 59 different solutions.
Parikh walk visited 0 properties in 12952 ms.
Support contains 66 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 794/794 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 510 transition count 778
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 494 transition count 778
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 32 place count 494 transition count 772
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 44 place count 488 transition count 772
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 52 place count 484 transition count 768
Applied a total of 52 rules in 36 ms. Remains 484 /510 variables (removed 26) and now considering 768/794 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 484/510 places, 768/794 transitions.
RANDOM walk for 4000000 steps (64911 resets) in 35440 ms. (112 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2230 resets) in 1429 ms. (279 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2207 resets) in 1492 ms. (267 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2217 resets) in 1940 ms. (206 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2218 resets) in 1585 ms. (252 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2229 resets) in 1598 ms. (250 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2256 resets) in 1428 ms. (279 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2220 resets) in 1551 ms. (257 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2266 resets) in 1406 ms. (284 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2266 resets) in 1703 ms. (234 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2212 resets) in 1497 ms. (267 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2231 resets) in 1613 ms. (247 steps per ms) remains 66/66 properties
SDD proceeding with computation,106 properties remain. new max is 262144
BEST_FIRST walk for 400002 steps (2259 resets) in 1467 ms. (272 steps per ms) remains 66/66 properties
SDD size :9.19489e+13 after 1.30594e+14
BEST_FIRST walk for 400004 steps (2255 resets) in 1382 ms. (289 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2230 resets) in 1641 ms. (243 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2224 resets) in 2011 ms. (198 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2231 resets) in 1514 ms. (264 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2252 resets) in 1345 ms. (297 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2254 resets) in 1375 ms. (290 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2195 resets) in 1560 ms. (256 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2199 resets) in 1419 ms. (281 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2197 resets) in 1564 ms. (255 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2247 resets) in 1451 ms. (275 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2211 resets) in 1730 ms. (231 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2188 resets) in 1546 ms. (258 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2229 resets) in 1723 ms. (232 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2190 resets) in 1512 ms. (264 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2173 resets) in 1776 ms. (225 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2215 resets) in 1457 ms. (274 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2208 resets) in 1692 ms. (236 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2207 resets) in 1480 ms. (270 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2240 resets) in 1509 ms. (264 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2230 resets) in 1476 ms. (270 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2228 resets) in 1662 ms. (240 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2213 resets) in 1384 ms. (288 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2234 resets) in 1660 ms. (240 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2208 resets) in 1744 ms. (229 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2254 resets) in 1426 ms. (280 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2186 resets) in 1738 ms. (230 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2249 resets) in 1441 ms. (277 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2241 resets) in 1616 ms. (247 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2244 resets) in 1618 ms. (247 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2243 resets) in 1524 ms. (262 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2196 resets) in 1757 ms. (227 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2210 resets) in 1659 ms. (240 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2216 resets) in 1739 ms. (229 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2234 resets) in 1497 ms. (267 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2217 resets) in 1684 ms. (237 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2266 resets) in 1532 ms. (260 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2229 resets) in 1585 ms. (252 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2219 resets) in 1500 ms. (266 steps per ms) remains 66/66 properties
SDD proceeding with computation,106 properties remain. new max is 524288
SDD size :1.30594e+14 after 3.92624e+14
Interrupted probabilistic random walk after 13920272 steps, run timeout after 108001 ms. (steps per millisecond=128 ) properties seen :64 out of 66
Probabilistic random walk after 13920272 steps, saw 3109085 distinct states, run finished after 108013 ms. (steps per millisecond=128 ) properties seen :64
// Phase 1: matrix 768 rows 484 cols
[2026-05-25 05:38:49] [INFO ] Computed 84 invariants in 7 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 43/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 33/85 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/86 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 113/199 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 45/244 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/246 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 113/359 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/359 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 53/412 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/414 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/414 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 68/482 variables, 23/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/483 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/483 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/484 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/484 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 768/1252 variables, 484/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1252 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/1252 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1252/1252 variables, and 568 constraints, problems are : Problem set: 0 solved, 2 unsolved in 593 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 484/484 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 43/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 33/85 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/86 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 113/199 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 45/244 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/246 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 113/359 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/359 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 53/412 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/414 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/414 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 68/482 variables, 23/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/483 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/483 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/484 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/484 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 768/1252 variables, 484/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1252 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1252 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/1252 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1252/1252 variables, and 570 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1549 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 484/484 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2159ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 5789 ms.
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 484 transition count 754
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 470 transition count 754
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 28 place count 470 transition count 738
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 62 place count 452 transition count 738
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 64 place count 451 transition count 737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 450 transition count 737
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 65 place count 450 transition count 736
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 68 place count 448 transition count 736
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 68 place count 448 transition count 735
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 70 place count 447 transition count 735
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 87 place count 438 transition count 727
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 87 place count 438 transition count 725
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 92 place count 435 transition count 725
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 93 place count 434 transition count 725
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 93 place count 434 transition count 724
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 95 place count 433 transition count 724
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 99 place count 431 transition count 722
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 100 place count 431 transition count 721
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 101 place count 430 transition count 721
Applied a total of 101 rules in 84 ms. Remains 430 /484 variables (removed 54) and now considering 721/768 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 430/484 places, 721/768 transitions.
RANDOM walk for 4000000 steps (64235 resets) in 11858 ms. (337 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000002 steps (22046 resets) in 5388 ms. (742 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (22144 resets) in 5529 ms. (723 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 3400053 steps, run timeout after 18001 ms. (steps per millisecond=188 ) properties seen :0 out of 2
Probabilistic random walk after 3400053 steps, saw 937769 distinct states, run finished after 18001 ms. (steps per millisecond=188 ) properties seen :0
// Phase 1: matrix 721 rows 430 cols
[2026-05-25 05:39:21] [INFO ] Computed 77 invariants in 6 ms
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/60 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/62 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 87/149 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 41/190 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/192 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 123/315 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 46/361 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 67/428 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/429 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/429 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/430 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 721/1151 variables, 430/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1151 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1151 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1151/1151 variables, and 507 constraints, problems are : Problem set: 0 solved, 2 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 430/430 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/60 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/62 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 87/149 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 41/190 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/192 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 123/315 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 46/361 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 67/428 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/429 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/429 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/430 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 721/1151 variables, 430/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1151 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1151 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1151 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1151/1151 variables, and 509 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1173 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 430/430 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1899ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 468 ms.
Support contains 2 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 721/721 transitions.
Applied a total of 0 rules in 11 ms. Remains 430 /430 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 430/430 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 721/721 transitions.
Applied a total of 0 rules in 12 ms. Remains 430 /430 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2026-05-25 05:39:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:39:24] [INFO ] Implicit Places using invariants in 365 ms returned [1, 18, 19, 32, 49, 67, 136, 140, 149, 150, 152, 169, 187, 256, 260, 261, 264, 275, 276, 277, 295, 297, 301, 319, 320, 321, 322, 334, 340, 346, 352, 358, 364, 370, 376, 382, 388, 394]
[2026-05-25 05:39:24] [INFO ] Actually due to overlaps returned [295, 277, 49, 169, 301, 32, 152, 149, 275, 319, 150, 276, 297, 320, 1, 19, 260, 261, 67, 187, 321, 364, 382, 394, 18, 264, 322, 334, 340, 346, 352, 358, 370, 376, 388]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 378 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 395/430 places, 721/721 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 393 transition count 658
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 330 transition count 656
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 130 place count 330 transition count 641
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 161 place count 314 transition count 641
Discarding 4 places :
Implicit places reduction removed 4 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 12 rules applied. Total rules applied 173 place count 310 transition count 633
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 181 place count 302 transition count 633
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 196 place count 287 transition count 618
Iterating global reduction 4 with 15 rules applied. Total rules applied 211 place count 287 transition count 618
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 214 place count 287 transition count 615
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 214 place count 287 transition count 614
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 216 place count 286 transition count 614
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 219 place count 283 transition count 608
Iterating global reduction 5 with 3 rules applied. Total rules applied 222 place count 283 transition count 608
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 223 place count 282 transition count 607
Iterating global reduction 5 with 1 rules applied. Total rules applied 224 place count 282 transition count 607
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 225 place count 281 transition count 605
Iterating global reduction 5 with 1 rules applied. Total rules applied 226 place count 281 transition count 605
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 268 place count 260 transition count 584
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 270 place count 258 transition count 582
Iterating global reduction 5 with 2 rules applied. Total rules applied 272 place count 258 transition count 582
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 274 place count 258 transition count 580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 278 place count 256 transition count 581
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 282 place count 256 transition count 577
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 287 place count 251 transition count 577
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 293 place count 251 transition count 577
Applied a total of 293 rules in 222 ms. Remains 251 /395 variables (removed 144) and now considering 577/721 (removed 144) transitions.
// Phase 1: matrix 577 rows 251 cols
[2026-05-25 05:39:24] [INFO ] Computed 34 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:39:25] [INFO ] Implicit Places using invariants in 388 ms returned [74, 91, 97, 100, 102, 103, 106, 107, 159, 176, 182, 185, 187]
[2026-05-25 05:39:25] [INFO ] Actually due to overlaps returned [106, 107, 91, 97, 102, 176, 182, 187, 74, 103, 159]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 403 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 240/430 places, 577/721 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 232 transition count 569
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 232 transition count 569
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 230 transition count 567
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 230 transition count 567
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 28 place count 226 transition count 563
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 226 transition count 557
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 220 transition count 557
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 220 transition count 555
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 218 transition count 555
Applied a total of 44 rules in 36 ms. Remains 218 /240 variables (removed 22) and now considering 555/577 (removed 22) transitions.
// Phase 1: matrix 555 rows 218 cols
[2026-05-25 05:39:25] [INFO ] Computed 23 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:39:25] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-25 05:39:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:39:25] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 218/430 places, 555/721 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1922 ms. Remains : 218/430 places, 555/721 transitions.
RANDOM walk for 4000000 steps (100910 resets) in 11147 ms. (358 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (38671 resets) in 4812 ms. (831 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (38741 resets) in 4673 ms. (855 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 38772 steps, run visited all 2 properties in 271 ms. (steps per millisecond=143 )
Probabilistic random walk after 38772 steps, saw 20269 distinct states, run finished after 275 ms. (steps per millisecond=140 ) properties seen :2
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 1097 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 296291 ms.

BK_STOP 1779687572445

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ sed s/.jar//
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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-02b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is ASLink-PT-02b, 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 r016-oct2-177944372700193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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