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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K 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 50K 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 1748771059300

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-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 09:44:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 09:44:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 09:44:22] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2025-06-01 09:44:22] [INFO ] Transformed 123 places.
[2025-06-01 09:44:22] [INFO ] Transformed 239 transitions.
[2025-06-01 09:44:22] [INFO ] Found NUPN structural information;
[2025-06-01 09:44:22] [INFO ] Parsed PT model containing 123 places and 239 transitions and 617 arcs in 416 ms.
Graph (trivial) has 190 edges and 123 vertex of which 8 / 123 are part of one of the 4 SCC in 7 ms
Free SCC test removed 4 places
Structural test allowed to assert that 27 places are NOT stable. Took 44 ms.
Ensure Unique test removed 12 transitions
Reduce redundant transitions removed 12 transitions.
RANDOM walk for 40000 steps (3525 resets) in 3014 ms. (13 steps per ms) remains 21/96 properties
BEST_FIRST walk for 4003 steps (48 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (45 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (45 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (45 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (48 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (44 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (47 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (46 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (46 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (45 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (48 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (46 resets) in 10 ms. (364 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4003 steps (45 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (48 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (47 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (46 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (45 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (44 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (47 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (46 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
[2025-06-01 09:44:23] [INFO ] Flow matrix only has 215 transitions (discarded 12 similar events)
// Phase 1: matrix 215 rows 119 cols
[2025-06-01 09:44:23] [INFO ] Computed 14 invariants in 21 ms
[2025-06-01 09:44:23] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 57/76 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 57/84 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 43/119 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 43/133 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 214/333 variables, 119/252 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 1/334 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 0/334 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 253 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1479 ms.
Refiners :[Domain max(s): 119/119 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 57/76 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 57/84 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-06-01 09:44:25] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 28 ms to minimize.
[2025-06-01 09:44:26] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 2 ms to minimize.
[2025-06-01 09:44:26] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2025-06-01 09:44:26] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2025-06-01 09:44:26] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 3 ms to minimize.
[2025-06-01 09:44:26] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2025-06-01 09:44:26] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2025-06-01 09:44:26] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 3 ms to minimize.
[2025-06-01 09:44:26] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 9/93 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-06-01 09:44:26] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2025-06-01 09:44:26] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
[2025-06-01 09:44:26] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 2 ms to minimize.
[2025-06-01 09:44:27] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 2 ms to minimize.
[2025-06-01 09:44:27] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 2 ms to minimize.
[2025-06-01 09:44:27] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 43/119 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 43/148 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-06-01 09:44:27] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 3 ms to minimize.
[2025-06-01 09:44:27] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 2 ms to minimize.
[2025-06-01 09:44:27] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 3 ms to minimize.
[2025-06-01 09:44:27] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 3 ms to minimize.
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 3 ms to minimize.
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 3 ms to minimize.
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 3 ms to minimize.
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 3 ms to minimize.
[2025-06-01 09:44:29] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2025-06-01 09:44:29] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2025-06-01 09:44:29] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2025-06-01 09:44:29] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 16/164 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-06-01 09:44:29] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-06-01 09:44:29] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-06-01 09:44:29] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 214/333 variables, 119/286 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/333 variables, 19/305 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/334 variables, and 305 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5016 ms.
Refiners :[Domain max(s): 119/119 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 34/34 constraints]
After SMT, in 6590ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 227/227 transitions.
Graph (complete) has 443 edges and 119 vertex of which 112 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 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 112 transition count 211
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 8 rules applied. Total rules applied 18 place count 109 transition count 206
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 21 place count 107 transition count 205
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 107 transition count 204
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 106 transition count 204
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 65 place count 64 transition count 120
Iterating global reduction 3 with 42 rules applied. Total rules applied 107 place count 64 transition count 120
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 112 place count 59 transition count 110
Iterating global reduction 3 with 5 rules applied. Total rules applied 117 place count 59 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 120 place count 59 transition count 107
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -28
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 130 place count 54 transition count 135
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 131 place count 54 transition count 134
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 4 with 19 rules applied. Total rules applied 150 place count 54 transition count 134
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 167 place count 54 transition count 134
Applied a total of 167 rules in 144 ms. Remains 54 /119 variables (removed 65) and now considering 134/227 (removed 93) transitions.
Running 118 sub problems to find dead transitions.
[2025-06-01 09:44:30] [INFO ] Flow matrix only has 124 transitions (discarded 10 similar events)
// Phase 1: matrix 124 rows 54 cols
[2025-06-01 09:44:30] [INFO ] Computed 7 invariants in 9 ms
[2025-06-01 09:44:30] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 2/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
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
At refinement iteration 4 (OVERLAPS) 124/178 variables, 54/61 constraints. Problems are: Problem set: 18 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 12/73 constraints. Problems are: Problem set: 18 solved, 100 unsolved
[2025-06-01 09:44:32] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 5 ms to minimize.
[2025-06-01 09:44:32] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2025-06-01 09:44:32] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2025-06-01 09:44:32] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2025-06-01 09:44:32] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2025-06-01 09:44:32] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 3 ms to minimize.
[2025-06-01 09:44:32] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2025-06-01 09:44:33] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
Problem TDEAD52 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 8/81 constraints. Problems are: Problem set: 19 solved, 99 unsolved
[2025-06-01 09:44:33] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 1/82 constraints. Problems are: Problem set: 19 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/82 constraints. Problems are: Problem set: 19 solved, 99 unsolved
[2025-06-01 09:44:34] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/178 variables, 1/83 constraints. Problems are: Problem set: 19 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/83 constraints. Problems are: Problem set: 19 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/83 constraints. Problems are: Problem set: 19 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 83 constraints, problems are : Problem set: 19 solved, 99 unsolved in 5477 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 19 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 3/53 variables, 1/1 constraints. Problems are: Problem set: 19 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 19 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 1/54 variables, 6/7 constraints. Problems are: Problem set: 19 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 19 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/17 constraints. Problems are: Problem set: 19 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 124/178 variables, 54/71 constraints. Problems are: Problem set: 19 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 12/83 constraints. Problems are: Problem set: 19 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 99/182 constraints. Problems are: Problem set: 19 solved, 99 unsolved
[2025-06-01 09:44:38] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 1/183 constraints. Problems are: Problem set: 19 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/183 constraints. Problems are: Problem set: 19 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/183 constraints. Problems are: Problem set: 19 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 183 constraints, problems are : Problem set: 19 solved, 99 unsolved in 4903 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 99/118 constraints, Known Traps: 11/11 constraints]
After SMT, in 10732ms problems are : Problem set: 19 solved, 99 unsolved
Search for dead transitions found 19 dead transitions in 10741ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 19 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 54/119 places, 115/227 transitions.
Graph (complete) has 169 edges and 54 vertex of which 52 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 51 transition count 114
Applied a total of 3 rules in 11 ms. Remains 51 /54 variables (removed 3) and now considering 114/115 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10930 ms. Remains : 51/119 places, 114/227 transitions.
RANDOM walk for 40878 steps (4657 resets) in 1086 ms. (37 steps per ms) remains 0/19 properties
Able to resolve query StableMarking after proving 98 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 19741 ms.
ITS solved all properties within timeout

BK_STOP 1748771081805

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

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