Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.5K Feb 26 18:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 18:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 17:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 17:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 71K Mar 5 18:22 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 1678611747708

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-12
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-12 09:02:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-12 09:02:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 09:02:30] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2023-03-12 09:02:30] [INFO ] Transformed 160 places.
[2023-03-12 09:02:30] [INFO ] Transformed 340 transitions.
[2023-03-12 09:02:30] [INFO ] Found NUPN structural information;
[2023-03-12 09:02:30] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 201 ms.
Graph (trivial) has 274 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 5 ms
Free SCC test removed 4 places
Structural test allowed to assert that 31 places are NOT stable. Took 17 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Incomplete random walk after 10000 steps, including 820 resets, run finished after 584 ms. (steps per millisecond=17 ) properties (out of 129) seen :74
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Running SMT prover for 55 properties.
[2023-03-12 09:02:31] [INFO ] Flow matrix only has 292 transitions (discarded 16 similar events)
// Phase 1: matrix 292 rows 156 cols
[2023-03-12 09:02:31] [INFO ] Computed 18 place invariants in 22 ms
[2023-03-12 09:02:32] [INFO ] After 636ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:55
[2023-03-12 09:02:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-12 09:02:32] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 15 ms returned sat
[2023-03-12 09:02:34] [INFO ] After 939ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :55
[2023-03-12 09:02:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 09:02:34] [INFO ] After 676ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :55
[2023-03-12 09:02:34] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 9 ms to minimize.
[2023-03-12 09:02:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-03-12 09:02:35] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 1 ms to minimize.
[2023-03-12 09:02:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-12 09:02:36] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2023-03-12 09:02:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-12 09:02:36] [INFO ] After 2101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :55
Attempting to minimize the solution found.
Minimization took 641 ms.
[2023-03-12 09:02:36] [INFO ] After 4376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :55
Fused 55 Parikh solutions to 39 different solutions.
Parikh walk visited 0 properties in 375 ms.
Support contains 55 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 308/308 transitions.
Graph (complete) has 678 edges and 156 vertex of which 147 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 147 transition count 289
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 145 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 144 transition count 286
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 place count 144 transition count 285
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 19 place count 143 transition count 285
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 58 place count 104 transition count 207
Iterating global reduction 3 with 39 rules applied. Total rules applied 97 place count 104 transition count 207
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 101 place count 100 transition count 199
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 100 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 100 transition count 197
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 119 place count 94 transition count 220
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 126 place count 94 transition count 213
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 128 place count 94 transition count 211
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 130 place count 92 transition count 211
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 146 place count 92 transition count 211
Applied a total of 146 rules in 81 ms. Remains 92 /156 variables (removed 64) and now considering 211/308 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 92/156 places, 211/308 transitions.
Incomplete random walk after 1000000 steps, including 70604 resets, run finished after 21716 ms. (steps per millisecond=46 ) properties (out of 55) seen :50
Incomplete Best-First random walk after 1000001 steps, including 12272 resets, run finished after 2893 ms. (steps per millisecond=345 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12260 resets, run finished after 2905 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12242 resets, run finished after 2840 ms. (steps per millisecond=352 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12261 resets, run finished after 2896 ms. (steps per millisecond=345 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12239 resets, run finished after 2912 ms. (steps per millisecond=343 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 09:03:13] [INFO ] Flow matrix only has 200 transitions (discarded 11 similar events)
// Phase 1: matrix 200 rows 92 cols
[2023-03-12 09:03:13] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-12 09:03:13] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 09:03:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 09:03:13] [INFO ] [Nat]Absence check using 1 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 09:03:13] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 09:03:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 09:03:13] [INFO ] After 69ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 09:03:13] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2023-03-12 09:03:14] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2023-03-12 09:03:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2023-03-12 09:03:14] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-12 09:03:14] [INFO ] After 650ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 100 ms.
Support contains 5 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 211/211 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 92 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 91 transition count 210
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 39 place count 54 transition count 136
Iterating global reduction 2 with 37 rules applied. Total rules applied 76 place count 54 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 54 transition count 134
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 51 transition count 128
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 51 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 49 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 49 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 90 place count 47 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 47 transition count 118
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 100 place count 47 transition count 110
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 4 with 2 rules applied. Total rules applied 102 place count 46 transition count 109
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 110 place count 42 transition count 130
Drop 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 42 transition count 129
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 126 place count 42 transition count 129
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 129 place count 42 transition count 129
Applied a total of 129 rules in 49 ms. Remains 42 /92 variables (removed 50) and now considering 129/211 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 42/92 places, 129/211 transitions.
Incomplete random walk after 1000000 steps, including 77147 resets, run finished after 10825 ms. (steps per millisecond=92 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1000001 steps, including 14055 resets, run finished after 2182 ms. (steps per millisecond=458 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 14046 resets, run finished after 2173 ms. (steps per millisecond=460 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 14044 resets, run finished after 2181 ms. (steps per millisecond=458 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 09:03:31] [INFO ] Flow matrix only has 114 transitions (discarded 15 similar events)
// Phase 1: matrix 114 rows 42 cols
[2023-03-12 09:03:31] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-12 09:03:31] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:03:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 09:03:31] [INFO ] [Nat]Absence check using 1 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 09:03:31] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:03:31] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-12 09:03:31] [INFO ] After 24ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:03:31] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-12 09:03:31] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 129/129 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 2 place count 41 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4 place count 40 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 39 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 39 transition count 123
Applied a total of 6 rules in 15 ms. Remains 39 /42 variables (removed 3) and now considering 123/129 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 39/42 places, 123/129 transitions.
Incomplete random walk after 1000000 steps, including 77206 resets, run finished after 10690 ms. (steps per millisecond=93 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 14107 resets, run finished after 2190 ms. (steps per millisecond=456 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 14030 resets, run finished after 2226 ms. (steps per millisecond=449 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 14033 resets, run finished after 2180 ms. (steps per millisecond=458 ) properties (out of 3) seen :0
Finished probabilistic random walk after 1612 steps, run visited all 3 properties in 18 ms. (steps per millisecond=89 )
Probabilistic random walk after 1612 steps, saw 610 distinct states, run finished after 18 ms. (steps per millisecond=89 ) properties seen :3
Able to resolve query StableMarking after proving 131 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 78812 ms.
ITS solved all properties within timeout

BK_STOP 1678611830285

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-12"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is HealthRecord-PT-12, 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 r213-smll-167840356600203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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