Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r498-tall-171640618000478.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is HealthRecord-PT-09, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r498-tall-171640618000478
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 230K Apr 12 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 21:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 21:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 68K May 18 16:42 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 1717193985200

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:19:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 22:19:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:19:46] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-31 22:19:46] [INFO ] Transformed 157 places.
[2024-05-31 22:19:46] [INFO ] Transformed 327 transitions.
[2024-05-31 22:19:46] [INFO ] Found NUPN structural information;
[2024-05-31 22:19:46] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 167 ms.
Graph (trivial) has 266 edges and 157 vertex of which 12 / 157 are part of one of the 6 SCC in 4 ms
Free SCC test removed 6 places
Structural test allowed to assert that 31 places are NOT stable. Took 20 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (3221 resets) in 1926 ms. (20 steps per ms) remains 45/126 properties
BEST_FIRST walk for 4004 steps (43 resets) in 37 ms. (105 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (42 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (45 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (43 resets) in 31 ms. (125 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (41 resets) in 32 ms. (121 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (40 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (41 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (41 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (40 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (41 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (40 resets) in 9 ms. (400 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4003 steps (40 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (40 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (41 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (44 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (42 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (43 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (44 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (40 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (39 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (40 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (42 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (42 resets) in 9 ms. (400 steps per ms) remains 42/44 properties
BEST_FIRST walk for 4004 steps (40 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (44 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (39 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (43 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (42 resets) in 9 ms. (400 steps per ms) remains 40/42 properties
BEST_FIRST walk for 4003 steps (43 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (43 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (41 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (45 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (39 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (44 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (44 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (43 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
[2024-05-31 22:19:47] [INFO ] Flow matrix only has 277 transitions (discarded 18 similar events)
// Phase 1: matrix 277 rows 151 cols
[2024-05-31 22:19:47] [INFO ] Computed 18 invariants in 12 ms
[2024-05-31 22:19:47] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 55/95 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 55/105 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 56/151 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 56/169 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 276/427 variables, 151/320 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 1/428 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (OVERLAPS) 0/428 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 321 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1432 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 151/151 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 55/95 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 55/105 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 18 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 2 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 41 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 14/119 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:19:50] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-31 22:19:50] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-31 22:19:50] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:19:50] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:19:50] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:19:50] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:19:50] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:19:50] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-31 22:19:50] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:19:50] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 56/151 variables, 8/139 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 56/195 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-31 22:19:50] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:19:50] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:19:50] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 2 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 4 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 2 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 2 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/151 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:19:51] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 2 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 7 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/151 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:19:53] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:19:53] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:19:53] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:19:53] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:19:53] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:19:53] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:19:53] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 0 ms to minimize.
[2024-05-31 22:19:53] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:19:53] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:19:53] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:19:53] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:19:53] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:19:53] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:19:53] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:19:53] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:19:53] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/151 variables, 20/255 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-31 22:19:53] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:19:53] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 151/428 variables, and 257 constraints, problems are : Problem set: 0 solved, 40 unsolved in 5007 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/151 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/40 constraints, Known Traps: 88/88 constraints]
After SMT, in 6501ms problems are : Problem set: 0 solved, 40 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 295/295 transitions.
Graph (complete) has 653 edges and 151 vertex of which 142 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 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 14 rules applied. Total rules applied 15 place count 142 transition count 272
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 9 rules applied. Total rules applied 24 place count 138 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 137 transition count 267
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 25 place count 137 transition count 264
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 33 place count 132 transition count 264
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 80 place count 85 transition count 170
Iterating global reduction 3 with 47 rules applied. Total rules applied 127 place count 85 transition count 170
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 132 place count 80 transition count 160
Iterating global reduction 3 with 5 rules applied. Total rules applied 137 place count 80 transition count 160
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 146 place count 80 transition count 151
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 160 place count 73 transition count 184
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 164 place count 73 transition count 180
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 73 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 166 place count 72 transition count 179
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 179 place count 72 transition count 179
Applied a total of 179 rules in 61 ms. Remains 72 /151 variables (removed 79) and now considering 179/295 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 72/151 places, 179/295 transitions.
RANDOM walk for 4000000 steps (1318711 resets) in 20480 ms. (195 steps per ms) remains 26/40 properties
BEST_FIRST walk for 400002 steps (14411 resets) in 271 ms. (1470 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (14507 resets) in 279 ms. (1428 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (14441 resets) in 264 ms. (1509 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (14397 resets) in 275 ms. (1449 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (14462 resets) in 269 ms. (1481 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (14547 resets) in 265 ms. (1503 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (14574 resets) in 267 ms. (1492 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (14483 resets) in 267 ms. (1492 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (14417 resets) in 262 ms. (1520 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (14410 resets) in 260 ms. (1532 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (14381 resets) in 269 ms. (1481 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (14349 resets) in 267 ms. (1492 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (14481 resets) in 269 ms. (1481 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (14422 resets) in 264 ms. (1509 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (14451 resets) in 267 ms. (1492 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (14417 resets) in 269 ms. (1481 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (14475 resets) in 302 ms. (1320 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (14439 resets) in 285 ms. (1398 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (14493 resets) in 269 ms. (1481 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (14420 resets) in 265 ms. (1503 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (14360 resets) in 269 ms. (1481 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (14511 resets) in 265 ms. (1503 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (14475 resets) in 267 ms. (1492 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (14505 resets) in 267 ms. (1492 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (14425 resets) in 266 ms. (1498 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (14469 resets) in 265 ms. (1503 steps per ms) remains 26/26 properties
[2024-05-31 22:20:01] [INFO ] Flow matrix only has 166 transitions (discarded 13 similar events)
// Phase 1: matrix 166 rows 72 cols
[2024-05-31 22:20:01] [INFO ] Computed 7 invariants in 5 ms
[2024-05-31 22:20:01] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 4/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 42/72 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 166/238 variables, 72/79 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/238 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 93 constraints, problems are : Problem set: 0 solved, 26 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 72/72 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 4/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 42/72 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 166/238 variables, 72/79 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 26/119 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-31 22:20:02] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:20:02] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:20:02] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:20:02] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:20:02] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:20:02] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-31 22:20:02] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:20:03] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:20:03] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:20:03] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:20:03] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:20:03] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:20:03] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:20:03] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:20:03] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:20:03] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-31 22:20:03] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:20:03] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:20:03] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:20:03] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-31 22:20:03] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:20:03] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:20:03] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:20:03] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 143 constraints, problems are : Problem set: 0 solved, 26 unsolved in 1887 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 72/72 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 24/24 constraints]
After SMT, in 2303ms problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 19 different solutions.
Parikh walk visited 23 properties in 979 ms.
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 179/179 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 47 transition count 129
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 47 transition count 129
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 43 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 43 transition count 121
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 40 transition count 112
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 40 transition count 112
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 37 transition count 103
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 37 transition count 103
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 86 place count 37 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 35 transition count 85
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 1 with 6 rules applied. Total rules applied 96 place count 32 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 98 place count 32 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 32 transition count 95
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 109 place count 32 transition count 95
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 32 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 31 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 31 transition count 91
Applied a total of 113 rules in 26 ms. Remains 31 /72 variables (removed 41) and now considering 91/179 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 31/72 places, 91/179 transitions.
RANDOM walk for 4000000 steps (1327634 resets) in 7576 ms. (527 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (147768 resets) in 1461 ms. (2735 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (147700 resets) in 1454 ms. (2749 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (147398 resets) in 1462 ms. (2734 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 2197 steps, run visited all 3 properties in 21 ms. (steps per millisecond=104 )
Probabilistic random walk after 2197 steps, saw 800 distinct states, run finished after 24 ms. (steps per millisecond=91 ) properties seen :3
Able to resolve query StableMarking after proving 128 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 22156 ms.
ITS solved all properties within timeout

BK_STOP 1717194008470

--------------------
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-09"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is HealthRecord-PT-09, 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 r498-tall-171640618000478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-09.tgz
mv HealthRecord-PT-09 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;