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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.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 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K 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 67K 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 1748771277694

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-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 09:48:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 09:48:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 09:48:00] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2025-06-01 09:48:00] [INFO ] Transformed 155 places.
[2025-06-01 09:48:00] [INFO ] Transformed 320 transitions.
[2025-06-01 09:48:00] [INFO ] Found NUPN structural information;
[2025-06-01 09:48:00] [INFO ] Parsed PT model containing 155 places and 320 transitions and 839 arcs in 426 ms.
Graph (trivial) has 262 edges and 155 vertex of which 14 / 155 are part of one of the 7 SCC in 7 ms
Free SCC test removed 7 places
Structural test allowed to assert that 32 places are NOT stable. Took 49 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (3102 resets) in 4167 ms. (9 steps per ms) remains 61/123 properties
BEST_FIRST walk for 4004 steps (40 resets) in 31 ms. (125 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (35 resets) in 32 ms. (121 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (39 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (40 resets) in 37 ms. (105 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (40 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (37 resets) in 35 ms. (111 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4003 steps (40 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (42 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (43 resets) in 21 ms. (181 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4004 steps (39 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (40 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (41 resets) in 10 ms. (364 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (39 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (41 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (40 resets) in 10 ms. (364 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (41 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (42 resets) in 21 ms. (182 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (40 resets) in 17 ms. (222 steps per ms) remains 58/59 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 (40 resets) in 24 ms. (160 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 4004 steps (43 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (39 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (39 resets) in 20 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (36 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (41 resets) in 11 ms. (333 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (38 resets) in 20 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (41 resets) in 10 ms. (363 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (42 resets) in 25 ms. (154 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (42 resets) in 11 ms. (333 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (40 resets) in 26 ms. (148 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (37 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 10 ms. (364 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4004 steps (38 resets) in 10 ms. (364 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (41 resets) in 23 ms. (166 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (40 resets) in 10 ms. (363 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (41 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (38 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (37 resets) in 10 ms. (364 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (43 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (41 resets) in 10 ms. (364 steps per ms) remains 55/57 properties
BEST_FIRST walk for 4004 steps (39 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (40 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (39 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (42 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (39 resets) in 10 ms. (363 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (40 resets) in 10 ms. (363 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (39 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (36 resets) in 18 ms. (210 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (42 resets) in 9 ms. (400 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (41 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (42 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (41 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (38 resets) in 10 ms. (363 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (40 resets) in 29 ms. (133 steps per ms) remains 54/54 properties
[2025-06-01 09:48:02] [INFO ] Flow matrix only has 269 transitions (discarded 19 similar events)
// Phase 1: matrix 269 rows 148 cols
[2025-06-01 09:48:02] [INFO ] Computed 18 invariants in 25 ms
[2025-06-01 09:48:02] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 41/95 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 41/105 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 53/148 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 53/166 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 268/416 variables, 148/314 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 1/417 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 0/417 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 315 constraints, problems are : Problem set: 0 solved, 54 unsolved in 3682 ms.
Refiners :[Domain max(s): 148/148 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 148/148 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 41/95 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 41/105 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2025-06-01 09:48:07] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 26 ms to minimize.
[2025-06-01 09:48:07] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 4 ms to minimize.
[2025-06-01 09:48:07] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2025-06-01 09:48:07] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2025-06-01 09:48:07] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2025-06-01 09:48:07] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
[2025-06-01 09:48:07] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2025-06-01 09:48:08] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 3 ms to minimize.
[2025-06-01 09:48:08] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2025-06-01 09:48:08] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2025-06-01 09:48:08] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2025-06-01 09:48:08] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2025-06-01 09:48:08] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2025-06-01 09:48:08] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2025-06-01 09:48:08] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2025-06-01 09:48:08] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2025-06-01 09:48:08] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 3 ms to minimize.
[2025-06-01 09:48:09] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2025-06-01 09:48:09] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2025-06-01 09:48:09] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2025-06-01 09:48:09] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2025-06-01 09:48:09] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2025-06-01 09:48:09] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2025-06-01 09:48:09] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 53/148 variables, 8/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 53/190 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2025-06-01 09:48:10] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2025-06-01 09:48:10] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2025-06-01 09:48:10] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 2 ms to minimize.
[2025-06-01 09:48:10] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2025-06-01 09:48:10] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2025-06-01 09:48:10] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2025-06-01 09:48:10] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2025-06-01 09:48:10] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2025-06-01 09:48:10] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 3 ms to minimize.
[2025-06-01 09:48:11] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 4 ms to minimize.
[2025-06-01 09:48:11] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 11 ms to minimize.
[2025-06-01 09:48:11] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 2 ms to minimize.
[2025-06-01 09:48:11] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2025-06-01 09:48:11] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2025-06-01 09:48:11] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
SMT process timed out in 8818ms, After SMT, problems are : Problem set: 0 solved, 54 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 288/288 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 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 24 rules applied. Total rules applied 24 place count 148 transition count 264
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 32 place count 144 transition count 260
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 32 place count 144 transition count 256
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 43 place count 137 transition count 256
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 85 place count 95 transition count 172
Iterating global reduction 2 with 42 rules applied. Total rules applied 127 place count 95 transition count 172
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 131 place count 91 transition count 164
Iterating global reduction 2 with 4 rules applied. Total rules applied 135 place count 91 transition count 164
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 140 place count 91 transition count 159
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
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 152 place count 85 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 85 transition count 181
Applied a total of 158 rules in 103 ms. Remains 85 /148 variables (removed 63) and now considering 181/288 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 85/148 places, 181/288 transitions.
RANDOM walk for 4000000 steps (1209014 resets) in 25842 ms. (154 steps per ms) remains 38/54 properties
BEST_FIRST walk for 400003 steps (21588 resets) in 658 ms. (606 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (21657 resets) in 481 ms. (829 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (21512 resets) in 482 ms. (828 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (21606 resets) in 505 ms. (790 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (21601 resets) in 668 ms. (597 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (21608 resets) in 722 ms. (553 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (21615 resets) in 685 ms. (583 steps per ms) remains 32/38 properties
BEST_FIRST walk for 400004 steps (21600 resets) in 448 ms. (890 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (21557 resets) in 458 ms. (871 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (21719 resets) in 447 ms. (892 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (21568 resets) in 451 ms. (884 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (21512 resets) in 450 ms. (886 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (21610 resets) in 456 ms. (875 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (21627 resets) in 462 ms. (863 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (21647 resets) in 451 ms. (884 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (21524 resets) in 451 ms. (884 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (21491 resets) in 449 ms. (888 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (21687 resets) in 451 ms. (884 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (21498 resets) in 454 ms. (879 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (21686 resets) in 448 ms. (890 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (21708 resets) in 449 ms. (888 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (21703 resets) in 445 ms. (896 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (21692 resets) in 453 ms. (881 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (21659 resets) in 448 ms. (890 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (21458 resets) in 447 ms. (892 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (21562 resets) in 447 ms. (892 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (21763 resets) in 453 ms. (881 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (21460 resets) in 450 ms. (886 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (21690 resets) in 452 ms. (883 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (21647 resets) in 449 ms. (888 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (21530 resets) in 444 ms. (898 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (21474 resets) in 449 ms. (888 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (21614 resets) in 451 ms. (884 steps per ms) remains 32/32 properties
[2025-06-01 09:48:24] [INFO ] Flow matrix only has 169 transitions (discarded 12 similar events)
// Phase 1: matrix 169 rows 85 cols
[2025-06-01 09:48:24] [INFO ] Computed 15 invariants in 2 ms
[2025-06-01 09:48:24] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 37/69 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 16/85 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 169/254 variables, 85/100 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 15/115 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/254 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 115 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1173 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 37/69 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-06-01 09:48:25] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 3 ms to minimize.
[2025-06-01 09:48:25] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2025-06-01 09:48:25] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 4 ms to minimize.
[2025-06-01 09:48:25] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2025-06-01 09:48:25] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2025-06-01 09:48:26] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2025-06-01 09:48:26] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2025-06-01 09:48:26] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 16/85 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-06-01 09:48:26] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2025-06-01 09:48:26] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2025-06-01 09:48:26] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2025-06-01 09:48:26] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 3 ms to minimize.
[2025-06-01 09:48:26] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2025-06-01 09:48:26] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2025-06-01 09:48:26] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
[2025-06-01 09:48:27] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2025-06-01 09:48:27] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 19 ms to minimize.
[2025-06-01 09:48:27] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2025-06-01 09:48:27] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2025-06-01 09:48:27] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2025-06-01 09:48:27] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2025-06-01 09:48:27] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2025-06-01 09:48:27] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2025-06-01 09:48:27] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2025-06-01 09:48:27] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 2 ms to minimize.
[2025-06-01 09:48:27] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2025-06-01 09:48:27] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2025-06-01 09:48:27] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-06-01 09:48:27] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2025-06-01 09:48:28] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2025-06-01 09:48:28] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2025-06-01 09:48:28] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2025-06-01 09:48:28] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2025-06-01 09:48:28] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2025-06-01 09:48:28] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2025-06-01 09:48:28] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2025-06-01 09:48:28] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2025-06-01 09:48:28] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 2 ms to minimize.
[2025-06-01 09:48:28] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2025-06-01 09:48:28] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2025-06-01 09:48:28] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2025-06-01 09:48:28] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 2 ms to minimize.
[2025-06-01 09:48:28] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2025-06-01 09:48:29] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-06-01 09:48:29] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2025-06-01 09:48:29] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2025-06-01 09:48:29] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2025-06-01 09:48:29] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2025-06-01 09:48:29] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
[2025-06-01 09:48:29] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2025-06-01 09:48:29] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 2 ms to minimize.
[2025-06-01 09:48:29] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2025-06-01 09:48:29] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2025-06-01 09:48:29] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2025-06-01 09:48:29] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
[2025-06-01 09:48:29] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-06-01 09:48:30] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2025-06-01 09:48:30] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2025-06-01 09:48:30] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2025-06-01 09:48:30] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
[2025-06-01 09:48:30] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2025-06-01 09:48:30] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 2 ms to minimize.
[2025-06-01 09:48:30] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2025-06-01 09:48:30] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-06-01 09:48:30] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2025-06-01 09:48:30] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 169/254 variables, 85/166 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 15/181 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 32/213 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (OVERLAPS) 0/254 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 213 constraints, problems are : Problem set: 0 solved, 32 unsolved in 6913 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 66/66 constraints]
After SMT, in 8121ms problems are : Problem set: 0 solved, 32 unsolved
Fused 32 Parikh solutions to 20 different solutions.
Parikh walk visited 29 properties in 1288 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 181/181 transitions.
Graph (complete) has 413 edges and 85 vertex of which 76 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 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 76 transition count 177
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 72 transition count 176
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 37 place count 45 transition count 122
Iterating global reduction 2 with 27 rules applied. Total rules applied 64 place count 45 transition count 122
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 40 transition count 112
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 40 transition count 112
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 37 transition count 103
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 37 transition count 103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 34 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 34 transition count 94
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 104 place count 34 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 33 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 112 place count 30 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 30 transition count 87
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 29 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 29 transition count 83
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 121 place count 29 transition count 77
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 130 place count 29 transition count 77
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 138 place count 29 transition count 77
Applied a total of 138 rules in 40 ms. Remains 29 /85 variables (removed 56) and now considering 77/181 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 29/85 places, 77/181 transitions.
RANDOM walk for 4000000 steps (1305566 resets) in 9996 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (221664 resets) in 1994 ms. (2005 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000001 steps (221648 resets) in 1988 ms. (2011 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (221469 resets) in 2071 ms. (1930 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 2129 steps, run visited all 3 properties in 25 ms. (steps per millisecond=85 )
Probabilistic random walk after 2129 steps, saw 764 distinct states, run finished after 30 ms. (steps per millisecond=70 ) properties seen :3
Able to resolve query StableMarking after proving 125 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 37488 ms.
ITS solved all properties within timeout

BK_STOP 1748771317790

--------------------
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-07"
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-07, 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-174867016500368"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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