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.r457-smll-167912649000231.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 SmartHome-PT-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649000231
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.3K Feb 26 05:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 05:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 05:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 05:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 05:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K Feb 26 05:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 05:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 05:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 68K 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 SmartHome-PT-10-ReachabilityFireability-00
FORMULA_NAME SmartHome-PT-10-ReachabilityFireability-01
FORMULA_NAME SmartHome-PT-10-ReachabilityFireability-02
FORMULA_NAME SmartHome-PT-10-ReachabilityFireability-03
FORMULA_NAME SmartHome-PT-10-ReachabilityFireability-04
FORMULA_NAME SmartHome-PT-10-ReachabilityFireability-05
FORMULA_NAME SmartHome-PT-10-ReachabilityFireability-06
FORMULA_NAME SmartHome-PT-10-ReachabilityFireability-07
FORMULA_NAME SmartHome-PT-10-ReachabilityFireability-08
FORMULA_NAME SmartHome-PT-10-ReachabilityFireability-09
FORMULA_NAME SmartHome-PT-10-ReachabilityFireability-10
FORMULA_NAME SmartHome-PT-10-ReachabilityFireability-11
FORMULA_NAME SmartHome-PT-10-ReachabilityFireability-12
FORMULA_NAME SmartHome-PT-10-ReachabilityFireability-13
FORMULA_NAME SmartHome-PT-10-ReachabilityFireability-14
FORMULA_NAME SmartHome-PT-10-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679322507325

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=SmartHome-PT-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 14:28:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 14:28:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 14:28:30] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2023-03-20 14:28:30] [INFO ] Transformed 273 places.
[2023-03-20 14:28:30] [INFO ] Transformed 308 transitions.
[2023-03-20 14:28:30] [INFO ] Found NUPN structural information;
[2023-03-20 14:28:30] [INFO ] Parsed PT model containing 273 places and 308 transitions and 699 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 40 places in 5 ms
Reduce places removed 40 places and 45 transitions.
FORMULA SmartHome-PT-10-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 66 resets, run finished after 654 ms. (steps per millisecond=15 ) properties (out of 11) seen :5
FORMULA SmartHome-PT-10-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 263 rows 233 cols
[2023-03-20 14:28:31] [INFO ] Computed 12 place invariants in 12 ms
[2023-03-20 14:28:32] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-20 14:28:32] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 14:28:32] [INFO ] After 519ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-20 14:28:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-20 14:28:32] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 14:28:32] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2023-03-20 14:28:32] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 10 ms to minimize.
[2023-03-20 14:28:32] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 1 ms to minimize.
[2023-03-20 14:28:32] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 2 ms to minimize.
[2023-03-20 14:28:33] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2023-03-20 14:28:33] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2023-03-20 14:28:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 645 ms
[2023-03-20 14:28:33] [INFO ] After 901ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-20 14:28:33] [INFO ] After 1180ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
FORMULA SmartHome-PT-10-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SmartHome-PT-10-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SmartHome-PT-10-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SmartHome-PT-10-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 20 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 263/263 transitions.
Graph (trivial) has 186 edges and 233 vertex of which 53 / 233 are part of one of the 5 SCC in 4 ms
Free SCC test removed 48 places
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 185 transition count 143
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 69 rules applied. Total rules applied 126 place count 129 transition count 130
Reduce places removed 8 places and 0 transitions.
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 2 with 10 rules applied. Total rules applied 136 place count 121 transition count 128
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 3 with 9 rules applied. Total rules applied 145 place count 120 transition count 120
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 153 place count 112 transition count 120
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 153 place count 112 transition count 114
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 165 place count 106 transition count 114
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 188 place count 83 transition count 91
Iterating global reduction 5 with 23 rules applied. Total rules applied 211 place count 83 transition count 91
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 216 place count 83 transition count 86
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 218 place count 82 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 218 place count 82 transition count 84
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 220 place count 81 transition count 84
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 256 place count 63 transition count 66
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 155 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 5 rules applied. Total rules applied 261 place count 62 transition count 62
Free-agglomeration rule applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 268 place count 62 transition count 55
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 275 place count 55 transition count 55
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 276 place count 55 transition count 55
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 277 place count 55 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 278 place count 54 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 279 place count 53 transition count 53
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 281 place count 53 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 283 place count 51 transition count 51
Applied a total of 283 rules in 108 ms. Remains 51 /233 variables (removed 182) and now considering 51/263 (removed 212) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 51/233 places, 51/263 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) 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 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :1
FORMULA SmartHome-PT-10-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 51 cols
[2023-03-20 14:28:33] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-20 14:28:33] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-20 14:28:33] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 14:28:33] [INFO ] After 28ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 14:28:33] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 14:28:33] [INFO ] After 6ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:28:33] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:28:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-20 14:28:33] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 14:28:33] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 14:28:33] [INFO ] After 7ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 14:28:33] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-20 14:28:33] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 51/51 transitions.
Graph (trivial) has 26 edges and 51 vertex of which 16 / 51 are part of one of the 6 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 39 transition count 30
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 36 transition count 30
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 36 transition count 27
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 33 transition count 27
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 24 place count 28 transition count 23
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 28 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 27 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 26 place count 27 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 30 place count 25 transition count 20
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 25 transition count 19
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 5 rules applied. Total rules applied 36 place count 23 transition count 16
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 39 place count 20 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 39 place count 20 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 44 place count 17 transition count 14
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 6 with 2 rules applied. Total rules applied 46 place count 16 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 48 place count 14 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 49 place count 13 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 49 place count 13 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 51 place count 12 transition count 10
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 7 with 2 rules applied. Total rules applied 53 place count 11 transition count 9
Applied a total of 53 rules in 11 ms. Remains 11 /51 variables (removed 40) and now considering 9/51 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 11/51 places, 9/51 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
FORMULA SmartHome-PT-10-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 3675 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/476/inv_0_ --invariant=/tmp/476/inv_1_ --invariant=/tmp/476/inv_2_ --invariant=/tmp/476/inv_3_ --invariant=/tmp/476/inv_4_ --invariant=/tmp/476/inv_5_ --invariant=/tmp/476/inv_6_ --invariant=/tmp/476/inv_7_ --invariant=/tmp/476/inv_8_ --invariant=/tmp/476/inv_9_ --invariant=/tmp/476/inv_10_ --invariant=/tmp/476/inv_11_ --invariant=/tmp/476/inv_12_ --invariant=/tmp/476/inv_13_ --invariant=/tmp/476/inv_14_ --invariant=/tmp/476/inv_15_ --inv-par
FORMULA SmartHome-PT-10-ReachabilityFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-10-ReachabilityFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-10-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-10-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-10-ReachabilityFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-10-ReachabilityFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-10-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-10-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-10-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-10-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-10-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-10-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-10-ReachabilityFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-10-ReachabilityFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-10-ReachabilityFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-10-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679322520142

