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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K 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 302K 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 1748542239150

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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:10:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-05-29 18:10:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:10:40] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2025-05-29 18:10:40] [INFO ] Transformed 229 places.
[2025-05-29 18:10:40] [INFO ] Transformed 600 transitions.
[2025-05-29 18:10:40] [INFO ] Found NUPN structural information;
[2025-05-29 18:10:40] [INFO ] Parsed PT model containing 229 places and 600 transitions and 2280 arcs in 203 ms.
Built sparse matrix representations for Structural reductions in 7 ms.18484KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 229/229 places, 600/600 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 45 ms. Remains 229 /229 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 58 ms. Remains : 229/229 places, 600/600 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 229/229 places, 600/600 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 23 ms. Remains 229 /229 variables (removed 0) and now considering 600/600 (removed 0) transitions.
// Phase 1: matrix 600 rows 229 cols
[2025-05-29 18:10:40] [INFO ] Computed 15 invariants in 32 ms
[2025-05-29 18:10:41] [INFO ] Implicit Places using invariants in 269 ms returned []
[2025-05-29 18:10:41] [INFO ] Invariant cache hit.
[2025-05-29 18:10:41] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-05-29 18:10:41] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2025-05-29 18:10:41] [INFO ] Redundant transitions in 31 ms returned []
Running 594 sub problems to find dead transitions.
[2025-05-29 18:10:41] [INFO ] Invariant cache hit.
[2025-05-29 18:10:41] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 7/236 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 8/244 constraints. Problems are: Problem set: 0 solved, 594 unsolved
[2025-05-29 18:10:45] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 19 ms to minimize.
[2025-05-29 18:10:45] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2025-05-29 18:10:45] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2025-05-29 18:10:45] [INFO ] Deduced a trap composed of 156 places in 106 ms of which 2 ms to minimize.
[2025-05-29 18:10:45] [INFO ] Deduced a trap composed of 122 places in 104 ms of which 2 ms to minimize.
[2025-05-29 18:10:46] [INFO ] Deduced a trap composed of 148 places in 100 ms of which 2 ms to minimize.
[2025-05-29 18:10:46] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 2 ms to minimize.
[2025-05-29 18:10:46] [INFO ] Deduced a trap composed of 120 places in 110 ms of which 5 ms to minimize.
[2025-05-29 18:10:46] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 2 ms to minimize.
[2025-05-29 18:10:46] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2025-05-29 18:10:46] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 1 ms to minimize.
[2025-05-29 18:10:46] [INFO ] Deduced a trap composed of 141 places in 101 ms of which 2 ms to minimize.
[2025-05-29 18:10:46] [INFO ] Deduced a trap composed of 138 places in 98 ms of which 2 ms to minimize.
[2025-05-29 18:10:47] [INFO ] Deduced a trap composed of 152 places in 94 ms of which 1 ms to minimize.
[2025-05-29 18:10:47] [INFO ] Deduced a trap composed of 144 places in 101 ms of which 2 ms to minimize.
[2025-05-29 18:10:47] [INFO ] Deduced a trap composed of 144 places in 101 ms of which 1 ms to minimize.
[2025-05-29 18:10:47] [INFO ] Deduced a trap composed of 131 places in 105 ms of which 1 ms to minimize.
[2025-05-29 18:10:47] [INFO ] Deduced a trap composed of 150 places in 117 ms of which 2 ms to minimize.
[2025-05-29 18:10:47] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 1 ms to minimize.
[2025-05-29 18:10:47] [INFO ] Deduced a trap composed of 143 places in 112 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 594 unsolved
[2025-05-29 18:10:51] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 1 ms to minimize.
[2025-05-29 18:10:51] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 2 ms to minimize.
[2025-05-29 18:10:52] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2025-05-29 18:10:52] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2025-05-29 18:10:52] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 1 ms to minimize.
[2025-05-29 18:10:52] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2025-05-29 18:10:52] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 1 ms to minimize.
[2025-05-29 18:10:52] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 1 ms to minimize.
[2025-05-29 18:10:52] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:10:52] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2025-05-29 18:10:53] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2025-05-29 18:10:53] [INFO ] Deduced a trap composed of 138 places in 115 ms of which 1 ms to minimize.
[2025-05-29 18:10:53] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2025-05-29 18:10:53] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 3 ms to minimize.
[2025-05-29 18:10:53] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 1 ms to minimize.
[2025-05-29 18:10:53] [INFO ] Deduced a trap composed of 127 places in 100 ms of which 2 ms to minimize.
[2025-05-29 18:10:54] [INFO ] Deduced a trap composed of 131 places in 107 ms of which 1 ms to minimize.
[2025-05-29 18:10:54] [INFO ] Deduced a trap composed of 148 places in 98 ms of which 1 ms to minimize.
[2025-05-29 18:10:54] [INFO ] Deduced a trap composed of 146 places in 103 ms of which 1 ms to minimize.
[2025-05-29 18:10:54] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 594 unsolved
[2025-05-29 18:10:55] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2025-05-29 18:10:55] [INFO ] Deduced a trap composed of 145 places in 115 ms of which 1 ms to minimize.
[2025-05-29 18:10:56] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2025-05-29 18:10:56] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2025-05-29 18:10:56] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 1 ms to minimize.
[2025-05-29 18:10:56] [INFO ] Deduced a trap composed of 119 places in 115 ms of which 2 ms to minimize.
[2025-05-29 18:10:56] [INFO ] Deduced a trap composed of 129 places in 104 ms of which 1 ms to minimize.
[2025-05-29 18:10:56] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 2 ms to minimize.
[2025-05-29 18:10:56] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:10:56] [INFO ] Deduced a trap composed of 130 places in 112 ms of which 1 ms to minimize.
[2025-05-29 18:10:57] [INFO ] Deduced a trap composed of 114 places in 128 ms of which 4 ms to minimize.
[2025-05-29 18:10:57] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 2 ms to minimize.
[2025-05-29 18:10:57] [INFO ] Deduced a trap composed of 111 places in 103 ms of which 2 ms to minimize.
[2025-05-29 18:10:57] [INFO ] Deduced a trap composed of 112 places in 115 ms of which 1 ms to minimize.
[2025-05-29 18:10:57] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 1 ms to minimize.
[2025-05-29 18:10:57] [INFO ] Deduced a trap composed of 149 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:10:57] [INFO ] Deduced a trap composed of 154 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:10:58] [INFO ] Deduced a trap composed of 144 places in 107 ms of which 2 ms to minimize.
[2025-05-29 18:10:58] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 1 ms to minimize.
[2025-05-29 18:10:58] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 594 unsolved
[2025-05-29 18:10:59] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:11:00] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 1 ms to minimize.
[2025-05-29 18:11:00] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 2 ms to minimize.
[2025-05-29 18:11:00] [INFO ] Deduced a trap composed of 121 places in 106 ms of which 2 ms to minimize.
[2025-05-29 18:11:00] [INFO ] Deduced a trap composed of 108 places in 100 ms of which 1 ms to minimize.
[2025-05-29 18:11:00] [INFO ] Deduced a trap composed of 127 places in 102 ms of which 2 ms to minimize.
[2025-05-29 18:11:00] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2025-05-29 18:11:00] [INFO ] Deduced a trap composed of 110 places in 106 ms of which 1 ms to minimize.
[2025-05-29 18:11:01] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 1 ms to minimize.
[2025-05-29 18:11:01] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2025-05-29 18:11:01] [INFO ] Deduced a trap composed of 124 places in 117 ms of which 1 ms to minimize.
[2025-05-29 18:11:01] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2025-05-29 18:11:01] [INFO ] Deduced a trap composed of 112 places in 102 ms of which 2 ms to minimize.
[2025-05-29 18:11:01] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2025-05-29 18:11:01] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 2 ms to minimize.
[2025-05-29 18:11:02] [INFO ] Deduced a trap composed of 139 places in 113 ms of which 2 ms to minimize.
[2025-05-29 18:11:02] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:11:02] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2025-05-29 18:11:02] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 1 ms to minimize.
[2025-05-29 18:11:03] [INFO ] Deduced a trap composed of 142 places in 107 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 20/324 constraints. Problems are: Problem set: 0 solved, 594 unsolved
[2025-05-29 18:11:10] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
[2025-05-29 18:11:10] [INFO ] Deduced a trap composed of 170 places in 112 ms of which 2 ms to minimize.
[2025-05-29 18:11:10] [INFO ] Deduced a trap composed of 110 places in 115 ms of which 1 ms to minimize.
[2025-05-29 18:11:10] [INFO ] Deduced a trap composed of 144 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:11:10] [INFO ] Deduced a trap composed of 145 places in 100 ms of which 2 ms to minimize.
[2025-05-29 18:11:10] [INFO ] Deduced a trap composed of 112 places in 108 ms of which 1 ms to minimize.
[2025-05-29 18:11:11] [INFO ] Deduced a trap composed of 117 places in 98 ms of which 2 ms to minimize.
[2025-05-29 18:11:11] [INFO ] Deduced a trap composed of 141 places in 113 ms of which 2 ms to minimize.
[2025-05-29 18:11:11] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:11:11] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 1 ms to minimize.
[2025-05-29 18:11:11] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 1 ms to minimize.
[2025-05-29 18:11:11] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 1 ms to minimize.
[2025-05-29 18:11:11] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2025-05-29 18:11:12] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 1 ms to minimize.
[2025-05-29 18:11:12] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 2 ms to minimize.
[2025-05-29 18:11:12] [INFO ] Deduced a trap composed of 141 places in 112 ms of which 2 ms to minimize.
[2025-05-29 18:11:12] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 1 ms to minimize.
SMT process timed out in 30940ms, After SMT, problems are : Problem set: 0 solved, 594 unsolved
Search for dead transitions found 0 dead transitions in 31032ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 31844 ms. Remains : 229/229 places, 600/600 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1788 ms (no deadlock found). (steps per millisecond=699 )
Random directed walk for 1250000 steps, including 0 resets, run took 1526 ms (no deadlock found). (steps per millisecond=819 )
[2025-05-29 18:11:15] [INFO ] Invariant cache hit.
[2025-05-29 18:11:16] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 18:11:16] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 131 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 229/229 places, 600/600 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 229 transition count 570
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 199 transition count 570
Applied a total of 60 rules in 24 ms. Remains 199 /229 variables (removed 30) and now considering 570/600 (removed 30) transitions.
// Phase 1: matrix 570 rows 199 cols
[2025-05-29 18:11:16] [INFO ] Computed 15 invariants in 10 ms
[2025-05-29 18:11:16] [INFO ] Implicit Places using invariants in 318 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 321 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 198/229 places, 570/600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 198 transition count 534
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 162 transition count 534
Applied a total of 72 rules in 6 ms. Remains 162 /198 variables (removed 36) and now considering 534/570 (removed 36) transitions.
// Phase 1: matrix 534 rows 162 cols
[2025-05-29 18:11:16] [INFO ] Computed 14 invariants in 5 ms
[2025-05-29 18:11:16] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-05-29 18:11:16] [INFO ] Invariant cache hit.
[2025-05-29 18:11:16] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-29 18:11:17] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 162/229 places, 534/600 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1322 ms. Remains : 162/229 places, 534/600 transitions.
Initial state reduction rules removed 6 formulas.
RANDOM walk for 40000 steps (8 resets) in 2219 ms. (18 steps per ms) remains 82/528 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 71/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 70/71 properties
BEST_FIRST walk for 4002 steps (8 resets) in 80 ms. (49 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 68/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 67/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 66/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/66 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 53/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 49/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 46/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 23/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/17 properties
[2025-05-29 18:11:18] [INFO ] Invariant cache hit.
[2025-05-29 18:11:18] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 110/122 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 110/127 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 33/155 variables, 7/134 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 33/167 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 7/162 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 7/176 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2025-05-29 18:11:18] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
[2025-05-29 18:11:19] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 1 ms to minimize.
[2025-05-29 18:11:19] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 1 ms to minimize.
[2025-05-29 18:11:19] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 1 ms to minimize.
[2025-05-29 18:11:19] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 1 ms to minimize.
[2025-05-29 18:11:19] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 2 ms to minimize.
[2025-05-29 18:11:19] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 1 ms to minimize.
[2025-05-29 18:11:19] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
[2025-05-29 18:11:19] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 1 ms to minimize.
[2025-05-29 18:11:19] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2025-05-29 18:11:20] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 2 ms to minimize.
[2025-05-29 18:11:20] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 1 ms to minimize.
[2025-05-29 18:11:20] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2025-05-29 18:11:20] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 1 ms to minimize.
[2025-05-29 18:11:20] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 1 ms to minimize.
[2025-05-29 18:11:20] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 1 ms to minimize.
[2025-05-29 18:11:20] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 1 ms to minimize.
[2025-05-29 18:11:20] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 1 ms to minimize.
[2025-05-29 18:11:20] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 1 ms to minimize.
[2025-05-29 18:11:20] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 20/196 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 534/696 variables, 162/358 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 54/412 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/696 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 696/696 variables, and 412 constraints, problems are : Problem set: 0 solved, 15 unsolved in 3960 ms.
Refiners :[Domain max(s): 162/162 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 110/122 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 110/127 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 33/155 variables, 7/134 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 33/167 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 7/162 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 7/176 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 20/196 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2025-05-29 18:11:22] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 1 ms to minimize.
[2025-05-29 18:11:23] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 534/696 variables, 162/360 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 54/414 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/696 variables, 15/429 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/696 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 0/696 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 696/696 variables, and 429 constraints, problems are : Problem set: 0 solved, 15 unsolved in 3405 ms.
Refiners :[Domain max(s): 162/162 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 22/22 constraints]
After SMT, in 7415ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 4 properties in 2873 ms.
Support contains 9 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 534/534 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 109 transition count 251
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 109 transition count 251
Applied a total of 106 rules in 19 ms. Remains 109 /162 variables (removed 53) and now considering 251/534 (removed 283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 109/162 places, 251/534 transitions.
RANDOM walk for 4000000 steps (8 resets) in 9930 ms. (402 steps per ms) remains 4/11 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 2264 ms. (1766 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2116 ms. (1889 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 1946 ms. (2054 steps per ms) remains 1/2 properties
BEST_FIRST walk for 45175 steps (0 resets) in 32 ms. (1368 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 534 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 229/229 places, 600/600 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 229 transition count 570
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 199 transition count 570
Applied a total of 60 rules in 15 ms. Remains 199 /229 variables (removed 30) and now considering 570/600 (removed 30) transitions.
// Phase 1: matrix 570 rows 199 cols
[2025-05-29 18:11:33] [INFO ] Computed 15 invariants in 8 ms
[2025-05-29 18:11:33] [INFO ] Implicit Places using invariants in 301 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 302 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 198/229 places, 570/600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 198 transition count 534
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 162 transition count 534
Applied a total of 72 rules in 6 ms. Remains 162 /198 variables (removed 36) and now considering 534/570 (removed 36) transitions.
// Phase 1: matrix 534 rows 162 cols
[2025-05-29 18:11:33] [INFO ] Computed 14 invariants in 3 ms
[2025-05-29 18:11:33] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-05-29 18:11:33] [INFO ] Invariant cache hit.
[2025-05-29 18:11:34] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-29 18:11:34] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 162/229 places, 534/600 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1258 ms. Remains : 162/229 places, 534/600 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 :534 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 534 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 54309 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Anderson-PT-06

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 229
TRANSITIONS: 600
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 2280
NUPN UNITS: 9
LOADING TIME: 0.527

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.033
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 0.8
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: 942
MODEL NAME: /home/mcc/execution/model
229 places, 600 transitions.

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.
Building monolithic NSF...

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

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-06"
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-06, 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-174853743300104"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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