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-174867016500348.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-03, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-smll-174867016500348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K 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 49K 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 1748770991161

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-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 09:43:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 09:43:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 09:43:14] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2025-06-01 09:43:14] [INFO ] Transformed 121 places.
[2025-06-01 09:43:14] [INFO ] Transformed 232 transitions.
[2025-06-01 09:43:14] [INFO ] Found NUPN structural information;
[2025-06-01 09:43:14] [INFO ] Parsed PT model containing 121 places and 232 transitions and 597 arcs in 285 ms.
Graph (trivial) has 186 edges and 121 vertex of which 10 / 121 are part of one of the 5 SCC in 5 ms
Free SCC test removed 5 places
Structural test allowed to assert that 28 places are NOT stable. Took 36 ms.
Ensure Unique test removed 12 transitions
Reduce redundant transitions removed 12 transitions.
RANDOM walk for 40000 steps (3372 resets) in 2987 ms. (13 steps per ms) remains 30/93 properties
BEST_FIRST walk for 4004 steps (44 resets) in 69 ms. (57 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (45 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (45 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (45 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (41 resets) in 43 ms. (91 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (46 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (44 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (46 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (47 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (46 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (46 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (45 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (45 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (45 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (45 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (46 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (43 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (44 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (42 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (45 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (44 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (47 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (42 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (43 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (43 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (48 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (46 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (45 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (42 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
[2025-06-01 09:43:15] [INFO ] Flow matrix only has 207 transitions (discarded 13 similar events)
// Phase 1: matrix 207 rows 116 cols
[2025-06-01 09:43:15] [INFO ] Computed 14 invariants in 21 ms
[2025-06-01 09:43:15] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 48/78 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 48/86 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 38/116 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 38/130 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 206/322 variables, 116/246 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 1/323 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 0/323 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 247 constraints, problems are : Problem set: 0 solved, 30 unsolved in 2322 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 116/116 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 48/78 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 48/86 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-01 09:43:18] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 27 ms to minimize.
[2025-06-01 09:43:18] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 3 ms to minimize.
[2025-06-01 09:43:18] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 3 ms to minimize.
[2025-06-01 09:43:19] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 3 ms to minimize.
[2025-06-01 09:43:19] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 3 ms to minimize.
[2025-06-01 09:43:19] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 28 ms to minimize.
[2025-06-01 09:43:19] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 2 ms to minimize.
[2025-06-01 09:43:19] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2025-06-01 09:43:19] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2025-06-01 09:43:20] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2025-06-01 09:43:20] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2025-06-01 09:43:20] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2025-06-01 09:43:20] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2025-06-01 09:43:20] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 14/100 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-01 09:43:20] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2025-06-01 09:43:20] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2025-06-01 09:43:20] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-01 09:43:21] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2025-06-01 09:43:21] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 38/116 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 38/149 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-01 09:43:21] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 3 ms to minimize.
[2025-06-01 09:43:21] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 2 ms to minimize.
[2025-06-01 09:43:21] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2025-06-01 09:43:21] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2025-06-01 09:43:22] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 3 ms to minimize.
[2025-06-01 09:43:22] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2025-06-01 09:43:22] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 2 ms to minimize.
[2025-06-01 09:43:22] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2025-06-01 09:43:22] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2025-06-01 09:43:22] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
[2025-06-01 09:43:22] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 3 ms to minimize.
[2025-06-01 09:43:22] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2025-06-01 09:43:22] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 2 ms to minimize.
[2025-06-01 09:43:22] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2025-06-01 09:43:23] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
[2025-06-01 09:43:23] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 8 ms to minimize.
[2025-06-01 09:43:23] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 3 ms to minimize.
SMT process timed out in 7531ms, After SMT, problems are : Problem set: 0 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 220/220 transitions.
Graph (complete) has 429 edges and 116 vertex of which 109 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 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 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 109 transition count 202
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 105 transition count 196
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 25 place count 103 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 25 place count 103 transition count 193
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 100 transition count 193
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 63 place count 67 transition count 127
Iterating global reduction 3 with 33 rules applied. Total rules applied 96 place count 67 transition count 127
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 101 place count 62 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 106 place count 62 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 109 place count 62 transition count 114
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 119 place count 57 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 120 place count 57 transition count 139
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 133 place count 57 transition count 139
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 145 place count 57 transition count 139
Applied a total of 145 rules in 98 ms. Remains 57 /116 variables (removed 59) and now considering 139/220 (removed 81) transitions.
Running 123 sub problems to find dead transitions.
[2025-06-01 09:43:23] [INFO ] Flow matrix only has 132 transitions (discarded 7 similar events)
// Phase 1: matrix 132 rows 57 cols
[2025-06-01 09:43:23] [INFO ] Computed 6 invariants in 6 ms
[2025-06-01 09:43:23] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 2/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
At refinement iteration 4 (OVERLAPS) 132/189 variables, 57/63 constraints. Problems are: Problem set: 13 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 13/76 constraints. Problems are: Problem set: 13 solved, 110 unsolved
[2025-06-01 09:43:25] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2025-06-01 09:43:25] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 2 ms to minimize.
[2025-06-01 09:43:25] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2025-06-01 09:43:25] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2025-06-01 09:43:25] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2025-06-01 09:43:25] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2025-06-01 09:43:25] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2025-06-01 09:43:25] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2025-06-01 09:43:25] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2025-06-01 09:43:25] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2025-06-01 09:43:25] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2025-06-01 09:43:25] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2025-06-01 09:43:25] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2025-06-01 09:43:26] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 14/90 constraints. Problems are: Problem set: 13 solved, 110 unsolved
[2025-06-01 09:43:27] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/91 constraints. Problems are: Problem set: 13 solved, 110 unsolved
[2025-06-01 09:43:27] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/92 constraints. Problems are: Problem set: 13 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/92 constraints. Problems are: Problem set: 13 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/92 constraints. Problems are: Problem set: 13 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 92 constraints, problems are : Problem set: 13 solved, 110 unsolved in 6417 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 13 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 2/56 variables, 1/1 constraints. Problems are: Problem set: 13 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/2 constraints. Problems are: Problem set: 13 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 13 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 1/57 variables, 5/7 constraints. Problems are: Problem set: 13 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 15/22 constraints. Problems are: Problem set: 13 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/22 constraints. Problems are: Problem set: 13 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 132/189 variables, 57/79 constraints. Problems are: Problem set: 13 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 13/92 constraints. Problems are: Problem set: 13 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 110/202 constraints. Problems are: Problem set: 13 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/202 constraints. Problems are: Problem set: 13 solved, 110 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/202 constraints. Problems are: Problem set: 13 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 202 constraints, problems are : Problem set: 13 solved, 110 unsolved in 4496 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 110/123 constraints, Known Traps: 16/16 constraints]
After SMT, in 11162ms problems are : Problem set: 13 solved, 110 unsolved
Search for dead transitions found 13 dead transitions in 11169ms
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 : 57/116 places, 126/220 transitions.
Graph (complete) has 182 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 55 transition count 125
Applied a total of 3 rules in 12 ms. Remains 55 /57 variables (removed 2) and now considering 125/126 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11318 ms. Remains : 55/116 places, 125/220 transitions.
RANDOM walk for 136995 steps (33881 resets) in 2083 ms. (65 steps per ms) remains 0/30 properties
Able to resolve query StableMarking after proving 95 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 21521 ms.
ITS solved all properties within timeout

BK_STOP 1748771015406

--------------------
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-03"
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-03, 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-174867016500348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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