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.r393-oct2-167903716800239.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPt-PT-004B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716800239
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 9.1K Feb 25 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 17:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 17:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 17:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 17:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 17:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 67K Mar 5 18:23 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 ShieldIIPt-PT-004B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679434879189

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=ShieldIIPt-PT-004B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 21:41:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 21:41:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:41:21] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2023-03-21 21:41:21] [INFO ] Transformed 283 places.
[2023-03-21 21:41:21] [INFO ] Transformed 263 transitions.
[2023-03-21 21:41:21] [INFO ] Found NUPN structural information;
[2023-03-21 21:41:21] [INFO ] Parsed PT model containing 283 places and 263 transitions and 654 arcs in 261 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 16) seen :10
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :1
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :1
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 263 rows 283 cols
[2023-03-21 21:41:22] [INFO ] Computed 37 place invariants in 8 ms
[2023-03-21 21:41:23] [INFO ] After 429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 21:41:23] [INFO ] [Nat]Absence check using 37 positive place invariants in 23 ms returned sat
[2023-03-21 21:41:23] [INFO ] After 408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 21:41:24] [INFO ] Deduced a trap composed of 13 places in 367 ms of which 46 ms to minimize.
[2023-03-21 21:41:24] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 1 ms to minimize.
[2023-03-21 21:41:24] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2023-03-21 21:41:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 761 ms
[2023-03-21 21:41:24] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2023-03-21 21:41:25] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2023-03-21 21:41:25] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2023-03-21 21:41:25] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2023-03-21 21:41:25] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 14 ms to minimize.
[2023-03-21 21:41:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 437 ms
[2023-03-21 21:41:25] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 0 ms to minimize.
[2023-03-21 21:41:25] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 0 ms to minimize.
[2023-03-21 21:41:25] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2023-03-21 21:41:25] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2023-03-21 21:41:26] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2023-03-21 21:41:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 784 ms
[2023-03-21 21:41:26] [INFO ] After 2554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-21 21:41:26] [INFO ] After 3001ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 81 ms.
Support contains 73 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 263/263 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 283 transition count 244
Reduce places removed 19 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 36 rules applied. Total rules applied 55 place count 264 transition count 227
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 72 place count 247 transition count 227
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 72 place count 247 transition count 211
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 104 place count 231 transition count 211
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 117 place count 218 transition count 198
Iterating global reduction 3 with 13 rules applied. Total rules applied 130 place count 218 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 2 rules applied. Total rules applied 132 place count 218 transition count 196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 133 place count 217 transition count 196
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 133 place count 217 transition count 194
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 137 place count 215 transition count 194
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 215 place count 176 transition count 155
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 219 place count 174 transition count 155
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 222 place count 174 transition count 152
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 225 place count 171 transition count 152
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 227 place count 171 transition count 152
Applied a total of 227 rules in 68 ms. Remains 171 /283 variables (removed 112) and now considering 152/263 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 171/283 places, 152/263 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :1
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :1
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 152 rows 171 cols
[2023-03-21 21:41:26] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-21 21:41:26] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 21:41:26] [INFO ] [Nat]Absence check using 37 positive place invariants in 30 ms returned sat
[2023-03-21 21:41:27] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 21:41:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-21 21:41:27] [INFO ] After 50ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 21:41:27] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2023-03-21 21:41:27] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2023-03-21 21:41:27] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2023-03-21 21:41:27] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2023-03-21 21:41:27] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2023-03-21 21:41:27] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2023-03-21 21:41:27] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2023-03-21 21:41:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 598 ms
[2023-03-21 21:41:27] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 3 ms to minimize.
[2023-03-21 21:41:28] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2023-03-21 21:41:28] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 0 ms to minimize.
[2023-03-21 21:41:28] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2023-03-21 21:41:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 559 ms
[2023-03-21 21:41:28] [INFO ] After 1314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-21 21:41:28] [INFO ] After 1683ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 47 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 152/152 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 171 transition count 147
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 166 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 165 transition count 146
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 12 place count 165 transition count 137
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 30 place count 156 transition count 137
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 56 place count 143 transition count 124
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 143 transition count 120
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 64 place count 139 transition count 120
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 139 transition count 120
Applied a total of 66 rules in 22 ms. Remains 139 /171 variables (removed 32) and now considering 120/152 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 139/171 places, 120/152 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 324792 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 324792 steps, saw 235968 distinct states, run finished after 3004 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 120 rows 139 cols
[2023-03-21 21:41:31] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-21 21:41:31] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 21:41:31] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-21 21:41:31] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 21:41:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-21 21:41:32] [INFO ] After 95ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 21:41:32] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 6 ms to minimize.
[2023-03-21 21:41:32] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2023-03-21 21:41:32] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2023-03-21 21:41:32] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-03-21 21:41:32] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2023-03-21 21:41:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 395 ms
[2023-03-21 21:41:32] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2023-03-21 21:41:32] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2023-03-21 21:41:32] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2023-03-21 21:41:32] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2023-03-21 21:41:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 344 ms
[2023-03-21 21:41:32] [INFO ] After 889ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-21 21:41:32] [INFO ] After 1153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 47 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 120/120 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 139/139 places, 120/120 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 120/120 transitions.
Applied a total of 0 rules in 3 ms. Remains 139 /139 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2023-03-21 21:41:32] [INFO ] Invariant cache hit.
[2023-03-21 21:41:33] [INFO ] Implicit Places using invariants in 110 ms returned [125]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 138/139 places, 120/120 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 138 transition count 119
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 137 transition count 119
Applied a total of 2 rules in 8 ms. Remains 137 /138 variables (removed 1) and now considering 119/120 (removed 1) transitions.
// Phase 1: matrix 119 rows 137 cols
[2023-03-21 21:41:33] [INFO ] Computed 36 place invariants in 1 ms
[2023-03-21 21:41:33] [INFO ] Implicit Places using invariants in 141 ms returned [118]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 148 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 136/139 places, 119/120 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 118
Applied a total of 2 rules in 10 ms. Remains 135 /136 variables (removed 1) and now considering 118/119 (removed 1) transitions.
// Phase 1: matrix 118 rows 135 cols
[2023-03-21 21:41:33] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-21 21:41:33] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-21 21:41:33] [INFO ] Invariant cache hit.
[2023-03-21 21:41:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-21 21:41:33] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 135/139 places, 118/120 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 600 ms. Remains : 135/139 places, 118/120 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 372016 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 372016 steps, saw 269159 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 21:41:36] [INFO ] Invariant cache hit.
[2023-03-21 21:41:36] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 21:41:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-21 21:41:36] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 21:41:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-21 21:41:36] [INFO ] After 69ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 21:41:37] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2023-03-21 21:41:37] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2023-03-21 21:41:37] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2023-03-21 21:41:37] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 7 ms to minimize.
[2023-03-21 21:41:37] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2023-03-21 21:41:37] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2023-03-21 21:41:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 391 ms
[2023-03-21 21:41:37] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-21 21:41:37] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2023-03-21 21:41:37] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2023-03-21 21:41:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 217 ms
[2023-03-21 21:41:37] [INFO ] After 736ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-21 21:41:37] [INFO ] After 972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 47 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 118/118 transitions.
Applied a total of 0 rules in 4 ms. Remains 135 /135 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 135/135 places, 118/118 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 118/118 transitions.
Applied a total of 0 rules in 3 ms. Remains 135 /135 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2023-03-21 21:41:37] [INFO ] Invariant cache hit.
[2023-03-21 21:41:37] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-21 21:41:37] [INFO ] Invariant cache hit.
[2023-03-21 21:41:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-21 21:41:37] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-21 21:41:37] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 21:41:37] [INFO ] Invariant cache hit.
[2023-03-21 21:41:38] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 328 ms. Remains : 135/135 places, 118/118 transitions.
Graph (complete) has 289 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 134 transition count 118
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 134 transition count 117
Applied a total of 7 rules in 15 ms. Remains 134 /135 variables (removed 1) and now considering 117/118 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 117 rows 134 cols
[2023-03-21 21:41:38] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-21 21:41:38] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 21:41:38] [INFO ] [Nat]Absence check using 34 positive place invariants in 26 ms returned sat
[2023-03-21 21:41:38] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 21:41:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 21:41:38] [INFO ] After 57ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 21:41:38] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-21 21:41:38] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2023-03-21 21:41:39] [INFO ] Deduced a trap composed of 9 places in 597 ms of which 1 ms to minimize.
[2023-03-21 21:41:40] [INFO ] Deduced a trap composed of 7 places in 1080 ms of which 1 ms to minimize.
[2023-03-21 21:41:40] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 13 ms to minimize.
[2023-03-21 21:41:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1894 ms
[2023-03-21 21:41:40] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2023-03-21 21:41:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-21 21:41:40] [INFO ] After 2105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-21 21:41:40] [INFO ] After 2363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-21 21:41:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 15 ms.
[2023-03-21 21:41:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 135 places, 118 transitions and 375 arcs took 2 ms.
[2023-03-21 21:41:40] [INFO ] Flatten gal took : 46 ms
Total runtime 19178 ms.
There are residual formulas that ITS could not solve within timeout
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/683/inv_0_ --invariant=/tmp/683/inv_1_ --inv-par
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679434901670

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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 ShieldIIPt-PT-004B-ReachabilityFireability-06
rfs formula type EF
rfs formula formula --invariant=/tmp/683/inv_0_
rfs formula name ShieldIIPt-PT-004B-ReachabilityFireability-11
rfs formula type EF
rfs formula formula --invariant=/tmp/683/inv_1_
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 135 places, 118 transitions and 375 arcs
pnml2lts-sym: Petri net ShieldIIPt_PT_004B analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 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: 118->111 groups
pnml2lts-sym: Regrouping took 0.020 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 135; there are 111 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:
pnml2lts-sym: Invariant violation (/tmp/683/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 13158 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.080 real 0.300 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 1.0541353013894e+15 states, 2740 nodes
pnml2lts-sym: group_next: 877 nodes total
pnml2lts-sym: group_explored: 944 nodes, 744 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="ShieldIIPt-PT-004B"
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 ShieldIIPt-PT-004B, 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 r393-oct2-167903716800239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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