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-174867016500393.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-12, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-smll-174867016500393
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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 71K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1748771711973

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 09:55:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 09:55:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 09:55:15] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2025-06-01 09:55:15] [INFO ] Transformed 160 places.
[2025-06-01 09:55:15] [INFO ] Transformed 340 transitions.
[2025-06-01 09:55:15] [INFO ] Found NUPN structural information;
[2025-06-01 09:55:15] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 501 ms.
Graph (trivial) has 274 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 7 ms
Free SCC test removed 4 places
Structural test allowed to assert that 31 places are NOT stable. Took 45 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (3229 resets) in 3351 ms. (11 steps per ms) remains 61/129 properties
BEST_FIRST walk for 4004 steps (35 resets) in 60 ms. (65 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (38 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (36 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (37 resets) in 36 ms. (108 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4004 steps (37 resets) in 23 ms. (166 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4003 steps (34 resets) in 46 ms. (85 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (35 resets) in 14 ms. (266 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4003 steps (35 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (37 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (36 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (35 resets) in 13 ms. (285 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (37 resets) in 10 ms. (363 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (36 resets) in 11 ms. (333 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (34 resets) in 34 ms. (114 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (37 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (35 resets) in 26 ms. (148 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (36 resets) in 10 ms. (363 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (37 resets) in 13 ms. (286 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (35 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (38 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (35 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (37 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (35 resets) in 13 ms. (286 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (37 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (37 resets) in 35 ms. (111 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (36 resets) in 10 ms. (363 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (39 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (35 resets) in 12 ms. (307 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (35 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (36 resets) in 12 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (36 resets) in 10 ms. (363 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (37 resets) in 11 ms. (333 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (36 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (35 resets) in 12 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (39 resets) in 11 ms. (333 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (36 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (34 resets) in 12 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (38 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (35 resets) in 10 ms. (363 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (36 resets) in 12 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (34 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (38 resets) in 12 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (35 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (35 resets) in 12 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (33 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (36 resets) in 12 ms. (307 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (36 resets) in 10 ms. (363 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (38 resets) in 12 ms. (307 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (36 resets) in 11 ms. (333 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (38 resets) in 10 ms. (364 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4004 steps (36 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (36 resets) in 10 ms. (364 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (38 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (37 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (36 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (36 resets) in 13 ms. (285 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (36 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
[2025-06-01 09:55:16] [INFO ] Flow matrix only has 292 transitions (discarded 16 similar events)
// Phase 1: matrix 292 rows 156 cols
[2025-06-01 09:55:16] [INFO ] Computed 18 invariants in 20 ms
[2025-06-01 09:55:16] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 43/100 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 43/110 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 56/156 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 56/174 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 291/447 variables, 156/330 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 1/448 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 12 (OVERLAPS) 0/448 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 331 constraints, problems are : Problem set: 0 solved, 57 unsolved in 4219 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 156/156 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 43/100 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 43/110 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2025-06-01 09:55:21] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 39 ms to minimize.
[2025-06-01 09:55:22] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 4 ms to minimize.
[2025-06-01 09:55:22] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2025-06-01 09:55:22] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
[2025-06-01 09:55:22] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 1 ms to minimize.
[2025-06-01 09:55:22] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2025-06-01 09:55:22] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 3 ms to minimize.
[2025-06-01 09:55:23] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 3 ms to minimize.
[2025-06-01 09:55:23] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 3 ms to minimize.
[2025-06-01 09:55:23] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 3 ms to minimize.
[2025-06-01 09:55:23] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2025-06-01 09:55:23] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2025-06-01 09:55:23] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
[2025-06-01 09:55:23] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 3 ms to minimize.
[2025-06-01 09:55:23] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2025-06-01 09:55:23] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 3 ms to minimize.
[2025-06-01 09:55:24] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 5 ms to minimize.
[2025-06-01 09:55:24] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2025-06-01 09:55:24] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 19/129 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2025-06-01 09:55:24] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 3 ms to minimize.
[2025-06-01 09:55:24] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2025-06-01 09:55:24] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2025-06-01 09:55:25] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2025-06-01 09:55:25] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2025-06-01 09:55:25] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 100/448 variables, and 135 constraints, problems are : Problem set: 0 solved, 57 unsolved in 5018 ms.
Refiners :[Domain max(s): 100/156 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/156 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/57 constraints, Known Traps: 25/25 constraints]
After SMT, in 9394ms problems are : Problem set: 0 solved, 57 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 308/308 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 156 transition count 290
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 155 transition count 289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 155 transition count 288
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 154 transition count 288
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 70 place count 106 transition count 192
Iterating global reduction 2 with 48 rules applied. Total rules applied 118 place count 106 transition count 192
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 123 place count 101 transition count 182
Iterating global reduction 2 with 5 rules applied. Total rules applied 128 place count 101 transition count 182
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 134 place count 101 transition count 176
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 146 place count 95 transition count 202
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 153 place count 95 transition count 195
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 95 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 157 place count 93 transition count 193
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 93 transition count 193
Applied a total of 158 rules in 172 ms. Remains 93 /156 variables (removed 63) and now considering 193/308 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 93/156 places, 193/308 transitions.
RANDOM walk for 4000000 steps (724490 resets) in 29425 ms. (135 steps per ms) remains 28/57 properties
BEST_FIRST walk for 400003 steps (10722 resets) in 569 ms. (701 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (10887 resets) in 541 ms. (738 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (10801 resets) in 509 ms. (784 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (10884 resets) in 586 ms. (681 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400001 steps (10726 resets) in 507 ms. (787 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400001 steps (10883 resets) in 458 ms. (871 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (10798 resets) in 460 ms. (867 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (10800 resets) in 656 ms. (608 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (10741 resets) in 862 ms. (463 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (10824 resets) in 535 ms. (746 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (10706 resets) in 697 ms. (573 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (10806 resets) in 903 ms. (442 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (10797 resets) in 625 ms. (638 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (10829 resets) in 687 ms. (581 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (10828 resets) in 704 ms. (567 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (10838 resets) in 659 ms. (606 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (10742 resets) in 614 ms. (650 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (10848 resets) in 618 ms. (646 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (10782 resets) in 410 ms. (973 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (10855 resets) in 413 ms. (966 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (10819 resets) in 414 ms. (963 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (10775 resets) in 461 ms. (865 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (10882 resets) in 414 ms. (963 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (10807 resets) in 410 ms. (973 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (10846 resets) in 415 ms. (961 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (10788 resets) in 410 ms. (973 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (10798 resets) in 404 ms. (987 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (10770 resets) in 641 ms. (623 steps per ms) remains 28/28 properties
[2025-06-01 09:55:39] [INFO ] Flow matrix only has 178 transitions (discarded 15 similar events)
// Phase 1: matrix 178 rows 93 cols
[2025-06-01 09:55:39] [INFO ] Computed 18 invariants in 4 ms
[2025-06-01 09:55:39] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 37/65 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 28/93 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 178/271 variables, 93/111 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 7/118 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/271 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 118 constraints, problems are : Problem set: 0 solved, 28 unsolved in 931 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 93/93 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 37/65 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-06-01 09:55:40] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2025-06-01 09:55:40] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2025-06-01 09:55:40] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2025-06-01 09:55:40] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2025-06-01 09:55:40] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2025-06-01 09:55:40] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2025-06-01 09:55:41] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2025-06-01 09:55:41] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-06-01 09:55:41] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2025-06-01 09:55:41] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 28/93 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-06-01 09:55:41] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2025-06-01 09:55:41] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 3 ms to minimize.
[2025-06-01 09:55:41] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2025-06-01 09:55:41] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2025-06-01 09:55:41] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 3 ms to minimize.
[2025-06-01 09:55:41] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2025-06-01 09:55:41] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2025-06-01 09:55:42] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2025-06-01 09:55:42] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2025-06-01 09:55:42] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2025-06-01 09:55:42] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2025-06-01 09:55:42] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2025-06-01 09:55:42] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2025-06-01 09:55:42] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2025-06-01 09:55:42] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2025-06-01 09:55:42] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2025-06-01 09:55:42] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2025-06-01 09:55:42] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2025-06-01 09:55:42] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2025-06-01 09:55:42] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-06-01 09:55:42] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2025-06-01 09:55:43] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 3 ms to minimize.
[2025-06-01 09:55:43] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2025-06-01 09:55:43] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2025-06-01 09:55:43] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2025-06-01 09:55:43] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2025-06-01 09:55:43] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2025-06-01 09:55:43] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2025-06-01 09:55:43] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2025-06-01 09:55:43] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2025-06-01 09:55:43] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2025-06-01 09:55:43] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2025-06-01 09:55:43] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2025-06-01 09:55:43] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2025-06-01 09:55:43] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2025-06-01 09:55:44] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2025-06-01 09:55:44] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2025-06-01 09:55:44] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2025-06-01 09:55:44] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2025-06-01 09:55:44] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-06-01 09:55:44] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2025-06-01 09:55:44] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2025-06-01 09:55:44] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2025-06-01 09:55:44] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2025-06-01 09:55:44] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2025-06-01 09:55:45] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2025-06-01 09:55:45] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2025-06-01 09:55:45] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2025-06-01 09:55:45] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2025-06-01 09:55:45] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2025-06-01 09:55:45] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2025-06-01 09:55:45] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2025-06-01 09:55:45] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2025-06-01 09:55:45] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2025-06-01 09:55:45] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2025-06-01 09:55:45] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2025-06-01 09:55:45] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 3 ms to minimize.
[2025-06-01 09:55:46] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 18/86 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-06-01 09:55:46] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2025-06-01 09:55:46] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2025-06-01 09:55:46] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-06-01 09:55:46] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2025-06-01 09:55:46] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2025-06-01 09:55:46] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2025-06-01 09:55:46] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2025-06-01 09:55:46] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2025-06-01 09:55:46] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2025-06-01 09:55:47] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 7/96 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-06-01 09:55:47] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2025-06-01 09:55:47] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2025-06-01 09:55:47] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2025-06-01 09:55:47] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2025-06-01 09:55:47] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/93 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/93 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 178/271 variables, 93/194 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/271 variables, 7/201 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/271 variables, 28/229 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-06-01 09:55:48] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2025-06-01 09:55:48] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/271 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/271 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 18 (OVERLAPS) 0/271 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 231 constraints, problems are : Problem set: 0 solved, 28 unsolved in 8679 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 93/93 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 85/85 constraints]
After SMT, in 9674ms problems are : Problem set: 0 solved, 28 unsolved
Fused 28 Parikh solutions to 14 different solutions.
Parikh walk visited 25 properties in 1180 ms.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 193/193 transitions.
Graph (complete) has 484 edges and 93 vertex of which 84 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 84 transition count 189
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 80 transition count 188
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 41 place count 49 transition count 126
Iterating global reduction 2 with 31 rules applied. Total rules applied 72 place count 49 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 49 transition count 125
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 77 place count 45 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 81 place count 45 transition count 117
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 84 place count 42 transition count 108
Iterating global reduction 3 with 3 rules applied. Total rules applied 87 place count 42 transition count 108
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 39 transition count 102
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 39 transition count 102
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 107 place count 39 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 38 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 113 place count 36 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 115 place count 36 transition count 95
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 116 place count 36 transition count 172
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 121 place count 35 transition count 168
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 122 place count 34 transition count 127
Iterating global reduction 6 with 1 rules applied. Total rules applied 123 place count 34 transition count 127
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 124 place count 33 transition count 125
Iterating global reduction 6 with 1 rules applied. Total rules applied 125 place count 33 transition count 125
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 133 place count 33 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 137 place count 33 transition count 113
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 146 place count 33 transition count 113
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 154 place count 33 transition count 113
Applied a total of 154 rules in 76 ms. Remains 33 /93 variables (removed 60) and now considering 113/193 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 33/93 places, 113/193 transitions.
RANDOM walk for 2452202 steps (243331 resets) in 12531 ms. (195 steps per ms) remains 0/3 properties
Able to resolve query StableMarking after proving 131 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 42042 ms.
ITS solved all properties within timeout

BK_STOP 1748771756823

--------------------
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 StableMarking -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-12"
export BK_EXAMINATION="StableMarking"
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-12, examination is StableMarking"
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-174867016500393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-12.tgz
mv HealthRecord-PT-12 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;