--------------------
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 SmartHome-PT-10-ReachabilityFireability-00
rfs formula type EF
rfs formula formula --invariant=/tmp/476/inv_0_
rfs formula name SmartHome-PT-10-ReachabilityFireability-01
rfs formula type EF
rfs formula formula --invariant=/tmp/476/inv_1_
rfs formula name SmartHome-PT-10-ReachabilityFireability-02
rfs formula type EF
rfs formula formula --invariant=/tmp/476/inv_2_
rfs formula name SmartHome-PT-10-ReachabilityFireability-03
rfs formula type EF
rfs formula formula --invariant=/tmp/476/inv_3_
rfs formula name SmartHome-PT-10-ReachabilityFireability-04
rfs formula type EF
rfs formula formula --invariant=/tmp/476/inv_4_
rfs formula name SmartHome-PT-10-ReachabilityFireability-05
rfs formula type EF
rfs formula formula --invariant=/tmp/476/inv_5_
rfs formula name SmartHome-PT-10-ReachabilityFireability-06
rfs formula type EF
rfs formula formula --invariant=/tmp/476/inv_6_
rfs formula name SmartHome-PT-10-ReachabilityFireability-07
rfs formula type EF
rfs formula formula --invariant=/tmp/476/inv_7_
rfs formula name SmartHome-PT-10-ReachabilityFireability-08
rfs formula type AG
rfs formula formula --invariant=/tmp/476/inv_8_
rfs formula name SmartHome-PT-10-ReachabilityFireability-09
rfs formula type EF
rfs formula formula --invariant=/tmp/476/inv_9_
rfs formula name SmartHome-PT-10-ReachabilityFireability-10
rfs formula type AG
rfs formula formula --invariant=/tmp/476/inv_10_
rfs formula name SmartHome-PT-10-ReachabilityFireability-11
rfs formula type AG
rfs formula formula --invariant=/tmp/476/inv_11_
rfs formula name SmartHome-PT-10-ReachabilityFireability-12
rfs formula type AG
rfs formula formula --invariant=/tmp/476/inv_12_
rfs formula name SmartHome-PT-10-ReachabilityFireability-13
rfs formula type EF
rfs formula formula --invariant=/tmp/476/inv_13_
rfs formula name SmartHome-PT-10-ReachabilityFireability-14
rfs formula type EF
rfs formula formula --invariant=/tmp/476/inv_14_
rfs formula name SmartHome-PT-10-ReachabilityFireability-15
rfs formula type EF
rfs formula formula --invariant=/tmp/476/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 273 places, 308 transitions and 699 arcs
pnml2lts-sym: Petri net SmartHome-PT-10 analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.010 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: 308->308 groups
pnml2lts-sym: Regrouping took 0.050 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 273; there are 308 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/476/inv_15_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/476/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/476/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/476/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/476/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/476/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/476/inv_7_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 418110 group checks and 0 next state calls
pnml2lts-sym: reachability took 4.870 real 19.290 user 0.100 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.030 real 0.130 user 0.000 sys
pnml2lts-sym: state space has 430089117268 states, 113212 nodes
pnml2lts-sym: group_next: 1173 nodes total
pnml2lts-sym: group_explored: 647 nodes, 763 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="SmartHome-PT-10"
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 SmartHome-PT-10, 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 r457-smll-167912649000231"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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