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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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 7.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K 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 461K 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 1748542301140

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-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:11:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-05-29 18:11:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:11:42] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2025-05-29 18:11:42] [INFO ] Transformed 309 places.
[2025-05-29 18:11:42] [INFO ] Transformed 917 transitions.
[2025-05-29 18:11:42] [INFO ] Found NUPN structural information;
[2025-05-29 18:11:42] [INFO ] Parsed PT model containing 309 places and 917 transitions and 3500 arcs in 210 ms.
Built sparse matrix representations for Structural reductions in 7 ms.25892KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 309/309 places, 917/917 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 64 ms. Remains 309 /309 variables (removed 0) and now considering 917/917 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 78 ms. Remains : 309/309 places, 917/917 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 309/309 places, 917/917 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 26 ms. Remains 309 /309 variables (removed 0) and now considering 917/917 (removed 0) transitions.
// Phase 1: matrix 917 rows 309 cols
[2025-05-29 18:11:42] [INFO ] Computed 17 invariants in 25 ms
[2025-05-29 18:11:43] [INFO ] Implicit Places using invariants in 262 ms returned []
[2025-05-29 18:11:43] [INFO ] Invariant cache hit.
[2025-05-29 18:11:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-29 18:11:43] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2025-05-29 18:11:43] [INFO ] Redundant transitions in 53 ms returned []
Running 910 sub problems to find dead transitions.
[2025-05-29 18:11:43] [INFO ] Invariant cache hit.
[2025-05-29 18:11:43] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 309/309 constraints. Problems are: Problem set: 0 solved, 910 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 910 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 9/326 constraints. Problems are: Problem set: 0 solved, 910 unsolved
[2025-05-29 18:11:50] [INFO ] Deduced a trap composed of 85 places in 224 ms of which 26 ms to minimize.
[2025-05-29 18:11:51] [INFO ] Deduced a trap composed of 106 places in 205 ms of which 3 ms to minimize.
[2025-05-29 18:11:51] [INFO ] Deduced a trap composed of 64 places in 179 ms of which 2 ms to minimize.
[2025-05-29 18:11:52] [INFO ] Deduced a trap composed of 185 places in 175 ms of which 2 ms to minimize.
[2025-05-29 18:11:52] [INFO ] Deduced a trap composed of 90 places in 167 ms of which 2 ms to minimize.
[2025-05-29 18:11:52] [INFO ] Deduced a trap composed of 136 places in 161 ms of which 2 ms to minimize.
[2025-05-29 18:11:52] [INFO ] Deduced a trap composed of 146 places in 167 ms of which 2 ms to minimize.
[2025-05-29 18:11:53] [INFO ] Deduced a trap composed of 129 places in 155 ms of which 3 ms to minimize.
[2025-05-29 18:11:53] [INFO ] Deduced a trap composed of 154 places in 154 ms of which 2 ms to minimize.
[2025-05-29 18:11:53] [INFO ] Deduced a trap composed of 80 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:11:53] [INFO ] Deduced a trap composed of 85 places in 152 ms of which 3 ms to minimize.
[2025-05-29 18:11:53] [INFO ] Deduced a trap composed of 73 places in 158 ms of which 3 ms to minimize.
[2025-05-29 18:11:53] [INFO ] Deduced a trap composed of 101 places in 150 ms of which 2 ms to minimize.
[2025-05-29 18:11:54] [INFO ] Deduced a trap composed of 84 places in 157 ms of which 2 ms to minimize.
[2025-05-29 18:11:54] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 2 ms to minimize.
[2025-05-29 18:11:54] [INFO ] Deduced a trap composed of 151 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:11:54] [INFO ] Deduced a trap composed of 149 places in 156 ms of which 2 ms to minimize.
[2025-05-29 18:11:54] [INFO ] Deduced a trap composed of 95 places in 150 ms of which 2 ms to minimize.
[2025-05-29 18:11:54] [INFO ] Deduced a trap composed of 77 places in 146 ms of which 2 ms to minimize.
[2025-05-29 18:11:55] [INFO ] Deduced a trap composed of 153 places in 156 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 20/346 constraints. Problems are: Problem set: 0 solved, 910 unsolved
[2025-05-29 18:12:02] [INFO ] Deduced a trap composed of 173 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:12:03] [INFO ] Deduced a trap composed of 66 places in 149 ms of which 2 ms to minimize.
[2025-05-29 18:12:03] [INFO ] Deduced a trap composed of 173 places in 145 ms of which 2 ms to minimize.
[2025-05-29 18:12:03] [INFO ] Deduced a trap composed of 129 places in 173 ms of which 1 ms to minimize.
[2025-05-29 18:12:03] [INFO ] Deduced a trap composed of 152 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:12:03] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 2 ms to minimize.
[2025-05-29 18:12:03] [INFO ] Deduced a trap composed of 195 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:12:03] [INFO ] Deduced a trap composed of 156 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:12:04] [INFO ] Deduced a trap composed of 154 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:12:04] [INFO ] Deduced a trap composed of 126 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:12:04] [INFO ] Deduced a trap composed of 164 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:12:04] [INFO ] Deduced a trap composed of 155 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:12:04] [INFO ] Deduced a trap composed of 169 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:12:04] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 3 ms to minimize.
[2025-05-29 18:12:04] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:12:05] [INFO ] Deduced a trap composed of 120 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:12:05] [INFO ] Deduced a trap composed of 118 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:12:05] [INFO ] Deduced a trap composed of 127 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:12:05] [INFO ] Deduced a trap composed of 153 places in 138 ms of which 3 ms to minimize.
[2025-05-29 18:12:05] [INFO ] Deduced a trap composed of 147 places in 137 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/366 constraints. Problems are: Problem set: 0 solved, 910 unsolved
[2025-05-29 18:12:07] [INFO ] Deduced a trap composed of 198 places in 176 ms of which 2 ms to minimize.
[2025-05-29 18:12:08] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 2 ms to minimize.
[2025-05-29 18:12:08] [INFO ] Deduced a trap composed of 99 places in 149 ms of which 2 ms to minimize.
[2025-05-29 18:12:08] [INFO ] Deduced a trap composed of 109 places in 145 ms of which 2 ms to minimize.
[2025-05-29 18:12:08] [INFO ] Deduced a trap composed of 117 places in 167 ms of which 2 ms to minimize.
[2025-05-29 18:12:08] [INFO ] Deduced a trap composed of 123 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:12:09] [INFO ] Deduced a trap composed of 168 places in 166 ms of which 2 ms to minimize.
[2025-05-29 18:12:09] [INFO ] Deduced a trap composed of 137 places in 160 ms of which 2 ms to minimize.
[2025-05-29 18:12:09] [INFO ] Deduced a trap composed of 185 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:12:09] [INFO ] Deduced a trap composed of 129 places in 157 ms of which 3 ms to minimize.
[2025-05-29 18:12:09] [INFO ] Deduced a trap composed of 93 places in 167 ms of which 3 ms to minimize.
[2025-05-29 18:12:09] [INFO ] Deduced a trap composed of 78 places in 160 ms of which 2 ms to minimize.
[2025-05-29 18:12:10] [INFO ] Deduced a trap composed of 141 places in 171 ms of which 2 ms to minimize.
[2025-05-29 18:12:10] [INFO ] Deduced a trap composed of 168 places in 164 ms of which 3 ms to minimize.
[2025-05-29 18:12:10] [INFO ] Deduced a trap composed of 109 places in 160 ms of which 2 ms to minimize.
[2025-05-29 18:12:10] [INFO ] Deduced a trap composed of 105 places in 160 ms of which 3 ms to minimize.
[2025-05-29 18:12:10] [INFO ] Deduced a trap composed of 60 places in 151 ms of which 2 ms to minimize.
[2025-05-29 18:12:11] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 2 ms to minimize.
[2025-05-29 18:12:11] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 2 ms to minimize.
[2025-05-29 18:12:11] [INFO ] Deduced a trap composed of 108 places in 148 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 20/386 constraints. Problems are: Problem set: 0 solved, 910 unsolved
[2025-05-29 18:12:14] [INFO ] Deduced a trap composed of 210 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:12:14] [INFO ] Deduced a trap composed of 107 places in 148 ms of which 2 ms to minimize.
[2025-05-29 18:12:14] [INFO ] Deduced a trap composed of 141 places in 162 ms of which 2 ms to minimize.
[2025-05-29 18:12:14] [INFO ] Deduced a trap composed of 144 places in 164 ms of which 3 ms to minimize.
[2025-05-29 18:12:15] [INFO ] Deduced a trap composed of 126 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:12:15] [INFO ] Deduced a trap composed of 193 places in 156 ms of which 2 ms to minimize.
SMT process timed out in 31667ms, After SMT, problems are : Problem set: 0 solved, 910 unsolved
Search for dead transitions found 0 dead transitions in 31802ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 32559 ms. Remains : 309/309 places, 917/917 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2152 ms (no deadlock found). (steps per millisecond=580 )
Random directed walk for 1250002 steps, including 0 resets, run took 1888 ms (no deadlock found). (steps per millisecond=662 )
[2025-05-29 18:12:19] [INFO ] Invariant cache hit.
[2025-05-29 18:12:19] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-29 18:12:19] [INFO ] [Real]Absence check using 8 positive and 9 generalized place invariants in 363 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 309/309 places, 917/917 transitions.
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 42 Pre rules applied. Total rules applied 0 place count 309 transition count 875
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 84 place count 267 transition count 875
Applied a total of 84 rules in 27 ms. Remains 267 /309 variables (removed 42) and now considering 875/917 (removed 42) transitions.
// Phase 1: matrix 875 rows 267 cols
[2025-05-29 18:12:19] [INFO ] Computed 17 invariants in 9 ms
[2025-05-29 18:12:20] [INFO ] Implicit Places using invariants in 450 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 454 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 266/309 places, 875/917 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 266 transition count 826
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 217 transition count 826
Applied a total of 98 rules in 7 ms. Remains 217 /266 variables (removed 49) and now considering 826/875 (removed 49) transitions.
// Phase 1: matrix 826 rows 217 cols
[2025-05-29 18:12:20] [INFO ] Computed 16 invariants in 6 ms
[2025-05-29 18:12:20] [INFO ] Implicit Places using invariants in 365 ms returned []
[2025-05-29 18:12:20] [INFO ] Invariant cache hit.
[2025-05-29 18:12:21] [INFO ] State equation strengthened by 77 read => feed constraints.
[2025-05-29 18:12:21] [INFO ] Implicit Places using invariants and state equation in 1172 ms returned []
Implicit Place search using SMT with State Equation took 1539 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 217/309 places, 826/917 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 2028 ms. Remains : 217/309 places, 826/917 transitions.
Initial state reduction rules removed 7 formulas.
RANDOM walk for 40000 steps (8 resets) in 2568 ms. (15 steps per ms) remains 234/819 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 234/234 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 234/234 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 234/234 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 234/234 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 234/234 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 234/234 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 234/234 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 234/234 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 234/234 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 234/234 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 234/234 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 234/234 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 234/234 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 234/234 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 234/234 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 234/234 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 234/234 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 234/234 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 234/234 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 234/234 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 234/234 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 234/234 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 234/234 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 234/234 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 234/234 properties
[2025-05-29 18:12:22] [INFO ] Invariant cache hit.
[2025-05-29 18:12:22] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 130/217 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 130/226 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 7/233 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2025-05-29 18:12:25] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 1 ms to minimize.
[2025-05-29 18:12:25] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 1 ms to minimize.
[2025-05-29 18:12:25] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 1 ms to minimize.
[2025-05-29 18:12:25] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:12:25] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 2 ms to minimize.
[2025-05-29 18:12:25] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:12:26] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 1 ms to minimize.
[2025-05-29 18:12:26] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 2 ms to minimize.
[2025-05-29 18:12:26] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2025-05-29 18:12:26] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 1 ms to minimize.
[2025-05-29 18:12:26] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2025-05-29 18:12:26] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 1 ms to minimize.
[2025-05-29 18:12:26] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
[2025-05-29 18:12:26] [INFO ] Deduced a trap composed of 70 places in 160 ms of which 2 ms to minimize.
[2025-05-29 18:12:27] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 1 ms to minimize.
[2025-05-29 18:12:27] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:12:27] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:12:27] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 2 ms to minimize.
[2025-05-29 18:12:27] [INFO ] Deduced a trap composed of 116 places in 137 ms of which 1 ms to minimize.
[2025-05-29 18:12:27] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 20/253 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 217/1043 variables, and 253 constraints, problems are : Problem set: 0 solved, 234 unsolved in 5025 ms.
Refiners :[Domain max(s): 217/217 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/217 constraints, ReadFeed: 0/77 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 130/217 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 130/226 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 7/233 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 20/253 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2025-05-29 18:12:29] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 2 ms to minimize.
[2025-05-29 18:12:29] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 2 ms to minimize.
[2025-05-29 18:12:29] [INFO ] Deduced a trap composed of 63 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:12:30] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 2 ms to minimize.
[2025-05-29 18:12:30] [INFO ] Deduced a trap composed of 63 places in 120 ms of which 2 ms to minimize.
[2025-05-29 18:12:30] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 2 ms to minimize.
[2025-05-29 18:12:30] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2025-05-29 18:12:30] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 2 ms to minimize.
[2025-05-29 18:12:30] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2025-05-29 18:12:30] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 2 ms to minimize.
[2025-05-29 18:12:30] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 2 ms to minimize.
[2025-05-29 18:12:31] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 1 ms to minimize.
[2025-05-29 18:12:31] [INFO ] Deduced a trap composed of 64 places in 118 ms of which 1 ms to minimize.
[2025-05-29 18:12:31] [INFO ] Deduced a trap composed of 52 places in 124 ms of which 2 ms to minimize.
[2025-05-29 18:12:31] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2025-05-29 18:12:31] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 1 ms to minimize.
[2025-05-29 18:12:31] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 1 ms to minimize.
[2025-05-29 18:12:31] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 1 ms to minimize.
[2025-05-29 18:12:31] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 1 ms to minimize.
[2025-05-29 18:12:32] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 20/273 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2025-05-29 18:12:32] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 1 ms to minimize.
[2025-05-29 18:12:32] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 1 ms to minimize.
[2025-05-29 18:12:32] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 2 ms to minimize.
[2025-05-29 18:12:33] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 2 ms to minimize.
[2025-05-29 18:12:33] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 2 ms to minimize.
[2025-05-29 18:12:33] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
SMT process timed out in 10382ms, After SMT, problems are : Problem set: 0 solved, 234 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 87 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 826/826 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 189 transition count 798
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 189 transition count 798
Applied a total of 56 rules in 28 ms. Remains 189 /217 variables (removed 28) and now considering 798/826 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 189/217 places, 798/826 transitions.
RANDOM walk for 4000000 steps (8 resets) in 37055 ms. (107 steps per ms) remains 38/234 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1195 ms. (334 steps per ms) remains 36/38 properties
BEST_FIRST walk for 400002 steps (8 resets) in 870 ms. (459 steps per ms) remains 35/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 675 ms. (591 steps per ms) remains 34/35 properties
BEST_FIRST walk for 400002 steps (8 resets) in 645 ms. (619 steps per ms) remains 32/34 properties
BEST_FIRST walk for 400003 steps (8 resets) in 755 ms. (529 steps per ms) remains 31/32 properties
BEST_FIRST walk for 400001 steps (8 resets) in 651 ms. (613 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400002 steps (8 resets) in 583 ms. (684 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 693 ms. (576 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 731 ms. (546 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 585 ms. (682 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 556 ms. (718 steps per ms) remains 25/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 630 ms. (633 steps per ms) remains 23/25 properties
BEST_FIRST walk for 400002 steps (8 resets) in 662 ms. (603 steps per ms) remains 21/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 596 ms. (670 steps per ms) remains 20/21 properties
BEST_FIRST walk for 400002 steps (8 resets) in 592 ms. (674 steps per ms) remains 18/20 properties
BEST_FIRST walk for 400004 steps (8 resets) in 536 ms. (744 steps per ms) remains 16/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 506 ms. (788 steps per ms) remains 15/16 properties
BEST_FIRST walk for 400001 steps (8 resets) in 498 ms. (801 steps per ms) remains 14/15 properties
BEST_FIRST walk for 400003 steps (8 resets) in 485 ms. (823 steps per ms) remains 11/14 properties
BEST_FIRST walk for 400002 steps (8 resets) in 407 ms. (980 steps per ms) remains 9/11 properties
BEST_FIRST walk for 400003 steps (8 resets) in 409 ms. (975 steps per ms) remains 8/9 properties
BEST_FIRST walk for 400004 steps (8 resets) in 387 ms. (1030 steps per ms) remains 7/8 properties
BEST_FIRST walk for 400003 steps (8 resets) in 358 ms. (1114 steps per ms) remains 5/7 properties
BEST_FIRST walk for 400003 steps (8 resets) in 329 ms. (1212 steps per ms) remains 4/5 properties
BEST_FIRST walk for 400004 steps (8 resets) in 348 ms. (1146 steps per ms) remains 3/4 properties
BEST_FIRST walk for 400002 steps (8 resets) in 300 ms. (1328 steps per ms) remains 2/3 properties
BEST_FIRST walk for 146145 steps (2 resets) in 141 ms. (1029 steps per ms) remains 0/2 properties
Able to resolve query QuasiLiveness after proving 826 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 309/309 places, 917/917 transitions.
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 42 Pre rules applied. Total rules applied 0 place count 309 transition count 875
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 84 place count 267 transition count 875
Applied a total of 84 rules in 30 ms. Remains 267 /309 variables (removed 42) and now considering 875/917 (removed 42) transitions.
// Phase 1: matrix 875 rows 267 cols
[2025-05-29 18:12:47] [INFO ] Computed 17 invariants in 10 ms
[2025-05-29 18:12:48] [INFO ] Implicit Places using invariants in 444 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 447 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 266/309 places, 875/917 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 266 transition count 826
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 217 transition count 826
Applied a total of 98 rules in 8 ms. Remains 217 /266 variables (removed 49) and now considering 826/875 (removed 49) transitions.
// Phase 1: matrix 826 rows 217 cols
[2025-05-29 18:12:48] [INFO ] Computed 16 invariants in 10 ms
[2025-05-29 18:12:48] [INFO ] Implicit Places using invariants in 375 ms returned []
[2025-05-29 18:12:48] [INFO ] Invariant cache hit.
[2025-05-29 18:12:49] [INFO ] State equation strengthened by 77 read => feed constraints.
[2025-05-29 18:12:49] [INFO ] Implicit Places using invariants and state equation in 1150 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 217/309 places, 826/917 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 2012 ms. Remains : 217/309 places, 826/917 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 :826 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 826 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 67698 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Anderson-PT-07

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 309
TRANSITIONS: 917
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 3500
NUPN UNITS: 10
LOADING TIME: 0.615

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.041
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 0.898
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: 918
MODEL NAME: /home/mcc/execution/model
309 places, 917 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.
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML
Error in allocating array of size 4194304 at unique_table.cc, line 313
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-07"
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-07, 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-174853743300109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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