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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 544K 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 1748545037113

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-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:57:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-29 18:57:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:57:18] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2025-05-29 18:57:18] [INFO ] Transformed 1638 places.
[2025-05-29 18:57:18] [INFO ] Transformed 2094 transitions.
[2025-05-29 18:57:18] [INFO ] Found NUPN structural information;
[2025-05-29 18:57:18] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 271 ms.
Structural test allowed to assert that 196 places are NOT stable. Took 15 ms.
RANDOM walk for 40000 steps (119 resets) in 3054 ms. (13 steps per ms) remains 325/1442 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 325/325 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 325/325 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 325/325 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
// Phase 1: matrix 2094 rows 1638 cols
[2025-05-29 18:57:20] [INFO ] Computed 160 invariants in 126 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 325/325 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 8/333 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 325/3732 variables, and 333 constraints, problems are : Problem set: 0 solved, 325 unsolved in 5064 ms.
Refiners :[Domain max(s): 325/1638 constraints, Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 8/123 constraints, State Equation: 0/1638 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 325/325 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 8/333 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 134/459 variables, 18/351 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 134/485 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 2/487 constraints. Problems are: Problem set: 0 solved, 325 unsolved
(s257 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s88 1)
(s89 1)
(s90 1)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 1)
(s185 1)
(s186 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 0)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 0)
(s215 0)
(s216 1)
(s217 1)
(s218 1)
(s219 0)
(s220 1)
(s234 1)
(s235 0)
(s236 0)
(s237 0)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 0)
(s257 0timeout
)
(s258 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/3732 variables, and 487 constraints, problems are : Problem set: 0 solved, 325 unsolved in 5016 ms.
Refiners :[Domain max(s): 459/1638 constraints, Positive P Invariants (semi-flows): 18/37 constraints, Generalized P Invariants (flows): 10/123 constraints, State Equation: 0/1638 constraints, PredecessorRefiner: 0/325 constraints, Known Traps: 0/0 constraints]
After SMT, in 10395ms problems are : Problem set: 0 solved, 325 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 325 out of 1638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 301 transitions
Trivial Post-agglo rules discarded 301 transitions
Performed 301 trivial Post agglomeration. Transition count delta: 301
Iterating post reduction 0 with 301 rules applied. Total rules applied 301 place count 1638 transition count 1793
Reduce places removed 301 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 1 with 319 rules applied. Total rules applied 620 place count 1337 transition count 1775
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 625 place count 1332 transition count 1775
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 300 Pre rules applied. Total rules applied 625 place count 1332 transition count 1475
Deduced a syphon composed of 300 places in 2 ms
Ensure Unique test removed 25 places
Reduce places removed 325 places and 0 transitions.
Iterating global reduction 3 with 625 rules applied. Total rules applied 1250 place count 1007 transition count 1475
Discarding 2 places :
Implicit places reduction removed 2 places
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 3 with 18 rules applied. Total rules applied 1268 place count 1005 transition count 1459
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1284 place count 989 transition count 1459
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 1284 place count 989 transition count 1449
Deduced a syphon composed of 10 places in 4 ms
Ensure Unique test removed 10 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 1314 place count 969 transition count 1449
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 1314 place count 969 transition count 1439
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1334 place count 959 transition count 1439
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 1371 place count 922 transition count 1402
Iterating global reduction 5 with 37 rules applied. Total rules applied 1408 place count 922 transition count 1402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1409 place count 922 transition count 1401
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1409 place count 922 transition count 1390
Deduced a syphon composed of 11 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 23 rules applied. Total rules applied 1432 place count 910 transition count 1390
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1432 place count 910 transition count 1389
Deduced a syphon composed of 1 places in 6 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 1435 place count 908 transition count 1389
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1438 place count 905 transition count 1368
Iterating global reduction 6 with 3 rules applied. Total rules applied 1441 place count 905 transition count 1368
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1441 place count 905 transition count 1367
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1443 place count 904 transition count 1367
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1444 place count 903 transition count 1359
Iterating global reduction 6 with 1 rules applied. Total rules applied 1445 place count 903 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1446 place count 902 transition count 1351
Iterating global reduction 6 with 1 rules applied. Total rules applied 1447 place count 902 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1448 place count 901 transition count 1343
Iterating global reduction 6 with 1 rules applied. Total rules applied 1449 place count 901 transition count 1343
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1450 place count 900 transition count 1335
Iterating global reduction 6 with 1 rules applied. Total rules applied 1451 place count 900 transition count 1335
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1452 place count 899 transition count 1327
Iterating global reduction 6 with 1 rules applied. Total rules applied 1453 place count 899 transition count 1327
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1454 place count 898 transition count 1319
Iterating global reduction 6 with 1 rules applied. Total rules applied 1455 place count 898 transition count 1319
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1456 place count 897 transition count 1311
Iterating global reduction 6 with 1 rules applied. Total rules applied 1457 place count 897 transition count 1311
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1458 place count 896 transition count 1303
Iterating global reduction 6 with 1 rules applied. Total rules applied 1459 place count 896 transition count 1303
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1460 place count 895 transition count 1295
Iterating global reduction 6 with 1 rules applied. Total rules applied 1461 place count 895 transition count 1295
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1462 place count 894 transition count 1287
Iterating global reduction 6 with 1 rules applied. Total rules applied 1463 place count 894 transition count 1287
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1464 place count 893 transition count 1279
Iterating global reduction 6 with 1 rules applied. Total rules applied 1465 place count 893 transition count 1279
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1466 place count 892 transition count 1271
Iterating global reduction 6 with 1 rules applied. Total rules applied 1467 place count 892 transition count 1271
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1468 place count 891 transition count 1263
Iterating global reduction 6 with 1 rules applied. Total rules applied 1469 place count 891 transition count 1263
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1470 place count 890 transition count 1255
Iterating global reduction 6 with 1 rules applied. Total rules applied 1471 place count 890 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1472 place count 889 transition count 1247
Iterating global reduction 6 with 1 rules applied. Total rules applied 1473 place count 889 transition count 1247
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1474 place count 888 transition count 1239
Iterating global reduction 6 with 1 rules applied. Total rules applied 1475 place count 888 transition count 1239
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 6 with 156 rules applied. Total rules applied 1631 place count 810 transition count 1161
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 6 with 2 rules applied. Total rules applied 1633 place count 809 transition count 1170
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 1638 place count 809 transition count 1165
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1643 place count 804 transition count 1165
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1644 place count 804 transition count 1164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1645 place count 803 transition count 1164
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1646 place count 802 transition count 1163
Reduce places removed 2 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 8 with 3 rules applied. Total rules applied 1649 place count 800 transition count 1162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1650 place count 799 transition count 1162
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 1650 place count 799 transition count 1159
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 1656 place count 796 transition count 1159
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 10 with 1 rules applied. Total rules applied 1657 place count 795 transition count 1159
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 11 with 4 rules applied. Total rules applied 1661 place count 793 transition count 1157
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1662 place count 792 transition count 1156
Iterating global reduction 11 with 1 rules applied. Total rules applied 1663 place count 792 transition count 1156
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1664 place count 792 transition count 1155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1665 place count 791 transition count 1155
Applied a total of 1665 rules in 873 ms. Remains 791 /1638 variables (removed 847) and now considering 1155/2094 (removed 939) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 884 ms. Remains : 791/1638 places, 1155/2094 transitions.
RANDOM walk for 4000000 steps (57648 resets) in 96807 ms. (41 steps per ms) remains 237/325 properties
BEST_FIRST walk for 40003 steps (150 resets) in 266 ms. (149 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (157 resets) in 325 ms. (122 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (159 resets) in 223 ms. (178 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (160 resets) in 323 ms. (123 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (157 resets) in 222 ms. (179 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (156 resets) in 284 ms. (140 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (155 resets) in 191 ms. (208 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (151 resets) in 192 ms. (207 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (154 resets) in 180 ms. (221 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (166 resets) in 183 ms. (217 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (154 resets) in 189 ms. (210 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (153 resets) in 190 ms. (209 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (162 resets) in 185 ms. (215 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (152 resets) in 185 ms. (215 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (154 resets) in 341 ms. (116 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (154 resets) in 316 ms. (126 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (145 resets) in 253 ms. (157 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (151 resets) in 364 ms. (109 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (144 resets) in 336 ms. (118 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (166 resets) in 325 ms. (122 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (148 resets) in 330 ms. (120 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (154 resets) in 299 ms. (133 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (153 resets) in 289 ms. (137 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (160 resets) in 277 ms. (143 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (160 resets) in 245 ms. (162 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (153 resets) in 298 ms. (133 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (152 resets) in 314 ms. (126 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (160 resets) in 289 ms. (137 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (153 resets) in 230 ms. (173 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (164 resets) in 301 ms. (132 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (158 resets) in 301 ms. (132 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40001 steps (171 resets) in 227 ms. (175 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (165 resets) in 304 ms. (131 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (154 resets) in 230 ms. (173 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40001 steps (156 resets) in 327 ms. (121 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40000 steps (147 resets) in 282 ms. (141 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (158 resets) in 265 ms. (150 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (158 resets) in 275 ms. (144 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (164 resets) in 300 ms. (132 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (161 resets) in 320 ms. (124 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (144 resets) in 295 ms. (135 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40001 steps (161 resets) in 300 ms. (132 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (153 resets) in 309 ms. (129 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (147 resets) in 311 ms. (128 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (158 resets) in 323 ms. (123 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (154 resets) in 285 ms. (139 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (149 resets) in 328 ms. (121 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (155 resets) in 296 ms. (134 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (161 resets) in 295 ms. (135 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (159 resets) in 309 ms. (129 steps per ms) remains 237/237 properties
// Phase 1: matrix 1155 rows 791 cols
[2025-05-29 18:58:05] [INFO ] Computed 118 invariants in 46 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 19/256 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (OVERLAPS) 1/257 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 154/411 variables, 29/48 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (OVERLAPS) 34/445 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 11 (OVERLAPS) 2/447 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 13 (OVERLAPS) 167/614 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/614 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 15 (OVERLAPS) 71/685 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/685 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 17 (OVERLAPS) 10/695 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/695 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 19 (OVERLAPS) 94/789 variables, 27/116 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/789 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 21 (OVERLAPS) 1/790 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/790 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 23 (OVERLAPS) 1/791 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/791 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 25 (OVERLAPS) 1155/1946 variables, 791/909 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1946 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 (/ 5.0 158.0))
(t1 0.0)
(t2 0.0)
(t3 (/ 3.0 158.0))
(t4 (/ 5.0 158.0))
(t5 0.0)
(t6 (/ 1.0 79.0))
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 1.0)
(t13 0.0)
(t14 (/ 219.0 158.0))
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 1.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 4.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 (/ 2.0 79.0))
(t37 (/ 1.0 79.0))
(t38 0.0)
(t39 0.0)
(t40 (/ 7.0 158.0))
(t41 (/ 7.0 158.0))
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 0.0)
(t46 (/ 7.0 158.0))
(t47 (/ 3.0 79.0))
(t48 (/ 5.0 158.0))
(t49 (/ 3.0 158.0))
(t50 (/ 2.0 79.0))
(t51 (/ 1.0 158.0))
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 0.0)
(t56 0.0)
(t57 (/ 315.0 158.0))
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 (/ 151.0 158.0))
(t67 (/ 10.0 79.0))
(t68 (/ 10.0 79.0))
(t69 (/ 10.0 79.0))
(t70 (/ 19.0 158.0))
(t71 (/ 9.0 79.0))
(t72 (/ 15.0 158.0))
(t73 (/ 7.0 79.0))
(t74 (/ 13.0 158.0))
(t75 (/ 5.0 79.0))
(t76 (/ 4.0 79.0))
(t77 (/ 9.0 158.0))
(t78 (/ 7.0 158.0))
(t79 (/ 7.0 158.0))
(t80 (/ 2.0 79.0))
(t81 (/ 1.0 158.0))
(t82 0.0)
(t83 (/ 24.0 79.0))
(t84 (/ 23.0 79.0))
(t85 (/ 3.0 79.0))
(t86 0.0)
(t87 (/ 1.0 79.0))
(t88 0.0)
(t89 (/ 3.0 158.0))
(t90 (/ 1.0 158.0))
(t91 (/ 3.0 79.0))
(t92 (/ 3.0 79.0))
(t93 0.0)
(t94 (/ 7.0 158.0))
(t95 (/ 3.0 79.0))
(t96 (/ 5.0 158.0))
(t97 (/ 1.0 79.0))
(t98 0.0)
(t99 (/ 24.0 79.0))
(t100 (/ 17.0 79.0))
(t101 (/ 16.0 79.0))
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 (/ 6.0 79.0))
(t107 (/ 11.0 158.0))
(t108 (/ 5.0 158.0))
(t109 (/ 3.0 158.0))
(t110 (/ 1.0 158.0))
(t111 0.0)
(t112 (/ 5.0 158.0))
(t113 (/ 2.0 79.0))
(t114 (/ 3.0 158.0))
(t115 (/ 1.0 158.0))
(t116 (/ 1.0 79.0))
(t117 0.0)
(t118 0.0)
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 0.0)
(t124 0.0)
(t125 0.0)
(t126 0.0)
(t127 0.0)
(t128 0.0)
(t129 0.0)
(t130 0.0)
(t131 (/ 54.0 79.0))
(t132 (/ 14.0 79.0))
(t133 (/ 27.0 158.0))
(t134 (/ 12.0 79.0))
(t135 (/ 23.0 158.0))
(t136 (/ 11.0 79.0))
(t137 (/ 19.0 158.0))
(t138 (/ 9.0 79.0))
(t139 (/ 15.0 158.0))
(t140 (/ 7.0 79.0))
(t141 (/ 13.0 158.0))
(t142 (/ 5.0 79.0))
(t143 (/ 7.0 158.0))
(t144 (/ 9.0 158.0))
(t145 (/ 7.0 158.0))
(t146 (/ 7.0 158.0))
(t147 (/ 2.0 79.0))
(t148 (/ 1.0 158.0))
(t149 0.0)
(t150 (/ 17.0 79.0))
(t151 (/ 33.0 158.0))
(t152 (/ 16.0 79.0))
(t153 (/ 31.0 158.0))
(t154 (/ 15.0 79.0))
(t155 (/ 29.0 158.0))
(t156 (/ 14.0 79.0))
(t157 (/ 2.0 79.0))
(t158 (/ 1.0 79.0))
(t159 0.0)
(t160 (/ 1.0 79.0))
(t161 0.0)
(t162 (/ 4.0 79.0))
(t163 (/ 4.0 79.0))
(t164 (/ 4.0 79.0))
(t165 (/ 4.0 79.0))
(t166 0.0)
(t167 0.0)
(t168 (/ 4.0 79.0))
(t169 (/ 1.0 158.0))
(t170 0.0)
(t171 (/ 4.0 79.0))
(t172 (/ 4.0 79.0))
(t173 0.0)
(t174 0.0)
(t175 0.0)
(t176 (/ 4.0 79.0))
(t177 0.0)
(t178 (/ 4.0 79.0))
(t179 0.0)
(t180 (/ 141.0 553.0))
(t181 (/ 275.0 1106.0))
(t182 (/ 261.0 1106.0))
(t183 (/ 127.0 553.0))
(t184 (/ 120.0 553.0))
(t185 (/ 233.0 1106.0))
(t186 (/ 219.0 1106.0))
(t187 (/ 106.0 553.0))
(t188 (/ 99.0 553.0))
(t189 (/ 191.0 1106.0))
(t190 (/ 177.0 1106.0))
(t191 (/ 85.0 553.0))
(t192 (/ 149.0 1106.0))
(t193 (/ 71.0 553.0))
(t194 (/ 9.0 79.0))
(t195 (/ 17.0 158.0))
(t196 (/ 8.0 79.0))
(t197 (/ 15.0 158.0))
(t198 0.0)
(t199 0.0)
(t200 0.0)
(t201 0.0)
(t202 0.0)
(t203 (/ 9.0 158.0))
(t204 (/ 3.0 79.0))
(t205 (/ 3.0 79.0))
(t206 (/ 4.0 79.0))
(t207 (/ 3.0 79.0))
(t208 (/ 4.0 79.0))
(t209 (/ 4.0 79.0))
(t210 (/ 3.0 79.0))
(t211 (/ 4.0 79.0))
(t212 (/ 3.0 79.0))
(t213 (/ 7.0 158.0))
(t214 (/ 9.0 158.0))
(t215 0.0)
(t216 0.0)
(t217 0.0)
(t218 0.0)
(t219 0.0)
(t220 0.0)
(t221 0.0)
(t222 0.0)
(t223 0.0)
(t224 0.0)
(t225 (/ 219.0 158.0))
(t226 0.0)
(t227 0.0)
(t228 0.0)
(t229 0.0)
(t230 0.0)
(t231 0.0)
(t232 0.0)
(t233 0.0)
(t234 0.0)
(t235 (/ 219.0 158.0))
(t236 0.0)
(t237 0.0)
(t238 (/ 219.0 158.0))
(t239 0.0)
(t240 0.0)
(t241 0.0)
(t242 0.0)
(t243 0.0)
(t244 0.0)
(t245 0.0)
(t246 0.0)
(t247 (/ 219.0 158.0))
(t248 0.0)
(t249 0.0)
(t250 0.0)
(t251 (/ 219.0 158.0))
(t252 0.0)
(t253 0.0)
(t254 0.0)
(t255 0.0)
(t256 0.0)
(t257 0.0)
(t258 0.0)
(t259 0.0)
(t260 0.0)
(t261 0.0)
(t262 (/ 219.0 158.0))
(t263 0.0)
(t264 0.0)
(t265 0.0)
(t266 0.0)
(t267 0.0)
(t268 0.0)
(t269 0.0)
(t270 0.0)
(t271 (/ 219.0 158.0))
(t272 0.0)
(t273 0.0)
(t274 0.0)
(t275 0.0)
(t276 0.0)
(t277 0.0)
(t278 (/ 4.0 79.0))
(t279 (/ 1.0 158.0))
(t280 0.0)
(t281 0.0)
(t282 0.0)
(t283 0.0)
(t284 0.0)
(t285 (/ 83.0 553.0))
(t286 (/ 36.0 553.0))
(t287 0.0)
(t288 (/ 8.0 79.0))
(t289 0.0)
(t290 (/ 9.0 79.0))
(t291 0.0)
(t292 0.0)
(t293 0.0)
(t294 0.0)
(t295 0.0)
(t296 (/ 75.0 1106.0))
(t297 (/ 78.0 553.0))
(t298 0.0)
(t299 0.0)
(t300 0.0)
(t301 0.0)
(t302 0.0)
(t303 0.0)
(t304 0.0)
(t305 0.0)
(t306 0.0)
(t307 (/ 127.0 1106.0))
(t308 0.0)
(t309 0.0)
(t310 (/ 52.0 553.0))
(t311 0.0)
(t312 0.0)
(t313 0.0)
(t314 (/ 92.0 553.0))
(t315 0.0)
(t316 (/ 23.0 1106.0))
(t317 (/ 17.0 1106.0))
(t318 0.0)
(t319 0.0)
(t320 0.0)
(t321 0.0)
(t322 0.0)
(t323 0.0)
(t324 0.0)
(t325 0.0)
(t326 (/ 143.0 1106.0))
(t327 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1946/1946 variables, and 909 constraints, problems are : Problem set: 0 solved, 237 unsolved in 45018 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 88/88 constraints, State Equation: 791/791 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 19/256 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (OVERLAPS) 1/257 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 154/411 variables, 29/48 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2025-05-29 18:58:54] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 15 ms to minimize.
[2025-05-29 18:58:54] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2025-05-29 18:58:54] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2025-05-29 18:58:55] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2025-05-29 18:58:55] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2025-05-29 18:58:55] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2025-05-29 18:58:55] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
[2025-05-29 18:58:56] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2025-05-29 18:58:57] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 10 (OVERLAPS) 34/445 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2025-05-29 18:59:01] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 1 ms to minimize.
[2025-05-29 18:59:03] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2025-05-29 18:59:05] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/445 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2025-05-29 18:59:09] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/445 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 15 (OVERLAPS) 2/447 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/447 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 17 (OVERLAPS) 167/614 variables, 22/93 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/614 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 19 (OVERLAPS) 71/685 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/685 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 21 (OVERLAPS) 10/695 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 23 (OVERLAPS) 94/789 variables, 27/129 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 789/1946 variables, and 129 constraints, problems are : Problem set: 0 solved, 237 unsolved in 45018 ms.
Refiners :[Positive P Invariants (semi-flows): 29/30 constraints, Generalized P Invariants (flows): 87/88 constraints, State Equation: 0/791 constraints, PredecessorRefiner: 0/237 constraints, Known Traps: 13/13 constraints]
After SMT, in 90205ms problems are : Problem set: 0 solved, 237 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 237 out of 791 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 791/791 places, 1155/1155 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 791 transition count 1126
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 762 transition count 1126
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 58 place count 762 transition count 1111
Deduced a syphon composed of 15 places in 2 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 89 place count 746 transition count 1111
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 90 place count 746 transition count 1110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 91 place count 745 transition count 1110
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 112 place count 734 transition count 1100
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 4 with 1 rules applied. Total rules applied 113 place count 734 transition count 1099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 114 place count 733 transition count 1099
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 114 place count 733 transition count 1098
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 116 place count 732 transition count 1098
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 117 place count 731 transition count 1098
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 7 with 2 rules applied. Total rules applied 119 place count 730 transition count 1097
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 120 place count 729 transition count 1096
Iterating global reduction 7 with 1 rules applied. Total rules applied 121 place count 729 transition count 1096
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 123 place count 729 transition count 1094
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 125 place count 727 transition count 1094
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 126 place count 727 transition count 1094
Applied a total of 126 rules in 125 ms. Remains 727 /791 variables (removed 64) and now considering 1094/1155 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 727/791 places, 1094/1155 transitions.
RANDOM walk for 4000000 steps (56544 resets) in 61067 ms. (65 steps per ms) remains 218/237 properties
BEST_FIRST walk for 40002 steps (137 resets) in 186 ms. (213 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (149 resets) in 183 ms. (217 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (161 resets) in 203 ms. (196 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (153 resets) in 286 ms. (139 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (144 resets) in 425 ms. (93 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (154 resets) in 282 ms. (141 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (162 resets) in 434 ms. (91 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (154 resets) in 382 ms. (104 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (147 resets) in 276 ms. (144 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (161 resets) in 262 ms. (152 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (152 resets) in 367 ms. (108 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (154 resets) in 245 ms. (162 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (159 resets) in 402 ms. (99 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (144 resets) in 462 ms. (86 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40001 steps (143 resets) in 522 ms. (76 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (144 resets) in 459 ms. (86 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (155 resets) in 257 ms. (155 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (166 resets) in 475 ms. (84 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (155 resets) in 504 ms. (79 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (152 resets) in 272 ms. (146 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (148 resets) in 258 ms. (154 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (157 resets) in 337 ms. (118 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (159 resets) in 392 ms. (101 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (154 resets) in 381 ms. (104 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (162 resets) in 442 ms. (90 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (156 resets) in 293 ms. (136 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (140 resets) in 307 ms. (129 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (141 resets) in 370 ms. (107 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (158 resets) in 226 ms. (176 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (155 resets) in 262 ms. (152 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (156 resets) in 399 ms. (100 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (160 resets) in 267 ms. (149 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (158 resets) in 392 ms. (101 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (151 resets) in 400 ms. (99 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (156 resets) in 340 ms. (117 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (155 resets) in 253 ms. (157 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (146 resets) in 406 ms. (98 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (159 resets) in 304 ms. (131 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (144 resets) in 344 ms. (115 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (158 resets) in 283 ms. (140 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (163 resets) in 278 ms. (143 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (154 resets) in 377 ms. (105 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (155 resets) in 252 ms. (158 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (152 resets) in 267 ms. (149 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (153 resets) in 316 ms. (126 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (153 resets) in 282 ms. (141 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40003 steps (153 resets) in 306 ms. (130 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (142 resets) in 285 ms. (139 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40002 steps (161 resets) in 280 ms. (142 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (151 resets) in 394 ms. (101 steps per ms) remains 218/218 properties
Interrupted probabilistic random walk after 3982504 steps, run timeout after 63001 ms. (steps per millisecond=63 ) properties seen :28 out of 218
Probabilistic random walk after 3982504 steps, saw 1035673 distinct states, run finished after 63009 ms. (steps per millisecond=63 ) properties seen :28
// Phase 1: matrix 1094 rows 727 cols
[2025-05-29 19:00:59] [INFO ] Computed 115 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 4/194 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 68/262 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 51/313 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 112/426 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (OVERLAPS) 30/456 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (OVERLAPS) 2/458 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/458 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 17 (OVERLAPS) 106/564 variables, 14/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/564 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 19 (OVERLAPS) 59/623 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/623 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 21 (OVERLAPS) 9/632 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/632 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 23 (OVERLAPS) 93/725 variables, 27/113 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/725 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 25 (OVERLAPS) 1/726 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/726 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 27 (OVERLAPS) 1/727 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/727 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 29 (OVERLAPS) 1094/1821 variables, 727/842 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1821 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 31 (OVERLAPS) 0/1821 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1821/1821 variables, and 842 constraints, problems are : Problem set: 0 solved, 190 unsolved in 43907 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 85/85 constraints, State Equation: 727/727 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 4/194 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 68/262 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2025-05-29 19:01:45] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2025-05-29 19:01:45] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2025-05-29 19:01:46] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2025-05-29 19:01:47] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2025-05-29 19:01:47] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2025-05-29 19:01:48] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2025-05-29 19:01:49] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (OVERLAPS) 51/313 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2025-05-29 19:01:51] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (OVERLAPS) 1/314 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (OVERLAPS) 112/426 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2025-05-29 19:01:56] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 2 ms to minimize.
[2025-05-29 19:01:58] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 18 (OVERLAPS) 30/456 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/456 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 20 (OVERLAPS) 2/458 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/458 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 22 (OVERLAPS) 106/564 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/564 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 24 (OVERLAPS) 59/623 variables, 7/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/623 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 26 (OVERLAPS) 9/632 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2025-05-29 19:02:15] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/632 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/632 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 29 (OVERLAPS) 93/725 variables, 27/124 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2025-05-29 19:02:23] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/725 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/725 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 32 (OVERLAPS) 1/726 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/726 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 34 (OVERLAPS) 1/727 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/727 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 36 (OVERLAPS) 1094/1821 variables, 727/854 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1821 variables, 190/1044 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1821/1821 variables, and 1044 constraints, problems are : Problem set: 0 solved, 190 unsolved in 75020 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 85/85 constraints, State Equation: 727/727 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 12/12 constraints]
After SMT, in 119001ms problems are : Problem set: 0 solved, 190 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 190 out of 727 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 727/727 places, 1094/1094 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 727 transition count 1078
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 711 transition count 1078
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 32 place count 711 transition count 1067
Deduced a syphon composed of 11 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 56 place count 698 transition count 1067
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 57 place count 698 transition count 1066
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 697 transition count 1066
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 58 place count 697 transition count 1065
Deduced a syphon composed of 1 places in 1 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 61 place count 695 transition count 1065
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 61 place count 695 transition count 1064
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 63 place count 694 transition count 1064
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 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 66 place count 692 transition count 1063
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 66 place count 692 transition count 1060
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 72 place count 689 transition count 1060
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 688 transition count 1060
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 75 place count 687 transition count 1059
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 76 place count 686 transition count 1058
Iterating global reduction 5 with 1 rules applied. Total rules applied 77 place count 686 transition count 1058
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 78 place count 686 transition count 1057
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 80 place count 685 transition count 1056
Applied a total of 80 rules in 98 ms. Remains 685 /727 variables (removed 42) and now considering 1056/1094 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 685/727 places, 1056/1094 transitions.
RANDOM walk for 4000000 steps (57524 resets) in 98720 ms. (40 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40001 steps (162 resets) in 279 ms. (142 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (150 resets) in 296 ms. (134 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (166 resets) in 287 ms. (138 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (163 resets) in 266 ms. (149 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (151 resets) in 278 ms. (143 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (153 resets) in 320 ms. (124 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (158 resets) in 385 ms. (103 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (158 resets) in 310 ms. (128 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (151 resets) in 308 ms. (129 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (163 resets) in 326 ms. (122 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (160 resets) in 364 ms. (109 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (159 resets) in 261 ms. (152 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (157 resets) in 295 ms. (135 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (156 resets) in 265 ms. (150 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (150 resets) in 268 ms. (148 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (173 resets) in 250 ms. (159 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (158 resets) in 288 ms. (138 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (159 resets) in 300 ms. (132 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (156 resets) in 286 ms. (139 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (162 resets) in 367 ms. (108 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (160 resets) in 345 ms. (115 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (153 resets) in 245 ms. (162 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (155 resets) in 329 ms. (121 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (168 resets) in 291 ms. (137 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (157 resets) in 318 ms. (125 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (150 resets) in 331 ms. (120 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (163 resets) in 286 ms. (139 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (165 resets) in 291 ms. (137 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (157 resets) in 344 ms. (115 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (147 resets) in 333 ms. (119 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (150 resets) in 311 ms. (128 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (160 resets) in 274 ms. (145 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (155 resets) in 328 ms. (121 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (165 resets) in 309 ms. (129 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (161 resets) in 272 ms. (146 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (159 resets) in 295 ms. (135 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (156 resets) in 358 ms. (111 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (164 resets) in 297 ms. (134 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (164 resets) in 292 ms. (136 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (157 resets) in 322 ms. (123 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (162 resets) in 301 ms. (132 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (144 resets) in 337 ms. (118 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (156 resets) in 280 ms. (142 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (149 resets) in 311 ms. (128 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (153 resets) in 288 ms. (138 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (154 resets) in 317 ms. (125 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (163 resets) in 355 ms. (112 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (157 resets) in 312 ms. (127 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (150 resets) in 299 ms. (133 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40001 steps (159 resets) in 267 ms. (149 steps per ms) remains 190/190 properties
Interrupted probabilistic random walk after 6438336 steps, run timeout after 102006 ms. (steps per millisecond=63 ) properties seen :0 out of 190
Probabilistic random walk after 6438336 steps, saw 1645597 distinct states, run finished after 102007 ms. (steps per millisecond=63 ) properties seen :0
// Phase 1: matrix 1056 rows 685 cols
[2025-05-29 19:05:15] [INFO ] Computed 110 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 4/194 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 65/259 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 30/289 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 2/291 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 96/387 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (OVERLAPS) 26/413 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (OVERLAPS) 2/415 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/415 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 17 (OVERLAPS) 107/522 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/522 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 19 (OVERLAPS) 59/581 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/581 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 21 (OVERLAPS) 9/590 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/590 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 23 (OVERLAPS) 93/683 variables, 27/108 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/683 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 25 (OVERLAPS) 1/684 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/684 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 27 (OVERLAPS) 1/685 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/685 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 29 (OVERLAPS) 1056/1741 variables, 685/795 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1741 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 31 (OVERLAPS) 0/1741 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1741/1741 variables, and 795 constraints, problems are : Problem set: 0 solved, 190 unsolved in 40907 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 685/685 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 4/194 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 65/259 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2025-05-29 19:05:57] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2025-05-29 19:05:58] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2025-05-29 19:05:58] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:05:58] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 2 ms to minimize.
[2025-05-29 19:05:58] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:05:59] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2025-05-29 19:06:00] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 30/289 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 2/291 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (OVERLAPS) 96/387 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2025-05-29 19:06:05] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2025-05-29 19:06:06] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (OVERLAPS) 26/413 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/413 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 18 (OVERLAPS) 2/415 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/415 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 20 (OVERLAPS) 107/522 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/522 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 22 (OVERLAPS) 59/581 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/581 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 24 (OVERLAPS) 9/590 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2025-05-29 19:06:20] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/590 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/590 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 27 (OVERLAPS) 93/683 variables, 27/118 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/683 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 29 (OVERLAPS) 1/684 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/684 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 31 (OVERLAPS) 1/685 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/685 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 33 (OVERLAPS) 1056/1741 variables, 685/805 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1741 variables, 190/995 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1741/1741 variables, and 995 constraints, problems are : Problem set: 0 solved, 190 unsolved in 90026 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 685/685 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 10/10 constraints]
After SMT, in 130991ms problems are : Problem set: 0 solved, 190 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 190 out of 685 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 685/685 places, 1056/1056 transitions.
Applied a total of 0 rules in 15 ms. Remains 685 /685 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 685/685 places, 1056/1056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 685/685 places, 1056/1056 transitions.
Applied a total of 0 rules in 13 ms. Remains 685 /685 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
[2025-05-29 19:07:26] [INFO ] Invariant cache hit.
[2025-05-29 19:07:26] [INFO ] Implicit Places using invariants in 394 ms returned [90, 285, 286, 288, 305, 323, 342, 392, 393, 404, 405, 407, 424, 442, 511, 515, 516, 519, 530, 531, 532, 550, 552, 556, 574, 575, 576, 577, 589, 595, 601, 607, 613, 619, 625, 631, 637, 643, 649]
[2025-05-29 19:07:26] [INFO ] Actually due to overlaps returned [550, 532, 90, 305, 424, 556, 288, 407, 285, 404, 530, 574, 286, 405, 531, 552, 575, 392, 393, 515, 516, 442, 576, 619, 637, 649, 323, 342, 519, 577, 589, 595, 601, 607, 613, 625, 631, 643]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 405 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 647/685 places, 1056/1056 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 646 transition count 992
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 582 transition count 991
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 130 place count 582 transition count 973
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 167 place count 563 transition count 973
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 179 place count 559 transition count 965
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 187 place count 551 transition count 965
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 202 place count 536 transition count 950
Iterating global reduction 4 with 15 rules applied. Total rules applied 217 place count 536 transition count 950
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 220 place count 536 transition count 947
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 220 place count 536 transition count 946
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 222 place count 535 transition count 946
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 225 place count 532 transition count 940
Iterating global reduction 5 with 3 rules applied. Total rules applied 228 place count 532 transition count 940
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 229 place count 531 transition count 939
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 531 transition count 939
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 231 place count 530 transition count 937
Iterating global reduction 5 with 1 rules applied. Total rules applied 232 place count 530 transition count 937
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 286 place count 503 transition count 910
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 287 place count 503 transition count 909
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 288 place count 502 transition count 908
Iterating global reduction 6 with 1 rules applied. Total rules applied 289 place count 502 transition count 908
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 290 place count 502 transition count 907
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 294 place count 500 transition count 908
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 301 place count 500 transition count 901
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 309 place count 492 transition count 901
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 318 place count 492 transition count 901
Applied a total of 318 rules in 123 ms. Remains 492 /647 variables (removed 155) and now considering 901/1056 (removed 155) transitions.
// Phase 1: matrix 901 rows 492 cols
[2025-05-29 19:07:26] [INFO ] Computed 65 invariants in 15 ms
[2025-05-29 19:07:26] [INFO ] Implicit Places using invariants in 238 ms returned [204, 210, 213, 215, 250, 251, 331, 337, 340, 342, 347, 348, 400, 417, 423, 426, 428]
[2025-05-29 19:07:26] [INFO ] Actually due to overlaps returned [250, 347, 251, 348, 204, 210, 215, 331, 337, 342, 417, 423, 428, 400]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 248 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 478/685 places, 901/1056 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 466 transition count 889
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 466 transition count 889
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 463 transition count 886
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 463 transition count 886
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 459 transition count 882
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 47 place count 459 transition count 873
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 56 place count 450 transition count 873
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 450 transition count 872
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 449 transition count 872
Applied a total of 58 rules in 56 ms. Remains 449 /478 variables (removed 29) and now considering 872/901 (removed 29) transitions.
// Phase 1: matrix 872 rows 449 cols
[2025-05-29 19:07:26] [INFO ] Computed 51 invariants in 8 ms
[2025-05-29 19:07:27] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-05-29 19:07:27] [INFO ] Invariant cache hit.
[2025-05-29 19:07:27] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 449/685 places, 872/1056 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1567 ms. Remains : 449/685 places, 872/1056 transitions.
RANDOM walk for 4000000 steps (89046 resets) in 52031 ms. (76 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (273 resets) in 370 ms. (107 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (266 resets) in 329 ms. (121 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (289 resets) in 347 ms. (114 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (277 resets) in 502 ms. (79 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (274 resets) in 405 ms. (98 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (272 resets) in 354 ms. (112 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (279 resets) in 363 ms. (109 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40001 steps (271 resets) in 334 ms. (119 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (282 resets) in 349 ms. (114 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (280 resets) in 303 ms. (131 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (281 resets) in 383 ms. (104 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (262 resets) in 379 ms. (105 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (269 resets) in 358 ms. (111 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (277 resets) in 324 ms. (123 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (277 resets) in 427 ms. (93 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (275 resets) in 281 ms. (141 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (278 resets) in 337 ms. (118 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (281 resets) in 349 ms. (114 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (272 resets) in 285 ms. (139 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (292 resets) in 334 ms. (119 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (283 resets) in 304 ms. (131 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (285 resets) in 306 ms. (130 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (277 resets) in 334 ms. (119 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (268 resets) in 339 ms. (117 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (288 resets) in 313 ms. (127 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (266 resets) in 297 ms. (134 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (265 resets) in 311 ms. (128 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (266 resets) in 283 ms. (140 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (280 resets) in 327 ms. (121 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (280 resets) in 308 ms. (129 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (283 resets) in 310 ms. (128 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (287 resets) in 314 ms. (126 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (276 resets) in 341 ms. (116 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (282 resets) in 308 ms. (129 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (295 resets) in 340 ms. (117 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (264 resets) in 321 ms. (124 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (292 resets) in 352 ms. (113 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (264 resets) in 350 ms. (113 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (269 resets) in 379 ms. (105 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (287 resets) in 251 ms. (158 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (272 resets) in 254 ms. (156 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (265 resets) in 260 ms. (153 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (278 resets) in 264 ms. (150 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (282 resets) in 305 ms. (130 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (280 resets) in 366 ms. (109 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (269 resets) in 301 ms. (132 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (266 resets) in 287 ms. (138 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (290 resets) in 291 ms. (136 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (282 resets) in 289 ms. (137 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (268 resets) in 274 ms. (145 steps per ms) remains 190/190 properties
Interrupted probabilistic random walk after 6225068 steps, run timeout after 60001 ms. (steps per millisecond=103 ) properties seen :119 out of 190
Probabilistic random walk after 6225068 steps, saw 1149438 distinct states, run finished after 60001 ms. (steps per millisecond=103 ) properties seen :119
[2025-05-29 19:08:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 28/99 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 13/112 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 3/115 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 13/128 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 33/161 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/161 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 12 (OVERLAPS) 205/366 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/366 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 14 (OVERLAPS) 24/390 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 16 (OVERLAPS) 59/449 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/449 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 18 (OVERLAPS) 872/1321 variables, 449/500 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1321 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 20 (OVERLAPS) 0/1321 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1321/1321 variables, and 500 constraints, problems are : Problem set: 0 solved, 71 unsolved in 6914 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 449/449 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 28/99 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2025-05-29 19:08:55] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2025-05-29 19:08:55] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 13/112 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 3/115 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 13/128 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (OVERLAPS) 33/161 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 13 (OVERLAPS) 205/366 variables, 22/42 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/366 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 15 (OVERLAPS) 24/390 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2025-05-29 19:08:57] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/390 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/390 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 18 (OVERLAPS) 59/449 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2025-05-29 19:08:58] [INFO ] Deduced a trap composed of 88 places in 83 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/449 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2025-05-29 19:08:59] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/449 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/449 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 22 (OVERLAPS) 872/1321 variables, 449/505 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1321 variables, 71/576 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1321 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 25 (OVERLAPS) 0/1321 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1321/1321 variables, and 576 constraints, problems are : Problem set: 0 solved, 71 unsolved in 14246 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 449/449 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 5/5 constraints]
After SMT, in 21175ms problems are : Problem set: 0 solved, 71 unsolved
Fused 71 Parikh solutions to 64 different solutions.
Parikh walk visited 0 properties in 29027 ms.
Support contains 71 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 872/872 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 449 transition count 858
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 435 transition count 858
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 28 place count 435 transition count 825
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 69 rules applied. Total rules applied 97 place count 399 transition count 825
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 2 with 3 rules applied. Total rules applied 100 place count 399 transition count 822
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 103 place count 396 transition count 822
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 394 transition count 820
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 394 transition count 820
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 25 rules applied. Total rules applied 132 place count 381 transition count 808
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 132 place count 381 transition count 807
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 134 place count 380 transition count 807
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 136 place count 378 transition count 800
Ensure Unique test removed 1 places
Iterating global reduction 4 with 3 rules applied. Total rules applied 139 place count 377 transition count 800
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 140 place count 376 transition count 800
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 141 place count 375 transition count 799
Iterating global reduction 5 with 1 rules applied. Total rules applied 142 place count 375 transition count 799
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 5 with 2 rules applied. Total rules applied 144 place count 375 transition count 797
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 145 place count 374 transition count 797
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 149 place count 372 transition count 795
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 150 place count 371 transition count 794
Iterating global reduction 7 with 1 rules applied. Total rules applied 151 place count 371 transition count 794
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 152 place count 371 transition count 793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 153 place count 370 transition count 793
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 154 place count 370 transition count 793
Applied a total of 154 rules in 74 ms. Remains 370 /449 variables (removed 79) and now considering 793/872 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 370/449 places, 793/872 transitions.
RANDOM walk for 4000000 steps (86158 resets) in 51757 ms. (77 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400000 steps (2707 resets) in 1651 ms. (242 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2787 resets) in 1782 ms. (224 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2738 resets) in 1718 ms. (232 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2756 resets) in 1678 ms. (238 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2765 resets) in 1753 ms. (228 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2711 resets) in 1951 ms. (204 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2772 resets) in 1492 ms. (267 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2729 resets) in 1740 ms. (229 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2735 resets) in 1491 ms. (268 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2728 resets) in 1594 ms. (250 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2789 resets) in 1270 ms. (314 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2736 resets) in 2151 ms. (185 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2727 resets) in 1874 ms. (213 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2775 resets) in 2097 ms. (190 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2725 resets) in 2190 ms. (182 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2748 resets) in 2126 ms. (188 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2775 resets) in 2284 ms. (175 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2745 resets) in 2015 ms. (198 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2743 resets) in 1826 ms. (218 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2736 resets) in 1871 ms. (213 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2734 resets) in 1590 ms. (251 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2785 resets) in 1912 ms. (209 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2702 resets) in 1710 ms. (233 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2792 resets) in 1664 ms. (240 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2734 resets) in 1913 ms. (208 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2763 resets) in 2060 ms. (194 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2747 resets) in 2229 ms. (179 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2752 resets) in 2224 ms. (179 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2727 resets) in 3063 ms. (130 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2744 resets) in 1921 ms. (208 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2728 resets) in 1717 ms. (232 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2802 resets) in 1875 ms. (213 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2780 resets) in 1884 ms. (212 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2808 resets) in 2364 ms. (169 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2752 resets) in 1916 ms. (208 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2730 resets) in 1754 ms. (227 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2770 resets) in 1437 ms. (278 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2769 resets) in 1600 ms. (249 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2750 resets) in 1523 ms. (262 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2731 resets) in 1570 ms. (254 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2775 resets) in 1816 ms. (220 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2733 resets) in 1960 ms. (203 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2746 resets) in 1821 ms. (219 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2759 resets) in 1600 ms. (249 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2695 resets) in 2058 ms. (194 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2741 resets) in 1437 ms. (278 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2726 resets) in 1510 ms. (264 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2786 resets) in 2230 ms. (179 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2718 resets) in 1795 ms. (222 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2760 resets) in 1900 ms. (210 steps per ms) remains 71/71 properties
Interrupted probabilistic random walk after 18600681 steps, run timeout after 141001 ms. (steps per millisecond=131 ) properties seen :69 out of 71
Probabilistic random walk after 18600681 steps, saw 4237616 distinct states, run finished after 141001 ms. (steps per millisecond=131 ) properties seen :69
// Phase 1: matrix 793 rows 370 cols
[2025-05-29 19:12:46] [INFO ] Computed 45 invariants in 11 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) 26/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/35 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/48 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 206/254 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 53/307 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 63/370 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 793/1163 variables, 370/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1163 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1163 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 415 constraints, problems are : Problem set: 0 solved, 2 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 26/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/35 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/48 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 206/254 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 53/307 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 63/370 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 793/1163 variables, 370/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1163 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1163 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1163 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 417 constraints, problems are : Problem set: 0 solved, 2 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 690ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 660 ms.
Support contains 2 out of 370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 370/370 places, 793/793 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 370 transition count 774
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 351 transition count 774
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 38 place count 351 transition count 758
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 72 place count 333 transition count 758
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 76 place count 332 transition count 755
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 79 place count 329 transition count 755
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 79 place count 329 transition count 754
Deduced a syphon composed of 1 places in 1 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 82 place count 327 transition count 754
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 82 place count 327 transition count 753
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 84 place count 326 transition count 753
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 99 place count 318 transition count 746
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 99 place count 318 transition count 744
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 104 place count 315 transition count 744
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 105 place count 314 transition count 744
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 105 place count 314 transition count 743
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 107 place count 313 transition count 743
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 111 place count 311 transition count 741
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 112 place count 311 transition count 740
Applied a total of 112 rules in 36 ms. Remains 311 /370 variables (removed 59) and now considering 740/793 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 311/370 places, 740/793 transitions.
RANDOM walk for 4000000 steps (85975 resets) in 15108 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (27692 resets) in 7355 ms. (543 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (27559 resets) in 6343 ms. (630 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 4821605 steps, run timeout after 30001 ms. (steps per millisecond=160 ) properties seen :0 out of 2
Probabilistic random walk after 4821605 steps, saw 1618545 distinct states, run finished after 30001 ms. (steps per millisecond=160 ) properties seen :0
// Phase 1: matrix 740 rows 311 cols
[2025-05-29 19:13:28] [INFO ] Computed 38 invariants in 13 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) 10/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 57/71 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 15/86 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/89 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 13/102 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 33/135 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/135 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 137/272 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 22/294 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/294 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 17/311 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/311 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 740/1051 variables, 311/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1051 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1051 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1051/1051 variables, and 349 constraints, problems are : Problem set: 0 solved, 2 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 10/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 57/71 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 15/86 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/89 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 13/102 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 33/135 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/135 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 137/272 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 22/294 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/294 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 17/311 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 19:13:29] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/311 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/311 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 740/1051 variables, 311/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1051 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1051 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1051 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1051/1051 variables, and 352 constraints, problems are : Problem set: 0 solved, 2 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 879ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 620 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 740/740 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 740/740 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 311/311 places, 740/740 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 740/740 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 740/740 (removed 0) transitions.
[2025-05-29 19:13:30] [INFO ] Invariant cache hit.
[2025-05-29 19:13:30] [INFO ] Implicit Places using invariants in 200 ms returned [0, 18, 19, 31, 66, 107, 111]
[2025-05-29 19:13:30] [INFO ] Actually due to overlaps returned [31, 0, 19, 66, 18, 111]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 201 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 305/311 places, 740/740 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 304 transition count 730
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 294 transition count 730
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 21 place count 294 transition count 729
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 293 transition count 729
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 291 transition count 727
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 290 transition count 726
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 290 transition count 726
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 290 transition count 725
Applied a total of 30 rules in 20 ms. Remains 290 /305 variables (removed 15) and now considering 725/740 (removed 15) transitions.
// Phase 1: matrix 725 rows 290 cols
[2025-05-29 19:13:30] [INFO ] Computed 31 invariants in 10 ms
[2025-05-29 19:13:30] [INFO ] Implicit Places using invariants in 183 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 184 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 289/311 places, 725/740 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 288 transition count 724
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 288 transition count 723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 287 transition count 723
Applied a total of 4 rules in 17 ms. Remains 287 /289 variables (removed 2) and now considering 723/725 (removed 2) transitions.
// Phase 1: matrix 723 rows 287 cols
[2025-05-29 19:13:30] [INFO ] Computed 30 invariants in 11 ms
[2025-05-29 19:13:30] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-05-29 19:13:30] [INFO ] Invariant cache hit.
[2025-05-29 19:13:31] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 287/311 places, 723/740 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1084 ms. Remains : 287/311 places, 723/740 transitions.
RANDOM walk for 4000000 steps (86038 resets) in 15604 ms. (256 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000002 steps (27492 resets) in 7151 ms. (559 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (27698 resets) in 5624 ms. (711 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 368160 steps, run visited all 2 properties in 2459 ms. (steps per millisecond=149 )
Probabilistic random walk after 368160 steps, saw 188893 distinct states, run finished after 2481 ms. (steps per millisecond=148 ) properties seen :2
Able to resolve query StableMarking after proving 1443 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 987060 ms.
ITS solved all properties within timeout

BK_STOP 1748546025395

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-03b"
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-03b, 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-174853743500203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-03b.tgz
mv ASLink-PT-03b 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 ;