Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r112-smll-174867016500338.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is HealthRecord-PT-01, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-smll-174867016500338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 46K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1748770871059

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 09:41:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 09:41:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 09:41:13] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2025-06-01 09:41:13] [INFO ] Transformed 117 places.
[2025-06-01 09:41:13] [INFO ] Transformed 218 transitions.
[2025-06-01 09:41:13] [INFO ] Found NUPN structural information;
[2025-06-01 09:41:13] [INFO ] Parsed PT model containing 117 places and 218 transitions and 557 arcs in 394 ms.
Graph (trivial) has 178 edges and 117 vertex of which 14 / 117 are part of one of the 7 SCC in 7 ms
Free SCC test removed 7 places
Structural test allowed to assert that 30 places are NOT stable. Took 44 ms.
Ensure Unique test removed 12 transitions
Reduce redundant transitions removed 12 transitions.
RANDOM walk for 40000 steps (3074 resets) in 3017 ms. (13 steps per ms) remains 24/87 properties
BEST_FIRST walk for 4004 steps (42 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (43 resets) in 41 ms. (95 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (42 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (40 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (43 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (40 resets) in 61 ms. (64 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (41 resets) in 75 ms. (52 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (40 resets) in 26 ms. (148 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4003 steps (41 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (42 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (41 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (42 resets) in 43 ms. (91 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (40 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (41 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (40 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (43 resets) in 46 ms. (85 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (40 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (42 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (40 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (43 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (44 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (43 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
[2025-06-01 09:41:15] [INFO ] Flow matrix only has 191 transitions (discarded 15 similar events)
// Phase 1: matrix 191 rows 110 cols
[2025-06-01 09:41:15] [INFO ] Computed 14 invariants in 21 ms
[2025-06-01 09:41:15] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 56/78 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 56/86 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 32/110 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 32/124 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 190/300 variables, 110/234 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 1/301 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 0/301 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 235 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1358 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 56/78 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 56/86 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-01 09:41:17] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 27 ms to minimize.
[2025-06-01 09:41:17] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 3 ms to minimize.
[2025-06-01 09:41:17] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2025-06-01 09:41:17] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2025-06-01 09:41:17] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 3 ms to minimize.
[2025-06-01 09:41:17] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2025-06-01 09:41:17] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2025-06-01 09:41:17] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 3 ms to minimize.
[2025-06-01 09:41:17] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2025-06-01 09:41:18] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2025-06-01 09:41:18] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2025-06-01 09:41:18] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 2 ms to minimize.
[2025-06-01 09:41:18] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-01 09:41:18] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 4 ms to minimize.
[2025-06-01 09:41:18] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2025-06-01 09:41:18] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2025-06-01 09:41:18] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 3 ms to minimize.
[2025-06-01 09:41:18] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2025-06-01 09:41:18] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 13 ms to minimize.
[2025-06-01 09:41:19] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2025-06-01 09:41:19] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2025-06-01 09:41:19] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 3 ms to minimize.
[2025-06-01 09:41:19] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 32/110 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-01 09:41:19] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 3 ms to minimize.
[2025-06-01 09:41:19] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2025-06-01 09:41:19] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2025-06-01 09:41:20] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2025-06-01 09:41:20] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2025-06-01 09:41:20] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2025-06-01 09:41:20] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
[2025-06-01 09:41:20] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2025-06-01 09:41:20] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2025-06-01 09:41:20] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2025-06-01 09:41:20] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 3 ms to minimize.
[2025-06-01 09:41:20] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 12/159 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-01 09:41:20] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2025-06-01 09:41:20] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2025-06-01 09:41:21] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2025-06-01 09:41:21] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2025-06-01 09:41:21] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 3 ms to minimize.
[2025-06-01 09:41:21] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-01 09:41:21] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
SMT process timed out in 6495ms, After SMT, problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 206/206 transitions.
Graph (complete) has 401 edges and 110 vertex of which 103 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 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 15 rules applied. Total rules applied 16 place count 103 transition count 184
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 30 place count 97 transition count 176
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 33 place count 95 transition count 175
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 33 place count 95 transition count 171
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 44 place count 88 transition count 171
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 77 place count 55 transition count 105
Iterating global reduction 3 with 33 rules applied. Total rules applied 110 place count 55 transition count 105
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 116 place count 49 transition count 93
Iterating global reduction 3 with 6 rules applied. Total rules applied 122 place count 49 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 126 place count 49 transition count 89
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 134 place count 45 transition count 109
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 137 place count 45 transition count 106
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 150 place count 45 transition count 106
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 162 place count 45 transition count 106
Applied a total of 162 rules in 104 ms. Remains 45 /110 variables (removed 65) and now considering 106/206 (removed 100) transitions.
Running 98 sub problems to find dead transitions.
[2025-06-01 09:41:21] [INFO ] Flow matrix only has 105 transitions (discarded 1 similar events)
// Phase 1: matrix 105 rows 45 cols
[2025-06-01 09:41:21] [INFO ] Computed 4 invariants in 8 ms
[2025-06-01 09:41:21] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 2/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
At refinement iteration 4 (OVERLAPS) 105/150 variables, 45/49 constraints. Problems are: Problem set: 13 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 15/64 constraints. Problems are: Problem set: 13 solved, 85 unsolved
[2025-06-01 09:41:23] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2025-06-01 09:41:23] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2025-06-01 09:41:23] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2025-06-01 09:41:23] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2025-06-01 09:41:23] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 5/69 constraints. Problems are: Problem set: 13 solved, 85 unsolved
[2025-06-01 09:41:23] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 1/70 constraints. Problems are: Problem set: 13 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/70 constraints. Problems are: Problem set: 13 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/150 variables, 0/70 constraints. Problems are: Problem set: 13 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 70 constraints, problems are : Problem set: 13 solved, 85 unsolved in 3330 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 13 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 2/44 variables, 1/1 constraints. Problems are: Problem set: 13 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 13 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/45 variables, 3/4 constraints. Problems are: Problem set: 13 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 6/10 constraints. Problems are: Problem set: 13 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 13 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 105/150 variables, 45/55 constraints. Problems are: Problem set: 13 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 15/70 constraints. Problems are: Problem set: 13 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 85/155 constraints. Problems are: Problem set: 13 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/155 constraints. Problems are: Problem set: 13 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/150 variables, 0/155 constraints. Problems are: Problem set: 13 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 155 constraints, problems are : Problem set: 13 solved, 85 unsolved in 2610 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 85/98 constraints, Known Traps: 6/6 constraints]
After SMT, in 6183ms problems are : Problem set: 13 solved, 85 unsolved
Search for dead transitions found 13 dead transitions in 6191ms
Found 13 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 13 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 13 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 45/110 places, 93/206 transitions.
Graph (complete) has 145 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 44 transition count 93
Applied a total of 3 rules in 9 ms. Remains 44 /45 variables (removed 1) and now considering 93/93 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6336 ms. Remains : 44/110 places, 93/206 transitions.
RANDOM walk for 260071 steps (85130 resets) in 2192 ms. (118 steps per ms) remains 0/22 properties
Able to resolve query StableMarking after proving 89 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 15932 ms.
ITS solved all properties within timeout

BK_STOP 1748770889174

--------------------
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-01"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is HealthRecord-PT-01, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r112-smll-174867016500338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-01.tgz
mv HealthRecord-PT-01 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;