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.r188-tall-171640616900503.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 greatspnxred
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 r188-tall-171640616900503
=====================================================================

--------------------
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 1716476012196

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 14:53:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-23 14:53:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:53:33] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-23 14:53:33] [INFO ] Transformed 162 places.
[2024-05-23 14:53:33] [INFO ] Transformed 347 transitions.
[2024-05-23 14:53:33] [INFO ] Found NUPN structural information;
[2024-05-23 14:53:33] [INFO ] Parsed PT model containing 162 places and 347 transitions and 915 arcs in 186 ms.
Graph (trivial) has 278 edges and 162 vertex of which 6 / 162 are part of one of the 3 SCC in 4 ms
Free SCC test removed 3 places
Structural test allowed to assert that 30 places are NOT stable. Took 20 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (3389 resets) in 1873 ms. (21 steps per ms) remains 46/132 properties
BEST_FIRST walk for 4003 steps (33 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (38 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (37 resets) in 43 ms. (91 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (37 resets) in 41 ms. (95 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (39 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (36 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (37 resets) in 17 ms. (222 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4004 steps (40 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (38 resets) in 10 ms. (363 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (36 resets) in 15 ms. (250 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4003 steps (36 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (37 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (37 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (37 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (38 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (39 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (36 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (36 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (36 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (37 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (37 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (36 resets) in 27 ms. (142 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (36 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (40 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (37 resets) in 8 ms. (444 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (37 resets) in 27 ms. (143 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (40 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (36 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (38 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (36 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (39 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (36 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (37 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (36 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (38 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (35 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (38 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (35 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (39 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (36 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (37 resets) in 10 ms. (363 steps per ms) remains 43/43 properties
[2024-05-23 14:53:34] [INFO ] Flow matrix only has 300 transitions (discarded 15 similar events)
// Phase 1: matrix 300 rows 159 cols
[2024-05-23 14:53:34] [INFO ] Computed 18 invariants in 13 ms
[2024-05-23 14:53:34] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 54/97 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 54/107 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 62/159 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 62/177 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 299/458 variables, 159/336 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 1/459 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (OVERLAPS) 0/459 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 337 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1773 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: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 54/97 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 54/107 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-23 14:53:36] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 15 ms to minimize.
[2024-05-23 14:53:36] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-05-23 14:53:36] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:53:36] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:53:37] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:53:37] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2024-05-23 14:53:37] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:53:37] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:53:37] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:53:37] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-05-23 14:53:37] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:53:37] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:53:37] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-05-23 14:53:37] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 4 ms to minimize.
[2024-05-23 14:53:37] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:53:37] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:53:37] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:53:37] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2024-05-23 14:53:37] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 19/126 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-23 14:53:37] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 62/159 variables, 8/135 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 62/197 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-23 14:53:38] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:53:38] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-23 14:53:38] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-23 14:53:38] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:53:38] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-23 14:53:38] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:53:38] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:53:38] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:53:38] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:53:38] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-23 14:53:38] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:53:38] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-23 14:53:38] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:53:38] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 2 ms to minimize.
[2024-05-23 14:53:38] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 5 ms to minimize.
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 2 ms to minimize.
[2024-05-23 14:53:39] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 2 ms to minimize.
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 4 ms to minimize.
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:53:40] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:53:41] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-05-23 14:53:41] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-23 14:53:41] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:53:41] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-23 14:53:41] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-23 14:53:41] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-05-23 14:53:41] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:53:41] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:53:41] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
SMT process timed out in 6899ms, After SMT, problems are : Problem set: 0 solved, 43 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 315/315 transitions.
Graph (complete) has 692 edges and 159 vertex of which 150 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 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 7 transitions
Reduce isomorphic transitions removed 7 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 0 with 8 rules applied. Total rules applied 9 place count 150 transition count 298
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 rules applied. Total rules applied 12 place count 149 transition count 296
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 148 transition count 296
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 67 place count 94 transition count 188
Iterating global reduction 3 with 54 rules applied. Total rules applied 121 place count 94 transition count 188
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 126 place count 89 transition count 178
Iterating global reduction 3 with 5 rules applied. Total rules applied 131 place count 89 transition count 178
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 139 place count 89 transition count 170
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 151 place count 83 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 156 place count 83 transition count 192
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 160 place count 83 transition count 188
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 164 place count 79 transition count 188
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 179 place count 79 transition count 188
Applied a total of 179 rules in 64 ms. Remains 79 /159 variables (removed 80) and now considering 188/315 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 79/159 places, 188/315 transitions.
RANDOM walk for 4000000 steps (272959 resets) in 13469 ms. (296 steps per ms) remains 3/43 properties
BEST_FIRST walk for 4000004 steps (49480 resets) in 2374 ms. (1684 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (49515 resets) in 2363 ms. (1692 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (49335 resets) in 2349 ms. (1702 steps per ms) remains 3/3 properties
[2024-05-23 14:53:47] [INFO ] Flow matrix only has 168 transitions (discarded 20 similar events)
// Phase 1: matrix 168 rows 79 cols
[2024-05-23 14:53:47] [INFO ] Computed 9 invariants in 1 ms
[2024-05-23 14:53:47] [INFO ] State equation strengthened by 7 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) 11/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 65/79 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 168/247 variables, 79/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 7/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/247 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 95 constraints, problems are : Problem set: 0 solved, 3 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 79/79 constraints, ReadFeed: 7/7 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) 11/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 65/79 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 168/247 variables, 79/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 7/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/247 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 98 constraints, problems are : Problem set: 0 solved, 3 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 79/79 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 227ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 188/188 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 0 with 1 rules applied. Total rules applied 1 place count 79 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 78 transition count 187
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 29 place count 51 transition count 133
Iterating global reduction 2 with 27 rules applied. Total rules applied 56 place count 51 transition count 133
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 47 transition count 125
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 47 transition count 125
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 44 transition count 116
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 44 transition count 116
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 41 transition count 110
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 41 transition count 110
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 90 place count 41 transition count 96
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 3 with 4 rules applied. Total rules applied 94 place count 39 transition count 94
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 100 place count 36 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 36 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 105 place count 36 transition count 102
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 116 place count 36 transition count 102
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 118 place count 36 transition count 102
Applied a total of 118 rules in 30 ms. Remains 36 /79 variables (removed 43) and now considering 102/188 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 36/79 places, 102/188 transitions.
RANDOM walk for 2377588 steps (179012 resets) in 12286 ms. (193 steps per ms) remains 0/3 properties
Able to resolve query StableMarking after proving 134 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 20693 ms.
ITS solved all properties within timeout

BK_STOP 1716476034094

--------------------
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="greatspnxred"
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 greatspnxred"
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 r188-tall-171640616900503"
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 ;