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-174853743400112.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is Anderson-PT-08, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743400112
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 667K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748542320093

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:12:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-29 18:12:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:12:01] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2025-05-29 18:12:01] [INFO ] Transformed 401 places.
[2025-05-29 18:12:01] [INFO ] Transformed 1328 transitions.
[2025-05-29 18:12:01] [INFO ] Found NUPN structural information;
[2025-05-29 18:12:01] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 219 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 401 transition count 1272
Deduced a syphon composed of 56 places in 5 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 345 transition count 1272
Applied a total of 112 rules in 58 ms. Remains 345 /401 variables (removed 56) and now considering 1272/1328 (removed 56) transitions.
// Phase 1: matrix 1272 rows 345 cols
[2025-05-29 18:12:01] [INFO ] Computed 19 invariants in 57 ms
[2025-05-29 18:12:02] [INFO ] Implicit Places using invariants in 917 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 946 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 344/401 places, 1272/1328 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 344 transition count 1208
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 280 transition count 1208
Applied a total of 128 rules in 15 ms. Remains 280 /344 variables (removed 64) and now considering 1208/1272 (removed 64) transitions.
// Phase 1: matrix 1208 rows 280 cols
[2025-05-29 18:12:02] [INFO ] Computed 18 invariants in 15 ms
[2025-05-29 18:12:03] [INFO ] Implicit Places using invariants in 572 ms returned []
[2025-05-29 18:12:03] [INFO ] Invariant cache hit.
[2025-05-29 18:12:03] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-05-29 18:12:04] [INFO ] Implicit Places using invariants and state equation in 1767 ms returned []
Implicit Place search using SMT with State Equation took 2341 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 280/401 places, 1208/1328 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 3384 ms. Remains : 280/401 places, 1208/1328 transitions.
Initial state reduction rules removed 8 formulas.
RANDOM walk for 40000 steps (8 resets) in 2222 ms. (17 steps per ms) remains 477/1200 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 28 ms. (13 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 29 ms. (13 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 25 ms. (15 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 477/477 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 477/477 properties
[2025-05-29 18:12:05] [INFO ] Invariant cache hit.
[2025-05-29 18:12:05] [INFO ] State equation strengthened by 104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (OVERLAPS) 163/280 variables, 9/127 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 163/290 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 8/298 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2025-05-29 18:12:12] [INFO ] Deduced a trap composed of 94 places in 232 ms of which 19 ms to minimize.
SMT process timed out in 6318ms, After SMT, problems are : Problem set: 0 solved, 477 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 117 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 1208/1208 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 249 transition count 1177
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 249 transition count 1177
Applied a total of 62 rules in 65 ms. Remains 249 /280 variables (removed 31) and now considering 1177/1208 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 249/280 places, 1177/1208 transitions.
RANDOM walk for 4000000 steps (8 resets) in 53975 ms. (74 steps per ms) remains 112/477 properties
BEST_FIRST walk for 40003 steps (8 resets) in 160 ms. (248 steps per ms) remains 107/112 properties
BEST_FIRST walk for 40003 steps (8 resets) in 179 ms. (222 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 106/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (8 resets) in 122 ms. (325 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (8 resets) in 180 ms. (221 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (8 resets) in 107 ms. (370 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 100/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 99/100 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40002 steps (8 resets) in 109 ms. (363 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40002 steps (8 resets) in 116 ms. (341 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40001 steps (8 resets) in 118 ms. (336 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40002 steps (8 resets) in 123 ms. (322 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40002 steps (8 resets) in 113 ms. (350 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40002 steps (8 resets) in 114 ms. (347 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40001 steps (8 resets) in 118 ms. (336 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40001 steps (8 resets) in 108 ms. (366 steps per ms) remains 87/99 properties
BEST_FIRST walk for 40002 steps (8 resets) in 165 ms. (240 steps per ms) remains 84/87 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 82/84 properties
BEST_FIRST walk for 40001 steps (8 resets) in 99 ms. (400 steps per ms) remains 80/82 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 80/80 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 80/80 properties
BEST_FIRST walk for 40002 steps (8 resets) in 113 ms. (350 steps per ms) remains 80/80 properties
BEST_FIRST walk for 40002 steps (8 resets) in 114 ms. (347 steps per ms) remains 80/80 properties
BEST_FIRST walk for 40001 steps (8 resets) in 95 ms. (416 steps per ms) remains 80/80 properties
BEST_FIRST walk for 40002 steps (8 resets) in 116 ms. (341 steps per ms) remains 80/80 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 80/80 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 77/80 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 73/77 properties
BEST_FIRST walk for 40002 steps (8 resets) in 107 ms. (370 steps per ms) remains 73/73 properties
BEST_FIRST walk for 40002 steps (8 resets) in 113 ms. (350 steps per ms) remains 73/73 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 65/73 properties
BEST_FIRST walk for 40002 steps (8 resets) in 74 ms. (533 steps per ms) remains 63/65 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 60/63 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 59/60 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 59/59 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 59/59 properties
BEST_FIRST walk for 40002 steps (8 resets) in 96 ms. (412 steps per ms) remains 59/59 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 56/59 properties
BEST_FIRST walk for 40003 steps (8 resets) in 82 ms. (481 steps per ms) remains 53/56 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 53/53 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 53/53 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 53/53 properties
BEST_FIRST walk for 40001 steps (8 resets) in 96 ms. (412 steps per ms) remains 53/53 properties
BEST_FIRST walk for 40002 steps (8 resets) in 95 ms. (416 steps per ms) remains 52/53 properties
BEST_FIRST walk for 40002 steps (8 resets) in 93 ms. (425 steps per ms) remains 52/52 properties
BEST_FIRST walk for 40002 steps (8 resets) in 92 ms. (430 steps per ms) remains 51/52 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 48/51 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 48/48 properties
BEST_FIRST walk for 40001 steps (8 resets) in 91 ms. (434 steps per ms) remains 48/48 properties
BEST_FIRST walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 38/48 properties
BEST_FIRST walk for 40002 steps (8 resets) in 111 ms. (357 steps per ms) remains 37/38 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 37/37 properties
BEST_FIRST walk for 40002 steps (8 resets) in 84 ms. (470 steps per ms) remains 37/37 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 37/37 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 37/37 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 36/37 properties
BEST_FIRST walk for 40003 steps (8 resets) in 80 ms. (493 steps per ms) remains 36/36 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 36/36 properties
// Phase 1: matrix 1177 rows 249 cols
[2025-05-29 18:12:29] [INFO ] Computed 18 invariants in 13 ms
[2025-05-29 18:12:29] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 201/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 20/248 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2025-05-29 18:12:30] [INFO ] Deduced a trap composed of 109 places in 195 ms of which 3 ms to minimize.
[2025-05-29 18:12:30] [INFO ] Deduced a trap composed of 98 places in 169 ms of which 1 ms to minimize.
[2025-05-29 18:12:30] [INFO ] Deduced a trap composed of 59 places in 163 ms of which 2 ms to minimize.
[2025-05-29 18:12:30] [INFO ] Deduced a trap composed of 105 places in 163 ms of which 2 ms to minimize.
[2025-05-29 18:12:30] [INFO ] Deduced a trap composed of 100 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:12:30] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:12:31] [INFO ] Deduced a trap composed of 104 places in 155 ms of which 1 ms to minimize.
[2025-05-29 18:12:31] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 1 ms to minimize.
[2025-05-29 18:12:31] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 1 ms to minimize.
[2025-05-29 18:12:31] [INFO ] Deduced a trap composed of 114 places in 155 ms of which 1 ms to minimize.
[2025-05-29 18:12:31] [INFO ] Deduced a trap composed of 79 places in 166 ms of which 2 ms to minimize.
[2025-05-29 18:12:32] [INFO ] Deduced a trap composed of 98 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:12:32] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 2 ms to minimize.
[2025-05-29 18:12:32] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:12:32] [INFO ] Deduced a trap composed of 80 places in 180 ms of which 2 ms to minimize.
[2025-05-29 18:12:32] [INFO ] Deduced a trap composed of 70 places in 174 ms of which 2 ms to minimize.
[2025-05-29 18:12:32] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 2 ms to minimize.
[2025-05-29 18:12:33] [INFO ] Deduced a trap composed of 81 places in 183 ms of which 1 ms to minimize.
[2025-05-29 18:12:33] [INFO ] Deduced a trap composed of 87 places in 175 ms of which 2 ms to minimize.
[2025-05-29 18:12:33] [INFO ] Deduced a trap composed of 73 places in 173 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2025-05-29 18:12:33] [INFO ] Deduced a trap composed of 70 places in 174 ms of which 1 ms to minimize.
[2025-05-29 18:12:34] [INFO ] Deduced a trap composed of 99 places in 175 ms of which 1 ms to minimize.
[2025-05-29 18:12:34] [INFO ] Deduced a trap composed of 93 places in 172 ms of which 1 ms to minimize.
[2025-05-29 18:12:34] [INFO ] Deduced a trap composed of 71 places in 168 ms of which 2 ms to minimize.
[2025-05-29 18:12:34] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 2 ms to minimize.
[2025-05-29 18:12:34] [INFO ] Deduced a trap composed of 55 places in 165 ms of which 2 ms to minimize.
[2025-05-29 18:12:35] [INFO ] Deduced a trap composed of 79 places in 173 ms of which 2 ms to minimize.
[2025-05-29 18:12:35] [INFO ] Deduced a trap composed of 85 places in 172 ms of which 2 ms to minimize.
[2025-05-29 18:12:35] [INFO ] Deduced a trap composed of 77 places in 176 ms of which 2 ms to minimize.
[2025-05-29 18:12:35] [INFO ] Deduced a trap composed of 74 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:12:35] [INFO ] Deduced a trap composed of 118 places in 176 ms of which 2 ms to minimize.
[2025-05-29 18:12:35] [INFO ] Deduced a trap composed of 77 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:12:36] [INFO ] Deduced a trap composed of 78 places in 166 ms of which 3 ms to minimize.
[2025-05-29 18:12:36] [INFO ] Deduced a trap composed of 62 places in 158 ms of which 5 ms to minimize.
[2025-05-29 18:12:36] [INFO ] Deduced a trap composed of 72 places in 155 ms of which 1 ms to minimize.
[2025-05-29 18:12:36] [INFO ] Deduced a trap composed of 89 places in 169 ms of which 1 ms to minimize.
[2025-05-29 18:12:36] [INFO ] Deduced a trap composed of 79 places in 156 ms of which 1 ms to minimize.
[2025-05-29 18:12:37] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:12:37] [INFO ] Deduced a trap composed of 77 places in 177 ms of which 2 ms to minimize.
[2025-05-29 18:12:37] [INFO ] Deduced a trap composed of 62 places in 169 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2025-05-29 18:12:38] [INFO ] Deduced a trap composed of 85 places in 177 ms of which 2 ms to minimize.
[2025-05-29 18:12:38] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 1 ms to minimize.
[2025-05-29 18:12:38] [INFO ] Deduced a trap composed of 113 places in 178 ms of which 2 ms to minimize.
[2025-05-29 18:12:39] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2025-05-29 18:12:40] [INFO ] Deduced a trap composed of 85 places in 175 ms of which 1 ms to minimize.
[2025-05-29 18:12:40] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2025-05-29 18:12:40] [INFO ] Deduced a trap composed of 69 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:12:41] [INFO ] Deduced a trap composed of 73 places in 161 ms of which 1 ms to minimize.
[2025-05-29 18:12:41] [INFO ] Deduced a trap composed of 73 places in 174 ms of which 1 ms to minimize.
[2025-05-29 18:12:41] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 1/249 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2025-05-29 18:12:43] [INFO ] Deduced a trap composed of 60 places in 175 ms of which 2 ms to minimize.
[2025-05-29 18:12:44] [INFO ] Deduced a trap composed of 93 places in 170 ms of which 2 ms to minimize.
[2025-05-29 18:12:44] [INFO ] Deduced a trap composed of 95 places in 171 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 13 (OVERLAPS) 1177/1426 variables, 249/320 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1426 variables, 81/401 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1426 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 16 (OVERLAPS) 0/1426 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1426/1426 variables, and 401 constraints, problems are : Problem set: 0 solved, 36 unsolved in 23087 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 249/249 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 201/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 20/248 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 53/70 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2025-05-29 18:12:53] [INFO ] Deduced a trap composed of 67 places in 166 ms of which 1 ms to minimize.
[2025-05-29 18:12:53] [INFO ] Deduced a trap composed of 92 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:12:53] [INFO ] Deduced a trap composed of 89 places in 170 ms of which 2 ms to minimize.
[2025-05-29 18:12:53] [INFO ] Deduced a trap composed of 91 places in 174 ms of which 2 ms to minimize.
[2025-05-29 18:12:54] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 1 ms to minimize.
[2025-05-29 18:12:54] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 1 ms to minimize.
[2025-05-29 18:12:54] [INFO ] Deduced a trap composed of 95 places in 159 ms of which 1 ms to minimize.
[2025-05-29 18:12:54] [INFO ] Deduced a trap composed of 88 places in 151 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2025-05-29 18:12:55] [INFO ] Deduced a trap composed of 79 places in 166 ms of which 2 ms to minimize.
[2025-05-29 18:12:55] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:12:56] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 2 ms to minimize.
[2025-05-29 18:12:56] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 2 ms to minimize.
[2025-05-29 18:12:56] [INFO ] Deduced a trap composed of 85 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:12:56] [INFO ] Deduced a trap composed of 60 places in 152 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 1/249 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 1177/1426 variables, 249/334 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1426 variables, 81/415 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1426 variables, 36/451 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1426 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 14 (OVERLAPS) 0/1426 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1426/1426 variables, and 451 constraints, problems are : Problem set: 0 solved, 36 unsolved in 21997 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 249/249 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 67/67 constraints]
After SMT, in 45208ms problems are : Problem set: 0 solved, 36 unsolved
Parikh walk visited 0 properties in 97 ms.
Support contains 27 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 1177/1177 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 192 transition count 672
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 192 transition count 672
Applied a total of 114 rules in 37 ms. Remains 192 /249 variables (removed 57) and now considering 672/1177 (removed 505) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 192/249 places, 672/1177 transitions.
RANDOM walk for 4000000 steps (8 resets) in 19765 ms. (202 steps per ms) remains 34/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 568 ms. (702 steps per ms) remains 33/34 properties
BEST_FIRST walk for 400003 steps (8 resets) in 540 ms. (739 steps per ms) remains 31/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 541 ms. (738 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 567 ms. (704 steps per ms) remains 29/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 563 ms. (709 steps per ms) remains 27/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 517 ms. (772 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400001 steps (8 resets) in 548 ms. (728 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 530 ms. (753 steps per ms) remains 25/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 515 ms. (775 steps per ms) remains 24/25 properties
BEST_FIRST walk for 400002 steps (8 resets) in 496 ms. (804 steps per ms) remains 23/24 properties
BEST_FIRST walk for 400003 steps (8 resets) in 580 ms. (688 steps per ms) remains 22/23 properties
BEST_FIRST walk for 400002 steps (8 resets) in 564 ms. (707 steps per ms) remains 20/22 properties
BEST_FIRST walk for 400002 steps (8 resets) in 531 ms. (751 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (8 resets) in 529 ms. (754 steps per ms) remains 19/20 properties
BEST_FIRST walk for 400003 steps (8 resets) in 539 ms. (740 steps per ms) remains 18/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 510 ms. (782 steps per ms) remains 17/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 484 ms. (824 steps per ms) remains 16/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 465 ms. (858 steps per ms) remains 14/16 properties
BEST_FIRST walk for 400002 steps (8 resets) in 444 ms. (898 steps per ms) remains 12/14 properties
BEST_FIRST walk for 400001 steps (8 resets) in 421 ms. (947 steps per ms) remains 10/12 properties
BEST_FIRST walk for 400003 steps (8 resets) in 360 ms. (1108 steps per ms) remains 9/10 properties
BEST_FIRST walk for 400004 steps (8 resets) in 370 ms. (1078 steps per ms) remains 7/9 properties
BEST_FIRST walk for 400003 steps (8 resets) in 330 ms. (1208 steps per ms) remains 7/7 properties
BEST_FIRST walk for 400003 steps (8 resets) in 312 ms. (1277 steps per ms) remains 4/7 properties
// Phase 1: matrix 672 rows 192 cols
[2025-05-29 18:13:23] [INFO ] Computed 18 invariants in 4 ms
[2025-05-29 18:13:23] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 82/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 93/180 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 12/192 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-05-29 18:13:23] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 672/864 variables, 192/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/864 variables, 56/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/864 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/864 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 864/864 variables, and 267 constraints, problems are : Problem set: 0 solved, 4 unsolved in 528 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 192/192 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 82/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 93/180 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 12/192 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 672/864 variables, 192/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/864 variables, 56/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/864 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/864 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/864 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 864/864 variables, and 271 constraints, problems are : Problem set: 0 solved, 4 unsolved in 552 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 192/192 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1106ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 890 ms.
Support contains 5 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 672/672 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 172 transition count 372
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 172 transition count 372
Applied a total of 40 rules in 23 ms. Remains 172 /192 variables (removed 20) and now considering 372/672 (removed 300) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 172/192 places, 372/672 transitions.
RANDOM walk for 4000000 steps (8 resets) in 7563 ms. (528 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 2417 ms. (1654 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2291 ms. (1745 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 2168 ms. (1844 steps per ms) remains 1/2 properties
BEST_FIRST walk for 1081566 steps (2 resets) in 553 ms. (1952 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 1208 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 88499 ms.
ITS solved all properties within timeout

BK_STOP 1748542409804

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-08.tgz
mv Anderson-PT-08 execution
cd execution
if [ "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 ;