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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 20:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 20:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 20:43 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 67K 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 1717193929191

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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:18:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 22:18:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:18:50] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-31 22:18:50] [INFO ] Transformed 154 places.
[2024-05-31 22:18:50] [INFO ] Transformed 319 transitions.
[2024-05-31 22:18:50] [INFO ] Found NUPN structural information;
[2024-05-31 22:18:50] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 170 ms.
Graph (trivial) has 262 edges and 154 vertex of which 14 / 154 are part of one of the 7 SCC in 4 ms
Free SCC test removed 7 places
Structural test allowed to assert that 34 places are NOT stable. Took 20 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (2877 resets) in 1801 ms. (22 steps per ms) remains 41/120 properties
BEST_FIRST walk for 4003 steps (31 resets) in 37 ms. (105 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (35 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (33 resets) in 24 ms. (160 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4003 steps (32 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (34 resets) in 44 ms. (88 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4003 steps (32 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (34 resets) in 35 ms. (111 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 31 ms. (125 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (33 resets) in 54 ms. (72 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (33 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (33 resets) in 10 ms. (363 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (31 resets) in 10 ms. (364 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (34 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (33 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (36 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (34 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (35 resets) in 10 ms. (364 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (31 resets) in 27 ms. (143 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (31 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (30 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (29 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (36 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (30 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (35 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (32 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (34 resets) in 11 ms. (333 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (33 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (32 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (31 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (33 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (34 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (33 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
[2024-05-31 22:18:51] [INFO ] Flow matrix only has 268 transitions (discarded 19 similar events)
// Phase 1: matrix 268 rows 147 cols
[2024-05-31 22:18:51] [INFO ] Computed 18 invariants in 12 ms
[2024-05-31 22:18:51] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 56/94 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 56/104 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 53/147 variables, 8/112 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 53/165 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 267/414 variables, 147/312 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 1/415 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/415 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 313 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1652 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 147/147 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 56/94 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 56/104 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:18:53] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 13 ms to minimize.
[2024-05-31 22:18:53] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:18:53] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:18:53] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:18:53] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:18:53] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:18:53] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
[2024-05-31 22:18:53] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:18:53] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:18:53] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:18:53] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:18:54] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:18:54] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:18:54] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:18:54] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:18:54] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:18:54] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 17/121 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:18:54] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 53/147 variables, 8/130 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 53/183 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:18:54] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:18:54] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:18:54] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:18:54] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:18:54] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:18:54] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:18:54] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 4 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 2 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:18:56] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-05-31 22:18:56] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:18:56] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:18:56] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:18:56] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:18:56] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:18:56] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:18:56] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:18:56] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:18:56] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-05-31 22:18:56] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:18:56] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 10 ms to minimize.
[2024-05-31 22:18:56] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:18:56] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:18:56] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:18:56] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:18:56] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:18:56] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:18:56] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:18:57] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:18:57] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:18:57] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:18:57] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:18:57] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-05-31 22:18:57] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:18:57] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:18:57] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:18:57] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:18:57] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:18:57] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 17/240 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/147 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (OVERLAPS) 267/414 variables, 147/387 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/414 variables, 38/425 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:18:58] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/415 variables, and 426 constraints, problems are : Problem set: 0 solved, 38 unsolved in 5015 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 147/147 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 76/76 constraints]
After SMT, in 6753ms problems are : Problem set: 0 solved, 38 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 287/287 transitions.
Graph (complete) has 636 edges and 147 vertex of which 138 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 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 138 transition count 261
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 32 place count 132 transition count 253
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 130 transition count 252
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 35 place count 130 transition count 248
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 46 place count 123 transition count 248
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 91 place count 78 transition count 158
Iterating global reduction 3 with 45 rules applied. Total rules applied 136 place count 78 transition count 158
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 141 place count 73 transition count 148
Iterating global reduction 3 with 5 rules applied. Total rules applied 146 place count 73 transition count 148
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 155 place count 73 transition count 139
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 167 place count 67 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 169 place count 67 transition count 169
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 183 place count 67 transition count 169
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 196 place count 67 transition count 169
Applied a total of 196 rules in 57 ms. Remains 67 /147 variables (removed 80) and now considering 169/287 (removed 118) transitions.
Running 153 sub problems to find dead transitions.
[2024-05-31 22:18:58] [INFO ] Flow matrix only has 158 transitions (discarded 11 similar events)
// Phase 1: matrix 158 rows 67 cols
[2024-05-31 22:18:58] [INFO ] Computed 6 invariants in 5 ms
[2024-05-31 22:18:58] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 2/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
At refinement iteration 4 (OVERLAPS) 158/225 variables, 67/73 constraints. Problems are: Problem set: 14 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 14/87 constraints. Problems are: Problem set: 14 solved, 139 unsolved
[2024-05-31 22:18:59] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:18:59] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:18:59] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:18:59] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:18:59] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:18:59] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:18:59] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:19:00] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:19:00] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:19:00] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:19:00] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:19:00] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:19:00] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:19:00] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:19:00] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 15/102 constraints. Problems are: Problem set: 14 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/102 constraints. Problems are: Problem set: 14 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/102 constraints. Problems are: Problem set: 14 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 102 constraints, problems are : Problem set: 14 solved, 139 unsolved in 3661 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 67/67 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 14 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 2/66 variables, 1/1 constraints. Problems are: Problem set: 14 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 2/3 constraints. Problems are: Problem set: 14 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 14 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 5/8 constraints. Problems are: Problem set: 14 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 13/21 constraints. Problems are: Problem set: 14 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/21 constraints. Problems are: Problem set: 14 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 158/225 variables, 67/88 constraints. Problems are: Problem set: 14 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 14/102 constraints. Problems are: Problem set: 14 solved, 139 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 139/241 constraints. Problems are: Problem set: 14 solved, 139 unsolved
[2024-05-31 22:19:03] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:19:03] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:19:03] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-31 22:19:03] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:19:03] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-31 22:19:03] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2024-05-31 22:19:03] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:19:03] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:19:03] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:19:04] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:19:04] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:19:04] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 12/253 constraints. Problems are: Problem set: 14 solved, 139 unsolved
[2024-05-31 22:19:05] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-31 22:19:05] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 2/255 constraints. Problems are: Problem set: 14 solved, 139 unsolved
[2024-05-31 22:19:06] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:19:06] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:19:06] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:19:06] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 4/259 constraints. Problems are: Problem set: 14 solved, 139 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/225 variables, 0/259 constraints. Problems are: Problem set: 14 solved, 139 unsolved
At refinement iteration 14 (OVERLAPS) 0/225 variables, 0/259 constraints. Problems are: Problem set: 14 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 259 constraints, problems are : Problem set: 14 solved, 139 unsolved in 9881 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 67/67 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 139/153 constraints, Known Traps: 33/33 constraints]
After SMT, in 13721ms problems are : Problem set: 14 solved, 139 unsolved
Search for dead transitions found 14 dead transitions in 13725ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 14 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 67/147 places, 155/287 transitions.
Graph (complete) has 284 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 155
Applied a total of 2 rules in 11 ms. Remains 66 /67 variables (removed 1) and now considering 155/155 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 13811 ms. Remains : 66/147 places, 155/287 transitions.
RANDOM walk for 4000000 steps (1177778 resets) in 17909 ms. (223 steps per ms) remains 5/38 properties
BEST_FIRST walk for 4000004 steps (133968 resets) in 1642 ms. (2434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000004 steps (134544 resets) in 2820 ms. (1417 steps per ms) remains 3/5 properties
BEST_FIRST walk for 4000004 steps (134230 resets) in 1578 ms. (2533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (134280 resets) in 1751 ms. (2283 steps per ms) remains 3/3 properties
[2024-05-31 22:19:19] [INFO ] Flow matrix only has 144 transitions (discarded 11 similar events)
// Phase 1: matrix 144 rows 66 cols
[2024-05-31 22:19:19] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 22:19:19] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 107/147 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 63/210 variables, 26/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 86 constraints, problems are : Problem set: 0 solved, 3 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 66/66 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 107/147 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 63/210 variables, 26/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 89 constraints, problems are : Problem set: 0 solved, 3 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 66/66 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 189ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 155/155 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 66 transition count 143
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 36 place count 42 transition count 100
Iterating global reduction 1 with 24 rules applied. Total rules applied 60 place count 42 transition count 100
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 38 transition count 96
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 38 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 35 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 35 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 32 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 32 transition count 84
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 98 place count 32 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 30 transition count 64
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 2 with 4 rules applied. Total rules applied 106 place count 28 transition count 72
Applied a total of 106 rules in 11 ms. Remains 28 /66 variables (removed 38) and now considering 72/155 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 28/66 places, 72/155 transitions.
RANDOM walk for 3334277 steps (1006755 resets) in 10202 ms. (326 steps per ms) remains 0/3 properties
Able to resolve query StableMarking after proving 122 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 33242 ms.
ITS solved all properties within timeout

BK_STOP 1717193963624

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-06"
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-06, 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-171640617900463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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