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.r224-tall-174902009800227.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 SieveSingleMsgMbox-PT-d0m06, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-174902009800227
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K 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 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 57K 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 1749107088117

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SieveSingleMsgMbox-PT-d0m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-05 07:04:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-05 07:04:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:04:49] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2025-06-05 07:04:49] [INFO ] Transformed 262 places.
[2025-06-05 07:04:49] [INFO ] Transformed 73 transitions.
[2025-06-05 07:04:49] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 154 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 262/262 places, 73/73 transitions.
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 70 transition count 73
Applied a total of 192 rules in 18 ms. Remains 70 /262 variables (removed 192) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 70 cols
[2025-06-05 07:04:49] [INFO ] Computed 5 invariants in 16 ms
[2025-06-05 07:04:49] [INFO ] Implicit Places using invariants in 319 ms returned []
[2025-06-05 07:04:49] [INFO ] Invariant cache hit.
[2025-06-05 07:04:50] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 07:04:50] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2025-06-05 07:04:50] [INFO ] Invariant cache hit.
[2025-06-05 07:04:50] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2025-06-05 07:04:51] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 32 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 1/70 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2025-06-05 07:04:52] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 3 ms to minimize.
[2025-06-05 07:04:52] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2025-06-05 07:04:52] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2025-06-05 07:04:52] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2025-06-05 07:04:52] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2025-06-05 07:04:52] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2025-06-05 07:04:53] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 73/143 variables, 70/83 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 31/114 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2025-06-05 07:04:54] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 18 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/143 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 14 (OVERLAPS) 0/143 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 115 constraints, problems are : Problem set: 0 solved, 72 unsolved in 5260 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 1/70 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 73/143 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 31/115 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 72/187 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 187 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3524 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 9/9 constraints]
After SMT, in 8986ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 9003ms
Starting structural reductions in LIVENESS mode, iteration 1 : 70/262 places, 73/73 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 9677 ms. Remains : 70/262 places, 73/73 transitions.
Discarding 10 transitions out of 73. Remains 63
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8944 resets) in 2360 ms. (16 steps per ms) remains 39/62 properties
BEST_FIRST walk for 4003 steps (194 resets) in 35 ms. (111 steps per ms) remains 36/39 properties
BEST_FIRST walk for 4002 steps (205 resets) in 85 ms. (46 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4003 steps (191 resets) in 57 ms. (69 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (191 resets) in 46 ms. (85 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (180 resets) in 75 ms. (52 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (186 resets) in 85 ms. (46 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (186 resets) in 89 ms. (44 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (190 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (185 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (194 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (192 resets) in 28 ms. (137 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (176 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (208 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (186 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (197 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (189 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (178 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (201 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (195 resets) in 12 ms. (307 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4001 steps (213 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (800 resets) in 28 ms. (137 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (427 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (394 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (422 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (401 resets) in 41 ms. (95 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (419 resets) in 44 ms. (88 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (402 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (408 resets) in 49 ms. (80 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (435 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (426 resets) in 28 ms. (137 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (407 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (400 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (412 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (418 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
[2025-06-05 07:05:00] [INFO ] Invariant cache hit.
[2025-06-05 07:05:00] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 25/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 2/69 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-06-05 07:05:01] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2025-06-05 07:05:01] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:05:01] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2025-06-05 07:05:02] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2025-06-05 07:05:02] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 72/141 variables, 69/79 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 30/109 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 2/143 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-06-05 07:05:02] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/143 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 14 (OVERLAPS) 0/143 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 112 constraints, problems are : Problem set: 0 solved, 34 unsolved in 2527 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 25/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 2/69 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 72/141 variables, 69/79 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 30/109 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 14/123 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 2/143 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 15 (OVERLAPS) 0/143 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 146 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1959 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 6/6 constraints]
After SMT, in 4573ms problems are : Problem set: 0 solved, 34 unsolved
Fused 34 Parikh solutions to 33 different solutions.
Parikh walk visited 0 properties in 671 ms.
Support contains 42 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 67 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 67 transition count 70
Applied a total of 6 rules in 12 ms. Remains 67 /70 variables (removed 3) and now considering 70/73 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 67/70 places, 70/73 transitions.
RANDOM walk for 4000000 steps (895530 resets) in 28592 ms. (139 steps per ms) remains 20/34 properties
BEST_FIRST walk for 400001 steps (19329 resets) in 950 ms. (420 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19328 resets) in 814 ms. (490 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19485 resets) in 933 ms. (428 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19200 resets) in 812 ms. (492 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (19374 resets) in 864 ms. (462 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19122 resets) in 788 ms. (506 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19225 resets) in 841 ms. (475 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19236 resets) in 899 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19323 resets) in 916 ms. (436 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19473 resets) in 982 ms. (406 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19376 resets) in 859 ms. (465 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1460 ms. (273 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41647 resets) in 996 ms. (401 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400000 steps (41479 resets) in 1218 ms. (328 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41308 resets) in 1079 ms. (370 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (41510 resets) in 1082 ms. (369 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41238 resets) in 1145 ms. (349 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (41447 resets) in 1085 ms. (368 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (40678 resets) in 1131 ms. (353 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41308 resets) in 1163 ms. (343 steps per ms) remains 20/20 properties
// Phase 1: matrix 70 rows 67 cols
[2025-06-05 07:05:24] [INFO ] Computed 5 invariants in 4 ms
[2025-06-05 07:05:24] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 33/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 6/65 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2025-06-05 07:05:24] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2025-06-05 07:05:24] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 69/134 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 29/101 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3/137 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2025-06-05 07:05:25] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2025-06-05 07:05:25] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 5 ms to minimize.
[2025-06-05 07:05:25] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2025-06-05 07:05:25] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2025-06-05 07:05:25] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2025-06-05 07:05:25] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2025-06-05 07:05:25] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2025-06-05 07:05:25] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2025-06-05 07:05:25] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2025-06-05 07:05:25] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/137 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2025-06-05 07:05:25] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2025-06-05 07:05:25] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/137 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/137 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 0/137 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 116 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1709 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 33/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 6/65 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 69/134 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 29/105 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 3/137 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 12/128 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/137 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 0/137 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 136 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 14/14 constraints]
After SMT, in 2741ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 490 ms.
Support contains 26 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 63 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 62 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 62 transition count 64
Applied a total of 11 rules in 14 ms. Remains 62 /67 variables (removed 5) and now considering 64/70 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 62/67 places, 64/70 transitions.
RANDOM walk for 4000000 steps (895496 resets) in 20292 ms. (197 steps per ms) remains 19/20 properties
BEST_FIRST walk for 400002 steps (19016 resets) in 1000 ms. (399 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (19316 resets) in 1001 ms. (399 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (19326 resets) in 982 ms. (406 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (19276 resets) in 1060 ms. (377 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (19193 resets) in 993 ms. (402 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (18992 resets) in 1008 ms. (396 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (19197 resets) in 855 ms. (467 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (19306 resets) in 899 ms. (444 steps per ms) remains 18/19 properties
BEST_FIRST walk for 400003 steps (19306 resets) in 656 ms. (608 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1238 ms. (322 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (41908 resets) in 1400 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (41292 resets) in 1314 ms. (304 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (41251 resets) in 1270 ms. (314 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (41254 resets) in 1256 ms. (318 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (41410 resets) in 1207 ms. (331 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41216 resets) in 1212 ms. (329 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (41118 resets) in 1291 ms. (309 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41136 resets) in 1310 ms. (305 steps per ms) remains 18/18 properties
// Phase 1: matrix 64 rows 62 cols
[2025-06-05 07:05:39] [INFO ] Computed 5 invariants in 2 ms
[2025-06-05 07:05:39] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 31/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 5/60 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 63/123 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 3/126 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-05 07:05:40] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-06-05 07:05:40] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2025-06-05 07:05:40] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2025-06-05 07:05:40] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-05 07:05:40] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/126 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-05 07:05:40] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/126 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/126 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 0/126 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 99 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1116 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 31/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 5/60 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 63/123 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 3/126 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 10/113 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/126 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/126 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 0/126 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 117 constraints, problems are : Problem set: 0 solved, 18 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 6/6 constraints]
After SMT, in 1916ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 227 ms.
Support contains 24 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 62/62 places, 64/64 transitions.
RANDOM walk for 4000000 steps (894903 resets) in 27847 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (19293 resets) in 1025 ms. (389 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (19336 resets) in 1017 ms. (392 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (19147 resets) in 1026 ms. (389 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (19384 resets) in 1028 ms. (388 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (19160 resets) in 971 ms. (411 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (19240 resets) in 998 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (19211 resets) in 1069 ms. (373 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (19483 resets) in 1123 ms. (355 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (19383 resets) in 972 ms. (411 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1730 ms. (231 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (41712 resets) in 1398 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (41137 resets) in 1360 ms. (293 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (41482 resets) in 1467 ms. (272 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (41076 resets) in 1336 ms. (299 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (41275 resets) in 1466 ms. (272 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (41037 resets) in 1264 ms. (316 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (40771 resets) in 1265 ms. (315 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (41091 resets) in 1370 ms. (291 steps per ms) remains 18/18 properties
Finished probabilistic random walk after 1549 steps, run visited all 18 properties in 15 ms. (steps per millisecond=103 )
Probabilistic random walk after 1549 steps, saw 808 distinct states, run finished after 19 ms. (steps per millisecond=81 ) properties seen :18
Able to resolve query QuasiLiveness after proving 63 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 67627 ms.
ITS solved all properties within timeout

BK_STOP 1749107157072

--------------------
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="SieveSingleMsgMbox-PT-d0m06"
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 SieveSingleMsgMbox-PT-d0m06, 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 r224-tall-174902009800227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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