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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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 6.8K Apr 12 20:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 20:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 20:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 20:07 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 50K 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 1716475583101

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-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 14:46:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-23 14:46:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:46:24] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-23 14:46:24] [INFO ] Transformed 123 places.
[2024-05-23 14:46:24] [INFO ] Transformed 239 transitions.
[2024-05-23 14:46:24] [INFO ] Found NUPN structural information;
[2024-05-23 14:46:24] [INFO ] Parsed PT model containing 123 places and 239 transitions and 617 arcs in 176 ms.
Graph (trivial) has 190 edges and 123 vertex of which 8 / 123 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Structural test allowed to assert that 27 places are NOT stable. Took 21 ms.
Ensure Unique test removed 12 transitions
Reduce redundant transitions removed 12 transitions.
RANDOM walk for 40000 steps (3523 resets) in 2293 ms. (17 steps per ms) remains 38/96 properties
BEST_FIRST walk for 4003 steps (47 resets) in 21 ms. (181 steps per ms) remains 36/38 properties
BEST_FIRST walk for 4003 steps (45 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (47 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (45 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (46 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (43 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (48 resets) in 39 ms. (100 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (48 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (45 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (48 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (47 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (46 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (44 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (47 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (46 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (46 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (48 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (47 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (46 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (43 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (47 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (42 resets) in 9 ms. (400 steps per ms) remains 32/36 properties
BEST_FIRST walk for 4004 steps (48 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (46 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (46 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (48 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (42 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (45 resets) in 14 ms. (266 steps per ms) remains 30/32 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (44 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (47 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (43 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (47 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
[2024-05-23 14:46:25] [INFO ] Flow matrix only has 215 transitions (discarded 12 similar events)
// Phase 1: matrix 215 rows 119 cols
[2024-05-23 14:46:25] [INFO ] Computed 14 invariants in 12 ms
[2024-05-23 14:46:25] [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) 41/119 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 41/133 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 214/333 variables, 119/252 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 1/334 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 0/334 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 253 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1061 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: 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
[2024-05-23 14:46:26] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 11 ms to minimize.
[2024-05-23 14:46:27] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:46:27] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 1 ms to minimize.
[2024-05-23 14:46:27] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-05-23 14:46:27] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-05-23 14:46:27] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-05-23 14:46:27] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:46:27] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:46:27] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-23 14:46:27] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-23 14:46:27] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-05-23 14:46:27] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2024-05-23 14:46:27] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2024-05-23 14:46:27] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 14/100 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-23 14:46:27] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:46:27] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:46:28] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-23 14:46:28] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-23 14:46:28] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 41/119 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-23 14:46:28] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-23 14:46:28] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 5 ms to minimize.
[2024-05-23 14:46:28] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:46:28] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:46:28] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 2 ms to minimize.
[2024-05-23 14:46:28] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-23 14:46:28] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-23 14:46:28] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 8/160 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-23 14:46:28] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:46:29] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:46:29] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-05-23 14:46:29] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:46:29] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-23 14:46:29] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-23 14:46:29] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:46:29] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 5 ms to minimize.
[2024-05-23 14:46:29] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 1 ms to minimize.
[2024-05-23 14:46:29] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 10/170 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-23 14:46:29] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:46:30] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (OVERLAPS) 214/333 variables, 119/291 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/333 variables, 30/321 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-23 14:46:30] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/333 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/333 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 17 (OVERLAPS) 1/334 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/334 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-23 14:46:31] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:46:31] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:46:31] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
SMT process timed out in 6185ms, After SMT, problems are : Problem set: 0 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 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.1 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 0 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 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 58 place count 71 transition count 134
Iterating global reduction 3 with 35 rules applied. Total rules applied 93 place count 71 transition count 134
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 96 place count 68 transition count 128
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 68 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 100 place count 68 transition count 127
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 110 place count 63 transition count 155
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 111 place count 63 transition count 154
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 128 place count 63 transition count 154
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 143 place count 63 transition count 154
Applied a total of 143 rules in 62 ms. Remains 63 /119 variables (removed 56) and now considering 154/227 (removed 73) transitions.
Running 138 sub problems to find dead transitions.
[2024-05-23 14:46:31] [INFO ] Flow matrix only has 144 transitions (discarded 10 similar events)
// Phase 1: matrix 144 rows 63 cols
[2024-05-23 14:46:31] [INFO ] Computed 7 invariants in 5 ms
[2024-05-23 14:46:31] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 2/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
At refinement iteration 4 (OVERLAPS) 144/207 variables, 63/70 constraints. Problems are: Problem set: 16 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 12/82 constraints. Problems are: Problem set: 16 solved, 122 unsolved
[2024-05-23 14:46:33] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-23 14:46:33] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 0 ms to minimize.
[2024-05-23 14:46:33] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
[2024-05-23 14:46:33] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-05-23 14:46:33] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-23 14:46:33] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:46:33] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
Problem TDEAD74 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 7/89 constraints. Problems are: Problem set: 17 solved, 121 unsolved
[2024-05-23 14:46:34] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:46:34] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-23 14:46:34] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-05-23 14:46:34] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-23 14:46:34] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-05-23 14:46:34] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 6/95 constraints. Problems are: Problem set: 17 solved, 121 unsolved
[2024-05-23 14:46:35] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:46:35] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 2/97 constraints. Problems are: Problem set: 17 solved, 121 unsolved
[2024-05-23 14:46:35] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:46:35] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 2/99 constraints. Problems are: Problem set: 17 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/99 constraints. Problems are: Problem set: 17 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/207 variables, 0/99 constraints. Problems are: Problem set: 17 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 99 constraints, problems are : Problem set: 17 solved, 121 unsolved in 5150 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 63/63 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 17 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 17 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 3/62 variables, 1/1 constraints. Problems are: Problem set: 17 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 17 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 6/7 constraints. Problems are: Problem set: 17 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 17/24 constraints. Problems are: Problem set: 17 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/24 constraints. Problems are: Problem set: 17 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 144/207 variables, 63/87 constraints. Problems are: Problem set: 17 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 12/99 constraints. Problems are: Problem set: 17 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 121/220 constraints. Problems are: Problem set: 17 solved, 121 unsolved
[2024-05-23 14:46:38] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 1/221 constraints. Problems are: Problem set: 17 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/221 constraints. Problems are: Problem set: 17 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/207 variables, 0/221 constraints. Problems are: Problem set: 17 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 221 constraints, problems are : Problem set: 17 solved, 121 unsolved in 4136 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 63/63 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 121/138 constraints, Known Traps: 18/18 constraints]
After SMT, in 9488ms problems are : Problem set: 17 solved, 121 unsolved
Search for dead transitions found 17 dead transitions in 9501ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 17 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/119 places, 137/227 transitions.
Graph (complete) has 202 edges and 63 vertex of which 61 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 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 60 transition count 136
Applied a total of 3 rules in 6 ms. Remains 60 /63 variables (removed 3) and now considering 136/137 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9584 ms. Remains : 60/119 places, 136/227 transitions.
RANDOM walk for 91142 steps (10610 resets) in 1150 ms. (79 steps per ms) remains 0/30 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 17420 ms.
ITS solved all properties within timeout

BK_STOP 1716475601820

--------------------
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="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-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 r188-tall-171640616700453"
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.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 ;