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.r252-tall-174915605600212.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 TokenRing-PT-010, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r252-tall-174915605600212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 169K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 891K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 345K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 65K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 240K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 318K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 947K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 402K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.2M May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.5M May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.8M May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 519K May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1749200475142

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=TokenRing-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-06 09:01:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-06 09:01:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 09:01:16] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2025-06-06 09:01:16] [INFO ] Transformed 121 places.
[2025-06-06 09:01:16] [INFO ] Transformed 1111 transitions.
[2025-06-06 09:01:16] [INFO ] Found NUPN structural information;
[2025-06-06 09:01:16] [INFO ] Parsed PT model containing 121 places and 1111 transitions and 4444 arcs in 230 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 24 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
// Phase 1: matrix 1111 rows 121 cols
[2025-06-06 09:01:16] [INFO ] Computed 11 invariants in 26 ms
[2025-06-06 09:01:17] [INFO ] Implicit Places using invariants in 382 ms returned []
[2025-06-06 09:01:17] [INFO ] Invariant cache hit.
[2025-06-06 09:01:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-06 09:01:18] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1452 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2025-06-06 09:01:18] [INFO ] Invariant cache hit.
[2025-06-06 09:01:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:01:22] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 14 ms to minimize.
[2025-06-06 09:01:22] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 2 ms to minimize.
[2025-06-06 09:01:22] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 2 ms to minimize.
[2025-06-06 09:01:23] [INFO ] Deduced a trap composed of 65 places in 110 ms of which 1 ms to minimize.
[2025-06-06 09:01:23] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 3 ms to minimize.
[2025-06-06 09:01:23] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:01:23] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2025-06-06 09:01:23] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 1 ms to minimize.
[2025-06-06 09:01:23] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 1 ms to minimize.
[2025-06-06 09:01:23] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 3 ms to minimize.
[2025-06-06 09:01:23] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2025-06-06 09:01:23] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2025-06-06 09:01:24] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:01:24] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:01:24] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:01:24] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:01:24] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 1 ms to minimize.
[2025-06-06 09:01:24] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2025-06-06 09:01:24] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2025-06-06 09:01:24] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:01:25] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:01:25] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:01:25] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:01:25] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:01:25] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 1 ms to minimize.
[2025-06-06 09:01:25] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 1 ms to minimize.
[2025-06-06 09:01:25] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 1 ms to minimize.
[2025-06-06 09:01:25] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2025-06-06 09:01:26] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 2 ms to minimize.
[2025-06-06 09:01:26] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2025-06-06 09:01:26] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:01:26] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:01:26] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 1 ms to minimize.
[2025-06-06 09:01:26] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2025-06-06 09:01:26] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 5 ms to minimize.
[2025-06-06 09:01:26] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2025-06-06 09:01:26] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:01:27] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2025-06-06 09:01:27] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:01:27] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:01:30] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 1 ms to minimize.
[2025-06-06 09:01:31] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 1 ms to minimize.
[2025-06-06 09:01:31] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 1 ms to minimize.
[2025-06-06 09:01:31] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 2 ms to minimize.
[2025-06-06 09:01:31] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:01:31] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 1 ms to minimize.
[2025-06-06 09:01:31] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 1 ms to minimize.
[2025-06-06 09:01:31] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 1 ms to minimize.
[2025-06-06 09:01:31] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 1 ms to minimize.
[2025-06-06 09:01:32] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 1 ms to minimize.
[2025-06-06 09:01:32] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 2 ms to minimize.
[2025-06-06 09:01:32] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 1 ms to minimize.
[2025-06-06 09:01:32] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 1 ms to minimize.
[2025-06-06 09:01:32] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 1 ms to minimize.
[2025-06-06 09:01:32] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 1 ms to minimize.
[2025-06-06 09:01:32] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 9 ms to minimize.
[2025-06-06 09:01:32] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:01:32] [INFO ] Deduced a trap composed of 65 places in 110 ms of which 1 ms to minimize.
[2025-06-06 09:01:33] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 1 ms to minimize.
[2025-06-06 09:01:33] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:01:34] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 1 ms to minimize.
[2025-06-06 09:01:34] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 1 ms to minimize.
[2025-06-06 09:01:34] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 1 ms to minimize.
[2025-06-06 09:01:34] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 2 ms to minimize.
[2025-06-06 09:01:34] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 1 ms to minimize.
[2025-06-06 09:01:34] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 1 ms to minimize.
[2025-06-06 09:01:34] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 1 ms to minimize.
[2025-06-06 09:01:34] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 1 ms to minimize.
[2025-06-06 09:01:35] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 1 ms to minimize.
[2025-06-06 09:01:35] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 1 ms to minimize.
[2025-06-06 09:01:35] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 1 ms to minimize.
[2025-06-06 09:01:35] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 1 ms to minimize.
[2025-06-06 09:01:35] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 1 ms to minimize.
[2025-06-06 09:01:35] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 1 ms to minimize.
[2025-06-06 09:01:35] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 1 ms to minimize.
[2025-06-06 09:01:35] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 1 ms to minimize.
[2025-06-06 09:01:36] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 1 ms to minimize.
[2025-06-06 09:01:36] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 0 ms to minimize.
[2025-06-06 09:01:36] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 1 ms to minimize.
[2025-06-06 09:01:36] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:01:37] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 1 ms to minimize.
[2025-06-06 09:01:37] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 1 ms to minimize.
[2025-06-06 09:01:37] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 1 ms to minimize.
[2025-06-06 09:01:37] [INFO ] Deduced a trap composed of 67 places in 130 ms of which 0 ms to minimize.
[2025-06-06 09:01:38] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 1 ms to minimize.
[2025-06-06 09:01:38] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 1 ms to minimize.
[2025-06-06 09:01:38] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 1 ms to minimize.
[2025-06-06 09:01:38] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 2 ms to minimize.
[2025-06-06 09:01:38] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 1 ms to minimize.
[2025-06-06 09:01:38] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 1 ms to minimize.
[2025-06-06 09:01:38] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 1 ms to minimize.
[2025-06-06 09:01:38] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 1 ms to minimize.
[2025-06-06 09:01:39] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 1 ms to minimize.
[2025-06-06 09:01:39] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 1 ms to minimize.
[2025-06-06 09:01:39] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:01:39] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 1 ms to minimize.
[2025-06-06 09:01:39] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 1 ms to minimize.
[2025-06-06 09:01:39] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 0 ms to minimize.
[2025-06-06 09:01:39] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 1 ms to minimize.
[2025-06-06 09:01:39] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:01:45] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 1 ms to minimize.
[2025-06-06 09:01:45] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 1 ms to minimize.
[2025-06-06 09:01:45] [INFO ] Deduced a trap composed of 63 places in 245 ms of which 1 ms to minimize.
[2025-06-06 09:01:45] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 1 ms to minimize.
[2025-06-06 09:01:45] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 1 ms to minimize.
[2025-06-06 09:01:46] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2025-06-06 09:01:46] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 1 ms to minimize.
[2025-06-06 09:01:46] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 1 ms to minimize.
[2025-06-06 09:01:46] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 1 ms to minimize.
[2025-06-06 09:01:46] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 1 ms to minimize.
[2025-06-06 09:01:46] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 1 ms to minimize.
[2025-06-06 09:01:46] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 1 ms to minimize.
[2025-06-06 09:01:46] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 1 ms to minimize.
[2025-06-06 09:01:46] [INFO ] Deduced a trap composed of 65 places in 110 ms of which 1 ms to minimize.
[2025-06-06 09:01:47] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 1 ms to minimize.
[2025-06-06 09:01:47] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 1 ms to minimize.
[2025-06-06 09:01:47] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 1 ms to minimize.
[2025-06-06 09:01:47] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 1 ms to minimize.
[2025-06-06 09:01:47] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:01:47] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:01:49] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:01:49] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 1 ms to minimize.
SMT process timed out in 31058ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31163ms
Finished structural reductions in LIVENESS mode , in 1 iterations and 32679 ms. Remains : 121/121 places, 1111/1111 transitions.
Initial state reduction rules removed 10 formulas.
RANDOM walk for 40000 steps (8 resets) in 4229 ms. (9 steps per ms) remains 845/1101 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 845/845 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 845/845 properties
[2025-06-06 09:01:50] [INFO ] Invariant cache hit.
[2025-06-06 09:01:50] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2025-06-06 09:01:53] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 1 ms to minimize.
[2025-06-06 09:01:53] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2025-06-06 09:01:54] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 1 ms to minimize.
[2025-06-06 09:01:54] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 1 ms to minimize.
[2025-06-06 09:01:54] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:01:54] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 1 ms to minimize.
[2025-06-06 09:01:54] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:01:54] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:01:54] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:01:54] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:01:54] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:01:55] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:01:55] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2025-06-06 09:01:55] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2025-06-06 09:01:55] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:01:55] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 1 ms to minimize.
[2025-06-06 09:01:55] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 1 ms to minimize.
[2025-06-06 09:01:55] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2025-06-06 09:01:55] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2025-06-06 09:01:55] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2025-06-06 09:01:56] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2025-06-06 09:01:56] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 154 constraints, problems are : Problem set: 0 solved, 845 unsolved in 5035 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 845/845 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 845 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 22/154 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2025-06-06 09:01:57] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 2 ms to minimize.
[2025-06-06 09:01:57] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 1 ms to minimize.
[2025-06-06 09:01:57] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:01:57] [INFO ] Deduced a trap composed of 63 places in 250 ms of which 1 ms to minimize.
[2025-06-06 09:01:58] [INFO ] Deduced a trap composed of 66 places in 156 ms of which 1 ms to minimize.
[2025-06-06 09:01:58] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 1 ms to minimize.
[2025-06-06 09:01:58] [INFO ] Deduced a trap composed of 68 places in 112 ms of which 1 ms to minimize.
[2025-06-06 09:01:58] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 1 ms to minimize.
[2025-06-06 09:01:58] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 1 ms to minimize.
[2025-06-06 09:01:58] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 1 ms to minimize.
[2025-06-06 09:01:58] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 1 ms to minimize.
[2025-06-06 09:01:58] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 1 ms to minimize.
[2025-06-06 09:01:59] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:01:59] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 1 ms to minimize.
[2025-06-06 09:01:59] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 1 ms to minimize.
[2025-06-06 09:01:59] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 1 ms to minimize.
[2025-06-06 09:01:59] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 1 ms to minimize.
[2025-06-06 09:01:59] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 1 ms to minimize.
[2025-06-06 09:01:59] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 1 ms to minimize.
[2025-06-06 09:01:59] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2025-06-06 09:02:00] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 1 ms to minimize.
[2025-06-06 09:02:00] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 1 ms to minimize.
[2025-06-06 09:02:00] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 1 ms to minimize.
[2025-06-06 09:02:00] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 1 ms to minimize.
[2025-06-06 09:02:00] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 1 ms to minimize.
[2025-06-06 09:02:01] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 1 ms to minimize.
[2025-06-06 09:02:01] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 1 ms to minimize.
[2025-06-06 09:02:01] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 1 ms to minimize.
[2025-06-06 09:02:01] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 1 ms to minimize.
SMT process timed out in 10704ms, After SMT, problems are : Problem set: 0 solved, 845 unsolved
Fused 845 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 121 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 72 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 121/121 places, 1111/1111 transitions.
RANDOM walk for 1783260 steps (4 resets) in 120004 ms. (14 steps per ms) remains 821/845 properties
BEST_FIRST walk for 4000 steps (8 resets) in 269 ms. (14 steps per ms) remains 809/821 properties
BEST_FIRST walk for 4000 steps (8 resets) in 199 ms. (20 steps per ms) remains 799/809 properties
BEST_FIRST walk for 4000 steps (8 resets) in 236 ms. (16 steps per ms) remains 799/799 properties
BEST_FIRST walk for 4000 steps (8 resets) in 313 ms. (12 steps per ms) remains 792/799 properties
BEST_FIRST walk for 4000 steps (8 resets) in 208 ms. (19 steps per ms) remains 789/792 properties
BEST_FIRST walk for 4000 steps (8 resets) in 212 ms. (18 steps per ms) remains 784/789 properties
BEST_FIRST walk for 4000 steps (8 resets) in 243 ms. (16 steps per ms) remains 784/784 properties
BEST_FIRST walk for 4000 steps (8 resets) in 242 ms. (16 steps per ms) remains 781/784 properties
BEST_FIRST walk for 4000 steps (8 resets) in 249 ms. (16 steps per ms) remains 779/781 properties
BEST_FIRST walk for 4000 steps (8 resets) in 236 ms. (16 steps per ms) remains 779/779 properties
BEST_FIRST walk for 4000 steps (8 resets) in 243 ms. (16 steps per ms) remains 777/779 properties
BEST_FIRST walk for 4000 steps (8 resets) in 236 ms. (16 steps per ms) remains 777/777 properties
BEST_FIRST walk for 4000 steps (8 resets) in 298 ms. (13 steps per ms) remains 775/777 properties
BEST_FIRST walk for 4000 steps (8 resets) in 316 ms. (12 steps per ms) remains 775/775 properties
BEST_FIRST walk for 4000 steps (8 resets) in 268 ms. (14 steps per ms) remains 774/775 properties
BEST_FIRST walk for 4000 steps (8 resets) in 218 ms. (18 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4000 steps (8 resets) in 226 ms. (17 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4000 steps (8 resets) in 205 ms. (19 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4000 steps (8 resets) in 206 ms. (19 steps per ms) remains 773/774 properties
BEST_FIRST walk for 4000 steps (8 resets) in 231 ms. (17 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4000 steps (8 resets) in 185 ms. (21 steps per ms) remains 772/773 properties
BEST_FIRST walk for 4000 steps (8 resets) in 258 ms. (15 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 228 ms. (17 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 240 ms. (16 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 204 ms. (19 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 168 ms. (23 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 152 ms. (26 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 148 ms. (26 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 150 ms. (26 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 145 ms. (27 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 147 ms. (27 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 148 ms. (26 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 150 ms. (26 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 142 ms. (27 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 151 ms. (26 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 153 ms. (25 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 145 ms. (27 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 146 ms. (27 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 153 ms. (25 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 149 ms. (26 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 148 ms. (26 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 155 ms. (25 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 145 ms. (27 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 151 ms. (26 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 154 ms. (25 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 140 ms. (28 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 147 ms. (27 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 151 ms. (26 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 142 ms. (27 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 143 ms. (27 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 151 ms. (26 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 147 ms. (27 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 151 ms. (26 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 148 ms. (26 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 157 ms. (25 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 153 ms. (25 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 156 ms. (25 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 157 ms. (25 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 153 ms. (25 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 166 ms. (23 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 188 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 194 ms. (20 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 213 ms. (18 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 228 ms. (17 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 204 ms. (19 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 189 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 213 ms. (18 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 230 ms. (17 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 228 ms. (17 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 220 ms. (18 steps per ms) remains 772/772 properties
Probably explored full state space saw : 58904 states, properties seen :1
Probabilistic random walk after 352949 steps, saw 58904 distinct states, run finished after 7002 ms. (steps per millisecond=50 ) properties seen :1
Explored full state space saw : 58905 states, properties seen :0
Exhaustive walk after 352955 steps, saw 58905 distinct states, run finished after 6384 ms. (steps per millisecond=55 ) properties seen :0
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK EXHAUSTIVE_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 92873 ms.
ITS solved all properties within timeout

BK_STOP 1749200569401

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TokenRing-PT-010"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is TokenRing-PT-010, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r252-tall-174915605600212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TokenRing-PT-010.tgz
mv TokenRing-PT-010 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;