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.r112-smll-174867016600417.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 HealthRecord-PT-17, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-smll-174867016600417
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.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.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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.7K 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 175K 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 1748772145616

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 10:02:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-01 10:02:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:02:28] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2025-06-01 10:02:28] [INFO ] Transformed 624 places.
[2025-06-01 10:02:28] [INFO ] Transformed 828 transitions.
[2025-06-01 10:02:28] [INFO ] Found NUPN structural information;
[2025-06-01 10:02:28] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 444 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 624/624 places, 828/828 transitions.
Graph (trivial) has 750 edges and 624 vertex of which 87 / 624 are part of one of the 21 SCC in 24 ms
Free SCC test removed 66 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 296 place count 558 transition count 458
Reduce places removed 295 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 337 rules applied. Total rules applied 633 place count 263 transition count 416
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 647 place count 249 transition count 416
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 647 place count 249 transition count 406
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 667 place count 239 transition count 406
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 861 place count 142 transition count 309
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -77
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 933 place count 106 transition count 386
Applied a total of 933 rules in 366 ms. Remains 106 /624 variables (removed 518) and now considering 386/828 (removed 442) transitions.
[2025-06-01 10:02:28] [INFO ] Flow matrix only has 357 transitions (discarded 29 similar events)
// Phase 1: matrix 357 rows 106 cols
[2025-06-01 10:02:28] [INFO ] Computed 18 invariants in 41 ms
[2025-06-01 10:02:29] [INFO ] Implicit Places using invariants in 513 ms returned []
[2025-06-01 10:02:29] [INFO ] Flow matrix only has 357 transitions (discarded 29 similar events)
[2025-06-01 10:02:29] [INFO ] Invariant cache hit.
[2025-06-01 10:02:29] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-06-01 10:02:29] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
Running 356 sub problems to find dead transitions.
[2025-06-01 10:02:29] [INFO ] Flow matrix only has 357 transitions (discarded 29 similar events)
[2025-06-01 10:02:29] [INFO ] Invariant cache hit.
[2025-06-01 10:02:29] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2025-06-01 10:02:37] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 25 ms to minimize.
[2025-06-01 10:02:37] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 4 ms to minimize.
[2025-06-01 10:02:38] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 2 ms to minimize.
[2025-06-01 10:02:38] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 3 ms to minimize.
[2025-06-01 10:02:38] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (OVERLAPS) 356/462 variables, 106/235 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 53/288 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 10 (OVERLAPS) 1/463 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 12 (OVERLAPS) 0/463 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 356 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 289 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30033 ms.
Refiners :[Domain max(s): 106/106 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (OVERLAPS) 356/462 variables, 106/235 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 53/288 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 356/644 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2025-06-01 10:03:13] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 4 ms to minimize.
[2025-06-01 10:03:13] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 3 ms to minimize.
[2025-06-01 10:03:13] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 3/647 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 12 (OVERLAPS) 1/463 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(timeout
s64 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 648 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30023 ms.
Refiners :[Domain max(s): 106/106 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 8/8 constraints]
After SMT, in 61377ms problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 61442ms
Starting structural reductions in LIVENESS mode, iteration 1 : 106/624 places, 386/828 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 62984 ms. Remains : 106/624 places, 386/828 transitions.
Discarding 295 transitions out of 386. Remains 91
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (3793 resets) in 4200 ms. (9 steps per ms) remains 38/90 properties
BEST_FIRST walk for 4004 steps (28 resets) in 74 ms. (53 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (25 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (25 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (24 resets) in 37 ms. (105 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (28 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (27 resets) in 28 ms. (138 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (27 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (25 resets) in 28 ms. (138 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (26 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (28 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (26 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (27 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (25 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (29 resets) in 25 ms. (153 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (13 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (13 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (41 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (40 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (19 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (17 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (18 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (19 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (18 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (25 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (26 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (29 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (27 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (25 resets) in 10 ms. (364 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (25 resets) in 11 ms. (333 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4003 steps (26 resets) in 10 ms. (363 steps per ms) remains 37/37 properties
[2025-06-01 10:03:32] [INFO ] Flow matrix only has 357 transitions (discarded 29 similar events)
[2025-06-01 10:03:32] [INFO ] Invariant cache hit.
[2025-06-01 10:03:32] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 16/68 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-06-01 10:03:33] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2025-06-01 10:03:33] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2025-06-01 10:03:33] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2025-06-01 10:03:33] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 38/106 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 38/128 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-06-01 10:03:34] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 356/462 variables, 106/235 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 53/288 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (OVERLAPS) 1/463 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 289 constraints, problems are : Problem set: 0 solved, 37 unsolved in 4384 ms.
Refiners :[Domain max(s): 106/106 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 16/68 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 38/106 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 38/128 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 356/462 variables, 106/235 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 53/288 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 37/325 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-06-01 10:03:39] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 15 (OVERLAPS) 1/463 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/463 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 327 constraints, problems are : Problem set: 0 solved, 37 unsolved in 5012 ms.
Refiners :[Domain max(s): 106/106 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 6/6 constraints]
After SMT, in 9511ms problems are : Problem set: 0 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 386/386 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 106 transition count 365
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 101 transition count 340
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 101 transition count 340
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 92 transition count 322
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 92 transition count 322
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 55 place count 92 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 2 with 32 rules applied. Total rules applied 87 place count 92 transition count 284
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 93 place count 92 transition count 278
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 99 place count 86 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 110 place count 86 transition count 267
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 86 transition count 267
Applied a total of 113 rules in 150 ms. Remains 86 /106 variables (removed 20) and now considering 267/386 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 86/106 places, 267/386 transitions.
RANDOM walk for 4000000 steps (382821 resets) in 25182 ms. (158 steps per ms) remains 18/37 properties
BEST_FIRST walk for 400004 steps (3811 resets) in 314 ms. (1269 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (3820 resets) in 306 ms. (1302 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (3822 resets) in 315 ms. (1265 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (3825 resets) in 307 ms. (1298 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (5103 resets) in 398 ms. (1002 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (4903 resets) in 418 ms. (954 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (3303 resets) in 373 ms. (1069 steps per ms) remains 17/18 properties
BEST_FIRST walk for 400003 steps (3285 resets) in 342 ms. (1166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (3285 resets) in 330 ms. (1208 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (3250 resets) in 337 ms. (1183 steps per ms) remains 16/17 properties
BEST_FIRST walk for 400004 steps (3255 resets) in 358 ms. (1114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (3273 resets) in 323 ms. (1234 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (3766 resets) in 316 ms. (1261 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (3812 resets) in 307 ms. (1298 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (3789 resets) in 335 ms. (1190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (3768 resets) in 387 ms. (1030 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (3784 resets) in 423 ms. (943 steps per ms) remains 16/16 properties
[2025-06-01 10:03:51] [INFO ] Flow matrix only has 255 transitions (discarded 12 similar events)
// Phase 1: matrix 255 rows 86 cols
[2025-06-01 10:03:51] [INFO ] Computed 18 invariants in 5 ms
[2025-06-01 10:03:51] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 25/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-06-01 10:03:51] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2025-06-01 10:03:51] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2025-06-01 10:03:51] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 31/86 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-06-01 10:03:52] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 255/341 variables, 86/108 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 53/161 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/341 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 161 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1616 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 86/86 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 25/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 31/86 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 255/341 variables, 86/108 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 53/161 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 16/177 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/341 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 177 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1693 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 86/86 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 4/4 constraints]
After SMT, in 3358ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 3 properties in 1848 ms.
Support contains 27 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 267/267 transitions.
Graph (complete) has 459 edges and 86 vertex of which 77 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 73 transition count 256
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 73 transition count 256
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 73 transition count 253
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 73 transition count 249
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 69 transition count 249
Applied a total of 20 rules in 39 ms. Remains 69 /86 variables (removed 17) and now considering 249/267 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 69/86 places, 249/267 transitions.
RANDOM walk for 4000000 steps (381045 resets) in 17750 ms. (225 steps per ms) remains 11/13 properties
BEST_FIRST walk for 4000004 steps (38619 resets) in 2569 ms. (1556 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (38663 resets) in 2536 ms. (1576 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000002 steps (38789 resets) in 2554 ms. (1565 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (49403 resets) in 3536 ms. (1130 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (34285 resets) in 2858 ms. (1399 steps per ms) remains 9/11 properties
BEST_FIRST walk for 4000004 steps (34263 resets) in 2727 ms. (1466 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (38320 resets) in 2561 ms. (1561 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (38341 resets) in 2533 ms. (1578 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (38298 resets) in 2608 ms. (1533 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (38270 resets) in 2600 ms. (1537 steps per ms) remains 9/9 properties
[2025-06-01 10:04:09] [INFO ] Flow matrix only has 236 transitions (discarded 13 similar events)
// Phase 1: matrix 236 rows 69 cols
[2025-06-01 10:04:09] [INFO ] Computed 9 invariants in 2 ms
[2025-06-01 10:04:09] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 6/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 41/69 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 236/305 variables, 69/78 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 52/130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/305 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 130 constraints, problems are : Problem set: 0 solved, 9 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 6/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 41/69 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 236/305 variables, 69/78 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 52/130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 9/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/305 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 139 constraints, problems are : Problem set: 0 solved, 9 unsolved in 784 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 1212ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 5 properties in 1352 ms.
Support contains 14 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 249/249 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 233
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 233
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 63 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 63 transition count 217
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 61 transition count 203
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 61 transition count 203
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 28 place count 61 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 60 transition count 197
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 60 transition count 192
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 41 place count 55 transition count 191
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 55 transition count 189
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 55 transition count 189
Applied a total of 48 rules in 32 ms. Remains 55 /69 variables (removed 14) and now considering 189/249 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 55/69 places, 189/249 transitions.
RANDOM walk for 4000000 steps (447937 resets) in 12913 ms. (309 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000003 steps (43492 resets) in 2143 ms. (1865 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000002 steps (43550 resets) in 2158 ms. (1852 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000003 steps (45350 resets) in 2955 ms. (1353 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (41821 resets) in 2257 ms. (1771 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 116430 steps, run visited all 4 properties in 478 ms. (steps per millisecond=243 )
Probabilistic random walk after 116430 steps, saw 23978 distinct states, run finished after 484 ms. (steps per millisecond=240 ) properties seen :4
Able to resolve query QuasiLiveness after proving 91 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 110884 ms.
ITS solved all properties within timeout

BK_STOP 1748772258749

--------------------
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="HealthRecord-PT-17"
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 HealthRecord-PT-17, 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 r112-smll-174867016600417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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