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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K 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 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 921K 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 1748546275017

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-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 19:17:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-29 19:17:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:17:56] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2025-05-29 19:17:56] [INFO ] Transformed 2826 places.
[2025-05-29 19:17:56] [INFO ] Transformed 3513 transitions.
[2025-05-29 19:17:56] [INFO ] Found NUPN structural information;
[2025-05-29 19:17:56] [INFO ] Parsed PT model containing 2826 places and 3513 transitions and 10709 arcs in 402 ms.
Structural test allowed to assert that 346 places are NOT stable. Took 28 ms.
RANDOM walk for 40000 steps (60 resets) in 4890 ms. (8 steps per ms) remains 825/2480 properties
BEST_FIRST walk for 122 steps (8 resets) in 14 ms. (8 steps per ms) remains 825/825 properties
BEST_FIRST walk for 123 steps (8 resets) in 16 ms. (7 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 31 ms. (3 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 25 ms. (4 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 21 ms. (5 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 825/825 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 825/825 properties
BEST_FIRST walk for 122 steps (8 resets) in 14 ms. (8 steps per ms) remains 825/825 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 825/825 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 825/825 properties
BEST_FIRST walk for 122 steps (8 resets) in 13 ms. (8 steps per ms) remains 825/825 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 825/825 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 825/825 properties
BEST_FIRST walk for 122 steps (8 resets) in 13 ms. (8 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 825/825 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 825/825 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 825/825 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 825/825 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 825/825 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 825/825 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 825/825 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 825/825 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 825/825 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 825/825 properties
BEST_FIRST walk for 122 steps (8 resets) in 5 ms. (20 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 825/825 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 825/825 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 825/825 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 825/825 properties
// Phase 1: matrix 3513 rows 2826 cols
[2025-05-29 19:17:58] [INFO ] Computed 277 invariants in 114 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/825 variables, 825/825 constraints. Problems are: Problem set: 0 solved, 825 unsolved
SMT process timed out in 5698ms, After SMT, problems are : Problem set: 0 solved, 825 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 825 out of 2826 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2826/2826 places, 3513/3513 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 484 transitions
Trivial Post-agglo rules discarded 484 transitions
Performed 484 trivial Post agglomeration. Transition count delta: 484
Iterating post reduction 0 with 484 rules applied. Total rules applied 484 place count 2826 transition count 3029
Reduce places removed 484 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 510 rules applied. Total rules applied 994 place count 2342 transition count 3003
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1000 place count 2336 transition count 3003
Performed 450 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 450 Pre rules applied. Total rules applied 1000 place count 2336 transition count 2553
Deduced a syphon composed of 450 places in 7 ms
Ensure Unique test removed 38 places
Reduce places removed 488 places and 0 transitions.
Iterating global reduction 3 with 938 rules applied. Total rules applied 1938 place count 1848 transition count 2553
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 3 with 25 rules applied. Total rules applied 1963 place count 1843 transition count 2533
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 1983 place count 1823 transition count 2533
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 19 Pre rules applied. Total rules applied 1983 place count 1823 transition count 2514
Deduced a syphon composed of 19 places in 20 ms
Ensure Unique test removed 19 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 57 rules applied. Total rules applied 2040 place count 1785 transition count 2514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 19 Pre rules applied. Total rules applied 2040 place count 1785 transition count 2495
Deduced a syphon composed of 19 places in 22 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 2078 place count 1766 transition count 2495
Discarding 54 places :
Symmetric choice reduction at 5 with 54 rule applications. Total rules 2132 place count 1712 transition count 2441
Iterating global reduction 5 with 54 rules applied. Total rules applied 2186 place count 1712 transition count 2441
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2187 place count 1712 transition count 2440
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 2187 place count 1712 transition count 2429
Deduced a syphon composed of 11 places in 18 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 2210 place count 1700 transition count 2429
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2210 place count 1700 transition count 2428
Deduced a syphon composed of 1 places in 18 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 2213 place count 1698 transition count 2428
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2217 place count 1694 transition count 2401
Iterating global reduction 6 with 4 rules applied. Total rules applied 2221 place count 1694 transition count 2401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2221 place count 1694 transition count 2400
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2223 place count 1693 transition count 2400
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2224 place count 1692 transition count 2392
Iterating global reduction 6 with 1 rules applied. Total rules applied 2225 place count 1692 transition count 2392
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2226 place count 1691 transition count 2384
Iterating global reduction 6 with 1 rules applied. Total rules applied 2227 place count 1691 transition count 2384
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2228 place count 1690 transition count 2376
Iterating global reduction 6 with 1 rules applied. Total rules applied 2229 place count 1690 transition count 2376
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2230 place count 1689 transition count 2368
Iterating global reduction 6 with 1 rules applied. Total rules applied 2231 place count 1689 transition count 2368
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2232 place count 1688 transition count 2360
Iterating global reduction 6 with 1 rules applied. Total rules applied 2233 place count 1688 transition count 2360
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2234 place count 1687 transition count 2352
Iterating global reduction 6 with 1 rules applied. Total rules applied 2235 place count 1687 transition count 2352
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2236 place count 1686 transition count 2344
Iterating global reduction 6 with 1 rules applied. Total rules applied 2237 place count 1686 transition count 2344
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2238 place count 1685 transition count 2336
Iterating global reduction 6 with 1 rules applied. Total rules applied 2239 place count 1685 transition count 2336
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2240 place count 1684 transition count 2328
Iterating global reduction 6 with 1 rules applied. Total rules applied 2241 place count 1684 transition count 2328
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2242 place count 1683 transition count 2320
Iterating global reduction 6 with 1 rules applied. Total rules applied 2243 place count 1683 transition count 2320
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2244 place count 1682 transition count 2312
Iterating global reduction 6 with 1 rules applied. Total rules applied 2245 place count 1682 transition count 2312
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2246 place count 1681 transition count 2304
Iterating global reduction 6 with 1 rules applied. Total rules applied 2247 place count 1681 transition count 2304
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2248 place count 1680 transition count 2296
Iterating global reduction 6 with 1 rules applied. Total rules applied 2249 place count 1680 transition count 2296
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2250 place count 1679 transition count 2288
Iterating global reduction 6 with 1 rules applied. Total rules applied 2251 place count 1679 transition count 2288
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2252 place count 1678 transition count 2280
Iterating global reduction 6 with 1 rules applied. Total rules applied 2253 place count 1678 transition count 2280
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2254 place count 1677 transition count 2272
Iterating global reduction 6 with 1 rules applied. Total rules applied 2255 place count 1677 transition count 2272
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 4 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 6 with 286 rules applied. Total rules applied 2541 place count 1534 transition count 2129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2543 place count 1533 transition count 2138
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 2553 place count 1533 transition count 2128
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2563 place count 1523 transition count 2128
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 2567 place count 1523 transition count 2124
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2571 place count 1519 transition count 2124
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 2574 place count 1519 transition count 2124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2575 place count 1518 transition count 2123
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 2578 place count 1516 transition count 2122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2579 place count 1515 transition count 2122
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 2579 place count 1515 transition count 2119
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2585 place count 1512 transition count 2119
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 10 with 1 rules applied. Total rules applied 2586 place count 1511 transition count 2119
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2590 place count 1509 transition count 2117
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 2591 place count 1508 transition count 2116
Iterating global reduction 11 with 1 rules applied. Total rules applied 2592 place count 1508 transition count 2116
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2593 place count 1508 transition count 2115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2594 place count 1507 transition count 2115
Applied a total of 2594 rules in 1568 ms. Remains 1507 /2826 variables (removed 1319) and now considering 2115/3513 (removed 1398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1581 ms. Remains : 1507/2826 places, 2115/3513 transitions.
RANDOM walk for 2635750 steps (27829 resets) in 120004 ms. (21 steps per ms) remains 632/825 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 632/632 properties
// Phase 1: matrix 2115 rows 1507 cols
[2025-05-29 19:18:36] [INFO ] Computed 210 invariants in 52 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (OVERLAPS) 77/709 variables, 40/58 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/709 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/709 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 5 (OVERLAPS) 2/711 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 1.0 130.0))
(s1 (/ 1.0 130.0))
(s2 (/ 1.0 10.0))
(s3 (/ 1.0 130.0))
(s4 (/ 1.0 130.0))
(s5 (/ 1.0 130.0))
(s6 (/ 1.0 130.0))
(s7 (/ 1.0 130.0))
(s8 (/ 1.0 130.0))
(s9 (/ 1.0 130.0))
(s10 (/ 1.0 130.0))
(s11 (/ 1.0 130.0))
(s12 (/ 1.0 130.0))
(s13 (/ 1.0 130.0))
(s14 (/ 1.0 130.0))
(s15 (/ 1.0 130.0))
(s16 (/ 1.0 130.0))
(s17 (/ 1.0 130.0))
(s18 (/ 1.0 130.0))
(s19 (/ 1.0 130.0))
(s20 (/ 1.0 130.0))
(s21 (/ 1.0 130.0))
(s22 (/ 1.0 130.0))
(s23 (/ 1.0 130.0))
(s24 (/ 1.0 130.0))
(s25 (/ 1.0 130.0))
(s26 (/ 1.0 130.0))
(s27 (/ 1.0 130.0))
(s28 (/ 1.0 130.0))
(s29 (/ 1.0 130.0))
(s30 (/ 1.0 130.0))
(s31 (/ 1.0 130.0))
(s32 (/ 1.0 130.0))
(s33 (/ 1.0 130.0))
(s34 (/ 1.0 130.0))
(s36 (/ 59.0 65.0))
(s37 (/ 1.0 130.0))
(s38 (/ 3.0 130.0))
(s39 (/ 1.0 130.0))
(s40 (/ 3.0 65.0))
(s41 (/ 1.0 130.0))
(s42 0.0)
(s44 (/ 1.0 130.0))
(s45 (/ 1.0 130.0))
(s46 (/ 1.0 130.0))
(s47 (/ 1.0 130.0))
(s48 (/ 1.0 130.0))
(s49 (/ 1.0 130.0))
(s50 (/ 1.0 130.0))
(s51 (/ 1.0 130.0))
(s52 (/ 1.0 130.0))
(s53 (/ 1.0 130.0))
(s54 (/ 1.0 130.0))
(s55 (/ 1.0 130.0))
(s56 (/ 1.0 130.0))
(s57 (/ 1.0 130.0))
(s58 (/ 1.0 130.0))
(s59 (/ 1.0 130.0))
(s60 (/ 1.0 130.0))
(s61 (/ 1.0 130.0))
(s62 (/ 1.0 130.0))
(s63 (/ 1.0 130.0))
(s64 (/ 1.0 130.0))
(s65 (/ 1.0 130.0))
(s66 (/ 1.0 130.0))
(s67 (/ 1.0 130.0))
(s68 (/ 1.0 130.0))
(s69 (/ 1.0 130.0))
(s70 (/ 1.0 130.0))
(s71 (/ 1.0 130.0))
(s72 (/ 1.0 130.0))
(s73 (/ 1.0 130.0))
(s74 (/ 1.0 130.0))
(s75 (/ 1.0 130.0))
(s76 (/ 1.0 130.0))
(s77 (/ 1.0 130.0))
(s78 (/ 1.0 130.0))
(s79 (/ 1.0 130.0))
(s80 (/ 1.0 130.0))
(s81 (/ 1.0 130.0))
(s82 (/ 1.0 130.0))
(s83 (/ 1.0 130.0))
(s84 (/ 1.0 130.0))
(s85 (/ 1.0 130.0))
(s86 (/ 1.0 130.0))
(s87 (/ 1.0 130.0))
(s88 (/ 1.0 130.0))
(s89 (/ 1.0 130.0))
(s90 (/ 1.0 130.0))
(s91 (/ 1.0 130.0))
(s92 (/ 1.0 130.0))
(s93 (/ 1.0 130.0))
(s94 (/ 1.0 130.0))
(s95 (/ 1.0 130.0))
(s96 (/ 1.0 130.0))
(s97 (/ 1.0 130.0))
(s98 (/ 1.0 130.0))
(s99 (/ 1.0 130.0))
(s100 (/ 1.0 130.0))
(s101 (/ 1.0 130.0))
(s102 (/ 1.0 130.0))
(s103 (/ 1.0 130.0))
(s104 (/ 1.0 130.0))
(s105 (/ 1.0 130.0))
(s106 (/ 1.0 130.0))
(s126 0.0)
(s127 (/ 48.0 65.0))
(s128 (/ 1.0 130.0))
(s129 (/ 1.0 130.0))
(s130 (/ 9.0 130.0))
(s131 (/ 1.0 130.0))
(s132 (/ 1.0 130.0))
(s133 (/ 1.0 130.0))
(s134 (/ 1.0 130.0))
(s135 (/ 1.0 130.0))
(s136 (/ 1.0 130.0))
(s137 (/ 1.0 130.0))
(s138 (/ 1.0 130.0))
(s139 (/ 1.0 130.0))
(s140 (/ 1.0 130.0))
(s141 (/ 1.0 130.0))
(s142 (/ 1.0 130.0))
(s143 (/ 1.0 130.0))
(s144 (/ 1.0 130.0))
(s145 (/ 1.0 130.0))
(s146 (/ 1.0 130.0))
(s147 (/ 1.0 130.0))
(s148 (/ 1.0 130.0))
(s149 (/ 1.0 130.0))
(s150 (/ 1.0 130.0))
(s151 (/ 1.0 130.0))
(s152 (/ 1.0 130.0))
(s153 (/ 1.0 130.0))
(s154 (/ 1.0 130.0))
(s155 (/ 1.0 130.0))
(s156 (/ 1.0 130.0))
(s157 (/ 1.0 130.0))
(s158 (/ 1.0 130.0))
(s159 (/ 1.0 130.0))
(s160 (/ 1.0 130.0))
(s161 (/ 1.0 130.0))
(s162 (/ 1.0 130.0))
(s163 (/ 1.0 130.0))
(s164 (/ 1.0 130.0))
(s165 (/ 1.0 130.0))
(s166 (/ 1.0 130.0))
(s167 (/ 1.0 130.0))
(s168 (/ 1.0 130.0))
(s169 (/ 1.0 130.0))
(s170 (/ 1.0 130.0))
(s171 (/ 1.0 130.0))
(s172 (/ 31.0 130.0))
(s173 (/ 1.0 130.0))
(s174 (/ 1.0 130.0))
(s175 (/ 1.0 130.0))
(s176 (/ 1.0 130.0))
(s177 (/ 1.0 130.0))
(s178 (/ 1.0 130.0))
(s184 (/ 1.0 130.0))
(s185 (/ 1.0 130.0))
(s186 (/ 1.0 130.0))
(s187 (/ 1.0 130.0))
(s188 (/ 1.0 130.0))
(s189 (/ 1.0 130.0))
(s190 (/ 1.0 130.0))
(s191 (/ 1.0 130.0))
(s192 (/ 1.0 130.0))
(s193 (/ 1.0 130.0))
(s194 (/ 1.0 130.0))
(s195 (/ 1.0 130.0))
(s196 (/ 1.0 130.0))
(s197 (/ 1.0 130.0))
(s198 (/ 1.0 130.0))
(s199 (/ 1.0 130.0))
(s200 (/ 1.0 130.0))
(s201 (/ 1.0 130.0))
(s202 (/ 1.0 130.0))
(s203 (/ 1.0 130.0))
(s204 (/ 1.0 130.0))
(s205 (/ 1.0 130.0))
(s206 (/ 1.0 130.0))
(s207 (/ 12.0 13.0))
(s208 (/ 1.0 130.0))
(s209 (/ 1.0 130.0))
(s210 (/ 1.0 130.0))
(s211 (/ 1.0 130.0))
(s212 (/ 1.0 130.0))
(s213 (/ 1.0 130.0))
(s214 (/ 12.0 13.0))
(s215 (/ 1.0 130.0))
(s216 (/ 1.0 130.0))
(s217 (/ 1.0 130.0))
(s218 (/ 121.0 130.0))
(s238 0.0)
(s252 0.0)
(s260 0.0)
(s262 0.0)
(s263 0.0)
(s265 0.0)
(s266 (/ 127.0 130.0))
(s268 (/ 1.0 130.0))
(s269 (/ 1.0 130.0))
(s270 (/ 1.0 130.0))
(s271 (/ 1.0 130.0))
(s272 (/ 1.0 130.0))
(s273 (/ 1.0 130.0))
(s274 (/ 1.0 130.0))
(s275 (/ 1.0 130.0))
(s276 (/ 1.0 130.0))
(s277 (/ 61.0 65.0))
(s278 (/ 1.0 130.0))
(s279 (/ 1.0 130.0))
(s280 (/ 1.0 130.0))
(s281 (/ 1.0 130.0))
(s282 (/ 121.0 130.0))
(s284 (/ 1.0 130.0))
(s285 (/ 1.0 130.0))
(s286 (/ 1.0 130.0))
(s287 (/ 1.0 130.0))
(s288 (/ 1.0 130.0))
(s289 (/ 1.0 130.0))
(s290 (/ 1.0 130.0))
(s291 (/ 1.0 130.0))
(s292 (/ 1.0 130.0))
(s293 (/ 1.0 130.0))
(s294 (/ 1.0 130.0))
(s295 (/ 1.0 130.0))
(s297 (/ 1.0 130.0))
(s298 (/ 1.0 130.0))
(s299 (/ 1.0 130.0))
(s300 (/ 1.0 130.0))
(s301 (/ 1.0 130.0))
(s302 (/ 1.0 130.0))
(s309 (/ 1.0 130.0))
(s310 (/ 1.0 130.0))
(s311 (/ 1.0 130.0))
(s312 (/ 127.0 130.0))
(s313 0.0)
(s314 (/ 1.0 130.0))
(s315 (/ 1.0 130.0))
(s316 (/ 61.0 65.0))
(s317 (/ 1.0 130.0))
(s318 (/ 1.0 130.0))
(s319 (/ 1.0 130.0))
(s320 (/ 1.0 130.0))
(s321 (/ 1.0 130.0))
(s322 (/ 1.0 130.0))
(s323 0.0)
(s324 (/ 1.0 130.0))
(s325 (/ 1.0 130.0))
(s326 (/ 1.0 130.0))
(s327 (/ 127.0 130.0))
(s328 0.0)
(s329 (/ 1.0 130.0))
(s330 (/ 1.0 130.0))
(s331 (/ 1.0 130.0))
(s332 (/ 1.0 130.0))
(s333 (/ 1.0 130.0))
(s334 (/ 1.0 130.0))
(s335 (/ 1.0 130.0))
(s336 (/ 1.0 130.0))
(s337 (/ 1.0 130.0))
(s338 (/ 1.0 130.0))
(s339 (/ 1.0 130.0))
(s340 (/ 1.0 130.0))
(s341 (/ 1.0 130.0))
(s342 (/ 1.0 130.0))
(s343 (/ 1.0 130.0))
(s344 (/ 1.0 130.0))
(s345 (/ 1.0 130.0))
(s346 (/ 1.0 130.0))
(s347 (/ 1.0 130.0))
(s348 (/ 1.0 130.0))
(s349 (/ 1.0 130.0))
(s350 (/ 1.0 130.0))
(s351 (/ 1.0 130.0))
(s352 (/ 1.0 130.0))
(s353 (/ 1.0 130.0))
(s354 (/ 1.0 130.0))
(s355 (/ 1.0 130.0))
(s356 (/ 1.0 130.0))
(s357 (/ 1.0 130.0))
(s358 (/ 1.0 130.0))
(s359 (/ 1.0 130.0))
(s360 (/ 1.0 130.0))
(s361 (/ 1.0 130.0))
(s362 (/ 1.0 130.0))
(s363 (/ 1.0 130.0))
(s364 (/ 1.0 130.0))
(s365 (/ 1.0 130.0))
(s366 (/ 1.0 130.0))
(s368 0.0)
(s386 0.0)
(s387 (/ 48.0 65.0))
(s388 (/ 1.0 130.0))
(s389 (/ 1.0 130.0))
(s390 (/ 1.0 130.0))
(s391 (/ 1.0 130.0))
(s392 (/ 1.0 130.0))
(s393 (/ 1.0 130.0))
(s394 (/ 9.0 130.0))
(s395 (/ 1.0 130.0))
(s396 (/ 1.0 130.0))
(s397 (/ 1.0 130.0))
(s398 (/ 1.0 130.0))
(s399 (/ 1.0 130.0))
(s400 (/ 1.0 130.0))
(s401 (/ 1.0 130.0))
(s402 (/ 1.0 130.0))
(s403 (/ 1.0 130.0))
(s404 (/ 1.0 130.0))
(s405 (/ 1.0 130.0))
(s406 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 711/3622 variables, and 65 constraints, problems are : Problem set: 0 solved, 632 unsolved in 45027 ms.
Refiners :[Positive P Invariants (semi-flows): 42/63 constraints, Generalized P Invariants (flows): 23/147 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (OVERLAPS) 77/709 variables, 40/58 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/709 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2025-05-29 19:19:34] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 9 ms to minimize.
[2025-05-29 19:19:36] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/709 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/709 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 6 (OVERLAPS) 2/711 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/711 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 8 (OVERLAPS) 402/1113 variables, 59/126 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2025-05-29 19:19:58] [INFO ] Deduced a trap composed of 129 places in 233 ms of which 4 ms to minimize.
[2025-05-29 19:19:58] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 2 ms to minimize.
[2025-05-29 19:19:58] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 5 ms to minimize.
[2025-05-29 19:19:59] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 11 ms to minimize.
[2025-05-29 19:19:59] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 2 ms to minimize.
[2025-05-29 19:19:59] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2025-05-29 19:20:00] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2025-05-29 19:20:01] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 2 ms to minimize.
[2025-05-29 19:20:02] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 2 ms to minimize.
[2025-05-29 19:20:04] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 2 ms to minimize.
[2025-05-29 19:20:05] [INFO ] Deduced a trap composed of 66 places in 134 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1113/3622 variables, and 137 constraints, problems are : Problem set: 0 solved, 632 unsolved in 45032 ms.
Refiners :[Positive P Invariants (semi-flows): 42/63 constraints, Generalized P Invariants (flows): 82/147 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/632 constraints, Known Traps: 13/13 constraints]
After SMT, in 90399ms problems are : Problem set: 0 solved, 632 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 632 out of 1507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1507/1507 places, 2115/2115 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 1507 transition count 2075
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 1467 transition count 2075
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 80 place count 1467 transition count 2030
Deduced a syphon composed of 45 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 172 place count 1420 transition count 2030
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 174 place count 1420 transition count 2028
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 176 place count 1418 transition count 2028
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 35 rules applied. Total rules applied 211 place count 1400 transition count 2011
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 212 place count 1400 transition count 2010
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 213 place count 1399 transition count 2010
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 213 place count 1399 transition count 2009
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 215 place count 1398 transition count 2009
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 216 place count 1397 transition count 2009
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 218 place count 1396 transition count 2008
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 219 place count 1395 transition count 2007
Iterating global reduction 7 with 1 rules applied. Total rules applied 220 place count 1395 transition count 2007
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 225 place count 1395 transition count 2002
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 11 rules applied. Total rules applied 236 place count 1388 transition count 1998
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 238 place count 1386 transition count 1998
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 239 place count 1386 transition count 1998
Applied a total of 239 rules in 377 ms. Remains 1386 /1507 variables (removed 121) and now considering 1998/2115 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 377 ms. Remains : 1386/1507 places, 1998/2115 transitions.
RANDOM walk for 2294659 steps (24907 resets) in 120008 ms. (19 steps per ms) remains 611/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4003 steps (9 resets) in 20 ms. (190 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 611/611 properties
Probabilistic random walk after 1000000 steps, saw 200126 distinct states, run finished after 21452 ms. (steps per millisecond=46 ) properties seen :33
// Phase 1: matrix 1998 rows 1386 cols
[2025-05-29 19:20:59] [INFO ] Computed 204 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (OVERLAPS) 41/619 variables, 37/53 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/619 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (OVERLAPS) 1/620 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/620 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 7 (OVERLAPS) 241/861 variables, 42/100 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/861 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 9 (OVERLAPS) 46/907 variables, 7/107 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/907 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 11 (OVERLAPS) 1/908 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/3384 variables, and 108 constraints, problems are : Problem set: 0 solved, 578 unsolved in 75027 ms.
Refiners :[Positive P Invariants (semi-flows): 46/63 constraints, Generalized P Invariants (flows): 62/141 constraints, State Equation: 0/1386 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 578 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (OVERLAPS) 41/619 variables, 37/53 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/619 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (OVERLAPS) 1/620 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/620 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 7 (OVERLAPS) 241/861 variables, 42/100 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2025-05-29 19:22:35] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 3 ms to minimize.
[2025-05-29 19:22:35] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 2 ms to minimize.
[2025-05-29 19:22:35] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 2 ms to minimize.
[2025-05-29 19:22:35] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 3 ms to minimize.
[2025-05-29 19:22:36] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2025-05-29 19:22:36] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2025-05-29 19:22:37] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 2 ms to minimize.
[2025-05-29 19:22:38] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 3 ms to minimize.
[2025-05-29 19:22:40] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 2 ms to minimize.
[2025-05-29 19:22:40] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2025-05-29 19:22:41] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 2 ms to minimize.
[2025-05-29 19:22:43] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 2 ms to minimize.
[2025-05-29 19:22:44] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 1 ms to minimize.
[2025-05-29 19:22:44] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2025-05-29 19:22:45] [INFO ] Deduced a trap composed of 68 places in 179 ms of which 3 ms to minimize.
[2025-05-29 19:22:45] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 4 ms to minimize.
[2025-05-29 19:22:46] [INFO ] Deduced a trap composed of 46 places in 238 ms of which 4 ms to minimize.
[2025-05-29 19:22:47] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2025-05-29 19:22:48] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 4 ms to minimize.
[2025-05-29 19:22:48] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/861 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2025-05-29 19:22:49] [INFO ] Deduced a trap composed of 74 places in 168 ms of which 2 ms to minimize.
[2025-05-29 19:22:53] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2025-05-29 19:22:58] [INFO ] Deduced a trap composed of 58 places in 224 ms of which 4 ms to minimize.
[2025-05-29 19:22:58] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 4 ms to minimize.
[2025-05-29 19:23:03] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 3 ms to minimize.
[2025-05-29 19:23:04] [INFO ] Deduced a trap composed of 101 places in 195 ms of which 3 ms to minimize.
[2025-05-29 19:23:07] [INFO ] Deduced a trap composed of 70 places in 227 ms of which 6 ms to minimize.
[2025-05-29 19:23:08] [INFO ] Deduced a trap composed of 27 places in 246 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/861 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2025-05-29 19:23:14] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 2 ms to minimize.
[2025-05-29 19:23:25] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 2 ms to minimize.
[2025-05-29 19:23:26] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 861/3384 variables, and 131 constraints, problems are : Problem set: 0 solved, 578 unsolved in 75023 ms.
Refiners :[Positive P Invariants (semi-flows): 38/63 constraints, Generalized P Invariants (flows): 62/141 constraints, State Equation: 0/1386 constraints, PredecessorRefiner: 0/578 constraints, Known Traps: 31/31 constraints]
After SMT, in 150299ms problems are : Problem set: 0 solved, 578 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 578 out of 1386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1386/1386 places, 1998/1998 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 1386 transition count 1979
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1367 transition count 1979
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 38 place count 1367 transition count 1967
Deduced a syphon composed of 12 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 64 place count 1353 transition count 1967
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 65 place count 1353 transition count 1966
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 1352 transition count 1966
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 66 place count 1352 transition count 1965
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 69 place count 1350 transition count 1965
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 69 place count 1350 transition count 1964
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 1349 transition count 1964
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 76 place count 1346 transition count 1962
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 76 place count 1346 transition count 1959
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 82 place count 1343 transition count 1959
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 83 place count 1342 transition count 1959
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 85 place count 1341 transition count 1958
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 86 place count 1340 transition count 1957
Iterating global reduction 5 with 1 rules applied. Total rules applied 87 place count 1340 transition count 1957
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 88 place count 1340 transition count 1956
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 90 place count 1339 transition count 1955
Applied a total of 90 rules in 163 ms. Remains 1339 /1386 variables (removed 47) and now considering 1955/1998 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 1339/1386 places, 1955/1998 transitions.
RANDOM walk for 3721497 steps (41120 resets) in 120004 ms. (31 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 578/578 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 578/578 properties
Probabilistic random walk after 1000000 steps, saw 246364 distinct states, run finished after 26318 ms. (steps per millisecond=37 ) properties seen :0
// Phase 1: matrix 1955 rows 1339 cols
[2025-05-29 19:24:26] [INFO ] Computed 199 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (OVERLAPS) 40/618 variables, 37/53 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/618 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (OVERLAPS) 1/619 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/619 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 7 (OVERLAPS) 238/857 variables, 42/100 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/857 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 9 (OVERLAPS) 29/886 variables, 7/107 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/886 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 11 (OVERLAPS) 2/888 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/888 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 13 (OVERLAPS) 153/1041 variables, 32/141 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 1.0 216.0))
(s1 (/ 1.0 216.0))
(s2 (/ 13.0 216.0))
(s3 (/ 85.0 108.0))
(s4 (/ 1.0 216.0))
(s5 (/ 1.0 216.0))
(s6 (/ 1.0 216.0))
(s7 (/ 1.0 216.0))
(s8 (/ 1.0 216.0))
(s9 (/ 1.0 216.0))
(s10 (/ 1.0 216.0))
(s11 (/ 1.0 216.0))
(s12 (/ 1.0 216.0))
(s13 (/ 1.0 216.0))
(s14 (/ 1.0 216.0))
(s15 (/ 1.0 216.0))
(s16 (/ 1.0 216.0))
(s17 (/ 1.0 216.0))
(s18 (/ 1.0 216.0))
(s19 (/ 1.0 216.0))
(s20 (/ 1.0 216.0))
(s21 (/ 1.0 216.0))
(s22 (/ 1.0 216.0))
(s23 (/ 1.0 216.0))
(s24 (/ 1.0 216.0))
(s25 (/ 1.0 216.0))
(s26 (/ 1.0 216.0))
(s27 (/ 1.0 216.0))
(s28 (/ 1.0 216.0))
(s29 (/ 1.0 216.0))
(s30 (/ 1.0 216.0))
(s31 (/ 1.0 216.0))
(s32 (/ 1.0 216.0))
(s33 (/ 1.0 216.0))
(s34 (/ 1.0 216.0))
(s35 0.0)
(s36 (/ 1.0 216.0))
(s37 (/ 1.0 216.0))
(s38 (/ 1.0 72.0))
(s39 (/ 1.0 216.0))
(s40 (/ 1.0 36.0))
(s41 (/ 1.0 216.0))
(s42 (/ 203.0 216.0))
(s43 0.0)
(s44 (/ 1.0 216.0))
(s45 (/ 1.0 216.0))
(s46 (/ 1.0 216.0))
(s47 (/ 1.0 216.0))
(s48 (/ 1.0 216.0))
(s49 (/ 23.0 27.0))
(s50 (/ 1.0 24.0))
(s51 (/ 1.0 216.0))
(s52 (/ 1.0 216.0))
(s53 (/ 1.0 216.0))
(s54 (/ 1.0 216.0))
(s55 (/ 1.0 216.0))
(s56 (/ 1.0 216.0))
(s57 (/ 1.0 216.0))
(s58 (/ 1.0 216.0))
(s59 (/ 1.0 216.0))
(s60 (/ 1.0 216.0))
(s61 (/ 1.0 216.0))
(s62 (/ 1.0 216.0))
(s63 (/ 1.0 216.0))
(s64 (/ 1.0 216.0))
(s65 (/ 1.0 216.0))
(s66 (/ 1.0 216.0))
(s67 (/ 1.0 216.0))
(s68 (/ 1.0 216.0))
(s69 (/ 1.0 216.0))
(s70 (/ 179.0 216.0))
(s71 (/ 1.0 216.0))
(s72 (/ 1.0 216.0))
(s73 (/ 1.0 216.0))
(s74 (/ 1.0 216.0))
(s75 (/ 1.0 216.0))
(s76 (/ 1.0 216.0))
(s77 (/ 1.0 216.0))
(s78 (/ 1.0 216.0))
(s79 (/ 1.0 216.0))
(s80 (/ 1.0 216.0))
(s81 (/ 1.0 216.0))
(s82 (/ 1.0 216.0))
(s83 (/ 1.0 216.0))
(s84 (/ 1.0 216.0))
(s85 (/ 1.0 216.0))
(s86 (/ 1.0 216.0))
(s87 (/ 1.0 216.0))
(s88 (/ 1.0 216.0))
(s89 (/ 1.0 216.0))
(s90 (/ 1.0 216.0))
(s91 (/ 1.0 216.0))
(s92 (/ 1.0 216.0))
(s93 (/ 1.0 216.0))
(s94 (/ 1.0 216.0))
(s95 (/ 1.0 216.0))
(s96 (/ 1.0 216.0))
(s97 (/ 1.0 216.0))
(s98 (/ 1.0 216.0))
(s99 (/ 1.0 216.0))
(s100 (/ 1.0 216.0))
(s101 (/ 1.0 216.0))
(s102 (/ 1.0 216.0))
(s103 (/ 1.0 216.0))
(s104 (/ 1.0 216.0))
(s105 (/ 1.0 216.0))
(s106 (/ 1.0 216.0))
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 (/ 91.0 108.0))
(s128 (/ 1.0 216.0))
(s129 (/ 1.0 216.0))
(s130 (/ 1.0 216.0))
(s131 (/ 1.0 24.0))
(s132 (/ 1.0 216.0))
(s133 (/ 1.0 216.0))
(s134 (/ 1.0 216.0))
(s135 (/ 1.0 216.0))
(s136 (/ 1.0 216.0))
(s137 (/ 1.0 216.0))
(s138 (/ 1.0 216.0))
(s139 (/ 1.0 216.0))
(s140 (/ 1.0 216.0))
(s141 (/ 1.0 216.0))
(s142 (/ 1.0 216.0))
(s143 (/ 1.0 216.0))
(s144 (/ 1.0 216.0))
(s145 (/ 1.0 216.0))
(s146 (/ 1.0 216.0))
(s147 (/ 1.0 216.0))
(s148 (/ 1.0 216.0))
(s149 (/ 1.0 216.0))
(s150 (/ 1.0 216.0))
(s151 (/ 1.0 216.0))
(s152 (/ 1.0 216.0))
(s153 (/ 1.0 216.0))
(s154 (/ 1.0 216.0))
(s155 (/ 1.0 216.0))
(s156 (/ 1.0 216.0))
(s157 (/ 1.0 216.0))
(s158 (/ 1.0 216.0))
(s159 (/ 1.0 216.0))
(s160 (/ 1.0 216.0))
(s161 (/ 1.0 216.0))
(s162 (/ 1.0 2.0))
(s163 (/ 1.0 216.0))
(s164 (/ 1.0 216.0))
(s165 (/ 1.0 216.0))
(s166 (/ 1.0 216.0))
(s167 (/ 1.0 216.0))
(s168 (/ 1.0 216.0))
(s169 (/ 1.0 216.0))
(s170 (/ 1.0 216.0))
(s171 (/ 1.0 216.0))
(s172 (/ 1.0 216.0))
(s173 (/ 4.0 27.0))
(s174 (/ 1.0 216.0))
(s175 (/ 1.0 216.0))
(s176 (/ 1.0 216.0))
(s177 (/ 1.0 216.0)timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1041/3294 variables, and 141 constraints, problems are : Problem set: 0 solved, 578 unsolved in 90020 ms.
Refiners :[Positive P Invariants (semi-flows): 47/62 constraints, Generalized P Invariants (flows): 94/137 constraints, State Equation: 0/1339 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 578 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (OVERLAPS) 40/618 variables, 37/53 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/618 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (OVERLAPS) 1/619 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/619 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 7 (OVERLAPS) 238/857 variables, 42/100 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2025-05-29 19:26:16] [INFO ] Deduced a trap composed of 43 places in 269 ms of which 4 ms to minimize.
[2025-05-29 19:26:16] [INFO ] Deduced a trap composed of 62 places in 165 ms of which 2 ms to minimize.
[2025-05-29 19:26:17] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 2 ms to minimize.
[2025-05-29 19:26:17] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 2 ms to minimize.
[2025-05-29 19:26:17] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 2 ms to minimize.
[2025-05-29 19:26:17] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 2 ms to minimize.
[2025-05-29 19:26:17] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
[2025-05-29 19:26:18] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2025-05-29 19:26:19] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2025-05-29 19:26:20] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 2 ms to minimize.
[2025-05-29 19:26:20] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 3 ms to minimize.
[2025-05-29 19:26:22] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 6 ms to minimize.
[2025-05-29 19:26:22] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 2 ms to minimize.
[2025-05-29 19:26:22] [INFO ] Deduced a trap composed of 68 places in 137 ms of which 1 ms to minimize.
[2025-05-29 19:26:23] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 5 ms to minimize.
[2025-05-29 19:26:26] [INFO ] Deduced a trap composed of 68 places in 191 ms of which 3 ms to minimize.
[2025-05-29 19:26:27] [INFO ] Deduced a trap composed of 40 places in 235 ms of which 4 ms to minimize.
[2025-05-29 19:26:27] [INFO ] Deduced a trap composed of 45 places in 223 ms of which 3 ms to minimize.
[2025-05-29 19:26:29] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 2 ms to minimize.
[2025-05-29 19:26:29] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/857 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2025-05-29 19:26:33] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2025-05-29 19:26:36] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 2 ms to minimize.
[2025-05-29 19:26:41] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 3 ms to minimize.
[2025-05-29 19:26:42] [INFO ] Deduced a trap composed of 75 places in 241 ms of which 4 ms to minimize.
[2025-05-29 19:26:44] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 4 ms to minimize.
[2025-05-29 19:26:47] [INFO ] Deduced a trap composed of 34 places in 261 ms of which 4 ms to minimize.
[2025-05-29 19:26:47] [INFO ] Deduced a trap composed of 50 places in 335 ms of which 5 ms to minimize.
[2025-05-29 19:26:48] [INFO ] Deduced a trap composed of 27 places in 271 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/857 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2025-05-29 19:26:51] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/857 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2025-05-29 19:27:09] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/857 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 857/3294 variables, and 130 constraints, problems are : Problem set: 0 solved, 578 unsolved in 90025 ms.
Refiners :[Positive P Invariants (semi-flows): 38/62 constraints, Generalized P Invariants (flows): 62/137 constraints, State Equation: 0/1339 constraints, PredecessorRefiner: 0/578 constraints, Known Traps: 30/30 constraints]
After SMT, in 180272ms problems are : Problem set: 0 solved, 578 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 578 out of 1339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1339/1339 places, 1955/1955 transitions.
Applied a total of 0 rules in 26 ms. Remains 1339 /1339 variables (removed 0) and now considering 1955/1955 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 1339/1339 places, 1955/1955 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1339/1339 places, 1955/1955 transitions.
Applied a total of 0 rules in 25 ms. Remains 1339 /1339 variables (removed 0) and now considering 1955/1955 (removed 0) transitions.
[2025-05-29 19:27:26] [INFO ] Invariant cache hit.
[2025-05-29 19:27:27] [INFO ] Implicit Places using invariants in 625 ms returned [108, 312, 353, 518, 545, 570, 734, 761, 764, 781, 799, 918, 939, 940, 942, 959, 977, 996, 1046, 1047, 1058, 1059, 1061, 1078, 1096, 1165, 1169, 1170, 1173, 1184, 1185, 1186, 1204, 1206, 1210, 1228, 1229, 1230, 1231, 1243, 1249, 1255, 1261, 1267, 1273, 1279, 1285, 1291, 1297, 1303]
[2025-05-29 19:27:27] [INFO ] Actually due to overlaps returned [1204, 1186, 108, 353, 570, 781, 959, 1078, 1210, 764, 942, 1061, 940, 1058, 1184, 1228, 312, 545, 761, 939, 1059, 1185, 1206, 1229, 518, 734, 918, 1046, 1047, 1169, 1170, 799, 1096, 1230, 1273, 1291, 1303, 977, 996, 1173, 1231, 1243, 1249, 1255, 1261, 1267, 1279, 1285, 1297]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 636 ms to find 49 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1290/1339 places, 1955/1955 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 1289 transition count 1868
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 176 place count 1202 transition count 1867
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 176 place count 1202 transition count 1850
Deduced a syphon composed of 17 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 35 rules applied. Total rules applied 211 place count 1184 transition count 1850
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 223 place count 1180 transition count 1842
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 231 place count 1172 transition count 1842
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 246 place count 1157 transition count 1827
Iterating global reduction 4 with 15 rules applied. Total rules applied 261 place count 1157 transition count 1827
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 264 place count 1157 transition count 1824
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 264 place count 1157 transition count 1823
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 266 place count 1156 transition count 1823
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 269 place count 1153 transition count 1817
Iterating global reduction 5 with 3 rules applied. Total rules applied 272 place count 1153 transition count 1817
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 273 place count 1152 transition count 1816
Iterating global reduction 5 with 1 rules applied. Total rules applied 274 place count 1152 transition count 1816
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 275 place count 1151 transition count 1814
Iterating global reduction 5 with 1 rules applied. Total rules applied 276 place count 1151 transition count 1814
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 360 place count 1109 transition count 1772
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 361 place count 1109 transition count 1771
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 362 place count 1108 transition count 1770
Iterating global reduction 6 with 1 rules applied. Total rules applied 363 place count 1108 transition count 1770
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 364 place count 1108 transition count 1769
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 368 place count 1106 transition count 1770
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 7 with 15 rules applied. Total rules applied 383 place count 1106 transition count 1755
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 399 place count 1090 transition count 1755
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 414 place count 1090 transition count 1755
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 415 place count 1090 transition count 1755
Applied a total of 415 rules in 249 ms. Remains 1090 /1290 variables (removed 200) and now considering 1755/1955 (removed 200) transitions.
// Phase 1: matrix 1755 rows 1090 cols
[2025-05-29 19:27:27] [INFO ] Computed 143 invariants in 20 ms
[2025-05-29 19:27:27] [INFO ] Implicit Places using invariants in 455 ms returned [236, 278, 279, 470, 498, 499, 669, 697, 698, 823, 829, 832, 834, 854, 855, 929, 935, 938, 940, 945, 946, 998, 1015, 1021, 1024, 1026]
[2025-05-29 19:27:27] [INFO ] Actually due to overlaps returned [278, 498, 697, 854, 945, 279, 499, 698, 946, 855, 823, 829, 834, 929, 935, 940, 1015, 1021, 1026, 236, 470, 669, 998]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 458 ms to find 23 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1067/1339 places, 1755/1955 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1056 transition count 1744
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1056 transition count 1744
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 1053 transition count 1741
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 1053 transition count 1741
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 38 place count 1048 transition count 1736
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 47 place count 1048 transition count 1727
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 56 place count 1039 transition count 1727
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1039 transition count 1726
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 1038 transition count 1726
Applied a total of 58 rules in 101 ms. Remains 1038 /1067 variables (removed 29) and now considering 1726/1755 (removed 29) transitions.
// Phase 1: matrix 1726 rows 1038 cols
[2025-05-29 19:27:27] [INFO ] Computed 120 invariants in 23 ms
[2025-05-29 19:27:28] [INFO ] Implicit Places using invariants in 398 ms returned []
[2025-05-29 19:27:28] [INFO ] Invariant cache hit.
[2025-05-29 19:27:29] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 1731 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1038/1339 places, 1726/1955 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3201 ms. Remains : 1038/1339 places, 1726/1955 transitions.
RANDOM walk for 3896819 steps (59433 resets) in 120004 ms. (32 steps per ms) remains 569/578 properties
BEST_FIRST walk for 4003 steps (11 resets) in 39 ms. (100 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 27 ms. (143 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (9 resets) in 28 ms. (138 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (9 resets) in 42 ms. (93 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (10 resets) in 27 ms. (142 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 47 ms. (83 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 61 ms. (64 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 26 ms. (148 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4001 steps (10 resets) in 55 ms. (71 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 50 ms. (78 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 47 ms. (83 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 27 ms. (142 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 51 ms. (77 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 48 ms. (81 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4001 steps (9 resets) in 53 ms. (74 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 31 ms. (125 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (9 resets) in 53 ms. (74 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 52 ms. (75 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 46 ms. (85 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 50 ms. (78 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 44 ms. (88 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 26 ms. (148 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 58 ms. (67 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 48 ms. (81 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 41 ms. (95 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 45 ms. (87 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 31 ms. (125 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (9 resets) in 43 ms. (90 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 51 ms. (76 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (10 resets) in 54 ms. (72 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4001 steps (9 resets) in 54 ms. (72 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 55 ms. (71 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 28 ms. (138 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 44 ms. (88 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 52 ms. (75 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (9 resets) in 46 ms. (85 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 43 ms. (91 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 41 ms. (95 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 40 ms. (97 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 39 ms. (100 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 51 ms. (76 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 45 ms. (87 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 32 ms. (121 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 52 ms. (75 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 40 ms. (97 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (9 resets) in 52 ms. (75 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 62 ms. (63 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 55 ms. (71 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 41 ms. (95 steps per ms) remains 569/569 properties
Probabilistic random walk after 1000001 steps, saw 186928 distinct states, run finished after 22335 ms. (steps per millisecond=44 ) properties seen :0
[2025-05-29 19:28:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (OVERLAPS) 21/590 variables, 32/53 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 5 (OVERLAPS) 258/848 variables, 32/89 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/848 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 7 (OVERLAPS) 6/854 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/854 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 9 (OVERLAPS) 92/946 variables, 13/106 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/946 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 11 (OVERLAPS) 17/963 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/963 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 13 (OVERLAPS) 51/1014 variables, 7/116 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1014 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 15 (OVERLAPS) 22/1036 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1036/2764 variables, and 119 constraints, problems are : Problem set: 0 solved, 569 unsolved in 105031 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 77/78 constraints, State Equation: 0/1038 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (OVERLAPS) 21/590 variables, 32/53 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2025-05-29 19:30:13] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:30:15] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/590 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 6 (OVERLAPS) 258/848 variables, 32/91 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2025-05-29 19:30:27] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
[2025-05-29 19:30:27] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
[2025-05-29 19:30:29] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 2 ms to minimize.
[2025-05-29 19:30:30] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 3 ms to minimize.
[2025-05-29 19:30:31] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 1 ms to minimize.
[2025-05-29 19:30:31] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 1 ms to minimize.
[2025-05-29 19:30:32] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 1 ms to minimize.
[2025-05-29 19:30:34] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 2 ms to minimize.
[2025-05-29 19:30:34] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 2 ms to minimize.
[2025-05-29 19:30:35] [INFO ] Deduced a trap composed of 77 places in 180 ms of which 3 ms to minimize.
[2025-05-29 19:30:35] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 3 ms to minimize.
[2025-05-29 19:30:35] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 3 ms to minimize.
[2025-05-29 19:30:36] [INFO ] Deduced a trap composed of 51 places in 234 ms of which 3 ms to minimize.
[2025-05-29 19:30:36] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 4 ms to minimize.
[2025-05-29 19:30:37] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 2 ms to minimize.
[2025-05-29 19:30:38] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 1 ms to minimize.
[2025-05-29 19:30:41] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 3 ms to minimize.
[2025-05-29 19:30:41] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 4 ms to minimize.
[2025-05-29 19:30:42] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 4 ms to minimize.
[2025-05-29 19:30:43] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/848 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2025-05-29 19:30:47] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2025-05-29 19:30:47] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2025-05-29 19:30:48] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 1 ms to minimize.
[2025-05-29 19:30:49] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 2 ms to minimize.
[2025-05-29 19:30:52] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/848 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2025-05-29 19:31:09] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2025-05-29 19:31:17] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2025-05-29 19:31:20] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 2 ms to minimize.
[2025-05-29 19:31:20] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 2 ms to minimize.
[2025-05-29 19:31:22] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/848 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2025-05-29 19:31:38] [INFO ] Deduced a trap composed of 74 places in 140 ms of which 2 ms to minimize.
[2025-05-29 19:31:38] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/848 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 848/2764 variables, and 123 constraints, problems are : Problem set: 0 solved, 569 unsolved in 105023 ms.
Refiners :[Positive P Invariants (semi-flows): 32/42 constraints, Generalized P Invariants (flows): 57/78 constraints, State Equation: 0/1038 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 34/34 constraints]
After SMT, in 210194ms problems are : Problem set: 0 solved, 569 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 569 out of 1038 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1038/1038 places, 1726/1726 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1038 transition count 1719
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 1031 transition count 1719
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 1031 transition count 1718
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 1030 transition count 1718
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 1030 transition count 1718
Applied a total of 18 rules in 50 ms. Remains 1030 /1038 variables (removed 8) and now considering 1718/1726 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1030/1038 places, 1718/1726 transitions.
RANDOM walk for 3956598 steps (60095 resets) in 119651 ms. (33 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 64 ms. (61 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (9 resets) in 24 ms. (160 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 36 ms. (108 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 55 ms. (71 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (9 resets) in 63 ms. (62 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 49 ms. (80 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4001 steps (10 resets) in 28 ms. (137 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 49 ms. (80 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 55 ms. (71 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 46 ms. (85 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (9 resets) in 61 ms. (64 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 29 ms. (133 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (10 resets) in 46 ms. (85 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 39 ms. (100 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 38 ms. (102 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 60 ms. (65 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4001 steps (11 resets) in 55 ms. (71 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 32 ms. (121 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (9 resets) in 56 ms. (70 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (9 resets) in 50 ms. (78 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (10 resets) in 40 ms. (97 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 51 ms. (77 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (10 resets) in 46 ms. (85 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 48 ms. (81 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 56 ms. (70 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (11 resets) in 40 ms. (97 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4001 steps (11 resets) in 60 ms. (65 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 44 ms. (88 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 67 ms. (58 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 43 ms. (91 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 43 ms. (91 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 49 ms. (80 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 46 ms. (85 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 26 ms. (148 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 60 ms. (65 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 41 ms. (95 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 45 ms. (87 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 44 ms. (88 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 43 ms. (90 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 47 ms. (83 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 50 ms. (78 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 48 ms. (81 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (12 resets) in 49 ms. (80 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 31 ms. (125 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 45 ms. (87 steps per ms) remains 569/569 properties
Probabilistic random walk after 1000001 steps, saw 186928 distinct states, run finished after 19227 ms. (steps per millisecond=52 ) properties seen :0
// Phase 1: matrix 1718 rows 1030 cols
[2025-05-29 19:32:42] [INFO ] Computed 120 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (OVERLAPS) 21/590 variables, 32/51 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 5 (OVERLAPS) 243/833 variables, 35/90 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/833 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 7 (OVERLAPS) 6/839 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/839 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 9 (OVERLAPS) 108/947 variables, 12/106 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/947 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 11 (OVERLAPS) 48/995 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/995 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 13 (OVERLAPS) 35/1030 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1030 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 15 (OVERLAPS) 1718/2748 variables, 1030/1150 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2748 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2748/2748 variables, and 1150 constraints, problems are : Problem set: 0 solved, 569 unsolved in 120020 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 1030/1030 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (OVERLAPS) 21/590 variables, 32/51 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2025-05-29 19:34:48] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:34:48] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:34:49] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2025-05-29 19:34:51] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/590 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 6 (OVERLAPS) 243/833 variables, 35/94 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2025-05-29 19:35:02] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 3 ms to minimize.
[2025-05-29 19:35:02] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2025-05-29 19:35:03] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 1 ms to minimize.
[2025-05-29 19:35:03] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 2 ms to minimize.
[2025-05-29 19:35:03] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 2 ms to minimize.
[2025-05-29 19:35:05] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 1 ms to minimize.
[2025-05-29 19:35:05] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 2 ms to minimize.
[2025-05-29 19:35:05] [INFO ] Deduced a trap composed of 53 places in 186 ms of which 2 ms to minimize.
[2025-05-29 19:35:07] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 1 ms to minimize.
[2025-05-29 19:35:07] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 2 ms to minimize.
[2025-05-29 19:35:10] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 2 ms to minimize.
[2025-05-29 19:35:10] [INFO ] Deduced a trap composed of 68 places in 176 ms of which 3 ms to minimize.
[2025-05-29 19:35:10] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 2 ms to minimize.
[2025-05-29 19:35:10] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2025-05-29 19:35:11] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 1 ms to minimize.
[2025-05-29 19:35:11] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 4 ms to minimize.
[2025-05-29 19:35:13] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 3 ms to minimize.
[2025-05-29 19:35:14] [INFO ] Deduced a trap composed of 67 places in 182 ms of which 3 ms to minimize.
[2025-05-29 19:35:16] [INFO ] Deduced a trap composed of 56 places in 228 ms of which 5 ms to minimize.
[2025-05-29 19:35:17] [INFO ] Deduced a trap composed of 48 places in 221 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/833 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2025-05-29 19:35:25] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 3 ms to minimize.
[2025-05-29 19:35:26] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 3 ms to minimize.
[2025-05-29 19:35:27] [INFO ] Deduced a trap composed of 72 places in 144 ms of which 3 ms to minimize.
[2025-05-29 19:35:27] [INFO ] Deduced a trap composed of 75 places in 145 ms of which 3 ms to minimize.
[2025-05-29 19:35:27] [INFO ] Deduced a trap composed of 80 places in 204 ms of which 3 ms to minimize.
[2025-05-29 19:35:27] [INFO ] Deduced a trap composed of 92 places in 200 ms of which 4 ms to minimize.
[2025-05-29 19:35:30] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 3 ms to minimize.
[2025-05-29 19:35:32] [INFO ] Deduced a trap composed of 46 places in 244 ms of which 4 ms to minimize.
[2025-05-29 19:35:35] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/833 variables, 9/123 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/833 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 10 (OVERLAPS) 6/839 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 12 (OVERLAPS) 108/947 variables, 12/139 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2025-05-29 19:36:13] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 2 ms to minimize.
[2025-05-29 19:36:30] [INFO ] Deduced a trap composed of 34 places in 273 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/947 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 947/2748 variables, and 141 constraints, problems are : Problem set: 0 solved, 569 unsolved in 120030 ms.
Refiners :[Positive P Invariants (semi-flows): 36/41 constraints, Generalized P Invariants (flows): 70/79 constraints, State Equation: 0/1030 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 35/35 constraints]
After SMT, in 240210ms problems are : Problem set: 0 solved, 569 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 569 out of 1030 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1030/1030 places, 1718/1718 transitions.
Applied a total of 0 rules in 17 ms. Remains 1030 /1030 variables (removed 0) and now considering 1718/1718 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1030/1030 places, 1718/1718 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1030/1030 places, 1718/1718 transitions.
Applied a total of 0 rules in 18 ms. Remains 1030 /1030 variables (removed 0) and now considering 1718/1718 (removed 0) transitions.
[2025-05-29 19:36:43] [INFO ] Invariant cache hit.
[2025-05-29 19:36:43] [INFO ] Implicit Places using invariants in 379 ms returned []
[2025-05-29 19:36:43] [INFO ] Invariant cache hit.
[2025-05-29 19:36:44] [INFO ] Implicit Places using invariants and state equation in 1271 ms returned []
Implicit Place search using SMT with State Equation took 1653 ms to find 0 implicit places.
[2025-05-29 19:36:44] [INFO ] Redundant transitions in 89 ms returned []
Running 1681 sub problems to find dead transitions.
[2025-05-29 19:36:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1029 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1029 variables, 78/116 constraints. Problems are: Problem set: 0 solved, 1681 unsolved
[2025-05-29 19:37:09] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2025-05-29 19:37:09] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 2 ms to minimize.
[2025-05-29 19:37:09] [INFO ] Deduced a trap composed of 61 places in 169 ms of which 2 ms to minimize.
[2025-05-29 19:37:10] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 2 ms to minimize.
[2025-05-29 19:37:11] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2025-05-29 19:37:11] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 2 ms to minimize.
[2025-05-29 19:37:11] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 2 ms to minimize.
[2025-05-29 19:37:12] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 2 ms to minimize.
[2025-05-29 19:37:13] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2025-05-29 19:37:14] [INFO ] Deduced a trap composed of 81 places in 193 ms of which 3 ms to minimize.
[2025-05-29 19:37:14] [INFO ] Deduced a trap composed of 70 places in 190 ms of which 3 ms to minimize.
[2025-05-29 19:37:14] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 2 ms to minimize.
[2025-05-29 19:37:15] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 2 ms to minimize.
[2025-05-29 19:37:15] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1029/2748 variables, and 130 constraints, problems are : Problem set: 0 solved, 1681 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 38/41 constraints, Generalized P Invariants (flows): 78/79 constraints, State Equation: 0/1030 constraints, PredecessorRefiner: 1681/1681 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1681 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1029 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1029 variables, 78/116 constraints. Problems are: Problem set: 0 solved, 1681 unsolved
Problem TDEAD1008 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1097 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1029 variables, 14/130 constraints. Problems are: Problem set: 12 solved, 1669 unsolved
[2025-05-29 19:37:17] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2025-05-29 19:37:24] [INFO ] Deduced a trap composed of 69 places in 175 ms of which 3 ms to minimize.
[2025-05-29 19:37:24] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 2 ms to minimize.
[2025-05-29 19:37:24] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2025-05-29 19:37:24] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2025-05-29 19:37:25] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2025-05-29 19:37:26] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2025-05-29 19:37:26] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 2 ms to minimize.
[2025-05-29 19:37:28] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 2 ms to minimize.
[2025-05-29 19:37:28] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 1 ms to minimize.
[2025-05-29 19:37:30] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 1 ms to minimize.
[2025-05-29 19:37:43] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1029/2748 variables, and 142 constraints, problems are : Problem set: 12 solved, 1669 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 38/41 constraints, Generalized P Invariants (flows): 78/79 constraints, State Equation: 0/1030 constraints, PredecessorRefiner: 0/1681 constraints, Known Traps: 26/26 constraints]
After SMT, in 60979ms problems are : Problem set: 12 solved, 1669 unsolved
Search for dead transitions found 12 dead transitions in 60998ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 1030/1030 places, 1706/1718 transitions.
Applied a total of 0 rules in 18 ms. Remains 1030 /1030 variables (removed 0) and now considering 1706/1706 (removed 0) transitions.
[2025-05-29 19:37:46] [INFO ] Redundant transitions in 89 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62902 ms. Remains : 1030/1030 places, 1706/1718 transitions.
RANDOM walk for 1419430 steps (21726 resets) in 120004 ms. (11 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (9 resets) in 71 ms. (55 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (10 resets) in 76 ms. (51 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 23 ms. (166 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (9 resets) in 62 ms. (63 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 52 ms. (75 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 47 ms. (83 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 53 ms. (74 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (10 resets) in 40 ms. (97 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (9 resets) in 71 ms. (55 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 61 ms. (64 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 50 ms. (78 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 73 ms. (54 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 62 ms. (63 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (9 resets) in 51 ms. (76 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 46 ms. (85 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 42 ms. (93 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 59 ms. (66 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 26 ms. (148 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 48 ms. (81 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (10 resets) in 45 ms. (87 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 61 ms. (64 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 55 ms. (71 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 47 ms. (83 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (9 resets) in 49 ms. (80 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 36 ms. (108 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 61 ms. (64 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 61 ms. (64 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (9 resets) in 56 ms. (70 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 41 ms. (95 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 42 ms. (93 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 52 ms. (75 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 45 ms. (87 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 59 ms. (66 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 59 ms. (66 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (9 resets) in 53 ms. (74 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 53 ms. (74 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 49 ms. (80 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4001 steps (8 resets) in 65 ms. (60 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 50 ms. (78 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 55 ms. (71 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 49 ms. (80 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (9 resets) in 63 ms. (62 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 54 ms. (72 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 54 ms. (72 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (9 resets) in 55 ms. (71 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (10 resets) in 58 ms. (67 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 60 ms. (65 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 63 ms. (62 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 54 ms. (72 steps per ms) remains 569/569 properties
Probabilistic random walk after 1000001 steps, saw 186928 distinct states, run finished after 22252 ms. (steps per millisecond=44 ) properties seen :0
// Phase 1: matrix 1706 rows 1030 cols
[2025-05-29 19:38:39] [INFO ] Computed 121 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (OVERLAPS) 21/590 variables, 32/52 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 5 (OVERLAPS) 243/833 variables, 33/91 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/833 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 7 (OVERLAPS) 6/839 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/839 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 9 (OVERLAPS) 108/947 variables, 12/107 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/947 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 11 (OVERLAPS) 48/995 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/995 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 13 (OVERLAPS) 35/1030 variables, 9/121 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1030 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 15 (OVERLAPS) 1706/2736 variables, 1030/1151 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2736 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 17 (OVERLAPS) 0/2736 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 569 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2736/2736 variables, and 1151 constraints, problems are : Problem set: 0 solved, 569 unsolved in 135020 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 1030/1030 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (OVERLAPS) 21/590 variables, 32/52 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2025-05-29 19:41:00] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2025-05-29 19:41:00] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2025-05-29 19:41:02] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/590 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 6 (OVERLAPS) 243/833 variables, 33/94 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2025-05-29 19:41:14] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2025-05-29 19:41:14] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 2 ms to minimize.
[2025-05-29 19:41:14] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 2 ms to minimize.
[2025-05-29 19:41:16] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 2 ms to minimize.
[2025-05-29 19:41:16] [INFO ] Deduced a trap composed of 62 places in 128 ms of which 2 ms to minimize.
[2025-05-29 19:41:16] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2025-05-29 19:41:16] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 1 ms to minimize.
[2025-05-29 19:41:16] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 5 ms to minimize.
[2025-05-29 19:41:17] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 2 ms to minimize.
[2025-05-29 19:41:21] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 3 ms to minimize.
[2025-05-29 19:41:21] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2025-05-29 19:41:21] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 2 ms to minimize.
[2025-05-29 19:41:21] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 3 ms to minimize.
[2025-05-29 19:41:22] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 3 ms to minimize.
[2025-05-29 19:41:22] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 3 ms to minimize.
[2025-05-29 19:41:24] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 3 ms to minimize.
[2025-05-29 19:41:27] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 3 ms to minimize.
[2025-05-29 19:41:28] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 2 ms to minimize.
[2025-05-29 19:41:28] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2025-05-29 19:41:28] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/833 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2025-05-29 19:41:30] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 2 ms to minimize.
[2025-05-29 19:41:39] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 3 ms to minimize.
[2025-05-29 19:41:42] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/833 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2025-05-29 19:41:48] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/833 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2025-05-29 19:42:03] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 2 ms to minimize.
[2025-05-29 19:42:04] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2025-05-29 19:42:04] [INFO ] Deduced a trap composed of 123 places in 120 ms of which 2 ms to minimize.
[2025-05-29 19:42:08] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/833 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2025-05-29 19:42:19] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2025-05-29 19:42:19] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 1 ms to minimize.
[2025-05-29 19:42:20] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 2 ms to minimize.
[2025-05-29 19:42:20] [INFO ] Deduced a trap composed of 55 places in 130 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/833 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2025-05-29 19:42:37] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/833 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/833 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 14 (OVERLAPS) 6/839 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 839/2736 variables, and 131 constraints, problems are : Problem set: 0 solved, 569 unsolved in 135020 ms.
Refiners :[Positive P Invariants (semi-flows): 36/41 constraints, Generalized P Invariants (flows): 59/80 constraints, State Equation: 0/1030 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 36/36 constraints]
After SMT, in 270190ms problems are : Problem set: 0 solved, 569 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 569 out of 1030 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1030/1030 places, 1706/1706 transitions.
Applied a total of 0 rules in 18 ms. Remains 1030 /1030 variables (removed 0) and now considering 1706/1706 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 1030/1030 places, 1706/1706 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1030/1030 places, 1706/1706 transitions.
Applied a total of 0 rules in 17 ms. Remains 1030 /1030 variables (removed 0) and now considering 1706/1706 (removed 0) transitions.
[2025-05-29 19:43:09] [INFO ] Invariant cache hit.
[2025-05-29 19:43:09] [INFO ] Implicit Places using invariants in 359 ms returned []
[2025-05-29 19:43:09] [INFO ] Invariant cache hit.
[2025-05-29 19:43:11] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned []
Implicit Place search using SMT with State Equation took 1637 ms to find 0 implicit places.
[2025-05-29 19:43:11] [INFO ] Redundant transitions in 37 ms returned []
Running 1669 sub problems to find dead transitions.
[2025-05-29 19:43:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1029 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1669 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1029 variables, 79/117 constraints. Problems are: Problem set: 0 solved, 1669 unsolved
[2025-05-29 19:43:35] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2025-05-29 19:43:36] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2025-05-29 19:43:36] [INFO ] Deduced a trap composed of 65 places in 156 ms of which 2 ms to minimize.
[2025-05-29 19:43:36] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 2 ms to minimize.
[2025-05-29 19:43:38] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 2 ms to minimize.
[2025-05-29 19:43:38] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 3 ms to minimize.
[2025-05-29 19:43:39] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2025-05-29 19:43:41] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 3 ms to minimize.
[2025-05-29 19:43:41] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1029/2736 variables, and 126 constraints, problems are : Problem set: 0 solved, 1669 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 38/41 constraints, Generalized P Invariants (flows): 79/80 constraints, State Equation: 0/1030 constraints, PredecessorRefiner: 1669/1669 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1669 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1029 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1669 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1029 variables, 79/117 constraints. Problems are: Problem set: 0 solved, 1669 unsolved
Problem TDEAD1049 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1029 variables, 9/126 constraints. Problems are: Problem set: 1 solved, 1668 unsolved
[2025-05-29 19:43:47] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 1 ms to minimize.
[2025-05-29 19:43:48] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 2 ms to minimize.
[2025-05-29 19:43:50] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 2 ms to minimize.
[2025-05-29 19:43:52] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 1 ms to minimize.
[2025-05-29 19:43:54] [INFO ] Deduced a trap composed of 55 places in 250 ms of which 4 ms to minimize.
[2025-05-29 19:43:55] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2025-05-29 19:43:55] [INFO ] Deduced a trap composed of 18 places in 271 ms of which 4 ms to minimize.
[2025-05-29 19:43:56] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:43:56] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 3 ms to minimize.
[2025-05-29 19:43:57] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 2 ms to minimize.
[2025-05-29 19:43:57] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1029/2736 variables, and 137 constraints, problems are : Problem set: 1 solved, 1668 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 38/41 constraints, Generalized P Invariants (flows): 79/80 constraints, State Equation: 0/1030 constraints, PredecessorRefiner: 0/1669 constraints, Known Traps: 20/20 constraints]
After SMT, in 60845ms problems are : Problem set: 1 solved, 1668 unsolved
Search for dead transitions found 1 dead transitions in 60860ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 1030/1030 places, 1705/1706 transitions.
Applied a total of 0 rules in 16 ms. Remains 1030 /1030 variables (removed 0) and now considering 1705/1705 (removed 0) transitions.
[2025-05-29 19:44:12] [INFO ] Redundant transitions in 22 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62611 ms. Remains : 1030/1030 places, 1705/1706 transitions.
RANDOM walk for 3296318 steps (50172 resets) in 120004 ms. (27 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 34 ms. (114 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 39 ms. (100 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 41 ms. (95 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (9 resets) in 73 ms. (54 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (12 resets) in 62 ms. (63 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (10 resets) in 66 ms. (59 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 70 ms. (56 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (11 resets) in 63 ms. (62 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 50 ms. (78 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 47 ms. (83 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 48 ms. (81 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 36 ms. (108 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 76 ms. (51 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4001 steps (11 resets) in 76 ms. (51 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 41 ms. (95 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 76 ms. (52 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (9 resets) in 34 ms. (114 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 99 ms. (40 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 57 ms. (69 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (10 resets) in 39 ms. (100 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (11 resets) in 55 ms. (71 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 40 ms. (97 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 35 ms. (111 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 40 ms. (97 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 80 ms. (49 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 66 ms. (59 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 75 ms. (52 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 37 ms. (105 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 38 ms. (102 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (9 resets) in 52 ms. (75 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 84 ms. (47 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 77 ms. (51 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (9 resets) in 69 ms. (57 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4002 steps (10 resets) in 32 ms. (121 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 73 ms. (54 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 51 ms. (76 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 91 ms. (43 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (9 resets) in 53 ms. (74 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 61 ms. (64 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (9 resets) in 46 ms. (85 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 55 ms. (71 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 60 ms. (65 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 33 ms. (117 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 43 ms. (91 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (11 resets) in 45 ms. (87 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (11 resets) in 50 ms. (78 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4003 steps (10 resets) in 50 ms. (78 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (10 resets) in 54 ms. (72 steps per ms) remains 569/569 properties
BEST_FIRST walk for 4004 steps (12 resets) in 53 ms. (74 steps per ms) remains 569/569 properties
Probabilistic random walk after 1000001 steps, saw 186928 distinct states, run finished after 23299 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 1705 rows 1030 cols
[2025-05-29 19:45:06] [INFO ] Computed 122 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (OVERLAPS) 21/590 variables, 32/53 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 5 (OVERLAPS) 243/833 variables, 33/92 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/833 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 7 (OVERLAPS) 6/839 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/839 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 9 (OVERLAPS) 108/947 variables, 12/108 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/947 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 11 (OVERLAPS) 48/995 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/995 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 13 (OVERLAPS) 35/1030 variables, 9/122 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1030 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 15 (OVERLAPS) 1705/2735 variables, 1030/1152 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2735 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 17 (OVERLAPS) 0/2735 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 569 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2735/2735 variables, and 1152 constraints, problems are : Problem set: 0 solved, 569 unsolved in 150022 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 81/81 constraints, State Equation: 1030/1030 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (OVERLAPS) 21/590 variables, 32/53 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2025-05-29 19:47:42] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:47:44] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 569 unsolved

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-06b"
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-06b, 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-174853743600233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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