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-174853743400117.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 Anderson-PT-09, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743400117
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K 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.7K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 927K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748542424168

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:13:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-29 18:13:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:13:45] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2025-05-29 18:13:45] [INFO ] Transformed 505 places.
[2025-05-29 18:13:45] [INFO ] Transformed 1845 transitions.
[2025-05-29 18:13:45] [INFO ] Found NUPN structural information;
[2025-05-29 18:13:45] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 253 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 505 transition count 1773
Deduced a syphon composed of 72 places in 7 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 433 transition count 1773
Applied a total of 144 rules in 84 ms. Remains 433 /505 variables (removed 72) and now considering 1773/1845 (removed 72) transitions.
// Phase 1: matrix 1773 rows 433 cols
[2025-05-29 18:13:45] [INFO ] Computed 21 invariants in 57 ms
[2025-05-29 18:13:47] [INFO ] Implicit Places using invariants in 1385 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1417 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 432/505 places, 1773/1845 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 432 transition count 1692
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 351 transition count 1692
Applied a total of 162 rules in 23 ms. Remains 351 /432 variables (removed 81) and now considering 1692/1773 (removed 81) transitions.
// Phase 1: matrix 1692 rows 351 cols
[2025-05-29 18:13:47] [INFO ] Computed 20 invariants in 12 ms
[2025-05-29 18:13:47] [INFO ] Implicit Places using invariants in 669 ms returned []
[2025-05-29 18:13:47] [INFO ] Invariant cache hit.
[2025-05-29 18:13:48] [INFO ] State equation strengthened by 135 read => feed constraints.
[2025-05-29 18:13:50] [INFO ] Implicit Places using invariants and state equation in 3069 ms returned []
Implicit Place search using SMT with State Equation took 3740 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 351/505 places, 1692/1845 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 5283 ms. Remains : 351/505 places, 1692/1845 transitions.
Initial state reduction rules removed 9 formulas.
RANDOM walk for 40000 steps (8 resets) in 3420 ms. (11 steps per ms) remains 761/1683 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 761/761 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 761/761 properties
[2025-05-29 18:13:52] [INFO ] Invariant cache hit.
[2025-05-29 18:13:52] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 3 (OVERLAPS) 199/351 variables, 10/163 constraints. Problems are: Problem set: 0 solved, 761 unsolved
SMT process timed out in 7333ms, After SMT, problems are : Problem set: 0 solved, 761 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 152 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 1692/1692 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 317 transition count 1658
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 317 transition count 1658
Applied a total of 68 rules in 86 ms. Remains 317 /351 variables (removed 34) and now considering 1658/1692 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 317/351 places, 1658/1692 transitions.
RANDOM walk for 4000000 steps (8 resets) in 97718 ms. (40 steps per ms) remains 253/761 properties
BEST_FIRST walk for 40003 steps (8 resets) in 299 ms. (133 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40002 steps (8 resets) in 242 ms. (164 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40002 steps (8 resets) in 331 ms. (120 steps per ms) remains 227/253 properties
BEST_FIRST walk for 40003 steps (8 resets) in 369 ms. (108 steps per ms) remains 227/227 properties
BEST_FIRST walk for 40003 steps (8 resets) in 247 ms. (161 steps per ms) remains 226/227 properties
BEST_FIRST walk for 40003 steps (8 resets) in 281 ms. (141 steps per ms) remains 226/226 properties
BEST_FIRST walk for 40003 steps (8 resets) in 200 ms. (199 steps per ms) remains 225/226 properties
BEST_FIRST walk for 40001 steps (8 resets) in 189 ms. (210 steps per ms) remains 220/225 properties
BEST_FIRST walk for 40002 steps (8 resets) in 190 ms. (209 steps per ms) remains 216/220 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40002 steps (8 resets) in 181 ms. (219 steps per ms) remains 215/216 properties
BEST_FIRST walk for 40003 steps (8 resets) in 170 ms. (233 steps per ms) remains 145/215 properties
BEST_FIRST walk for 40002 steps (8 resets) in 158 ms. (251 steps per ms) remains 144/145 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40002 steps (8 resets) in 152 ms. (261 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 142/144 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 141/142 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 138/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 137/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 134/137 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 134/134 properties
BEST_FIRST walk for 40000 steps (8 resets) in 144 ms. (275 steps per ms) remains 134/134 properties
BEST_FIRST walk for 40003 steps (8 resets) in 141 ms. (281 steps per ms) remains 134/134 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 134/134 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 134/134 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 134/134 properties
BEST_FIRST walk for 40002 steps (8 resets) in 148 ms. (268 steps per ms) remains 134/134 properties
BEST_FIRST walk for 40002 steps (8 resets) in 147 ms. (270 steps per ms) remains 133/134 properties
BEST_FIRST walk for 40002 steps (8 resets) in 144 ms. (275 steps per ms) remains 132/133 properties
BEST_FIRST walk for 40002 steps (8 resets) in 142 ms. (279 steps per ms) remains 132/132 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 132/132 properties
BEST_FIRST walk for 40002 steps (8 resets) in 114 ms. (347 steps per ms) remains 132/132 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 132/132 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 132/132 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 132/132 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 130/132 properties
BEST_FIRST walk for 40002 steps (8 resets) in 149 ms. (266 steps per ms) remains 130/130 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 130/130 properties
BEST_FIRST walk for 40002 steps (8 resets) in 152 ms. (261 steps per ms) remains 130/130 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 130/130 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 127/130 properties
BEST_FIRST walk for 40003 steps (8 resets) in 152 ms. (261 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40001 steps (8 resets) in 114 ms. (347 steps per ms) remains 123/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 122/123 properties
BEST_FIRST walk for 40002 steps (8 resets) in 145 ms. (273 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40002 steps (8 resets) in 142 ms. (279 steps per ms) remains 121/122 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40001 steps (8 resets) in 144 ms. (275 steps per ms) remains 118/121 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40003 steps (8 resets) in 156 ms. (254 steps per ms) remains 113/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (8 resets) in 108 ms. (366 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 112/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 109/112 properties
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 108/109 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 100/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40001 steps (8 resets) in 124 ms. (320 steps per ms) remains 95/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40001 steps (8 resets) in 119 ms. (333 steps per ms) remains 94/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40001 steps (8 resets) in 126 ms. (314 steps per ms) remains 93/94 properties
BEST_FIRST walk for 40002 steps (8 resets) in 134 ms. (296 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40001 steps (8 resets) in 91 ms. (434 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40002 steps (8 resets) in 93 ms. (425 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40002 steps (8 resets) in 124 ms. (320 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40002 steps (8 resets) in 138 ms. (287 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 92/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 87/92 properties
BEST_FIRST walk for 40001 steps (8 resets) in 92 ms. (430 steps per ms) remains 87/87 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 83/87 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 83/83 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 83/83 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 83/83 properties
BEST_FIRST walk for 40002 steps (8 resets) in 124 ms. (320 steps per ms) remains 78/83 properties
BEST_FIRST walk for 40003 steps (8 resets) in 89 ms. (444 steps per ms) remains 74/78 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 74/74 properties
BEST_FIRST walk for 40001 steps (8 resets) in 118 ms. (336 steps per ms) remains 74/74 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 74/74 properties
BEST_FIRST walk for 40001 steps (8 resets) in 114 ms. (347 steps per ms) remains 74/74 properties
BEST_FIRST walk for 40002 steps (8 resets) in 121 ms. (327 steps per ms) remains 74/74 properties
BEST_FIRST walk for 40002 steps (8 resets) in 108 ms. (366 steps per ms) remains 74/74 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 73/74 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 73/73 properties
BEST_FIRST walk for 40001 steps (8 resets) in 119 ms. (333 steps per ms) remains 70/73 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 59/70 properties
// Phase 1: matrix 1658 rows 317 cols
[2025-05-29 18:14:29] [INFO ] Computed 20 invariants in 11 ms
[2025-05-29 18:14:29] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 260/293 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 23/316 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2025-05-29 18:14:30] [INFO ] Deduced a trap composed of 117 places in 275 ms of which 20 ms to minimize.
[2025-05-29 18:14:30] [INFO ] Deduced a trap composed of 111 places in 231 ms of which 3 ms to minimize.
[2025-05-29 18:14:31] [INFO ] Deduced a trap composed of 69 places in 232 ms of which 2 ms to minimize.
[2025-05-29 18:14:31] [INFO ] Deduced a trap composed of 139 places in 259 ms of which 9 ms to minimize.
[2025-05-29 18:14:31] [INFO ] Deduced a trap composed of 132 places in 241 ms of which 3 ms to minimize.
[2025-05-29 18:14:31] [INFO ] Deduced a trap composed of 105 places in 239 ms of which 2 ms to minimize.
[2025-05-29 18:14:32] [INFO ] Deduced a trap composed of 143 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:14:32] [INFO ] Deduced a trap composed of 93 places in 234 ms of which 2 ms to minimize.
[2025-05-29 18:14:32] [INFO ] Deduced a trap composed of 75 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:14:32] [INFO ] Deduced a trap composed of 80 places in 221 ms of which 3 ms to minimize.
[2025-05-29 18:14:33] [INFO ] Deduced a trap composed of 116 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:14:33] [INFO ] Deduced a trap composed of 82 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:14:33] [INFO ] Deduced a trap composed of 98 places in 219 ms of which 2 ms to minimize.
[2025-05-29 18:14:33] [INFO ] Deduced a trap composed of 100 places in 219 ms of which 2 ms to minimize.
[2025-05-29 18:14:34] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 2 ms to minimize.
[2025-05-29 18:14:34] [INFO ] Deduced a trap composed of 119 places in 217 ms of which 2 ms to minimize.
[2025-05-29 18:14:34] [INFO ] Deduced a trap composed of 140 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:14:34] [INFO ] Deduced a trap composed of 102 places in 231 ms of which 2 ms to minimize.
[2025-05-29 18:14:35] [INFO ] Deduced a trap composed of 149 places in 219 ms of which 2 ms to minimize.
[2025-05-29 18:14:35] [INFO ] Deduced a trap composed of 136 places in 238 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2025-05-29 18:14:35] [INFO ] Deduced a trap composed of 97 places in 243 ms of which 2 ms to minimize.
[2025-05-29 18:14:35] [INFO ] Deduced a trap composed of 115 places in 238 ms of which 2 ms to minimize.
[2025-05-29 18:14:36] [INFO ] Deduced a trap composed of 78 places in 233 ms of which 2 ms to minimize.
[2025-05-29 18:14:36] [INFO ] Deduced a trap composed of 83 places in 236 ms of which 2 ms to minimize.
[2025-05-29 18:14:36] [INFO ] Deduced a trap composed of 94 places in 230 ms of which 2 ms to minimize.
[2025-05-29 18:14:36] [INFO ] Deduced a trap composed of 84 places in 222 ms of which 2 ms to minimize.
[2025-05-29 18:14:37] [INFO ] Deduced a trap composed of 122 places in 243 ms of which 3 ms to minimize.
[2025-05-29 18:14:37] [INFO ] Deduced a trap composed of 128 places in 224 ms of which 2 ms to minimize.
[2025-05-29 18:14:37] [INFO ] Deduced a trap composed of 145 places in 217 ms of which 2 ms to minimize.
[2025-05-29 18:14:37] [INFO ] Deduced a trap composed of 141 places in 243 ms of which 2 ms to minimize.
[2025-05-29 18:14:38] [INFO ] Deduced a trap composed of 81 places in 244 ms of which 5 ms to minimize.
[2025-05-29 18:14:38] [INFO ] Deduced a trap composed of 152 places in 225 ms of which 2 ms to minimize.
[2025-05-29 18:14:38] [INFO ] Deduced a trap composed of 121 places in 235 ms of which 2 ms to minimize.
[2025-05-29 18:14:38] [INFO ] Deduced a trap composed of 98 places in 233 ms of which 3 ms to minimize.
[2025-05-29 18:14:39] [INFO ] Deduced a trap composed of 86 places in 222 ms of which 5 ms to minimize.
[2025-05-29 18:14:39] [INFO ] Deduced a trap composed of 81 places in 222 ms of which 2 ms to minimize.
[2025-05-29 18:14:39] [INFO ] Deduced a trap composed of 104 places in 232 ms of which 2 ms to minimize.
[2025-05-29 18:14:39] [INFO ] Deduced a trap composed of 122 places in 240 ms of which 4 ms to minimize.
[2025-05-29 18:14:40] [INFO ] Deduced a trap composed of 115 places in 231 ms of which 2 ms to minimize.
[2025-05-29 18:14:40] [INFO ] Deduced a trap composed of 145 places in 237 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2025-05-29 18:14:40] [INFO ] Deduced a trap composed of 151 places in 241 ms of which 2 ms to minimize.
[2025-05-29 18:14:41] [INFO ] Deduced a trap composed of 95 places in 235 ms of which 2 ms to minimize.
[2025-05-29 18:14:41] [INFO ] Deduced a trap composed of 95 places in 219 ms of which 2 ms to minimize.
[2025-05-29 18:14:41] [INFO ] Deduced a trap composed of 88 places in 240 ms of which 2 ms to minimize.
[2025-05-29 18:14:41] [INFO ] Deduced a trap composed of 63 places in 237 ms of which 3 ms to minimize.
[2025-05-29 18:14:42] [INFO ] Deduced a trap composed of 83 places in 241 ms of which 2 ms to minimize.
[2025-05-29 18:14:42] [INFO ] Deduced a trap composed of 73 places in 233 ms of which 2 ms to minimize.
[2025-05-29 18:14:42] [INFO ] Deduced a trap composed of 89 places in 234 ms of which 2 ms to minimize.
[2025-05-29 18:14:42] [INFO ] Deduced a trap composed of 84 places in 235 ms of which 3 ms to minimize.
[2025-05-29 18:14:43] [INFO ] Deduced a trap composed of 78 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:14:43] [INFO ] Deduced a trap composed of 71 places in 244 ms of which 2 ms to minimize.
[2025-05-29 18:14:43] [INFO ] Deduced a trap composed of 65 places in 219 ms of which 2 ms to minimize.
[2025-05-29 18:14:43] [INFO ] Deduced a trap composed of 105 places in 241 ms of which 3 ms to minimize.
[2025-05-29 18:14:44] [INFO ] Deduced a trap composed of 88 places in 215 ms of which 2 ms to minimize.
[2025-05-29 18:14:44] [INFO ] Deduced a trap composed of 55 places in 217 ms of which 2 ms to minimize.
[2025-05-29 18:14:44] [INFO ] Deduced a trap composed of 59 places in 238 ms of which 3 ms to minimize.
[2025-05-29 18:14:44] [INFO ] Deduced a trap composed of 55 places in 235 ms of which 2 ms to minimize.
[2025-05-29 18:14:44] [INFO ] Deduced a trap composed of 67 places in 221 ms of which 2 ms to minimize.
[2025-05-29 18:14:45] [INFO ] Deduced a trap composed of 113 places in 235 ms of which 3 ms to minimize.
[2025-05-29 18:14:45] [INFO ] Deduced a trap composed of 139 places in 240 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2025-05-29 18:14:46] [INFO ] Deduced a trap composed of 78 places in 225 ms of which 2 ms to minimize.
[2025-05-29 18:14:46] [INFO ] Deduced a trap composed of 57 places in 246 ms of which 2 ms to minimize.
[2025-05-29 18:14:47] [INFO ] Deduced a trap composed of 133 places in 244 ms of which 2 ms to minimize.
[2025-05-29 18:14:47] [INFO ] Deduced a trap composed of 108 places in 239 ms of which 2 ms to minimize.
[2025-05-29 18:14:47] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 2 ms to minimize.
[2025-05-29 18:14:48] [INFO ] Deduced a trap composed of 75 places in 234 ms of which 2 ms to minimize.
[2025-05-29 18:14:48] [INFO ] Deduced a trap composed of 54 places in 237 ms of which 2 ms to minimize.
[2025-05-29 18:14:48] [INFO ] Deduced a trap composed of 48 places in 235 ms of which 2 ms to minimize.
[2025-05-29 18:14:49] [INFO ] Deduced a trap composed of 69 places in 230 ms of which 2 ms to minimize.
[2025-05-29 18:14:49] [INFO ] Deduced a trap composed of 54 places in 219 ms of which 2 ms to minimize.
[2025-05-29 18:14:49] [INFO ] Deduced a trap composed of 122 places in 224 ms of which 3 ms to minimize.
[2025-05-29 18:14:49] [INFO ] Deduced a trap composed of 132 places in 245 ms of which 2 ms to minimize.
[2025-05-29 18:14:50] [INFO ] Deduced a trap composed of 115 places in 246 ms of which 2 ms to minimize.
[2025-05-29 18:14:50] [INFO ] Deduced a trap composed of 173 places in 242 ms of which 3 ms to minimize.
[2025-05-29 18:14:50] [INFO ] Deduced a trap composed of 128 places in 219 ms of which 2 ms to minimize.
[2025-05-29 18:14:50] [INFO ] Deduced a trap composed of 138 places in 235 ms of which 2 ms to minimize.
[2025-05-29 18:14:51] [INFO ] Deduced a trap composed of 63 places in 215 ms of which 3 ms to minimize.
[2025-05-29 18:14:51] [INFO ] Deduced a trap composed of 53 places in 215 ms of which 2 ms to minimize.
[2025-05-29 18:14:51] [INFO ] Deduced a trap composed of 158 places in 240 ms of which 3 ms to minimize.
[2025-05-29 18:14:51] [INFO ] Deduced a trap composed of 146 places in 242 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2025-05-29 18:14:54] [INFO ] Deduced a trap composed of 74 places in 244 ms of which 2 ms to minimize.
[2025-05-29 18:14:54] [INFO ] Deduced a trap composed of 105 places in 240 ms of which 2 ms to minimize.
[2025-05-29 18:14:54] [INFO ] Deduced a trap composed of 62 places in 233 ms of which 2 ms to minimize.
[2025-05-29 18:14:54] [INFO ] Deduced a trap composed of 49 places in 239 ms of which 2 ms to minimize.
[2025-05-29 18:14:55] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 2 ms to minimize.
[2025-05-29 18:14:55] [INFO ] Deduced a trap composed of 99 places in 223 ms of which 2 ms to minimize.
[2025-05-29 18:14:56] [INFO ] Deduced a trap composed of 67 places in 242 ms of which 2 ms to minimize.
[2025-05-29 18:14:56] [INFO ] Deduced a trap composed of 113 places in 217 ms of which 2 ms to minimize.
[2025-05-29 18:14:56] [INFO ] Deduced a trap composed of 71 places in 240 ms of which 2 ms to minimize.
[2025-05-29 18:14:57] [INFO ] Deduced a trap composed of 178 places in 224 ms of which 2 ms to minimize.
[2025-05-29 18:14:57] [INFO ] Deduced a trap composed of 113 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:14:57] [INFO ] Deduced a trap composed of 185 places in 244 ms of which 2 ms to minimize.
[2025-05-29 18:14:57] [INFO ] Deduced a trap composed of 159 places in 224 ms of which 2 ms to minimize.
[2025-05-29 18:14:58] [INFO ] Deduced a trap composed of 130 places in 240 ms of which 2 ms to minimize.
[2025-05-29 18:14:58] [INFO ] Deduced a trap composed of 109 places in 245 ms of which 2 ms to minimize.
[2025-05-29 18:14:58] [INFO ] Deduced a trap composed of 70 places in 225 ms of which 2 ms to minimize.
[2025-05-29 18:14:58] [INFO ] Deduced a trap composed of 73 places in 235 ms of which 3 ms to minimize.
[2025-05-29 18:14:59] [INFO ] Deduced a trap composed of 45 places in 234 ms of which 2 ms to minimize.
[2025-05-29 18:14:59] [INFO ] Deduced a trap composed of 127 places in 243 ms of which 3 ms to minimize.
[2025-05-29 18:14:59] [INFO ] Deduced a trap composed of 107 places in 242 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2025-05-29 18:15:03] [INFO ] Deduced a trap composed of 123 places in 240 ms of which 2 ms to minimize.
[2025-05-29 18:15:03] [INFO ] Deduced a trap composed of 55 places in 230 ms of which 3 ms to minimize.
[2025-05-29 18:15:03] [INFO ] Deduced a trap composed of 92 places in 232 ms of which 3 ms to minimize.
[2025-05-29 18:15:03] [INFO ] Deduced a trap composed of 61 places in 231 ms of which 2 ms to minimize.
[2025-05-29 18:15:04] [INFO ] Deduced a trap composed of 130 places in 242 ms of which 2 ms to minimize.
[2025-05-29 18:15:04] [INFO ] Deduced a trap composed of 118 places in 235 ms of which 2 ms to minimize.
[2025-05-29 18:15:04] [INFO ] Deduced a trap composed of 62 places in 237 ms of which 2 ms to minimize.
[2025-05-29 18:15:04] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 2 ms to minimize.
[2025-05-29 18:15:05] [INFO ] Deduced a trap composed of 94 places in 236 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 1/317 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (OVERLAPS) 1658/1975 variables, 317/446 constraints. Problems are: Problem set: 0 solved, 59 unsolved
SMT process timed out in 45209ms, After SMT, problems are : Problem set: 0 solved, 59 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 1658/1658 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 237 transition count 906
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 237 transition count 906
Applied a total of 160 rules in 41 ms. Remains 237 /317 variables (removed 80) and now considering 906/1658 (removed 752) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 237/317 places, 906/1658 transitions.
RANDOM walk for 4000000 steps (8 resets) in 24116 ms. (165 steps per ms) remains 57/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 700 ms. (570 steps per ms) remains 54/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 705 ms. (566 steps per ms) remains 53/54 properties
BEST_FIRST walk for 400003 steps (8 resets) in 727 ms. (549 steps per ms) remains 51/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 678 ms. (589 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (8 resets) in 672 ms. (594 steps per ms) remains 48/51 properties
BEST_FIRST walk for 400003 steps (8 resets) in 684 ms. (583 steps per ms) remains 46/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 693 ms. (576 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 645 ms. (619 steps per ms) remains 44/46 properties
BEST_FIRST walk for 400002 steps (8 resets) in 661 ms. (604 steps per ms) remains 43/44 properties
BEST_FIRST walk for 400002 steps (8 resets) in 657 ms. (607 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 639 ms. (625 steps per ms) remains 42/43 properties
BEST_FIRST walk for 400003 steps (8 resets) in 640 ms. (624 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 697 ms. (573 steps per ms) remains 41/42 properties
BEST_FIRST walk for 400003 steps (8 resets) in 644 ms. (620 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (8 resets) in 642 ms. (622 steps per ms) remains 39/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 611 ms. (653 steps per ms) remains 37/39 properties
BEST_FIRST walk for 400002 steps (8 resets) in 612 ms. (652 steps per ms) remains 34/37 properties
BEST_FIRST walk for 400003 steps (8 resets) in 643 ms. (621 steps per ms) remains 32/34 properties
BEST_FIRST walk for 400003 steps (8 resets) in 627 ms. (636 steps per ms) remains 31/32 properties
BEST_FIRST walk for 400004 steps (8 resets) in 653 ms. (611 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (8 resets) in 621 ms. (643 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (8 resets) in 618 ms. (646 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (8 resets) in 651 ms. (613 steps per ms) remains 29/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 595 ms. (671 steps per ms) remains 26/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 617 ms. (647 steps per ms) remains 23/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 674 ms. (592 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 668 ms. (597 steps per ms) remains 22/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 646 ms. (618 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (8 resets) in 620 ms. (644 steps per ms) remains 20/22 properties
BEST_FIRST walk for 400004 steps (8 resets) in 582 ms. (686 steps per ms) remains 18/20 properties
BEST_FIRST walk for 400002 steps (8 resets) in 571 ms. (699 steps per ms) remains 16/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 553 ms. (722 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (8 resets) in 512 ms. (779 steps per ms) remains 15/16 properties
BEST_FIRST walk for 400003 steps (8 resets) in 521 ms. (766 steps per ms) remains 13/15 properties
BEST_FIRST walk for 400002 steps (8 resets) in 480 ms. (831 steps per ms) remains 12/13 properties
BEST_FIRST walk for 400003 steps (8 resets) in 471 ms. (847 steps per ms) remains 12/12 properties
// Phase 1: matrix 906 rows 237 cols
[2025-05-29 18:15:28] [INFO ] Computed 20 invariants in 7 ms
[2025-05-29 18:15:28] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 154/167 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 67/234 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 3/237 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2025-05-29 18:15:28] [INFO ] Deduced a trap composed of 69 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:15:28] [INFO ] Deduced a trap composed of 96 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:15:28] [INFO ] Deduced a trap composed of 71 places in 150 ms of which 1 ms to minimize.
[2025-05-29 18:15:29] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 906/1143 variables, 237/261 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1143 variables, 72/333 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1143 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/1143 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1143/1143 variables, and 333 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2087 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 237/237 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 154/167 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 67/234 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 3/237 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 906/1143 variables, 237/261 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1143 variables, 72/333 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1143 variables, 12/345 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1143 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/1143 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1143/1143 variables, and 345 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1890 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 237/237 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 4/4 constraints]
After SMT, in 4023ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 13 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 906/906 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 219 transition count 600
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 219 transition count 600
Applied a total of 36 rules in 18 ms. Remains 219 /237 variables (removed 18) and now considering 600/906 (removed 306) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 219/237 places, 600/906 transitions.
RANDOM walk for 4000000 steps (8 resets) in 13865 ms. (288 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4157 ms. (962 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4091 ms. (977 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 3956 ms. (1010 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 3928 ms. (1018 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 3535 ms. (1131 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3352 ms. (1192 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 3136 ms. (1275 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 3170 ms. (1261 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2927 ms. (1366 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 2700 ms. (1480 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 2422 ms. (1650 steps per ms) remains 1/2 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 2376 ms. (1682 steps per ms) remains 1/1 properties
// Phase 1: matrix 600 rows 219 cols
[2025-05-29 18:15:47] [INFO ] Computed 20 invariants in 5 ms
[2025-05-29 18:15:47] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/193 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/201 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/218 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/219 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 600/819 variables, 219/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/819 variables, 72/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/819 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/819 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 819/819 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 219/219 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/193 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/201 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/218 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/219 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 600/819 variables, 219/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/819 variables, 72/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/819 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/819 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/819 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 819/819 variables, and 312 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 219/219 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 610ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 600/600 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 208 transition count 413
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 208 transition count 413
Applied a total of 22 rules in 20 ms. Remains 208 /219 variables (removed 11) and now considering 413/600 (removed 187) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 208/219 places, 413/600 transitions.
RANDOM walk for 4000000 steps (8 resets) in 5817 ms. (687 steps per ms) remains 1/1 properties
BEST_FIRST walk for 2539946 steps (4 resets) in 1428 ms. (1777 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 1692 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 125001 ms.
ITS solved all properties within timeout

BK_STOP 1748542550436

--------------------
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 QuasiLiveness -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="Anderson-PT-09"
export BK_EXAMINATION="QuasiLiveness"
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 Anderson-PT-09, examination is QuasiLiveness"
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-174853743400117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-09.tgz
mv Anderson-PT-09 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;