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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 667K 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 Liveness

=== Now, execution of the tool begins

BK_START 1748542333105

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:12:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-05-29 18:12:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:12:14] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2025-05-29 18:12:14] [INFO ] Transformed 401 places.
[2025-05-29 18:12:14] [INFO ] Transformed 1328 transitions.
[2025-05-29 18:12:14] [INFO ] Found NUPN structural information;
[2025-05-29 18:12:14] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 232 ms.
Built sparse matrix representations for Structural reductions in 10 ms.19304KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 81 ms. Remains 401 /401 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 95 ms. Remains : 401/401 places, 1328/1328 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 37 ms. Remains 401 /401 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
// Phase 1: matrix 1328 rows 401 cols
[2025-05-29 18:12:14] [INFO ] Computed 19 invariants in 49 ms
[2025-05-29 18:12:15] [INFO ] Implicit Places using invariants in 289 ms returned []
[2025-05-29 18:12:15] [INFO ] Invariant cache hit.
[2025-05-29 18:12:15] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-29 18:12:15] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
[2025-05-29 18:12:15] [INFO ] Redundant transitions in 63 ms returned []
Running 1320 sub problems to find dead transitions.
[2025-05-29 18:12:15] [INFO ] Invariant cache hit.
[2025-05-29 18:12:15] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 401/401 constraints. Problems are: Problem set: 0 solved, 1320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/410 constraints. Problems are: Problem set: 0 solved, 1320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 10/420 constraints. Problems are: Problem set: 0 solved, 1320 unsolved
[2025-05-29 18:12:28] [INFO ] Deduced a trap composed of 302 places in 285 ms of which 27 ms to minimize.
[2025-05-29 18:12:28] [INFO ] Deduced a trap composed of 234 places in 250 ms of which 4 ms to minimize.
[2025-05-29 18:12:28] [INFO ] Deduced a trap composed of 250 places in 216 ms of which 3 ms to minimize.
[2025-05-29 18:12:28] [INFO ] Deduced a trap composed of 251 places in 221 ms of which 3 ms to minimize.
[2025-05-29 18:12:29] [INFO ] Deduced a trap composed of 141 places in 208 ms of which 3 ms to minimize.
[2025-05-29 18:12:29] [INFO ] Deduced a trap composed of 241 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:12:29] [INFO ] Deduced a trap composed of 150 places in 209 ms of which 3 ms to minimize.
[2025-05-29 18:12:29] [INFO ] Deduced a trap composed of 215 places in 218 ms of which 3 ms to minimize.
[2025-05-29 18:12:30] [INFO ] Deduced a trap composed of 141 places in 219 ms of which 3 ms to minimize.
[2025-05-29 18:12:30] [INFO ] Deduced a trap composed of 181 places in 209 ms of which 3 ms to minimize.
[2025-05-29 18:12:30] [INFO ] Deduced a trap composed of 194 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:12:30] [INFO ] Deduced a trap composed of 174 places in 210 ms of which 3 ms to minimize.
[2025-05-29 18:12:31] [INFO ] Deduced a trap composed of 234 places in 206 ms of which 3 ms to minimize.
[2025-05-29 18:12:31] [INFO ] Deduced a trap composed of 200 places in 212 ms of which 3 ms to minimize.
[2025-05-29 18:12:31] [INFO ] Deduced a trap composed of 232 places in 211 ms of which 3 ms to minimize.
[2025-05-29 18:12:31] [INFO ] Deduced a trap composed of 225 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:12:31] [INFO ] Deduced a trap composed of 94 places in 200 ms of which 3 ms to minimize.
[2025-05-29 18:12:32] [INFO ] Deduced a trap composed of 197 places in 216 ms of which 2 ms to minimize.
[2025-05-29 18:12:32] [INFO ] Deduced a trap composed of 147 places in 204 ms of which 3 ms to minimize.
[2025-05-29 18:12:32] [INFO ] Deduced a trap composed of 95 places in 204 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1320 unsolved
[2025-05-29 18:12:48] [INFO ] Deduced a trap composed of 167 places in 196 ms of which 2 ms to minimize.
[2025-05-29 18:12:48] [INFO ] Deduced a trap composed of 167 places in 196 ms of which 3 ms to minimize.
[2025-05-29 18:12:48] [INFO ] Deduced a trap composed of 94 places in 192 ms of which 3 ms to minimize.
SMT process timed out in 32831ms, After SMT, problems are : Problem set: 0 solved, 1320 unsolved
Search for dead transitions found 0 dead transitions in 32863ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 33828 ms. Remains : 401/401 places, 1328/1328 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2536 ms (no deadlock found). (steps per millisecond=492 )
Random directed walk for 1250001 steps, including 0 resets, run took 2337 ms (no deadlock found). (steps per millisecond=534 )
[2025-05-29 18:12:53] [INFO ] Invariant cache hit.
[2025-05-29 18:12:53] [INFO ] [Real]Absence check using 9 positive place invariants in 17 ms returned sat
[2025-05-29 18:12:54] [INFO ] [Real]Absence check using 9 positive and 10 generalized place invariants in 843 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 401 transition count 1272
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 345 transition count 1272
Applied a total of 112 rules in 43 ms. Remains 345 /401 variables (removed 56) and now considering 1272/1328 (removed 56) transitions.
// Phase 1: matrix 1272 rows 345 cols
[2025-05-29 18:12:54] [INFO ] Computed 19 invariants in 16 ms
[2025-05-29 18:12:55] [INFO ] Implicit Places using invariants in 620 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 623 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 344/401 places, 1272/1328 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 344 transition count 1208
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 280 transition count 1208
Applied a total of 128 rules in 9 ms. Remains 280 /344 variables (removed 64) and now considering 1208/1272 (removed 64) transitions.
// Phase 1: matrix 1208 rows 280 cols
[2025-05-29 18:12:55] [INFO ] Computed 18 invariants in 13 ms
[2025-05-29 18:12:55] [INFO ] Implicit Places using invariants in 591 ms returned []
[2025-05-29 18:12:55] [INFO ] Invariant cache hit.
[2025-05-29 18:12:56] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-05-29 18:12:57] [INFO ] Implicit Places using invariants and state equation in 1784 ms returned []
Implicit Place search using SMT with State Equation took 2378 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 280/401 places, 1208/1328 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 3054 ms. Remains : 280/401 places, 1208/1328 transitions.
Initial state reduction rules removed 8 formulas.
RANDOM walk for 40000 steps (8 resets) in 3125 ms. (12 steps per ms) remains 456/1200 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 456/456 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 456/456 properties
[2025-05-29 18:12:58] [INFO ] Invariant cache hit.
[2025-05-29 18:12:58] [INFO ] State equation strengthened by 104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 3 (OVERLAPS) 162/280 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 162/290 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 8/298 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2025-05-29 18:13:04] [INFO ] Deduced a trap composed of 106 places in 171 ms of which 2 ms to minimize.
[2025-05-29 18:13:04] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 2 ms to minimize.
[2025-05-29 18:13:04] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 2 ms to minimize.
[2025-05-29 18:13:04] [INFO ] Deduced a trap composed of 126 places in 163 ms of which 2 ms to minimize.
[2025-05-29 18:13:04] [INFO ] Deduced a trap composed of 76 places in 172 ms of which 2 ms to minimize.
SMT process timed out in 5912ms, After SMT, problems are : Problem set: 0 solved, 456 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 118 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 1208/1208 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 250 transition count 1178
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 250 transition count 1178
Applied a total of 60 rules in 42 ms. Remains 250 /280 variables (removed 30) and now considering 1178/1208 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 250/280 places, 1178/1208 transitions.
RANDOM walk for 4000000 steps (8 resets) in 52689 ms. (75 steps per ms) remains 118/456 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 112/118 properties
BEST_FIRST walk for 40002 steps (8 resets) in 126 ms. (314 steps per ms) remains 109/112 properties
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (8 resets) in 212 ms. (187 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 106/109 properties
BEST_FIRST walk for 40002 steps (8 resets) in 196 ms. (203 steps per ms) remains 105/106 properties
BEST_FIRST walk for 40002 steps (8 resets) in 176 ms. (226 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 104/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40001 steps (8 resets) in 110 ms. (360 steps per ms) remains 92/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 104 ms. (380 steps per ms) remains 92/92 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 92/92 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 89/92 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 88/89 properties
BEST_FIRST walk for 40003 steps (8 resets) in 82 ms. (481 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 87/88 properties
BEST_FIRST walk for 40002 steps (8 resets) in 95 ms. (416 steps per ms) remains 87/87 properties
BEST_FIRST walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 87/87 properties
BEST_FIRST walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 87/87 properties
BEST_FIRST walk for 40003 steps (8 resets) in 100 ms. (396 steps per ms) remains 87/87 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 87/87 properties
BEST_FIRST walk for 40002 steps (8 resets) in 80 ms. (493 steps per ms) remains 87/87 properties
BEST_FIRST walk for 40003 steps (8 resets) in 81 ms. (487 steps per ms) remains 87/87 properties
BEST_FIRST walk for 40003 steps (8 resets) in 100 ms. (396 steps per ms) remains 76/87 properties
BEST_FIRST walk for 40002 steps (8 resets) in 95 ms. (416 steps per ms) remains 76/76 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 76/76 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 76/76 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 74/76 properties
BEST_FIRST walk for 40002 steps (8 resets) in 89 ms. (444 steps per ms) remains 74/74 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 70/74 properties
BEST_FIRST walk for 40002 steps (8 resets) in 85 ms. (465 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40001 steps (8 resets) in 84 ms. (470 steps per ms) remains 68/70 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 67/68 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 steps per ms) remains 67/67 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 60/67 properties
BEST_FIRST walk for 40003 steps (8 resets) in 70 ms. (563 steps per ms) remains 57/60 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 57/57 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 57/57 properties
BEST_FIRST walk for 40002 steps (8 resets) in 88 ms. (449 steps per ms) remains 56/57 properties
BEST_FIRST walk for 40002 steps (8 resets) in 88 ms. (449 steps per ms) remains 55/56 properties
BEST_FIRST walk for 40002 steps (8 resets) in 82 ms. (481 steps per ms) remains 55/55 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 55/55 properties
BEST_FIRST walk for 40002 steps (8 resets) in 70 ms. (563 steps per ms) remains 55/55 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 53/55 properties
BEST_FIRST walk for 40002 steps (8 resets) in 92 ms. (430 steps per ms) remains 53/53 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 53/53 properties
BEST_FIRST walk for 40002 steps (8 resets) in 89 ms. (444 steps per ms) remains 53/53 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 52/53 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 52/52 properties
BEST_FIRST walk for 40003 steps (8 resets) in 83 ms. (476 steps per ms) remains 52/52 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 52/52 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 52/52 properties
BEST_FIRST walk for 40001 steps (8 resets) in 69 ms. (571 steps per ms) remains 51/52 properties
BEST_FIRST walk for 40002 steps (8 resets) in 86 ms. (459 steps per ms) remains 51/51 properties
BEST_FIRST walk for 40002 steps (8 resets) in 86 ms. (459 steps per ms) remains 51/51 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 50/51 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 50/50 properties
BEST_FIRST walk for 40002 steps (8 resets) in 78 ms. (506 steps per ms) remains 50/50 properties
BEST_FIRST walk for 40002 steps (8 resets) in 82 ms. (481 steps per ms) remains 47/50 properties
BEST_FIRST walk for 40003 steps (8 resets) in 66 ms. (597 steps per ms) remains 45/47 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 43/45 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 43/43 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 43/43 properties
BEST_FIRST walk for 40002 steps (8 resets) in 85 ms. (465 steps per ms) remains 43/43 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 43/43 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 43/43 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 43/43 properties
// Phase 1: matrix 1178 rows 250 cols
[2025-05-29 18:13:20] [INFO ] Computed 18 invariants in 6 ms
[2025-05-29 18:13:20] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 196/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 21/249 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-05-29 18:13:21] [INFO ] Deduced a trap composed of 113 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:13:21] [INFO ] Deduced a trap composed of 59 places in 157 ms of which 1 ms to minimize.
[2025-05-29 18:13:21] [INFO ] Deduced a trap composed of 90 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:13:21] [INFO ] Deduced a trap composed of 130 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:13:21] [INFO ] Deduced a trap composed of 110 places in 154 ms of which 1 ms to minimize.
[2025-05-29 18:13:22] [INFO ] Deduced a trap composed of 74 places in 160 ms of which 2 ms to minimize.
[2025-05-29 18:13:22] [INFO ] Deduced a trap composed of 83 places in 162 ms of which 6 ms to minimize.
[2025-05-29 18:13:22] [INFO ] Deduced a trap composed of 69 places in 164 ms of which 2 ms to minimize.
[2025-05-29 18:13:22] [INFO ] Deduced a trap composed of 104 places in 156 ms of which 2 ms to minimize.
[2025-05-29 18:13:22] [INFO ] Deduced a trap composed of 118 places in 159 ms of which 1 ms to minimize.
[2025-05-29 18:13:22] [INFO ] Deduced a trap composed of 98 places in 158 ms of which 1 ms to minimize.
[2025-05-29 18:13:23] [INFO ] Deduced a trap composed of 94 places in 156 ms of which 3 ms to minimize.
[2025-05-29 18:13:23] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:13:23] [INFO ] Deduced a trap composed of 67 places in 151 ms of which 1 ms to minimize.
[2025-05-29 18:13:23] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 1 ms to minimize.
[2025-05-29 18:13:23] [INFO ] Deduced a trap composed of 70 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:13:23] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:13:24] [INFO ] Deduced a trap composed of 95 places in 164 ms of which 1 ms to minimize.
[2025-05-29 18:13:24] [INFO ] Deduced a trap composed of 81 places in 156 ms of which 2 ms to minimize.
[2025-05-29 18:13:24] [INFO ] Deduced a trap composed of 61 places in 155 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-05-29 18:13:24] [INFO ] Deduced a trap composed of 56 places in 157 ms of which 1 ms to minimize.
[2025-05-29 18:13:24] [INFO ] Deduced a trap composed of 87 places in 166 ms of which 1 ms to minimize.
[2025-05-29 18:13:25] [INFO ] Deduced a trap composed of 57 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:13:25] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 1 ms to minimize.
[2025-05-29 18:13:25] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 2 ms to minimize.
[2025-05-29 18:13:25] [INFO ] Deduced a trap composed of 74 places in 155 ms of which 1 ms to minimize.
[2025-05-29 18:13:25] [INFO ] Deduced a trap composed of 69 places in 154 ms of which 2 ms to minimize.
[2025-05-29 18:13:25] [INFO ] Deduced a trap composed of 79 places in 160 ms of which 3 ms to minimize.
[2025-05-29 18:13:25] [INFO ] Deduced a trap composed of 63 places in 156 ms of which 2 ms to minimize.
[2025-05-29 18:13:26] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:13:26] [INFO ] Deduced a trap composed of 83 places in 164 ms of which 2 ms to minimize.
[2025-05-29 18:13:26] [INFO ] Deduced a trap composed of 113 places in 159 ms of which 1 ms to minimize.
[2025-05-29 18:13:26] [INFO ] Deduced a trap composed of 62 places in 152 ms of which 1 ms to minimize.
[2025-05-29 18:13:26] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 2 ms to minimize.
[2025-05-29 18:13:26] [INFO ] Deduced a trap composed of 96 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:13:27] [INFO ] Deduced a trap composed of 86 places in 153 ms of which 1 ms to minimize.
[2025-05-29 18:13:27] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 1 ms to minimize.
[2025-05-29 18:13:27] [INFO ] Deduced a trap composed of 122 places in 158 ms of which 1 ms to minimize.
[2025-05-29 18:13:27] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:13:27] [INFO ] Deduced a trap composed of 120 places in 150 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-05-29 18:13:28] [INFO ] Deduced a trap composed of 77 places in 156 ms of which 1 ms to minimize.
[2025-05-29 18:13:28] [INFO ] Deduced a trap composed of 99 places in 156 ms of which 2 ms to minimize.
[2025-05-29 18:13:28] [INFO ] Deduced a trap composed of 111 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:13:28] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:13:28] [INFO ] Deduced a trap composed of 81 places in 152 ms of which 1 ms to minimize.
[2025-05-29 18:13:29] [INFO ] Deduced a trap composed of 77 places in 160 ms of which 2 ms to minimize.
[2025-05-29 18:13:29] [INFO ] Deduced a trap composed of 80 places in 159 ms of which 1 ms to minimize.
[2025-05-29 18:13:29] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:13:29] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 2 ms to minimize.
[2025-05-29 18:13:29] [INFO ] Deduced a trap composed of 71 places in 151 ms of which 2 ms to minimize.
[2025-05-29 18:13:30] [INFO ] Deduced a trap composed of 73 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:13:30] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 1 ms to minimize.
[2025-05-29 18:13:30] [INFO ] Deduced a trap composed of 83 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:13:30] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 1 ms to minimize.
[2025-05-29 18:13:30] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:13:30] [INFO ] Deduced a trap composed of 89 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:13:31] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:13:31] [INFO ] Deduced a trap composed of 68 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:13:31] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:13:31] [INFO ] Deduced a trap composed of 73 places in 153 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-05-29 18:13:34] [INFO ] Deduced a trap composed of 89 places in 162 ms of which 2 ms to minimize.
[2025-05-29 18:13:34] [INFO ] Deduced a trap composed of 62 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:13:34] [INFO ] Deduced a trap composed of 79 places in 167 ms of which 2 ms to minimize.
[2025-05-29 18:13:35] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:13:35] [INFO ] Deduced a trap composed of 72 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:13:35] [INFO ] Deduced a trap composed of 135 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:13:35] [INFO ] Deduced a trap composed of 81 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:13:35] [INFO ] Deduced a trap composed of 95 places in 157 ms of which 1 ms to minimize.
[2025-05-29 18:13:35] [INFO ] Deduced a trap composed of 58 places in 157 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-05-29 18:13:37] [INFO ] Deduced a trap composed of 113 places in 172 ms of which 2 ms to minimize.
[2025-05-29 18:13:37] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 1 ms to minimize.
[2025-05-29 18:13:37] [INFO ] Deduced a trap composed of 123 places in 164 ms of which 2 ms to minimize.
[2025-05-29 18:13:37] [INFO ] Deduced a trap composed of 110 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:13:37] [INFO ] Deduced a trap composed of 87 places in 157 ms of which 1 ms to minimize.
[2025-05-29 18:13:37] [INFO ] Deduced a trap composed of 87 places in 150 ms of which 2 ms to minimize.
[2025-05-29 18:13:38] [INFO ] Deduced a trap composed of 70 places in 157 ms of which 1 ms to minimize.
[2025-05-29 18:13:38] [INFO ] Deduced a trap composed of 93 places in 158 ms of which 1 ms to minimize.
[2025-05-29 18:13:39] [INFO ] Deduced a trap composed of 85 places in 163 ms of which 2 ms to minimize.
[2025-05-29 18:13:39] [INFO ] Deduced a trap composed of 72 places in 158 ms of which 1 ms to minimize.
[2025-05-29 18:13:39] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 1 ms to minimize.
[2025-05-29 18:13:39] [INFO ] Deduced a trap composed of 78 places in 156 ms of which 1 ms to minimize.
[2025-05-29 18:13:40] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-05-29 18:13:41] [INFO ] Deduced a trap composed of 75 places in 160 ms of which 1 ms to minimize.
[2025-05-29 18:13:41] [INFO ] Deduced a trap composed of 85 places in 156 ms of which 2 ms to minimize.
[2025-05-29 18:13:41] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 1 ms to minimize.
[2025-05-29 18:13:42] [INFO ] Deduced a trap composed of 82 places in 146 ms of which 2 ms to minimize.
[2025-05-29 18:13:42] [INFO ] Deduced a trap composed of 123 places in 158 ms of which 1 ms to minimize.
[2025-05-29 18:13:42] [INFO ] Deduced a trap composed of 82 places in 158 ms of which 1 ms to minimize.
[2025-05-29 18:13:42] [INFO ] Deduced a trap composed of 110 places in 156 ms of which 2 ms to minimize.
[2025-05-29 18:13:42] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 8/107 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 1/250 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-05-29 18:13:51] [INFO ] Deduced a trap composed of 100 places in 163 ms of which 2 ms to minimize.
[2025-05-29 18:13:51] [INFO ] Deduced a trap composed of 87 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:13:51] [INFO ] Deduced a trap composed of 120 places in 157 ms of which 1 ms to minimize.
[2025-05-29 18:13:51] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:13:52] [INFO ] Deduced a trap composed of 69 places in 161 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-05-29 18:13:54] [INFO ] Deduced a trap composed of 67 places in 156 ms of which 1 ms to minimize.
[2025-05-29 18:13:54] [INFO ] Deduced a trap composed of 63 places in 152 ms of which 1 ms to minimize.
[2025-05-29 18:13:55] [INFO ] Deduced a trap composed of 66 places in 165 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 15 (OVERLAPS) 1178/1428 variables, 250/366 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1428 variables, 82/448 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1428/1428 variables, and 448 constraints, problems are : Problem set: 0 solved, 43 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 250/250 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 196/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 21/249 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 98/115 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-05-29 18:14:08] [INFO ] Deduced a trap composed of 71 places in 170 ms of which 2 ms to minimize.
[2025-05-29 18:14:08] [INFO ] Deduced a trap composed of 69 places in 163 ms of which 2 ms to minimize.
[2025-05-29 18:14:08] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 1/250 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 1178/1428 variables, 250/369 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1428 variables, 82/451 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1428 variables, 43/494 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1428 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 13 (OVERLAPS) 0/1428 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1428/1428 variables, and 494 constraints, problems are : Problem set: 0 solved, 43 unsolved in 36906 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 250/250 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 101/101 constraints]
After SMT, in 82028ms problems are : Problem set: 0 solved, 43 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 32 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 1178/1178 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 198 transition count 762
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 198 transition count 762
Applied a total of 104 rules in 32 ms. Remains 198 /250 variables (removed 52) and now considering 762/1178 (removed 416) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 198/250 places, 762/1178 transitions.
RANDOM walk for 4000000 steps (8 resets) in 19867 ms. (201 steps per ms) remains 41/43 properties
BEST_FIRST walk for 400001 steps (8 resets) in 856 ms. (466 steps per ms) remains 39/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 975 ms. (409 steps per ms) remains 37/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 903 ms. (442 steps per ms) remains 35/37 properties
BEST_FIRST walk for 400003 steps (8 resets) in 878 ms. (455 steps per ms) remains 34/35 properties
BEST_FIRST walk for 400003 steps (8 resets) in 915 ms. (436 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (8 resets) in 854 ms. (467 steps per ms) remains 32/34 properties
BEST_FIRST walk for 400004 steps (8 resets) in 779 ms. (512 steps per ms) remains 30/32 properties
BEST_FIRST walk for 400004 steps (8 resets) in 882 ms. (453 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 877 ms. (455 steps per ms) remains 27/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 848 ms. (471 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400002 steps (8 resets) in 836 ms. (477 steps per ms) remains 25/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 847 ms. (471 steps per ms) remains 24/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 817 ms. (489 steps per ms) remains 22/24 properties
BEST_FIRST walk for 400003 steps (8 resets) in 899 ms. (444 steps per ms) remains 21/22 properties
BEST_FIRST walk for 400002 steps (8 resets) in 862 ms. (463 steps per ms) remains 19/21 properties
BEST_FIRST walk for 400003 steps (8 resets) in 774 ms. (516 steps per ms) remains 17/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 766 ms. (521 steps per ms) remains 16/17 properties
BEST_FIRST walk for 400003 steps (8 resets) in 785 ms. (508 steps per ms) remains 15/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 786 ms. (508 steps per ms) remains 14/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 730 ms. (547 steps per ms) remains 13/14 properties
BEST_FIRST walk for 400003 steps (8 resets) in 853 ms. (468 steps per ms) remains 11/13 properties
BEST_FIRST walk for 400002 steps (8 resets) in 676 ms. (590 steps per ms) remains 10/11 properties
BEST_FIRST walk for 400001 steps (8 resets) in 734 ms. (544 steps per ms) remains 8/10 properties
BEST_FIRST walk for 400004 steps (8 resets) in 695 ms. (574 steps per ms) remains 7/8 properties
BEST_FIRST walk for 400004 steps (8 resets) in 608 ms. (656 steps per ms) remains 6/7 properties
BEST_FIRST walk for 400003 steps (8 resets) in 600 ms. (665 steps per ms) remains 5/6 properties
BEST_FIRST walk for 400004 steps (8 resets) in 604 ms. (661 steps per ms) remains 4/5 properties
BEST_FIRST walk for 400004 steps (8 resets) in 602 ms. (663 steps per ms) remains 3/4 properties
BEST_FIRST walk for 400004 steps (8 resets) in 520 ms. (767 steps per ms) remains 1/3 properties
// Phase 1: matrix 762 rows 198 cols
[2025-05-29 18:14:59] [INFO ] Computed 18 invariants in 6 ms
[2025-05-29 18:14:59] [INFO ] State equation strengthened by 56 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) 21/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/198 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 762/960 variables, 198/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/960 variables, 56/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/960 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/960 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 960/960 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 198/198 constraints, ReadFeed: 56/56 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) 21/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/198 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 762/960 variables, 198/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/960 variables, 56/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/960 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/960 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/960 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 960/960 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 198/198 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 525ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 762/762 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 169 transition count 327
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 169 transition count 327
Applied a total of 58 rules in 13 ms. Remains 169 /198 variables (removed 29) and now considering 327/762 (removed 435) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 169/198 places, 327/762 transitions.
RANDOM walk for 4000000 steps (8 resets) in 5277 ms. (757 steps per ms) remains 1/1 properties
BEST_FIRST walk for 270400 steps (0 resets) in 147 ms. (1827 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 1208 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 401 transition count 1272
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 345 transition count 1272
Applied a total of 112 rules in 27 ms. Remains 345 /401 variables (removed 56) and now considering 1272/1328 (removed 56) transitions.
// Phase 1: matrix 1272 rows 345 cols
[2025-05-29 18:15:01] [INFO ] Computed 19 invariants in 9 ms
[2025-05-29 18:15:01] [INFO ] Implicit Places using invariants in 590 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 591 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 344/401 places, 1272/1328 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 344 transition count 1208
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 280 transition count 1208
Applied a total of 128 rules in 7 ms. Remains 280 /344 variables (removed 64) and now considering 1208/1272 (removed 64) transitions.
// Phase 1: matrix 1208 rows 280 cols
[2025-05-29 18:15:01] [INFO ] Computed 18 invariants in 6 ms
[2025-05-29 18:15:02] [INFO ] Implicit Places using invariants in 581 ms returned []
[2025-05-29 18:15:02] [INFO ] Invariant cache hit.
[2025-05-29 18:15:02] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-05-29 18:15:04] [INFO ] Implicit Places using invariants and state equation in 1842 ms returned []
Implicit Place search using SMT with State Equation took 2426 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 280/401 places, 1208/1328 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 3052 ms. Remains : 280/401 places, 1208/1328 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :1208 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 1208 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 169859 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Anderson-PT-08

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 401
TRANSITIONS: 1328
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 5088
NUPN UNITS: 11
LOADING TIME: 0.749

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.052
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.074
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 989
MODEL NAME: /home/mcc/execution/model
401 places, 1328 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

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 Liveness -timeout 180 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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-08"
export BK_EXAMINATION="Liveness"
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-08, examination is Liveness"
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-174853743400114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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