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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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 72K 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 1748771894872

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-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 09:58:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 09:58:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 09:58:17] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2025-06-01 09:58:17] [INFO ] Transformed 162 places.
[2025-06-01 09:58:17] [INFO ] Transformed 347 transitions.
[2025-06-01 09:58:17] [INFO ] Found NUPN structural information;
[2025-06-01 09:58:17] [INFO ] Parsed PT model containing 162 places and 347 transitions and 915 arcs in 399 ms.
Graph (trivial) has 278 edges and 162 vertex of which 6 / 162 are part of one of the 3 SCC in 6 ms
Free SCC test removed 3 places
Structural test allowed to assert that 30 places are NOT stable. Took 41 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (3383 resets) in 3180 ms. (12 steps per ms) remains 60/132 properties
BEST_FIRST walk for 4004 steps (38 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (37 resets) in 25 ms. (153 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (36 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (37 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (37 resets) in 41 ms. (95 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (39 resets) in 34 ms. (114 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (39 resets) in 25 ms. (154 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (37 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (36 resets) in 11 ms. (333 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (37 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (41 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (34 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (38 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (36 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (38 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (38 resets) in 10 ms. (364 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (35 resets) in 10 ms. (363 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (38 resets) in 18 ms. (210 steps per ms) remains 58/59 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 (38 resets) in 10 ms. (364 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 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (38 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (39 resets) in 38 ms. (102 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (36 resets) in 16 ms. (235 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4004 steps (36 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (37 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (39 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (34 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (39 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (37 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (39 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (38 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (37 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (37 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (39 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (37 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (39 resets) in 23 ms. (166 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (38 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (37 resets) in 13 ms. (285 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (39 resets) in 13 ms. (285 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (38 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (38 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (39 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (37 resets) in 12 ms. (307 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (36 resets) in 13 ms. (285 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (37 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (42 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (38 resets) in 22 ms. (174 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 (40 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (37 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (35 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (40 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (38 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (38 resets) in 21 ms. (181 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (40 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
[2025-06-01 09:58:19] [INFO ] Flow matrix only has 300 transitions (discarded 15 similar events)
// Phase 1: matrix 300 rows 159 cols
[2025-06-01 09:58:19] [INFO ] Computed 18 invariants in 17 ms
[2025-06-01 09:58:19] [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) 59/159 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 59/177 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 299/458 variables, 159/336 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 1/459 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 12 (OVERLAPS) 0/459 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 337 constraints, problems are : Problem set: 0 solved, 57 unsolved in 4322 ms.
Refiners :[Domain max(s): 159/159 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 159/159 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:58:24] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 24 ms to minimize.
[2025-06-01 09:58:25] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 3 ms to minimize.
[2025-06-01 09:58:25] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2025-06-01 09:58:25] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 2 ms to minimize.
[2025-06-01 09:58:25] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2025-06-01 09:58:25] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2025-06-01 09:58:25] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2025-06-01 09:58:25] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2025-06-01 09:58:25] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2025-06-01 09:58:25] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2025-06-01 09:58:25] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2025-06-01 09:58:25] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2025-06-01 09:58:26] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2025-06-01 09:58:26] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2025-06-01 09:58:26] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 4 ms to minimize.
[2025-06-01 09:58:26] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 16/126 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2025-06-01 09:58:26] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2025-06-01 09:58:26] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2025-06-01 09:58:26] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2025-06-01 09:58:26] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2025-06-01 09:58:26] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2025-06-01 09:58:27] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 59/159 variables, 8/140 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 59/199 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2025-06-01 09:58:27] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2025-06-01 09:58:27] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2025-06-01 09:58:27] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2025-06-01 09:58:27] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2025-06-01 09:58:27] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2025-06-01 09:58:27] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2025-06-01 09:58:28] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 2 ms to minimize.
[2025-06-01 09:58:28] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 2 ms to minimize.
[2025-06-01 09:58:28] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2025-06-01 09:58:28] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2025-06-01 09:58:28] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 2 ms to minimize.
[2025-06-01 09:58:28] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 3 ms to minimize.
[2025-06-01 09:58:28] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 7 ms to minimize.
[2025-06-01 09:58:28] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2025-06-01 09:58:28] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 2 ms to minimize.
[2025-06-01 09:58:28] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 2 ms to minimize.
[2025-06-01 09:58:28] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2025-06-01 09:58:29] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2025-06-01 09:58:29] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2025-06-01 09:58:29] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 3 ms to minimize.
SMT process timed out in 9524ms, After SMT, problems are : Problem set: 0 solved, 57 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 315/315 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 159 transition count 299
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 67 place count 108 transition count 197
Iterating global reduction 1 with 51 rules applied. Total rules applied 118 place count 108 transition count 197
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 123 place count 103 transition count 187
Iterating global reduction 1 with 5 rules applied. Total rules applied 128 place count 103 transition count 187
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 133 place count 103 transition count 182
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 145 place count 97 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 152 place count 97 transition count 202
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 156 place count 97 transition count 198
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 160 place count 93 transition count 198
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 161 place count 93 transition count 198
Applied a total of 161 rules in 84 ms. Remains 93 /159 variables (removed 66) and now considering 198/315 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 93/159 places, 198/315 transitions.
RANDOM walk for 4000000 steps (723936 resets) in 28626 ms. (139 steps per ms) remains 24/57 properties
BEST_FIRST walk for 400004 steps (10754 resets) in 417 ms. (956 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10797 resets) in 423 ms. (943 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10801 resets) in 431 ms. (925 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10842 resets) in 412 ms. (968 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (10714 resets) in 421 ms. (947 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (10785 resets) in 544 ms. (733 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10782 resets) in 544 ms. (733 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10777 resets) in 431 ms. (925 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10826 resets) in 416 ms. (959 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10772 resets) in 413 ms. (966 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10768 resets) in 413 ms. (966 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (10869 resets) in 414 ms. (963 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (10795 resets) in 417 ms. (956 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (10814 resets) in 415 ms. (961 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (10801 resets) in 416 ms. (959 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10844 resets) in 412 ms. (968 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10729 resets) in 419 ms. (952 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (10765 resets) in 416 ms. (959 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (10832 resets) in 417 ms. (956 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10812 resets) in 413 ms. (966 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10867 resets) in 417 ms. (956 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (10762 resets) in 417 ms. (956 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10818 resets) in 416 ms. (959 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10725 resets) in 416 ms. (959 steps per ms) remains 24/24 properties
[2025-06-01 09:58:40] [INFO ] Flow matrix only has 179 transitions (discarded 19 similar events)
// Phase 1: matrix 179 rows 93 cols
[2025-06-01 09:58:40] [INFO ] Computed 18 invariants in 3 ms
[2025-06-01 09:58:40] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 38/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 31/93 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 179/272 variables, 93/111 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 7/118 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 118 constraints, problems are : Problem set: 0 solved, 24 unsolved in 648 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: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 38/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-06-01 09:58:41] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2025-06-01 09:58:41] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 4 ms to minimize.
[2025-06-01 09:58:41] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2025-06-01 09:58:41] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2025-06-01 09:58:41] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2025-06-01 09:58:41] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2025-06-01 09:58:41] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2025-06-01 09:58:41] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2025-06-01 09:58:41] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-06-01 09:58:41] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2025-06-01 09:58:41] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2025-06-01 09:58:41] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2025-06-01 09:58:41] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 31/93 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-06-01 09:58:42] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 24 ms to minimize.
[2025-06-01 09:58:42] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2025-06-01 09:58:42] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2025-06-01 09:58:42] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2025-06-01 09:58:42] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2025-06-01 09:58:42] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2025-06-01 09:58:42] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2025-06-01 09:58:42] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2025-06-01 09:58:42] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 3 ms to minimize.
[2025-06-01 09:58:43] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2025-06-01 09:58:43] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2025-06-01 09:58:43] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2025-06-01 09:58:43] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2025-06-01 09:58:43] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2025-06-01 09:58:43] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2025-06-01 09:58:43] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2025-06-01 09:58:43] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2025-06-01 09:58:43] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2025-06-01 09:58:43] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2025-06-01 09:58:43] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-06-01 09:58:43] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2025-06-01 09:58:43] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2025-06-01 09:58:44] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2025-06-01 09:58:44] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2025-06-01 09:58:44] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2025-06-01 09:58:44] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2025-06-01 09:58:44] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2025-06-01 09:58:44] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2025-06-01 09:58:44] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2025-06-01 09:58:44] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 3 ms to minimize.
[2025-06-01 09:58:44] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 2 ms to minimize.
[2025-06-01 09:58:45] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 2 ms to minimize.
[2025-06-01 09:58:45] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 1 ms to minimize.
[2025-06-01 09:58:45] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2025-06-01 09:58:45] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 2 ms to minimize.
[2025-06-01 09:58:45] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-06-01 09:58:45] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2025-06-01 09:58:45] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2025-06-01 09:58:45] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2025-06-01 09:58:45] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-06-01 09:58:46] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-06-01 09:58:46] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2025-06-01 09:58:46] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 3 ms to minimize.
[2025-06-01 09:58:46] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 2 ms to minimize.
[2025-06-01 09:58:46] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 2 ms to minimize.
[2025-06-01 09:58:46] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-06-01 09:58:47] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 2 ms to minimize.
[2025-06-01 09:58:47] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2025-06-01 09:58:47] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/93 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/93 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 179/272 variables, 93/173 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/272 variables, 24/204 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-06-01 09:58:48] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/272 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (OVERLAPS) 0/272 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 205 constraints, problems are : Problem set: 0 solved, 24 unsolved in 8176 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: 24/24 constraints, Known Traps: 63/63 constraints]
After SMT, in 8847ms problems are : Problem set: 0 solved, 24 unsolved
Fused 24 Parikh solutions to 12 different solutions.
Parikh walk visited 21 properties in 1602 ms.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 198/198 transitions.
Graph (complete) has 487 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 194
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 193
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 41 place count 49 transition count 131
Iterating global reduction 2 with 31 rules applied. Total rules applied 72 place count 49 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 49 transition count 129
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 78 place count 45 transition count 121
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 45 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 85 place count 42 transition count 112
Iterating global reduction 3 with 3 rules applied. Total rules applied 88 place count 42 transition count 112
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 91 place count 39 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 39 transition count 106
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 108 place count 39 transition count 92
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 4 with 2 rules applied. Total rules applied 110 place count 38 transition count 91
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 114 place count 36 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 116 place count 36 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 36 transition count 97
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 119 place count 36 transition count 178
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 124 place count 35 transition count 174
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 125 place count 34 transition count 131
Iterating global reduction 6 with 1 rules applied. Total rules applied 126 place count 34 transition count 131
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 127 place count 33 transition count 129
Iterating global reduction 6 with 1 rules applied. Total rules applied 128 place count 33 transition count 129
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 138 place count 33 transition count 119
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 147 place count 33 transition count 119
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 155 place count 33 transition count 119
Applied a total of 155 rules in 73 ms. Remains 33 /93 variables (removed 60) and now considering 119/198 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 33/93 places, 119/198 transitions.
RANDOM walk for 1584398 steps (157000 resets) in 9590 ms. (165 steps per ms) remains 0/3 properties
Able to resolve query StableMarking after proving 134 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 38087 ms.
ITS solved all properties within timeout

BK_STOP 1748771935470

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

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