fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r201-smll-167840347600303
Last Updated
May 14, 2023

About the Execution of LTSMin+red for HealthRecord-PT-09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
353.695 45417.00 134012.00 374.20 FTTFTTFFTFFTTTTT normal

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.r201-smll-167840347600303.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 ltsminxred
Input is HealthRecord-PT-09, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347600303
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 18:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 18:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 18:21 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 68K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-00
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-01
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-02
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-03
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-04
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-05
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-06
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-07
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-08
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-09
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-10
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-11
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-12
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-13
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-14
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678639726442

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:48:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:48:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:48:50] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2023-03-12 16:48:50] [INFO ] Transformed 157 places.
[2023-03-12 16:48:50] [INFO ] Transformed 327 transitions.
[2023-03-12 16:48:50] [INFO ] Found NUPN structural information;
[2023-03-12 16:48:50] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Incomplete random walk after 10000 steps, including 592 resets, run finished after 1096 ms. (steps per millisecond=9 ) properties (out of 16) seen :2
FORMULA HealthRecord-PT-09-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 14) seen :1
FORMULA HealthRecord-PT-09-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :1
FORMULA HealthRecord-PT-09-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-12 16:48:52] [INFO ] Flow matrix only has 289 transitions (discarded 12 similar events)
// Phase 1: matrix 289 rows 157 cols
[2023-03-12 16:48:52] [INFO ] Computed 18 place invariants in 26 ms
[2023-03-12 16:48:53] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-12 16:48:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 22 ms returned sat
[2023-03-12 16:48:53] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 23 ms returned sat
[2023-03-12 16:48:54] [INFO ] After 612ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :7
[2023-03-12 16:48:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:48:54] [INFO ] After 310ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :5 sat :7
[2023-03-12 16:48:54] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 11 ms to minimize.
[2023-03-12 16:48:54] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2023-03-12 16:48:54] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 3 ms to minimize.
[2023-03-12 16:48:54] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 2 ms to minimize.
[2023-03-12 16:48:54] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2023-03-12 16:48:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 649 ms
[2023-03-12 16:48:55] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2023-03-12 16:48:55] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 0 ms to minimize.
[2023-03-12 16:48:55] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2023-03-12 16:48:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 340 ms
[2023-03-12 16:48:55] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2023-03-12 16:48:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-12 16:48:55] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 0 ms to minimize.
[2023-03-12 16:48:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-12 16:48:55] [INFO ] After 1876ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :7
Attempting to minimize the solution found.
Minimization took 324 ms.
[2023-03-12 16:48:56] [INFO ] After 3171ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :7
FORMULA HealthRecord-PT-09-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-09-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-09-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-09-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-09-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 88 ms.
Support contains 68 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 301/301 transitions.
Graph (trivial) has 76 edges and 157 vertex of which 2 / 157 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 663 edges and 156 vertex of which 148 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 148 transition count 285
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 147 transition count 284
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 41 place count 111 transition count 212
Iterating global reduction 2 with 36 rules applied. Total rules applied 77 place count 111 transition count 212
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 110 transition count 211
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 110 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 109 transition count 210
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 109 transition count 210
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 109 transition count 210
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 109 transition count 209
Applied a total of 85 rules in 143 ms. Remains 109 /157 variables (removed 48) and now considering 209/301 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 109/157 places, 209/301 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 829136 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :{}
Probabilistic random walk after 829136 steps, saw 106063 distinct states, run finished after 3002 ms. (steps per millisecond=276 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 209 rows 109 cols
[2023-03-12 16:49:01] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-12 16:49:01] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-12 16:49:01] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-12 16:49:01] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 16:49:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-12 16:49:01] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 10 ms returned sat
[2023-03-12 16:49:01] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 16:49:01] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2023-03-12 16:49:01] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 0 ms to minimize.
[2023-03-12 16:49:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2023-03-12 16:49:01] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2023-03-12 16:49:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-12 16:49:02] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2023-03-12 16:49:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-12 16:49:02] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2023-03-12 16:49:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-12 16:49:02] [INFO ] After 762ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 167 ms.
[2023-03-12 16:49:02] [INFO ] After 1026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA HealthRecord-PT-09-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 15 ms.
Support contains 44 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 209/209 transitions.
Graph (trivial) has 49 edges and 109 vertex of which 2 / 109 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 437 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 3 place count 107 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 106 transition count 206
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 21 place count 89 transition count 172
Iterating global reduction 2 with 17 rules applied. Total rules applied 38 place count 89 transition count 172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 88 transition count 170
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 88 transition count 170
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 2 with 2 rules applied. Total rules applied 42 place count 87 transition count 169
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 2 with 2 rules applied. Total rules applied 44 place count 86 transition count 169
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 86 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 85 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 85 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 84 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 84 transition count 165
Applied a total of 49 rules in 40 ms. Remains 84 /109 variables (removed 25) and now considering 165/209 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 84/109 places, 165/209 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2695484 steps, run timeout after 3001 ms. (steps per millisecond=898 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 2695484 steps, saw 318832 distinct states, run finished after 3003 ms. (steps per millisecond=897 ) properties seen :2
FORMULA HealthRecord-PT-09-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 165 rows 84 cols
[2023-03-12 16:49:05] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-12 16:49:05] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:49:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-12 16:49:05] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:49:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:49:06] [INFO ] After 24ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:49:06] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 5 ms to minimize.
[2023-03-12 16:49:06] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 0 ms to minimize.
[2023-03-12 16:49:06] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2023-03-12 16:49:06] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2023-03-12 16:49:06] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2023-03-12 16:49:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 312 ms
[2023-03-12 16:49:06] [INFO ] After 365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-12 16:49:06] [INFO ] After 529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 165/165 transitions.
Graph (trivial) has 53 edges and 84 vertex of which 2 / 84 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 70 transition count 137
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 70 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 30 place count 67 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 33 place count 67 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 35 place count 65 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 37 place count 65 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 38 place count 64 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 39 place count 64 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 41 place count 64 transition count 121
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 1 with 2 rules applied. Total rules applied 43 place count 63 transition count 120
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 59 transition count 131
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 59 transition count 130
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 59 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 58 transition count 129
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 69 place count 58 transition count 129
Applied a total of 69 rules in 41 ms. Remains 58 /84 variables (removed 26) and now considering 129/165 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 58/84 places, 129/165 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Finished probabilistic random walk after 850567 steps, run visited all 1 properties in 991 ms. (steps per millisecond=858 )
Probabilistic random walk after 850567 steps, saw 125916 distinct states, run finished after 992 ms. (steps per millisecond=857 ) properties seen :1
FORMULA HealthRecord-PT-09-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 17756 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/535/inv_0_ --invariant=/tmp/535/inv_1_ --invariant=/tmp/535/inv_2_ --invariant=/tmp/535/inv_3_ --invariant=/tmp/535/inv_4_ --invariant=/tmp/535/inv_5_ --invariant=/tmp/535/inv_6_ --invariant=/tmp/535/inv_7_ --invariant=/tmp/535/inv_8_ --invariant=/tmp/535/inv_9_ --invariant=/tmp/535/inv_10_ --invariant=/tmp/535/inv_11_ --invariant=/tmp/535/inv_12_ --invariant=/tmp/535/inv_13_ --invariant=/tmp/535/inv_14_ --invariant=/tmp/535/inv_15_ --inv-par
FORMULA HealthRecord-PT-09-ReachabilityFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-09-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-09-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-09-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-09-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-09-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-09-ReachabilityFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-09-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-09-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-09-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-09-ReachabilityFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-09-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-09-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-09-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-09-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-09-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678639771859

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name HealthRecord-PT-09-ReachabilityFireability-00
rfs formula type EF
rfs formula formula --invariant=/tmp/535/inv_0_
rfs formula name HealthRecord-PT-09-ReachabilityFireability-01
rfs formula type EF
rfs formula formula --invariant=/tmp/535/inv_1_
rfs formula name HealthRecord-PT-09-ReachabilityFireability-02
rfs formula type EF
rfs formula formula --invariant=/tmp/535/inv_2_
rfs formula name HealthRecord-PT-09-ReachabilityFireability-03
rfs formula type AG
rfs formula formula --invariant=/tmp/535/inv_3_
rfs formula name HealthRecord-PT-09-ReachabilityFireability-04
rfs formula type EF
rfs formula formula --invariant=/tmp/535/inv_4_
rfs formula name HealthRecord-PT-09-ReachabilityFireability-05
rfs formula type AG
rfs formula formula --invariant=/tmp/535/inv_5_
rfs formula name HealthRecord-PT-09-ReachabilityFireability-06
rfs formula type EF
rfs formula formula --invariant=/tmp/535/inv_6_
rfs formula name HealthRecord-PT-09-ReachabilityFireability-07
rfs formula type AG
rfs formula formula --invariant=/tmp/535/inv_7_
rfs formula name HealthRecord-PT-09-ReachabilityFireability-08
rfs formula type EF
rfs formula formula --invariant=/tmp/535/inv_8_
rfs formula name HealthRecord-PT-09-ReachabilityFireability-09
rfs formula type EF
rfs formula formula --invariant=/tmp/535/inv_9_
rfs formula name HealthRecord-PT-09-ReachabilityFireability-10
rfs formula type AG
rfs formula formula --invariant=/tmp/535/inv_10_
rfs formula name HealthRecord-PT-09-ReachabilityFireability-11
rfs formula type EF
rfs formula formula --invariant=/tmp/535/inv_11_
rfs formula name HealthRecord-PT-09-ReachabilityFireability-12
rfs formula type AG
rfs formula formula --invariant=/tmp/535/inv_12_
rfs formula name HealthRecord-PT-09-ReachabilityFireability-13
rfs formula type EF
rfs formula formula --invariant=/tmp/535/inv_13_
rfs formula name HealthRecord-PT-09-ReachabilityFireability-14
rfs formula type EF
rfs formula formula --invariant=/tmp/535/inv_14_
rfs formula name HealthRecord-PT-09-ReachabilityFireability-15
rfs formula type EF
rfs formula formula --invariant=/tmp/535/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 157 places, 327 transitions and 859 arcs
pnml2lts-sym: Petri net HealthRecord-PT-09 analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 327->298 groups
pnml2lts-sym: Regrouping took 0.090 real 0.100 user 0.000 sys
pnml2lts-sym: state vector length is 157; there are 298 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/535/inv_15_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/535/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/535/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/535/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/535/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/535/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/535/inv_13_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/535/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/535/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/535/inv_7_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/535/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 2630703 group checks and 0 next state calls
pnml2lts-sym: reachability took 19.780 real 67.820 user 10.990 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.020 user 0.000 sys
pnml2lts-sym: state space has 829535052 states, 44583 nodes
pnml2lts-sym: group_next: 1548 nodes total
pnml2lts-sym: group_explored: 792 nodes, 3860 short vectors total
pnml2lts-sym: max token count: 1

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-09"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 ltsminxred"
echo " Input is HealthRecord-PT-09, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r201-smll-167840347600303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-09.tgz
mv HealthRecord-PT-09 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;