Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286026000959.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVt-PT-005B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286026000959
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.3K Apr 30 01:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 30 01:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 01:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 01:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 09:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 09:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 09:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 09:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 30 01:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 30 01:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 30 01:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 30 01:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 60K May 10 09:34 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 ShieldRVt-PT-005B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654282221314

Running Version 202205111006
[2022-06-03 18:50:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 18:50:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 18:50:22] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2022-06-03 18:50:22] [INFO ] Transformed 253 places.
[2022-06-03 18:50:22] [INFO ] Transformed 253 transitions.
[2022-06-03 18:50:22] [INFO ] Found NUPN structural information;
[2022-06-03 18:50:22] [INFO ] Parsed PT model containing 253 places and 253 transitions in 205 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 509 ms. (steps per millisecond=19 ) properties (out of 16) seen :10
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) 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 ShieldRVt-PT-005B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) 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 5) seen :1
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 253 rows 253 cols
[2022-06-03 18:50:23] [INFO ] Computed 21 place invariants in 19 ms
[2022-06-03 18:50:23] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-03 18:50:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2022-06-03 18:50:24] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-03 18:50:24] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 5 ms to minimize.
[2022-06-03 18:50:24] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2022-06-03 18:50:24] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2022-06-03 18:50:24] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2022-06-03 18:50:24] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2022-06-03 18:50:24] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2022-06-03 18:50:24] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 0 ms to minimize.
[2022-06-03 18:50:25] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 1 ms to minimize.
[2022-06-03 18:50:25] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 0 ms to minimize.
[2022-06-03 18:50:25] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 894 ms
[2022-06-03 18:50:25] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2022-06-03 18:50:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2022-06-03 18:50:25] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2022-06-03 18:50:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 59 ms
[2022-06-03 18:50:25] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 0 ms to minimize.
[2022-06-03 18:50:25] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2022-06-03 18:50:25] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2022-06-03 18:50:25] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2022-06-03 18:50:25] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2022-06-03 18:50:25] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2022-06-03 18:50:25] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2022-06-03 18:50:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 473 ms
[2022-06-03 18:50:25] [INFO ] After 1816ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 136 ms.
[2022-06-03 18:50:26] [INFO ] After 2088ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 572 ms.
Support contains 53 out of 253 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 253/253 places, 253/253 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 253 transition count 219
Reduce places removed 34 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 57 rules applied. Total rules applied 91 place count 219 transition count 196
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 114 place count 196 transition count 196
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 114 place count 196 transition count 178
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 150 place count 178 transition count 178
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 171 place count 157 transition count 157
Iterating global reduction 3 with 21 rules applied. Total rules applied 192 place count 157 transition count 157
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 192 place count 157 transition count 153
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 200 place count 153 transition count 153
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 258 place count 124 transition count 124
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 266 place count 120 transition count 125
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 267 place count 120 transition count 124
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 269 place count 120 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 271 place count 118 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 272 place count 117 transition count 121
Applied a total of 272 rules in 57 ms. Remains 117 /253 variables (removed 136) and now considering 121/253 (removed 132) transitions.
Finished structural reductions, in 1 iterations. Remains : 117/253 places, 121/253 transitions.
Incomplete random walk after 1000000 steps, including 194 resets, run finished after 9962 ms. (steps per millisecond=100 ) properties (out of 3) seen :1
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 34 resets, run finished after 1445 ms. (steps per millisecond=692 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 17 resets, run finished after 2363 ms. (steps per millisecond=423 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 121 rows 117 cols
[2022-06-03 18:50:40] [INFO ] Computed 21 place invariants in 5 ms
[2022-06-03 18:50:40] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 18:50:40] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2022-06-03 18:50:40] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 18:50:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-03 18:50:40] [INFO ] After 28ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 18:50:40] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2022-06-03 18:50:40] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2022-06-03 18:50:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2022-06-03 18:50:40] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2022-06-03 18:50:40] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2022-06-03 18:50:40] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2022-06-03 18:50:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 140 ms
[2022-06-03 18:50:40] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-06-03 18:50:40] [INFO ] After 418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 162 ms.
Support contains 25 out of 117 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 117/117 places, 121/121 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 117 transition count 111
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 22 place count 107 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 106 transition count 109
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 23 place count 106 transition count 103
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 35 place count 100 transition count 103
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 37 place count 98 transition count 101
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 98 transition count 101
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 69 place count 83 transition count 86
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 80 transition count 89
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 80 transition count 88
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 80 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 79 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 78 transition count 86
Applied a total of 79 rules in 26 ms. Remains 78 /117 variables (removed 39) and now considering 86/121 (removed 35) transitions.
Finished structural reductions, in 1 iterations. Remains : 78/117 places, 86/121 transitions.
Incomplete random walk after 1000000 steps, including 308 resets, run finished after 10009 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 48 resets, run finished after 1605 ms. (steps per millisecond=623 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 61 resets, run finished after 2329 ms. (steps per millisecond=429 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 15593475 steps, run timeout after 39001 ms. (steps per millisecond=399 ) properties seen :{}
Probabilistic random walk after 15593475 steps, saw 2836858 distinct states, run finished after 39004 ms. (steps per millisecond=399 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 86 rows 78 cols
[2022-06-03 18:51:34] [INFO ] Computed 21 place invariants in 1 ms
[2022-06-03 18:51:34] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 18:51:34] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2022-06-03 18:51:34] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 18:51:34] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-06-03 18:51:34] [INFO ] After 26ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 18:51:34] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-06-03 18:51:34] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2022-06-03 18:51:34] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2022-06-03 18:51:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 130 ms
[2022-06-03 18:51:34] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2022-06-03 18:51:34] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2022-06-03 18:51:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2022-06-03 18:51:34] [INFO ] After 257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-06-03 18:51:34] [INFO ] After 381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 86 ms.
Support contains 7 out of 78 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 78/78 places, 86/86 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 78 transition count 82
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 74 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 72 transition count 80
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 12 place count 72 transition count 75
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 22 place count 67 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 66 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 66 transition count 74
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 44 place count 56 transition count 64
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 53 transition count 67
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 53 transition count 66
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 53 transition count 66
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 50 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 49 transition count 63
Applied a total of 56 rules in 25 ms. Remains 49 /78 variables (removed 29) and now considering 63/86 (removed 23) transitions.
Finished structural reductions, in 1 iterations. Remains : 49/78 places, 63/86 transitions.
Incomplete random walk after 1000000 steps, including 516 resets, run finished after 2002 ms. (steps per millisecond=499 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 76 resets, run finished after 692 ms. (steps per millisecond=1445 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4963439 steps, run timeout after 6001 ms. (steps per millisecond=827 ) properties seen :{}
Probabilistic random walk after 4963439 steps, saw 1384847 distinct states, run finished after 6001 ms. (steps per millisecond=827 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 63 rows 49 cols
[2022-06-03 18:51:43] [INFO ] Computed 20 place invariants in 2 ms
[2022-06-03 18:51:43] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:51:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2022-06-03 18:51:43] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:51:43] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-06-03 18:51:43] [INFO ] After 9ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 18:51:43] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2022-06-03 18:51:43] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2022-06-03 18:51:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2022-06-03 18:51:43] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-03 18:51:43] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 7 out of 49 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 49/49 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 49/49 places, 63/63 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 49/49 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 49 cols
[2022-06-03 18:51:43] [INFO ] Computed 20 place invariants in 1 ms
[2022-06-03 18:51:43] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 63 rows 49 cols
[2022-06-03 18:51:43] [INFO ] Computed 20 place invariants in 1 ms
[2022-06-03 18:51:43] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-06-03 18:51:43] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2022-06-03 18:51:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 49 cols
[2022-06-03 18:51:43] [INFO ] Computed 20 place invariants in 1 ms
[2022-06-03 18:51:43] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/49 places, 63/63 transitions.
Incomplete random walk after 1000000 steps, including 518 resets, run finished after 2031 ms. (steps per millisecond=492 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 63 resets, run finished after 694 ms. (steps per millisecond=1440 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5142195 steps, run timeout after 6001 ms. (steps per millisecond=856 ) properties seen :{}
Probabilistic random walk after 5142195 steps, saw 1458614 distinct states, run finished after 6001 ms. (steps per millisecond=856 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 63 rows 49 cols
[2022-06-03 18:51:52] [INFO ] Computed 20 place invariants in 1 ms
[2022-06-03 18:51:52] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:51:52] [INFO ] [Nat]Absence check using 20 positive place invariants in 2 ms returned sat
[2022-06-03 18:51:52] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:51:52] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-06-03 18:51:52] [INFO ] After 15ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 18:51:52] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 10 ms to minimize.
[2022-06-03 18:51:52] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2022-06-03 18:51:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2022-06-03 18:51:52] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-03 18:51:52] [INFO ] After 159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 7 out of 49 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 49/49 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 49/49 places, 63/63 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 49/49 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 49 cols
[2022-06-03 18:51:52] [INFO ] Computed 20 place invariants in 1 ms
[2022-06-03 18:51:52] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 63 rows 49 cols
[2022-06-03 18:51:52] [INFO ] Computed 20 place invariants in 2 ms
[2022-06-03 18:51:52] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-06-03 18:51:52] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2022-06-03 18:51:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 49 cols
[2022-06-03 18:51:52] [INFO ] Computed 20 place invariants in 1 ms
[2022-06-03 18:51:52] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/49 places, 63/63 transitions.
Graph (trivial) has 14 edges and 49 vertex of which 4 / 49 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 149 edges and 47 vertex of which 45 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 11 edges and 43 vertex of which 4 / 43 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 41 transition count 54
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 10 edges and 39 vertex of which 4 / 39 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 19 place count 37 transition count 46
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 7 edges and 36 vertex of which 2 / 36 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 25 place count 35 transition count 42
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 28 place count 35 transition count 39
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 31 place count 35 transition count 36
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 33 place count 35 transition count 36
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 34 place count 35 transition count 35
Applied a total of 34 rules in 12 ms. Remains 35 /49 variables (removed 14) and now considering 35/63 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 35 cols
[2022-06-03 18:51:52] [INFO ] Computed 14 place invariants in 0 ms
[2022-06-03 18:51:52] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:51:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-06-03 18:51:52] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:51:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-03 18:51:52] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 18:51:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-06-03 18:51:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-06-03 18:51:52] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-03 18:51:52] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 18:51:53] [INFO ] Flatten gal took : 32 ms
[2022-06-03 18:51:53] [INFO ] Flatten gal took : 7 ms
[2022-06-03 18:51:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1265043380947734675.gal : 7 ms
[2022-06-03 18:51:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7018070166089227916.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1265043380947734675.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7018070166089227916.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality7018070166089227916.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 34
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :34 after 77
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :77 after 1177
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1177 after 3621
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,70661,0.049022,4096,2,126,11,2159,7,0,184,2220,0
Total reachable state count : 70661

Verifying 1 reachability properties.
Invariant property ShieldRVt-PT-005B-ReachabilityFireability-01 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-005B-ReachabilityFireability-01,0,0.049865,4360,1,0,11,2159,7,0,192,2220,0
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-01 TRUE TECHNIQUES OVER_APPROXIMATION
All properties solved without resorting to model-checking.
Total runtime 90875 ms.

BK_STOP 1654282313569

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldRVt-PT-005B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-005B, 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 r222-tall-165286026000959"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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