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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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 27K 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 13K Apr 12 20:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 20:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 20:29 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 72K 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 1717194076190

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-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:21:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 22:21:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:21:17] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-31 22:21:17] [INFO ] Transformed 162 places.
[2024-05-31 22:21:17] [INFO ] Transformed 347 transitions.
[2024-05-31 22:21:17] [INFO ] Found NUPN structural information;
[2024-05-31 22:21:17] [INFO ] Parsed PT model containing 162 places and 347 transitions and 915 arcs in 164 ms.
Graph (trivial) has 278 edges and 162 vertex of which 6 / 162 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Structural test allowed to assert that 30 places are NOT stable. Took 25 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (3387 resets) in 2103 ms. (19 steps per ms) remains 56/132 properties
BEST_FIRST walk for 4004 steps (37 resets) in 30 ms. (129 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (39 resets) in 31 ms. (125 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (37 resets) in 21 ms. (182 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (43 resets) in 53 ms. (74 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (35 resets) in 23 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (36 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (39 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (39 resets) in 10 ms. (364 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (37 resets) in 8 ms. (444 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (36 resets) in 8 ms. (444 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (37 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (37 resets) in 10 ms. (364 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (37 resets) in 9 ms. (400 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (41 resets) in 8 ms. (444 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4004 steps (36 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (34 resets) in 8 ms. (444 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (37 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (38 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (38 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (38 resets) in 8 ms. (444 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 8 ms. (444 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (37 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (38 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (37 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (35 resets) in 8 ms. (444 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (38 resets) in 9 ms. (400 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (38 resets) in 10 ms. (364 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 8 ms. (444 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (38 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (38 resets) in 9 ms. (400 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (37 resets) in 8 ms. (444 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (36 resets) in 10 ms. (363 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (39 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 8 ms. (444 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (34 resets) in 8 ms. (444 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (35 resets) in 9 ms. (400 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (38 resets) in 8 ms. (444 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (35 resets) in 10 ms. (363 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (39 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (36 resets) in 10 ms. (363 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (37 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (36 resets) in 8 ms. (444 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (39 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (34 resets) in 9 ms. (400 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (35 resets) in 8 ms. (444 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (36 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (33 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (40 resets) in 10 ms. (363 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (38 resets) in 10 ms. (364 steps per ms) remains 54/54 properties
[2024-05-31 22:21:18] [INFO ] Flow matrix only has 300 transitions (discarded 15 similar events)
// Phase 1: matrix 300 rows 159 cols
[2024-05-31 22:21:18] [INFO ] Computed 18 invariants in 8 ms
[2024-05-31 22:21:18] [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) 43/97 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 43/107 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 62/159 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 62/177 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 299/458 variables, 159/336 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 1/459 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 0/459 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 337 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1957 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: 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) 43/97 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 43/107 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-31 22:21:20] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 14 ms to minimize.
[2024-05-31 22:21:20] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 2 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 15/122 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 62/159 variables, 8/138 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 62/200 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 2 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 5 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 2 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/159 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:21:25] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 2 ms to minimize.
[2024-05-31 22:21:25] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:21:25] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:21:25] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-31 22:21:25] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:21:25] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/159 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-31 22:21:25] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:21:25] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:21:25] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
SMT process timed out in 7041ms, After SMT, problems are : Problem set: 0 solved, 54 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 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 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 70 place count 105 transition count 191
Iterating global reduction 1 with 54 rules applied. Total rules applied 124 place count 105 transition count 191
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 129 place count 100 transition count 181
Iterating global reduction 1 with 5 rules applied. Total rules applied 134 place count 100 transition count 181
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 143 place count 100 transition count 172
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 155 place count 94 transition count 198
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 158 place count 94 transition count 195
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 162 place count 94 transition count 191
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 166 place count 90 transition count 191
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 167 place count 90 transition count 191
Applied a total of 167 rules in 54 ms. Remains 90 /159 variables (removed 69) and now considering 191/315 (removed 124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 90/159 places, 191/315 transitions.
RANDOM walk for 4000000 steps (724256 resets) in 20408 ms. (195 steps per ms) remains 24/54 properties
BEST_FIRST walk for 400004 steps (10854 resets) in 340 ms. (1173 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (10812 resets) in 327 ms. (1219 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10828 resets) in 333 ms. (1197 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (10833 resets) in 336 ms. (1186 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10891 resets) in 332 ms. (1201 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10862 resets) in 335 ms. (1190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10814 resets) in 336 ms. (1186 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (10798 resets) in 331 ms. (1204 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (10816 resets) in 332 ms. (1201 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10724 resets) in 330 ms. (1208 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10866 resets) in 328 ms. (1215 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10827 resets) in 319 ms. (1250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (10848 resets) in 330 ms. (1208 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10873 resets) in 328 ms. (1215 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10799 resets) in 328 ms. (1215 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (10813 resets) in 322 ms. (1238 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10801 resets) in 325 ms. (1227 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (10778 resets) in 329 ms. (1212 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10818 resets) in 331 ms. (1204 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10857 resets) in 337 ms. (1183 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10791 resets) in 340 ms. (1173 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (10736 resets) in 339 ms. (1176 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (10795 resets) in 342 ms. (1166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (10803 resets) in 565 ms. (706 steps per ms) remains 24/24 properties
[2024-05-31 22:21:34] [INFO ] Flow matrix only has 171 transitions (discarded 20 similar events)
// Phase 1: matrix 171 rows 90 cols
[2024-05-31 22:21:34] [INFO ] Computed 18 invariants in 5 ms
[2024-05-31 22:21:34] [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) 28/90 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 171/261 variables, 90/108 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 7/115 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/261 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 115 constraints, problems are : Problem set: 0 solved, 24 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 90/90 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
[2024-05-31 22:21:34] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:34] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 3 ms to minimize.
[2024-05-31 22:21:34] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:21:34] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 28/90 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:21:35] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 171/261 variables, 90/160 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/261 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/261 variables, 24/191 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/261 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/261 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (OVERLAPS) 0/261 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/261 variables, and 192 constraints, problems are : Problem set: 0 solved, 24 unsolved in 3506 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 90/90 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 53/53 constraints]
After SMT, in 3945ms problems are : Problem set: 0 solved, 24 unsolved
Fused 24 Parikh solutions to 14 different solutions.
Parikh walk visited 21 properties in 698 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 191/191 transitions.
Graph (complete) has 475 edges and 90 vertex of which 81 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 81 transition count 187
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 77 transition count 186
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 38 place count 49 transition count 130
Iterating global reduction 2 with 28 rules applied. Total rules applied 66 place count 49 transition count 130
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 45 transition count 122
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 45 transition count 122
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 42 transition count 113
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 42 transition count 113
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 39 transition count 107
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 39 transition count 107
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 100 place count 39 transition count 93
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 102 place count 38 transition count 92
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 36 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 36 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 36 transition count 181
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 114 place count 35 transition count 177
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 34 transition count 133
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 34 transition count 133
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 33 transition count 131
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 33 transition count 131
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 126 place count 33 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 130 place count 33 transition count 119
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 139 place count 33 transition count 119
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 147 place count 33 transition count 119
Applied a total of 147 rules in 46 ms. Remains 33 /90 variables (removed 57) and now considering 119/191 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 33/90 places, 119/191 transitions.
RANDOM walk for 2710100 steps (268723 resets) in 8676 ms. (312 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 25111 ms.
ITS solved all properties within timeout

BK_STOP 1717194102479

--------------------
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="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-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 r498-tall-171640618000503"
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.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 ;