About the Execution of Marcie+red for SmartHome-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7159.199 | 111430.00 | 119568.00 | 2961.00 | FFFTFFTTTTTFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r458-smll-167912650000231.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 marciexred
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 r458-smll-167912650000231
=====================================================================
--------------------
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 1679312259765
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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 11:37:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 11:37:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:37:44] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2023-03-20 11:37:44] [INFO ] Transformed 273 places.
[2023-03-20 11:37:44] [INFO ] Transformed 308 transitions.
[2023-03-20 11:37:44] [INFO ] Found NUPN structural information;
[2023-03-20 11:37:44] [INFO ] Parsed PT model containing 273 places and 308 transitions and 699 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 40 places in 6 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 64 resets, run finished after 855 ms. (steps per millisecond=11 ) 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 13 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 263 rows 233 cols
[2023-03-20 11:37:45] [INFO ] Computed 12 place invariants in 14 ms
[2023-03-20 11:37:46] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2023-03-20 11:37:46] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 11:37:46] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-20 11:37:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-20 11:37:46] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:37:46] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2023-03-20 11:37:46] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 19 ms to minimize.
[2023-03-20 11:37:47] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 1 ms to minimize.
[2023-03-20 11:37:47] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2023-03-20 11:37:47] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2023-03-20 11:37:47] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2023-03-20 11:37:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 698 ms
[2023-03-20 11:37:47] [INFO ] After 1100ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-20 11:37:47] [INFO ] After 1426ms 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 22 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 17 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 2 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 1 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.2 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 144 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 144 ms. Remains : 51/233 places, 51/263 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :1
FORMULA SmartHome-PT-10-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 51 cols
[2023-03-20 11:37:47] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-20 11:37:47] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-20 11:37:47] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:37:47] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 11:37:47] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 11:37:47] [INFO ] After 8ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:37:47] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:37:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-20 11:37:47] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:37:47] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 11:37:48] [INFO ] After 8ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 11:37:48] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-20 11:37:48] [INFO ] After 118ms 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 1 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 17 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 18 ms. Remains : 11/51 places, 9/51 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
FORMULA SmartHome-PT-10-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4280 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: SmartHome_PT_10
(NrP: 273 NrTr: 308 NrArc: 699)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.011sec
net check time: 0m 0.000sec
init dd package: 0m 3.635sec
RS generation: 0m12.459sec
-> reachability set: #nodes 57240 (5.7e+04) #states 430,089,117,268 (11)
starting MCC model checker
--------------------------
checking: EF [IS_FIREABLE [t97]]
normalized: E [true U IS_FIREABLE [t97]]
-> the formula is FALSE
FORMULA SmartHome-PT-10-ReachabilityFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.026sec
checking: EF [IS_FIREABLE [t255]]
normalized: E [true U IS_FIREABLE [t255]]
-> the formula is TRUE
FORMULA SmartHome-PT-10-ReachabilityFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 9.290sec
checking: AG [~ [IS_FIREABLE [t128]]]
normalized: ~ [E [true U IS_FIREABLE [t128]]]
-> the formula is FALSE
FORMULA SmartHome-PT-10-ReachabilityFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.319sec
checking: EF [IS_FIREABLE [t244]]
normalized: E [true U IS_FIREABLE [t244]]
-> the formula is TRUE
FORMULA SmartHome-PT-10-ReachabilityFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.791sec
checking: AG [[~ [IS_FIREABLE [t175]] | IS_FIREABLE [t72]]]
normalized: ~ [E [true U ~ [[IS_FIREABLE [t72] | ~ [IS_FIREABLE [t175]]]]]]
-> the formula is TRUE
FORMULA SmartHome-PT-10-ReachabilityFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.099sec
checking: AG [~ [[~ [IS_FIREABLE [t125]] & IS_FIREABLE [t208]]]]
normalized: ~ [E [true U [IS_FIREABLE [t208] & ~ [IS_FIREABLE [t125]]]]]
-> the formula is FALSE
FORMULA SmartHome-PT-10-ReachabilityFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m13.644sec
checking: EF [~ [[[[[IS_FIREABLE [t249] | [~ [[IS_FIREABLE [t114] | IS_FIREABLE [t97]]] | IS_FIREABLE [t124]]] | [~ [[[IS_FIREABLE [t190] | IS_FIREABLE [t140]] & ~ [IS_FIREABLE [t55]]]] | IS_FIREABLE [t34]]] | IS_FIREABLE [t166]] | IS_FIREABLE [t129]]]]
normalized: E [true U ~ [[IS_FIREABLE [t129] | [IS_FIREABLE [t166] | [[IS_FIREABLE [t34] | ~ [[~ [IS_FIREABLE [t55]] & [IS_FIREABLE [t190] | IS_FIREABLE [t140]]]]] | [IS_FIREABLE [t249] | [IS_FIREABLE [t124] | ~ [[IS_FIREABLE [t114] | IS_FIREABLE [t97]]]]]]]]]]
-> the formula is FALSE
FORMULA SmartHome-PT-10-ReachabilityFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.137sec
checking: EF [[~ [[[[[[[IS_FIREABLE [t217] | IS_FIREABLE [t235]] & [IS_FIREABLE [t165] & IS_FIREABLE [t240]]] | IS_FIREABLE [t90]] & [~ [[IS_FIREABLE [t281] | IS_FIREABLE [t104]]] & [[IS_FIREABLE [t210] | IS_FIREABLE [t64]] & IS_FIREABLE [t210]]]] | ~ [IS_FIREABLE [t46]]] | [~ [[IS_FIREABLE [t106] & ~ [[IS_FIREABLE [t27] & IS_FIREABLE [t9]]]]] | ~ [IS_FIREABLE [t174]]]]] & IS_FIREABLE [t209]]]
normalized: E [true U [IS_FIREABLE [t209] & ~ [[[~ [IS_FIREABLE [t174]] | ~ [[IS_FIREABLE [t106] & ~ [[IS_FIREABLE [t27] & IS_FIREABLE [t9]]]]]] | [~ [IS_FIREABLE [t46]] | [[[IS_FIREABLE [t210] & [IS_FIREABLE [t210] | IS_FIREABLE [t64]]] & ~ [[IS_FIREABLE [t281] | IS_FIREABLE [t104]]]] & [IS_FIREABLE [t90] | [[IS_FIREABLE [t165] & IS_FIREABLE [t240]] & [IS_FIREABLE [t217] | IS_FIREABLE [t235]]]]]]]]]]
-> the formula is FALSE
FORMULA SmartHome-PT-10-ReachabilityFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.474sec
checking: EF [[[[[[[IS_FIREABLE [t66] & IS_FIREABLE [t56]] & ~ [[~ [[IS_FIREABLE [t21] & IS_FIREABLE [t244]]] & IS_FIREABLE [t240]]]] & [IS_FIREABLE [t108] & [~ [[~ [IS_FIREABLE [t81]] | [IS_FIREABLE [t106] & IS_FIREABLE [t124]]]] | ~ [[IS_FIREABLE [t181] | IS_FIREABLE [t140]]]]]] | ~ [[[~ [[IS_FIREABLE [t149] & ~ [IS_FIREABLE [t7]]]] | IS_FIREABLE [t114]] & ~ [IS_FIREABLE [t92]]]]] | IS_FIREABLE [t159]] & [IS_FIREABLE [t255] & IS_FIREABLE [t171]]]]
normalized: E [true U [[IS_FIREABLE [t255] & IS_FIREABLE [t171]] & [IS_FIREABLE [t159] | [~ [[~ [IS_FIREABLE [t92]] & [IS_FIREABLE [t114] | ~ [[IS_FIREABLE [t149] & ~ [IS_FIREABLE [t7]]]]]]] | [[IS_FIREABLE [t108] & [~ [[IS_FIREABLE [t181] | IS_FIREABLE [t140]]] | ~ [[[IS_FIREABLE [t106] & IS_FIREABLE [t124]] | ~ [IS_FIREABLE [t81]]]]]] & [~ [[IS_FIREABLE [t240] & ~ [[IS_FIREABLE [t21] & IS_FIREABLE [t244]]]]] & [IS_FIREABLE [t66] & IS_FIREABLE [t56]]]]]]]]
-> the formula is FALSE
FORMULA SmartHome-PT-10-ReachabilityFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.533sec
checking: EF [[[IS_FIREABLE [t138] | [[~ [[[[[IS_FIREABLE [t211] & IS_FIREABLE [t279]] | [IS_FIREABLE [t41] & IS_FIREABLE [t12]]] & [[IS_FIREABLE [t137] & IS_FIREABLE [t112]] | [IS_FIREABLE [t210] & IS_FIREABLE [t137]]]] | [IS_FIREABLE [t122] | ~ [IS_FIREABLE [t149]]]]] | IS_FIREABLE [t105]] | ~ [[~ [[[[IS_FIREABLE [t162] & IS_FIREABLE [t107]] & ~ [IS_FIREABLE [t70]]] | IS_FIREABLE [t29]]] & IS_FIREABLE [t0]]]]] & IS_FIREABLE [t226]]]
normalized: E [true U [IS_FIREABLE [t226] & [IS_FIREABLE [t138] | [~ [[IS_FIREABLE [t0] & ~ [[IS_FIREABLE [t29] | [~ [IS_FIREABLE [t70]] & [IS_FIREABLE [t162] & IS_FIREABLE [t107]]]]]]] | [IS_FIREABLE [t105] | ~ [[[IS_FIREABLE [t122] | ~ [IS_FIREABLE [t149]]] | [[[IS_FIREABLE [t210] & IS_FIREABLE [t137]] | [IS_FIREABLE [t137] & IS_FIREABLE [t112]]] & [[IS_FIREABLE [t41] & IS_FIREABLE [t12]] | [IS_FIREABLE [t211] & IS_FIREABLE [t279]]]]]]]]]]]
-> the formula is TRUE
FORMULA SmartHome-PT-10-ReachabilityFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m15.701sec
checking: AG [[~ [[IS_FIREABLE [t282] & [~ [[~ [[IS_FIREABLE [t145] & [IS_FIREABLE [t7] & IS_FIREABLE [t184]]]] | IS_FIREABLE [t56]]] | IS_FIREABLE [t256]]]] | ~ [[[[IS_FIREABLE [t215] | [~ [[IS_FIREABLE [t180] & IS_FIREABLE [t69]]] | [~ [IS_FIREABLE [t167]] | IS_FIREABLE [t143]]]] | IS_FIREABLE [t149]] & [[IS_FIREABLE [t35] | [[~ [IS_FIREABLE [t171]] | [IS_FIREABLE [t169] & IS_FIREABLE [t137]]] | ~ [[IS_FIREABLE [t11] & IS_FIREABLE [t193]]]]] & [IS_FIREABLE [t167] & ~ [IS_FIREABLE [t151]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[[[IS_FIREABLE [t167] & ~ [IS_FIREABLE [t151]]] & [IS_FIREABLE [t35] | [~ [[IS_FIREABLE [t11] & IS_FIREABLE [t193]]] | [[IS_FIREABLE [t169] & IS_FIREABLE [t137]] | ~ [IS_FIREABLE [t171]]]]]] & [IS_FIREABLE [t149] | [IS_FIREABLE [t215] | [[IS_FIREABLE [t143] | ~ [IS_FIREABLE [t167]]] | ~ [[IS_FIREABLE [t180] & IS_FIREABLE [t69]]]]]]]] | ~ [[IS_FIREABLE [t282] & [IS_FIREABLE [t256] | ~ [[IS_FIREABLE [t56] | ~ [[IS_FIREABLE [t145] & [IS_FIREABLE [t7] & IS_FIREABLE [t184]]]]]]]]]]]]]
-> the formula is TRUE
FORMULA SmartHome-PT-10-ReachabilityFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.272sec
checking: EF [~ [[[[[IS_FIREABLE [t52] | IS_FIREABLE [t30]] & ~ [[IS_FIREABLE [t84] & ~ [[[IS_FIREABLE [t261] | IS_FIREABLE [t21]] & IS_FIREABLE [t237]]]]]] | ~ [[[IS_FIREABLE [t236] & [~ [IS_FIREABLE [t141]] | [[IS_FIREABLE [t117] & IS_FIREABLE [t87]] | IS_FIREABLE [t253]]]] & [IS_FIREABLE [t121] & [[[IS_FIREABLE [t245] & IS_FIREABLE [t39]] | [IS_FIREABLE [t130] & IS_FIREABLE [t41]]] | [IS_FIREABLE [t158] & [IS_FIREABLE [t242] & IS_FIREABLE [t228]]]]]]]] | ~ [[~ [IS_FIREABLE [t272]] | ~ [IS_FIREABLE [t104]]]]]]]
normalized: E [true U ~ [[~ [[~ [IS_FIREABLE [t104]] | ~ [IS_FIREABLE [t272]]]] | [~ [[[IS_FIREABLE [t121] & [[IS_FIREABLE [t158] & [IS_FIREABLE [t242] & IS_FIREABLE [t228]]] | [[IS_FIREABLE [t130] & IS_FIREABLE [t41]] | [IS_FIREABLE [t245] & IS_FIREABLE [t39]]]]] & [IS_FIREABLE [t236] & [[IS_FIREABLE [t253] | [IS_FIREABLE [t117] & IS_FIREABLE [t87]]] | ~ [IS_FIREABLE [t141]]]]]] | [~ [[IS_FIREABLE [t84] & ~ [[IS_FIREABLE [t237] & [IS_FIREABLE [t261] | IS_FIREABLE [t21]]]]]] & [IS_FIREABLE [t52] | IS_FIREABLE [t30]]]]]]]
-> the formula is FALSE
FORMULA SmartHome-PT-10-ReachabilityFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.279sec
checking: EF [[IS_FIREABLE [t64] & [~ [[[[IS_FIREABLE [t140] & IS_FIREABLE [t298]] | [[IS_FIREABLE [t27] | IS_FIREABLE [t51]] | [IS_FIREABLE [t14] | IS_FIREABLE [t180]]]] & [IS_FIREABLE [t217] | IS_FIREABLE [t124]]]] | ~ [[[[IS_FIREABLE [t128] & [~ [IS_FIREABLE [t84]] | [IS_FIREABLE [t137] | [IS_FIREABLE [t102] & IS_FIREABLE [t102]]]]] & IS_FIREABLE [t177]] | [[[[~ [IS_FIREABLE [t30]] & [IS_FIREABLE [t178] | IS_FIREABLE [t157]]] | [[IS_FIREABLE [t202] | IS_FIREABLE [t81]] & IS_FIREABLE [t98]]] | IS_FIREABLE [t40]] & ~ [[IS_FIREABLE [t281] | IS_FIREABLE [t241]]]]]]]]]
normalized: E [true U [IS_FIREABLE [t64] & [~ [[[~ [[IS_FIREABLE [t281] | IS_FIREABLE [t241]]] & [IS_FIREABLE [t40] | [[IS_FIREABLE [t98] & [IS_FIREABLE [t202] | IS_FIREABLE [t81]]] | [[IS_FIREABLE [t178] | IS_FIREABLE [t157]] & ~ [IS_FIREABLE [t30]]]]]] | [IS_FIREABLE [t177] & [IS_FIREABLE [t128] & [[IS_FIREABLE [t137] | [IS_FIREABLE [t102] & IS_FIREABLE [t102]]] | ~ [IS_FIREABLE [t84]]]]]]] | ~ [[[IS_FIREABLE [t217] | IS_FIREABLE [t124]] & [[[IS_FIREABLE [t14] | IS_FIREABLE [t180]] | [IS_FIREABLE [t27] | IS_FIREABLE [t51]]] | [IS_FIREABLE [t140] & IS_FIREABLE [t298]]]]]]]]
-> the formula is TRUE
FORMULA SmartHome-PT-10-ReachabilityFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m27.442sec
checking: EF [[[[[[~ [[[[IS_FIREABLE [t292] | IS_FIREABLE [t249]] | IS_FIREABLE [t220]] | ~ [IS_FIREABLE [t19]]]] & ~ [[[~ [IS_FIREABLE [t208]] & [IS_FIREABLE [t135] | IS_FIREABLE [t301]]] | [[IS_FIREABLE [t138] & IS_FIREABLE [t188]] & [IS_FIREABLE [t14] & IS_FIREABLE [t221]]]]]] | ~ [[~ [[~ [IS_FIREABLE [t293]] & IS_FIREABLE [t198]]] | IS_FIREABLE [t148]]]] | [[[[~ [[IS_FIREABLE [t238] & IS_FIREABLE [t97]]] & [[IS_FIREABLE [t264] | IS_FIREABLE [t73]] | ~ [IS_FIREABLE [t268]]]] & [~ [IS_FIREABLE [t13]] & IS_FIREABLE [t283]]] | [~ [[[IS_FIREABLE [t208] & IS_FIREABLE [t254]] & IS_FIREABLE [t177]]] & ~ [IS_FIREABLE [t219]]]] & IS_FIREABLE [t60]]] & IS_FIREABLE [t190]] | IS_FIREABLE [t179]]]
normalized: E [true U [IS_FIREABLE [t179] | [IS_FIREABLE [t190] & [[IS_FIREABLE [t60] & [[~ [IS_FIREABLE [t219]] & ~ [[IS_FIREABLE [t177] & [IS_FIREABLE [t208] & IS_FIREABLE [t254]]]]] | [[IS_FIREABLE [t283] & ~ [IS_FIREABLE [t13]]] & [[~ [IS_FIREABLE [t268]] | [IS_FIREABLE [t264] | IS_FIREABLE [t73]]] & ~ [[IS_FIREABLE [t238] & IS_FIREABLE [t97]]]]]]] | [~ [[IS_FIREABLE [t148] | ~ [[IS_FIREABLE [t198] & ~ [IS_FIREABLE [t293]]]]]] | [~ [[[[IS_FIREABLE [t14] & IS_FIREABLE [t221]] & [IS_FIREABLE [t138] & IS_FIREABLE [t188]]] | [[IS_FIREABLE [t135] | IS_FIREABLE [t301]] & ~ [IS_FIREABLE [t208]]]]] & ~ [[~ [IS_FIREABLE [t19]] | [IS_FIREABLE [t220] | [IS_FIREABLE [t292] | IS_FIREABLE [t249]]]]]]]]]]]
-> the formula is TRUE
FORMULA SmartHome-PT-10-ReachabilityFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.454sec
checking: EF [[IS_FIREABLE [t157] & [[[[[~ [[~ [IS_FIREABLE [t267]] | [IS_FIREABLE [t92] | IS_FIREABLE [t301]]]] & ~ [IS_FIREABLE [t33]]] & ~ [[IS_FIREABLE [t73] & ~ [IS_FIREABLE [t68]]]]] & ~ [IS_FIREABLE [t148]]] & [~ [[[~ [[IS_FIREABLE [t297] & IS_FIREABLE [t286]]] | [~ [IS_FIREABLE [t297]] & IS_FIREABLE [t269]]] | [[IS_FIREABLE [t101] | IS_FIREABLE [t267]] & ~ [[IS_FIREABLE [t247] & IS_FIREABLE [t53]]]]]] & [IS_FIREABLE [t176] & ~ [[[IS_FIREABLE [t281] & IS_FIREABLE [t8]] | ~ [IS_FIREABLE [t140]]]]]]] & ~ [[[[[[IS_FIREABLE [t99] & IS_FIREABLE [t214]] & IS_FIREABLE [t68]] & [[IS_FIREABLE [t241] & IS_FIREABLE [t270]] | [IS_FIREABLE [t102] & IS_FIREABLE [t247]]]] | IS_FIREABLE [t46]] & [[[IS_FIREABLE [t219] | IS_FIREABLE [t8]] | ~ [[IS_FIREABLE [t86] | IS_FIREABLE [t208]]]] | ~ [IS_FIREABLE [t10]]]]]]]]
normalized: E [true U [IS_FIREABLE [t157] & [~ [[[~ [IS_FIREABLE [t10]] | [~ [[IS_FIREABLE [t86] | IS_FIREABLE [t208]]] | [IS_FIREABLE [t219] | IS_FIREABLE [t8]]]] & [IS_FIREABLE [t46] | [[[IS_FIREABLE [t102] & IS_FIREABLE [t247]] | [IS_FIREABLE [t241] & IS_FIREABLE [t270]]] & [IS_FIREABLE [t68] & [IS_FIREABLE [t99] & IS_FIREABLE [t214]]]]]]] & [[[IS_FIREABLE [t176] & ~ [[~ [IS_FIREABLE [t140]] | [IS_FIREABLE [t281] & IS_FIREABLE [t8]]]]] & ~ [[[~ [[IS_FIREABLE [t247] & IS_FIREABLE [t53]]] & [IS_FIREABLE [t101] | IS_FIREABLE [t267]]] | [[IS_FIREABLE [t269] & ~ [IS_FIREABLE [t297]]] | ~ [[IS_FIREABLE [t297] & IS_FIREABLE [t286]]]]]]] & [~ [IS_FIREABLE [t148]] & [~ [[IS_FIREABLE [t73] & ~ [IS_FIREABLE [t68]]]] & [~ [IS_FIREABLE [t33]] & ~ [[[IS_FIREABLE [t92] | IS_FIREABLE [t301]] | ~ [IS_FIREABLE [t267]]]]]]]]]]]
-> the formula is FALSE
FORMULA SmartHome-PT-10-ReachabilityFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.632sec
checking: EF [[[[[[[IS_FIREABLE [t167] & [[[IS_FIREABLE [t258] & IS_FIREABLE [t124]] & [IS_FIREABLE [t106] & IS_FIREABLE [t25]]] & IS_FIREABLE [t67]]] & ~ [IS_FIREABLE [t273]]] & IS_FIREABLE [t227]] | ~ [[[~ [[[IS_FIREABLE [t100] | IS_FIREABLE [t6]] & IS_FIREABLE [t31]]] & ~ [[~ [IS_FIREABLE [t92]] | [IS_FIREABLE [t157] | IS_FIREABLE [t2]]]]] | ~ [[[IS_FIREABLE [t93] & IS_FIREABLE [t215]] | ~ [IS_FIREABLE [t297]]]]]]] | IS_FIREABLE [t158]] & [[IS_FIREABLE [t185] & [[[[~ [[IS_FIREABLE [t186] & IS_FIREABLE [t248]]] & ~ [IS_FIREABLE [t111]]] | [[[IS_FIREABLE [t157] & IS_FIREABLE [t17]] & [IS_FIREABLE [t300] | IS_FIREABLE [t303]]] | ~ [IS_FIREABLE [t24]]]] | [[IS_FIREABLE [t135] | IS_FIREABLE [t29]] & [~ [IS_FIREABLE [t303]] & [[IS_FIREABLE [t251] | IS_FIREABLE [t221]] | [IS_FIREABLE [t235] & IS_FIREABLE [t252]]]]]] & [IS_FIREABLE [t86] & IS_FIREABLE [t89]]]] | [[IS_FIREABLE [t49] & ~ [[~ [IS_FIREABLE [t39]] & [~ [IS_FIREABLE [t133]] & [[IS_FIREABLE [t69] & IS_FIREABLE [t237]] & IS_FIREABLE [t9]]]]]] & IS_FIREABLE [t287]]]]]
normalized: E [true U [[[IS_FIREABLE [t287] & [IS_FIREABLE [t49] & ~ [[[[IS_FIREABLE [t9] & [IS_FIREABLE [t69] & IS_FIREABLE [t237]]] & ~ [IS_FIREABLE [t133]]] & ~ [IS_FIREABLE [t39]]]]]] | [IS_FIREABLE [t185] & [[IS_FIREABLE [t86] & IS_FIREABLE [t89]] & [[[[[IS_FIREABLE [t235] & IS_FIREABLE [t252]] | [IS_FIREABLE [t251] | IS_FIREABLE [t221]]] & ~ [IS_FIREABLE [t303]]] & [IS_FIREABLE [t135] | IS_FIREABLE [t29]]] | [[~ [IS_FIREABLE [t24]] | [[IS_FIREABLE [t300] | IS_FIREABLE [t303]] & [IS_FIREABLE [t157] & IS_FIREABLE [t17]]]] | [~ [IS_FIREABLE [t111]] & ~ [[IS_FIREABLE [t186] & IS_FIREABLE [t248]]]]]]]]] & [IS_FIREABLE [t158] | [~ [[~ [[~ [IS_FIREABLE [t297]] | [IS_FIREABLE [t93] & IS_FIREABLE [t215]]]] | [~ [[[IS_FIREABLE [t157] | IS_FIREABLE [t2]] | ~ [IS_FIREABLE [t92]]]] & ~ [[IS_FIREABLE [t31] & [IS_FIREABLE [t100] | IS_FIREABLE [t6]]]]]]] | [IS_FIREABLE [t227] & [~ [IS_FIREABLE [t273]] & [IS_FIREABLE [t167] & [IS_FIREABLE [t67] & [[IS_FIREABLE [t106] & IS_FIREABLE [t25]] & [IS_FIREABLE [t258] & IS_FIREABLE [t124]]]]]]]]]]]
-> the formula is FALSE
FORMULA SmartHome-PT-10-ReachabilityFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.606sec
totally nodes used: 24054336 (2.4e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 73414644 163527581 236942225
used/not used/entry size/cache size: 62592137 4516727 16 1024MB
basic ops cache: hits/miss/sum: 14214669 31042218 45256887
used/not used/entry size/cache size: 15955230 821986 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 24690 57247 81937
used/not used/entry size/cache size: 57105 8331503 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 48050353
1 14962320
2 3335355
3 640260
4 104471
5 14201
6 1703
7 190
8 10
9 1
>= 10 0
Total processing time: 1m41.315sec
BK_STOP 1679312371195
--------------------
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
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p162
p85
p26
p228
p169
p99
p167
p226
p166
p196
p101
p147
p18
p19
p20
p21
p22
p23
p24
p25
p27
p28
p86
p164
p98
p100
p87
p149
p159
p160
p104
p103
p227
p102
p168
p163
p97
p148
p161
p165
The net has transition(s) that can never fire:
t93
t94
t95
t96
t97
t98
t99
t100
t101
t102
t103
t61
t104
t105
t116
t117
t118
t24
t25
t26
t259
t260
t261
t262
t263
t264
t265
t266
t267
t268
t169
t170
t171
t172
t173
t174
t175
t176
t177
t188
t189
t190
t256
t257
t258
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:40653 (131), effective:3522 (11)
initing FirstDep: 0m 0.000sec
iterations count:2723 (8), effective:199 (0)
iterations count:4945 (16), effective:336 (1)
iterations count:2721 (8), effective:199 (0)
iterations count:6010 (19), effective:440 (1)
iterations count:6229 (20), effective:474 (1)
iterations count:6689 (21), effective:466 (1)
iterations count:5850 (18), effective:457 (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="marciexred"
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 marciexred"
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 r458-smll-167912650000231"
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 '
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 ;