About the Execution of Marcie+red for SmartHome-PT-02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5450.107 | 11811.00 | 16862.00 | 672.10 | FFFFFTTTFFTFTFTT | 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-167912649900162.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-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912649900162
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.8K Feb 26 05:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 05:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 05:46 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.5K Feb 25 17:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 05:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 05:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 05:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 05:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:08 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 27K 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-02-CTLFireability-00
FORMULA_NAME SmartHome-PT-02-CTLFireability-01
FORMULA_NAME SmartHome-PT-02-CTLFireability-02
FORMULA_NAME SmartHome-PT-02-CTLFireability-03
FORMULA_NAME SmartHome-PT-02-CTLFireability-04
FORMULA_NAME SmartHome-PT-02-CTLFireability-05
FORMULA_NAME SmartHome-PT-02-CTLFireability-06
FORMULA_NAME SmartHome-PT-02-CTLFireability-07
FORMULA_NAME SmartHome-PT-02-CTLFireability-08
FORMULA_NAME SmartHome-PT-02-CTLFireability-09
FORMULA_NAME SmartHome-PT-02-CTLFireability-10
FORMULA_NAME SmartHome-PT-02-CTLFireability-11
FORMULA_NAME SmartHome-PT-02-CTLFireability-12
FORMULA_NAME SmartHome-PT-02-CTLFireability-13
FORMULA_NAME SmartHome-PT-02-CTLFireability-14
FORMULA_NAME SmartHome-PT-02-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679309070779
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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 10:44:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 10:44:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:44:33] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-03-20 10:44:33] [INFO ] Transformed 41 places.
[2023-03-20 10:44:33] [INFO ] Transformed 127 transitions.
[2023-03-20 10:44:33] [INFO ] Found NUPN structural information;
[2023-03-20 10:44:33] [INFO ] Parsed PT model containing 41 places and 127 transitions and 359 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 66 transitions
Reduce redundant transitions removed 66 transitions.
FORMULA SmartHome-PT-02-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-02-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 61/61 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 41 transition count 49
Applied a total of 12 rules in 19 ms. Remains 41 /41 variables (removed 0) and now considering 49/61 (removed 12) transitions.
[2023-03-20 10:44:33] [INFO ] Flow matrix only has 36 transitions (discarded 13 similar events)
// Phase 1: matrix 36 rows 41 cols
[2023-03-20 10:44:33] [INFO ] Computed 17 place invariants in 27 ms
[2023-03-20 10:44:34] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-20 10:44:34] [INFO ] Flow matrix only has 36 transitions (discarded 13 similar events)
[2023-03-20 10:44:34] [INFO ] Invariant cache hit.
[2023-03-20 10:44:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-20 10:44:34] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2023-03-20 10:44:34] [INFO ] Flow matrix only has 36 transitions (discarded 13 similar events)
[2023-03-20 10:44:34] [INFO ] Invariant cache hit.
[2023-03-20 10:44:34] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/41 places, 49/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 627 ms. Remains : 41/41 places, 49/61 transitions.
Support contains 34 out of 41 places after structural reductions.
[2023-03-20 10:44:34] [INFO ] Flatten gal took : 27 ms
[2023-03-20 10:44:34] [INFO ] Flatten gal took : 11 ms
[2023-03-20 10:44:34] [INFO ] Input system was already deterministic with 49 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 68) seen :67
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 10:44:35] [INFO ] Flow matrix only has 36 transitions (discarded 13 similar events)
[2023-03-20 10:44:35] [INFO ] Invariant cache hit.
[2023-03-20 10:44:35] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-20 10:44:35] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 10:44:35] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-03-20 10:44:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 8 ms
FORMULA SmartHome-PT-02-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 7 ms
[2023-03-20 10:44:35] [INFO ] Input system was already deterministic with 49 transitions.
Computed a total of 21 stabilizing places and 13 stable transitions
Graph (complete) has 110 edges and 41 vertex of which 40 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 37 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 37 transition count 45
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 37 transition count 44
Applied a total of 9 rules in 7 ms. Remains 37 /41 variables (removed 4) and now considering 44/49 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 37/41 places, 44/49 transitions.
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:44:35] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 49
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 36 transition count 45
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 36 transition count 45
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 36 transition count 44
Applied a total of 10 rules in 5 ms. Remains 36 /41 variables (removed 5) and now considering 44/49 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 36/41 places, 44/49 transitions.
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:44:35] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 49
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 36 transition count 45
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 36 transition count 45
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 36 transition count 43
Applied a total of 11 rules in 4 ms. Remains 36 /41 variables (removed 5) and now considering 43/49 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 36/41 places, 43/49 transitions.
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 10 ms
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:44:35] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 35 transition count 43
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 35 transition count 43
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 35 transition count 41
Applied a total of 14 rules in 3 ms. Remains 35 /41 variables (removed 6) and now considering 41/49 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 35/41 places, 41/49 transitions.
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:44:35] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 49
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 34 transition count 43
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 34 transition count 43
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 34 transition count 41
Applied a total of 15 rules in 4 ms. Remains 34 /41 variables (removed 7) and now considering 41/49 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 34/41 places, 41/49 transitions.
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:44:35] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 35 transition count 43
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 35 transition count 43
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 35 transition count 41
Applied a total of 14 rules in 3 ms. Remains 35 /41 variables (removed 6) and now considering 41/49 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 35/41 places, 41/49 transitions.
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:44:35] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Graph (trivial) has 22 edges and 41 vertex of which 4 / 41 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 35 transition count 41
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 35 transition count 41
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 21 place count 29 transition count 35
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 24 place count 26 transition count 29
Iterating global reduction 0 with 3 rules applied. Total rules applied 27 place count 26 transition count 29
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 26 transition count 26
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 25 transition count 25
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 25 transition count 25
Applied a total of 32 rules in 21 ms. Remains 25 /41 variables (removed 16) and now considering 25/49 (removed 24) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 25/41 places, 25/49 transitions.
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:44:35] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 37 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 37 transition count 45
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 37 transition count 44
Applied a total of 9 rules in 2 ms. Remains 37 /41 variables (removed 4) and now considering 44/49 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 37/41 places, 44/49 transitions.
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:44:35] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 36 transition count 44
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 36 transition count 44
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 36 transition count 42
Applied a total of 12 rules in 3 ms. Remains 36 /41 variables (removed 5) and now considering 42/49 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 36/41 places, 42/49 transitions.
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:44:35] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 49
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 37 transition count 46
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 37 transition count 46
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 37 transition count 45
Applied a total of 8 rules in 3 ms. Remains 37 /41 variables (removed 4) and now considering 45/49 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 37/41 places, 45/49 transitions.
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:44:35] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 49
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 35 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 35 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 35 transition count 43
Applied a total of 12 rules in 3 ms. Remains 35 /41 variables (removed 6) and now considering 43/49 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 35/41 places, 43/49 transitions.
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 5 ms
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:44:35] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 37 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 37 transition count 45
Applied a total of 8 rules in 2 ms. Remains 37 /41 variables (removed 4) and now considering 45/49 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 37/41 places, 45/49 transitions.
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:44:35] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 39 transition count 47
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 39 transition count 47
Applied a total of 4 rules in 1 ms. Remains 39 /41 variables (removed 2) and now considering 47/49 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 39/41 places, 47/49 transitions.
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:44:35] [INFO ] Input system was already deterministic with 47 transitions.
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:44:35] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:44:35] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-20 10:44:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 41 places, 49 transitions and 157 arcs took 0 ms.
Total runtime 2281 ms.
There are residual formulas that ITS could not solve within timeout
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=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 41 NrTr: 49 NrArc: 157)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.350sec
RS generation: 0m 0.006sec
-> reachability set: #nodes 682 (6.8e+02) #states 86,401 (4)
starting MCC model checker
--------------------------
checking: EF [AX [[EG [[p2<=0 & 0<=p2]] & [[p13<=0 & 0<=p13] & [p11<=0 & 0<=p11]]]]]
normalized: E [true U ~ [EX [~ [[[[p11<=0 & 0<=p11] & [p13<=0 & 0<=p13]] & EG [[p2<=0 & 0<=p2]]]]]]]
abstracting: (0<=p2)
states: 86,401 (4)
abstracting: (p2<=0)
states: 1
..
EG iterations: 2
abstracting: (0<=p13)
states: 86,401 (4)
abstracting: (p13<=0)
states: 43,201 (4)
abstracting: (0<=p11)
states: 86,401 (4)
abstracting: (p11<=0)
states: 1
.-> the formula is FALSE
FORMULA SmartHome-PT-02-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: A [[p10<=1 & 1<=p10] U ~ [EF [[~ [AF [[p24<=1 & 1<=p24]]] & AX [[[p16<=1 & 1<=p16] | [[p1<=1 & 1<=p1] & [p16<=1 & 1<=p16]]]]]]]]
normalized: [~ [EG [E [true U [~ [EX [~ [[[[p16<=1 & 1<=p16] & [p1<=1 & 1<=p1]] | [p16<=1 & 1<=p16]]]]] & EG [~ [[p24<=1 & 1<=p24]]]]]]] & ~ [E [E [true U [~ [EX [~ [[[[p16<=1 & 1<=p16] & [p1<=1 & 1<=p1]] | [p16<=1 & 1<=p16]]]]] & EG [~ [[p24<=1 & 1<=p24]]]]] U [~ [[p10<=1 & 1<=p10]] & E [true U [~ [EX [~ [[[[p16<=1 & 1<=p16] & [p1<=1 & 1<=p1]] | [p16<=1 & 1<=p16]]]]] & EG [~ [[p24<=1 & 1<=p24]]]]]]]]]
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p24<=1)
states: 86,401 (4)
..
EG iterations: 2
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
.abstracting: (1<=p10)
states: 43,200 (4)
abstracting: (p10<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p24<=1)
states: 86,401 (4)
..
EG iterations: 2
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
.abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p24<=1)
states: 86,401 (4)
..
EG iterations: 2
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
..
EG iterations: 1
-> the formula is TRUE
FORMULA SmartHome-PT-02-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: ~ [A [~ [[EX [~ [[[p1<=1 & 1<=p1] & [p21<=1 & 1<=p21]]]] & A [~ [[[p1<=1 & 1<=p1] & [p26<=1 & 1<=p26]]] U AX [[p22<=1 & 1<=p22]]]]] U [~ [[p5<=1 & 1<=p5]] & AG [EX [[p4<=1 & 1<=p4]]]]]]
normalized: ~ [[~ [EG [~ [[~ [E [true U ~ [EX [[p4<=1 & 1<=p4]]]]] & ~ [[p5<=1 & 1<=p5]]]]]] & ~ [E [~ [[~ [E [true U ~ [EX [[p4<=1 & 1<=p4]]]]] & ~ [[p5<=1 & 1<=p5]]]] U [[[~ [EG [EX [~ [[p22<=1 & 1<=p22]]]]] & ~ [E [EX [~ [[p22<=1 & 1<=p22]]] U [[[p26<=1 & 1<=p26] & [p1<=1 & 1<=p1]] & EX [~ [[p22<=1 & 1<=p22]]]]]]] & EX [~ [[[p21<=1 & 1<=p21] & [p1<=1 & 1<=p1]]]]] & ~ [[~ [E [true U ~ [EX [[p4<=1 & 1<=p4]]]]] & ~ [[p5<=1 & 1<=p5]]]]]]]]]
abstracting: (1<=p5)
states: 86,400 (4)
abstracting: (p5<=1)
states: 86,401 (4)
abstracting: (1<=p4)
states: 43,200 (4)
abstracting: (p4<=1)
states: 86,401 (4)
.abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p21)
states: 28,800 (4)
abstracting: (p21<=1)
states: 86,401 (4)
.abstracting: (1<=p22)
states: 28,800 (4)
abstracting: (p22<=1)
states: 86,401 (4)
.abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p26)
states: 43,200 (4)
abstracting: (p26<=1)
states: 86,401 (4)
abstracting: (1<=p22)
states: 28,800 (4)
abstracting: (p22<=1)
states: 86,401 (4)
.abstracting: (1<=p22)
states: 28,800 (4)
abstracting: (p22<=1)
states: 86,401 (4)
.
EG iterations: 0
abstracting: (1<=p5)
states: 86,400 (4)
abstracting: (p5<=1)
states: 86,401 (4)
abstracting: (1<=p4)
states: 43,200 (4)
abstracting: (p4<=1)
states: 86,401 (4)
.abstracting: (1<=p5)
states: 86,400 (4)
abstracting: (p5<=1)
states: 86,401 (4)
abstracting: (1<=p4)
states: 43,200 (4)
abstracting: (p4<=1)
states: 86,401 (4)
..
EG iterations: 1
-> the formula is FALSE
FORMULA SmartHome-PT-02-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: AG [[EF [[[[p13<=1 & 1<=p13] & [p27<=1 & 1<=p27]] & [[p22<=1 & 1<=p22] & [[p18<=1 & 1<=p18] & [p27<=1 & 1<=p27]]]]] | [[p13<=1 & 1<=p13] & [p27<=1 & 1<=p27]]]]
normalized: ~ [E [true U ~ [[[[p27<=1 & 1<=p27] & [p13<=1 & 1<=p13]] | E [true U [[[[p27<=1 & 1<=p27] & [p18<=1 & 1<=p18]] & [p22<=1 & 1<=p22]] & [[p27<=1 & 1<=p27] & [p13<=1 & 1<=p13]]]]]]]]
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p22)
states: 28,800 (4)
abstracting: (p22<=1)
states: 86,401 (4)
abstracting: (1<=p18)
states: 43,200 (4)
abstracting: (p18<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
-> the formula is TRUE
FORMULA SmartHome-PT-02-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AF [[EF [AG [EX [[p4<=0 & 0<=p4]]]] & [[p18<=0 & 0<=p18] | [AX [[p22<=1 & 1<=p22]] & AF [[[[p1<=0 & 0<=p1] | [p7<=0 & 0<=p7]] | [[p16<=0 & 0<=p16] | [p33<=0 & 0<=p33]]]]]]]]
normalized: ~ [EG [~ [[[[~ [EG [~ [[[[p33<=0 & 0<=p33] | [p16<=0 & 0<=p16]] | [[p7<=0 & 0<=p7] | [p1<=0 & 0<=p1]]]]]] & ~ [EX [~ [[p22<=1 & 1<=p22]]]]] | [p18<=0 & 0<=p18]] & E [true U ~ [E [true U ~ [EX [[p4<=0 & 0<=p4]]]]]]]]]]
abstracting: (0<=p4)
states: 86,401 (4)
abstracting: (p4<=0)
states: 43,201 (4)
.abstracting: (0<=p18)
states: 86,401 (4)
abstracting: (p18<=0)
states: 43,201 (4)
abstracting: (1<=p22)
states: 28,800 (4)
abstracting: (p22<=1)
states: 86,401 (4)
.abstracting: (0<=p1)
states: 86,401 (4)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p7)
states: 86,401 (4)
abstracting: (p7<=0)
states: 43,201 (4)
abstracting: (0<=p16)
states: 86,401 (4)
abstracting: (p16<=0)
states: 43,201 (4)
abstracting: (0<=p33)
states: 86,401 (4)
abstracting: (p33<=0)
states: 65,665 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA SmartHome-PT-02-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: AG [AF [[EF [[[[p1<=1 & 1<=p1] & [p4<=1 & 1<=p4]] | [p23<=1 & 1<=p23]]] | [EX [EX [[p8<=1 & 1<=p8]]] | E [~ [[[[p24<=1 & 1<=p24] & [p36<=1 & 1<=p36]] & [[p1<=1 & 1<=p1] & [p26<=1 & 1<=p26]]]] U [p5<=1 & 1<=p5]]]]]]
normalized: ~ [E [true U EG [~ [[[E [~ [[[[p26<=1 & 1<=p26] & [p1<=1 & 1<=p1]] & [[p36<=1 & 1<=p36] & [p24<=1 & 1<=p24]]]] U [p5<=1 & 1<=p5]] | EX [EX [[p8<=1 & 1<=p8]]]] | E [true U [[p23<=1 & 1<=p23] | [[p4<=1 & 1<=p4] & [p1<=1 & 1<=p1]]]]]]]]]
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p4)
states: 43,200 (4)
abstracting: (p4<=1)
states: 86,401 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p23<=1)
states: 86,401 (4)
abstracting: (1<=p8)
states: 86,400 (4)
abstracting: (p8<=1)
states: 86,401 (4)
..abstracting: (1<=p5)
states: 86,400 (4)
abstracting: (p5<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p24<=1)
states: 86,401 (4)
abstracting: (1<=p36)
states: 13,824 (4)
abstracting: (p36<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p26)
states: 43,200 (4)
abstracting: (p26<=1)
states: 86,401 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA SmartHome-PT-02-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: [AG [AX [EX [[[p16<=0 & 0<=p16] | [p33<=0 & 0<=p33]]]]] | AF [[[EG [EX [[[p24<=1 & 1<=p24] & [p27<=1 & 1<=p27]]]] & [EG [AG [[p12<=1 & 1<=p12]]] & [AG [[[p1<=1 & 1<=p1] & [p21<=1 & 1<=p21]]] | [[p10<=0 & 0<=p10] & [p14<=0 & 0<=p14]]]]] | AX [[[p7<=0 & 0<=p7] & [p17<=1 & 1<=p17]]]]]]
normalized: [~ [EG [~ [[~ [EX [~ [[[p17<=1 & 1<=p17] & [p7<=0 & 0<=p7]]]]] | [[[[[p14<=0 & 0<=p14] & [p10<=0 & 0<=p10]] | ~ [E [true U ~ [[[p21<=1 & 1<=p21] & [p1<=1 & 1<=p1]]]]]] & EG [~ [E [true U ~ [[p12<=1 & 1<=p12]]]]]] & EG [EX [[[p27<=1 & 1<=p27] & [p24<=1 & 1<=p24]]]]]]]]] | ~ [E [true U EX [~ [EX [[[p33<=0 & 0<=p33] | [p16<=0 & 0<=p16]]]]]]]]
abstracting: (0<=p16)
states: 86,401 (4)
abstracting: (p16<=0)
states: 43,201 (4)
abstracting: (0<=p33)
states: 86,401 (4)
abstracting: (p33<=0)
states: 65,665 (4)
..abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p24<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
.
EG iterations: 0
abstracting: (1<=p12)
states: 43,200 (4)
abstracting: (p12<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p21)
states: 28,800 (4)
abstracting: (p21<=1)
states: 86,401 (4)
abstracting: (0<=p10)
states: 86,401 (4)
abstracting: (p10<=0)
states: 43,201 (4)
abstracting: (0<=p14)
states: 86,401 (4)
abstracting: (p14<=0)
states: 1
abstracting: (0<=p7)
states: 86,401 (4)
abstracting: (p7<=0)
states: 43,201 (4)
abstracting: (1<=p17)
states: 43,200 (4)
abstracting: (p17<=1)
states: 86,401 (4)
.
EG iterations: 0
-> the formula is TRUE
FORMULA SmartHome-PT-02-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: EF [[[p14<=0 & 0<=p14] & [~ [A [EX [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]]] U [[[p18<=1 & 1<=p18] | [[p7<=1 & 1<=p7] & [p27<=1 & 1<=p27]]] | [[p16<=1 & 1<=p16] | [[p1<=1 & 1<=p1] & [p26<=1 & 1<=p26]]]]]] | EX [~ [E [[p8<=1 & 1<=p8] U [[p1<=1 & 1<=p1] & [p21<=1 & 1<=p21]]]]]]]]
normalized: E [true U [[EX [~ [E [[p8<=1 & 1<=p8] U [[p21<=1 & 1<=p21] & [p1<=1 & 1<=p1]]]]] | ~ [[~ [EG [~ [[[[[p26<=1 & 1<=p26] & [p1<=1 & 1<=p1]] | [p16<=1 & 1<=p16]] | [[[p27<=1 & 1<=p27] & [p7<=1 & 1<=p7]] | [p18<=1 & 1<=p18]]]]]] & ~ [E [~ [[[[[p26<=1 & 1<=p26] & [p1<=1 & 1<=p1]] | [p16<=1 & 1<=p16]] | [[[p27<=1 & 1<=p27] & [p7<=1 & 1<=p7]] | [p18<=1 & 1<=p18]]]] U [~ [EX [[[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]] & ~ [[[[[p26<=1 & 1<=p26] & [p1<=1 & 1<=p1]] | [p16<=1 & 1<=p16]] | [[[p27<=1 & 1<=p27] & [p7<=1 & 1<=p7]] | [p18<=1 & 1<=p18]]]]]]]]]] & [p14<=0 & 0<=p14]]]
abstracting: (0<=p14)
states: 86,401 (4)
abstracting: (p14<=0)
states: 1
abstracting: (1<=p18)
states: 43,200 (4)
abstracting: (p18<=1)
states: 86,401 (4)
abstracting: (1<=p7)
states: 43,200 (4)
abstracting: (p7<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p26)
states: 43,200 (4)
abstracting: (p26<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p7)
states: 43,200 (4)
abstracting: (p7<=1)
states: 86,401 (4)
.abstracting: (1<=p18)
states: 43,200 (4)
abstracting: (p18<=1)
states: 86,401 (4)
abstracting: (1<=p7)
states: 43,200 (4)
abstracting: (p7<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p26)
states: 43,200 (4)
abstracting: (p26<=1)
states: 86,401 (4)
abstracting: (1<=p18)
states: 43,200 (4)
abstracting: (p18<=1)
states: 86,401 (4)
abstracting: (1<=p7)
states: 43,200 (4)
abstracting: (p7<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p26)
states: 43,200 (4)
abstracting: (p26<=1)
states: 86,401 (4)
..
EG iterations: 2
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p21)
states: 28,800 (4)
abstracting: (p21<=1)
states: 86,401 (4)
abstracting: (1<=p8)
states: 86,400 (4)
abstracting: (p8<=1)
states: 86,401 (4)
.-> the formula is FALSE
FORMULA SmartHome-PT-02-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: [EX [[E [AX [[[[p13<=1 & 1<=p13] & [p27<=1 & 1<=p27]] | [p22<=1 & 1<=p22]]] U ~ [[~ [[p26<=1 & 1<=p26]] | ~ [[[p2<=1 & 1<=p2] & [p27<=1 & 1<=p27]]]]]] | EF [~ [E [[p22<=1 & 1<=p22] U [[p1<=1 & 1<=p1] & [p26<=1 & 1<=p26]]]]]]] & E [EF [[[p13<=1 & 1<=p13] & AF [[[p13<=1 & 1<=p13] & [p31<=1 & 1<=p31]]]]] U ~ [[[p18<=1 & 1<=p18] | EX [E [[[p1<=1 & 1<=p1] & [p24<=1 & 1<=p24]] U [p21<=1 & 1<=p21]]]]]]]
normalized: [EX [[E [true U ~ [E [[p22<=1 & 1<=p22] U [[p26<=1 & 1<=p26] & [p1<=1 & 1<=p1]]]]] | E [~ [EX [~ [[[p22<=1 & 1<=p22] | [[p27<=1 & 1<=p27] & [p13<=1 & 1<=p13]]]]]] U ~ [[~ [[[p27<=1 & 1<=p27] & [p2<=1 & 1<=p2]]] | ~ [[p26<=1 & 1<=p26]]]]]]] & E [E [true U [~ [EG [~ [[[p31<=1 & 1<=p31] & [p13<=1 & 1<=p13]]]]] & [p13<=1 & 1<=p13]]] U ~ [[EX [E [[[p24<=1 & 1<=p24] & [p1<=1 & 1<=p1]] U [p21<=1 & 1<=p21]]] | [p18<=1 & 1<=p18]]]]]
abstracting: (1<=p18)
states: 43,200 (4)
abstracting: (p18<=1)
states: 86,401 (4)
abstracting: (1<=p21)
states: 28,800 (4)
abstracting: (p21<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p24<=1)
states: 86,401 (4)
.abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
abstracting: (1<=p31)
states: 27,648 (4)
abstracting: (p31<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p26)
states: 43,200 (4)
abstracting: (p26<=1)
states: 86,401 (4)
abstracting: (1<=p2)
states: 86,400 (4)
abstracting: (p2<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p22)
states: 28,800 (4)
abstracting: (p22<=1)
states: 86,401 (4)
.abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p26)
states: 43,200 (4)
abstracting: (p26<=1)
states: 86,401 (4)
abstracting: (1<=p22)
states: 28,800 (4)
abstracting: (p22<=1)
states: 86,401 (4)
.-> the formula is FALSE
FORMULA SmartHome-PT-02-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.017sec
checking: [AG [[[[~ [E [[[p21<=1 & 1<=p21] & [p27<=1 & 1<=p27]] U [[p1<=1 & 1<=p1] & [p26<=1 & 1<=p26]]]] & AX [[[p1<=0 & 0<=p1] | [p13<=0 & 0<=p13]]]] | [AF [[p17<=0 & 0<=p17]] & AG [[p21<=0 & 0<=p21]]]] & [EX [AG [[[p1<=0 & 0<=p1] | [p4<=0 & 0<=p4]]]] | A [AG [[p14<=1 & 1<=p14]] U AF [[p10<=1 & 1<=p10]]]]]] | EF [[[[p1<=0 & 0<=p1] | [p16<=0 & 0<=p16]] & AG [[[p16<=1 & 1<=p16] & [p33<=1 & 1<=p33]]]]]]
normalized: [E [true U [~ [E [true U ~ [[[p33<=1 & 1<=p33] & [p16<=1 & 1<=p16]]]]] & [[p16<=0 & 0<=p16] | [p1<=0 & 0<=p1]]]] | ~ [E [true U ~ [[[[~ [EG [EG [~ [[p10<=1 & 1<=p10]]]]] & ~ [E [EG [~ [[p10<=1 & 1<=p10]]] U [E [true U ~ [[p14<=1 & 1<=p14]]] & EG [~ [[p10<=1 & 1<=p10]]]]]]] | EX [~ [E [true U ~ [[[p4<=0 & 0<=p4] | [p1<=0 & 0<=p1]]]]]]] & [[~ [E [true U ~ [[p21<=0 & 0<=p21]]]] & ~ [EG [~ [[p17<=0 & 0<=p17]]]]] | [~ [EX [~ [[[p13<=0 & 0<=p13] | [p1<=0 & 0<=p1]]]]] & ~ [E [[[p27<=1 & 1<=p27] & [p21<=1 & 1<=p21]] U [[p26<=1 & 1<=p26] & [p1<=1 & 1<=p1]]]]]]]]]]]
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p26)
states: 43,200 (4)
abstracting: (p26<=1)
states: 86,401 (4)
abstracting: (1<=p21)
states: 28,800 (4)
abstracting: (p21<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (0<=p1)
states: 86,401 (4)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p13)
states: 86,401 (4)
abstracting: (p13<=0)
states: 43,201 (4)
.abstracting: (0<=p17)
states: 86,401 (4)
abstracting: (p17<=0)
states: 43,201 (4)
.
EG iterations: 1
abstracting: (0<=p21)
states: 86,401 (4)
abstracting: (p21<=0)
states: 57,601 (4)
abstracting: (0<=p1)
states: 86,401 (4)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p4)
states: 86,401 (4)
abstracting: (p4<=0)
states: 43,201 (4)
.abstracting: (1<=p10)
states: 43,200 (4)
abstracting: (p10<=1)
states: 86,401 (4)
..
EG iterations: 2
abstracting: (1<=p14)
states: 86,400 (4)
abstracting: (p14<=1)
states: 86,401 (4)
abstracting: (1<=p10)
states: 43,200 (4)
abstracting: (p10<=1)
states: 86,401 (4)
..
EG iterations: 2
abstracting: (1<=p10)
states: 43,200 (4)
abstracting: (p10<=1)
states: 86,401 (4)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (0<=p1)
states: 86,401 (4)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p16)
states: 86,401 (4)
abstracting: (p16<=0)
states: 43,201 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p33)
states: 20,736 (4)
abstracting: (p33<=1)
states: 86,401 (4)
-> the formula is FALSE
FORMULA SmartHome-PT-02-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: ~ [A [AX [EF [[[p24<=1 & 1<=p24] & [p27<=1 & 1<=p27]]]] U [A [[[[p1<=1 & 1<=p1] & [p4<=1 & 1<=p4]] | [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] | [[p24<=1 & 1<=p24] & [p36<=1 & 1<=p36]]]] U [[[p14<=1 & 1<=p14] & [p35<=1 & 1<=p35]] | [[p16<=1 & 1<=p16] & [p27<=1 & 1<=p27]]]] & [EG [[p22<=1 & 1<=p22]] | EX [[[[p7<=1 & 1<=p7] & [p27<=1 & 1<=p27]] | [p20<=1 & 1<=p20]]]]]]]
normalized: ~ [[~ [EG [~ [[[EX [[[p20<=1 & 1<=p20] | [[p27<=1 & 1<=p27] & [p7<=1 & 1<=p7]]]] | EG [[p22<=1 & 1<=p22]]] & [~ [EG [~ [[[[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]] | [[p35<=1 & 1<=p35] & [p14<=1 & 1<=p14]]]]]] & ~ [E [~ [[[[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]] | [[p35<=1 & 1<=p35] & [p14<=1 & 1<=p14]]]] U [~ [[[[[p36<=1 & 1<=p36] & [p24<=1 & 1<=p24]] | [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]] | [[p4<=1 & 1<=p4] & [p1<=1 & 1<=p1]]]] & ~ [[[[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]] | [[p35<=1 & 1<=p35] & [p14<=1 & 1<=p14]]]]]]]]]]]] & ~ [E [~ [[[EX [[[p20<=1 & 1<=p20] | [[p27<=1 & 1<=p27] & [p7<=1 & 1<=p7]]]] | EG [[p22<=1 & 1<=p22]]] & [~ [EG [~ [[[[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]] | [[p35<=1 & 1<=p35] & [p14<=1 & 1<=p14]]]]]] & ~ [E [~ [[[[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]] | [[p35<=1 & 1<=p35] & [p14<=1 & 1<=p14]]]] U [~ [[[[[p36<=1 & 1<=p36] & [p24<=1 & 1<=p24]] | [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]] | [[p4<=1 & 1<=p4] & [p1<=1 & 1<=p1]]]] & ~ [[[[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]] | [[p35<=1 & 1<=p35] & [p14<=1 & 1<=p14]]]]]]]]]] U [EX [~ [E [true U [[p27<=1 & 1<=p27] & [p24<=1 & 1<=p24]]]]] & ~ [[[EX [[[p20<=1 & 1<=p20] | [[p27<=1 & 1<=p27] & [p7<=1 & 1<=p7]]]] | EG [[p22<=1 & 1<=p22]]] & [~ [EG [~ [[[[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]] | [[p35<=1 & 1<=p35] & [p14<=1 & 1<=p14]]]]]] & ~ [E [~ [[[[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]] | [[p35<=1 & 1<=p35] & [p14<=1 & 1<=p14]]]] U [~ [[[[[p36<=1 & 1<=p36] & [p24<=1 & 1<=p24]] | [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]] | [[p4<=1 & 1<=p4] & [p1<=1 & 1<=p1]]]] & ~ [[[[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]] | [[p35<=1 & 1<=p35] & [p14<=1 & 1<=p14]]]]]]]]]]]]]]]
abstracting: (1<=p14)
states: 86,400 (4)
abstracting: (p14<=1)
states: 86,401 (4)
abstracting: (1<=p35)
states: 20,736 (4)
abstracting: (p35<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p4)
states: 43,200 (4)
abstracting: (p4<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p7)
states: 43,200 (4)
abstracting: (p7<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p24<=1)
states: 86,401 (4)
abstracting: (1<=p36)
states: 13,824 (4)
abstracting: (p36<=1)
states: 86,401 (4)
abstracting: (1<=p14)
states: 86,400 (4)
abstracting: (p14<=1)
states: 86,401 (4)
abstracting: (1<=p35)
states: 20,736 (4)
abstracting: (p35<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p14)
states: 86,400 (4)
abstracting: (p14<=1)
states: 86,401 (4)
abstracting: (1<=p35)
states: 20,736 (4)
abstracting: (p35<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
..
EG iterations: 2
abstracting: (1<=p22)
states: 28,800 (4)
abstracting: (p22<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p7)
states: 43,200 (4)
abstracting: (p7<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p20)
states: 28,800 (4)
abstracting: (p20<=1)
states: 86,401 (4)
.abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p24<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
.abstracting: (1<=p14)
states: 86,400 (4)
abstracting: (p14<=1)
states: 86,401 (4)
abstracting: (1<=p35)
states: 20,736 (4)
abstracting: (p35<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p4)
states: 43,200 (4)
abstracting: (p4<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p7)
states: 43,200 (4)
abstracting: (p7<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p24<=1)
states: 86,401 (4)
abstracting: (1<=p36)
states: 13,824 (4)
abstracting: (p36<=1)
states: 86,401 (4)
abstracting: (1<=p14)
states: 86,400 (4)
abstracting: (p14<=1)
states: 86,401 (4)
abstracting: (1<=p35)
states: 20,736 (4)
abstracting: (p35<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p14)
states: 86,400 (4)
abstracting: (p14<=1)
states: 86,401 (4)
abstracting: (1<=p35)
states: 20,736 (4)
abstracting: (p35<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
..
EG iterations: 2
abstracting: (1<=p22)
states: 28,800 (4)
abstracting: (p22<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p7)
states: 43,200 (4)
abstracting: (p7<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p20)
states: 28,800 (4)
abstracting: (p20<=1)
states: 86,401 (4)
.abstracting: (1<=p14)
states: 86,400 (4)
abstracting: (p14<=1)
states: 86,401 (4)
abstracting: (1<=p35)
states: 20,736 (4)
abstracting: (p35<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p4)
states: 43,200 (4)
abstracting: (p4<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p7)
states: 43,200 (4)
abstracting: (p7<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p24<=1)
states: 86,401 (4)
abstracting: (1<=p36)
states: 13,824 (4)
abstracting: (p36<=1)
states: 86,401 (4)
abstracting: (1<=p14)
states: 86,400 (4)
abstracting: (p14<=1)
states: 86,401 (4)
abstracting: (1<=p35)
states: 20,736 (4)
abstracting: (p35<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p14)
states: 86,400 (4)
abstracting: (p14<=1)
states: 86,401 (4)
abstracting: (1<=p35)
states: 20,736 (4)
abstracting: (p35<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
..
EG iterations: 2
abstracting: (1<=p22)
states: 28,800 (4)
abstracting: (p22<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p7)
states: 43,200 (4)
abstracting: (p7<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p20)
states: 28,800 (4)
abstracting: (p20<=1)
states: 86,401 (4)
...
EG iterations: 2
-> the formula is FALSE
FORMULA SmartHome-PT-02-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: E [E [AX [~ [EX [[[p4<=1 & 1<=p4] & [p27<=1 & 1<=p27]]]]] U ~ [A [[[p7<=1 & 1<=p7] & [p27<=1 & 1<=p27]] U EF [[[p24<=1 & 1<=p24] & [p36<=1 & 1<=p36]]]]]] U AG [[[~ [[A [[[p14<=1 & 1<=p14] & [p32<=1 & 1<=p32]] U [p25<=1 & 1<=p25]] | [p3<=1 & 1<=p3]]] | [[~ [[[p1<=1 & 1<=p1] & [p10<=1 & 1<=p10]]] | [[p1<=1 & 1<=p1] & [[p13<=1 & 1<=p13] & [p4<=1 & 1<=p4]]]] & [EG [[[p14<=1 & 1<=p14] & [p32<=1 & 1<=p32]]] | ~ [[p22<=1 & 1<=p22]]]]] & [~ [E [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] U [p7<=1 & 1<=p7]]] | [EG [[p17<=1 & 1<=p17]] & [~ [[[p13<=1 & 1<=p13] & [p31<=1 & 1<=p31]]] | [[p9<=1 & 1<=p9] | [p7<=1 & 1<=p7]]]]]]]]
normalized: E [E [~ [EX [EX [[[p27<=1 & 1<=p27] & [p4<=1 & 1<=p4]]]]] U ~ [[~ [EG [~ [E [true U [[p36<=1 & 1<=p36] & [p24<=1 & 1<=p24]]]]]] & ~ [E [~ [E [true U [[p36<=1 & 1<=p36] & [p24<=1 & 1<=p24]]]] U [~ [[[p27<=1 & 1<=p27] & [p7<=1 & 1<=p7]]] & ~ [E [true U [[p36<=1 & 1<=p36] & [p24<=1 & 1<=p24]]]]]]]]]] U ~ [E [true U ~ [[[~ [[[~ [EG [~ [[p25<=1 & 1<=p25]]]] & ~ [E [~ [[p25<=1 & 1<=p25]] U [~ [[[p32<=1 & 1<=p32] & [p14<=1 & 1<=p14]]] & ~ [[p25<=1 & 1<=p25]]]]]] | [p3<=1 & 1<=p3]]] | [[~ [[p22<=1 & 1<=p22]] | EG [[[p32<=1 & 1<=p32] & [p14<=1 & 1<=p14]]]] & [[[[p4<=1 & 1<=p4] & [p13<=1 & 1<=p13]] & [p1<=1 & 1<=p1]] | ~ [[[p10<=1 & 1<=p10] & [p1<=1 & 1<=p1]]]]]] & [[[[[p7<=1 & 1<=p7] | [p9<=1 & 1<=p9]] | ~ [[[p31<=1 & 1<=p31] & [p13<=1 & 1<=p13]]]] & EG [[p17<=1 & 1<=p17]]] | ~ [E [[[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]] U [p7<=1 & 1<=p7]]]]]]]]]
abstracting: (1<=p7)
states: 43,200 (4)
abstracting: (p7<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p7)
states: 43,200 (4)
abstracting: (p7<=1)
states: 86,401 (4)
abstracting: (1<=p17)
states: 43,200 (4)
abstracting: (p17<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
abstracting: (1<=p31)
states: 27,648 (4)
abstracting: (p31<=1)
states: 86,401 (4)
abstracting: (1<=p9)
states: 43,200 (4)
abstracting: (p9<=1)
states: 86,401 (4)
abstracting: (1<=p7)
states: 43,200 (4)
abstracting: (p7<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p10)
states: 43,200 (4)
abstracting: (p10<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
abstracting: (1<=p4)
states: 43,200 (4)
abstracting: (p4<=1)
states: 86,401 (4)
abstracting: (1<=p14)
states: 86,400 (4)
abstracting: (p14<=1)
states: 86,401 (4)
abstracting: (1<=p32)
states: 27,648 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p22)
states: 28,800 (4)
abstracting: (p22<=1)
states: 86,401 (4)
abstracting: (1<=p3)
states: 43,200 (4)
abstracting: (p3<=1)
states: 86,401 (4)
abstracting: (1<=p25)
states: 43,200 (4)
abstracting: (p25<=1)
states: 86,401 (4)
abstracting: (1<=p14)
states: 86,400 (4)
abstracting: (p14<=1)
states: 86,401 (4)
abstracting: (1<=p32)
states: 27,648 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p25)
states: 43,200 (4)
abstracting: (p25<=1)
states: 86,401 (4)
abstracting: (1<=p25)
states: 43,200 (4)
abstracting: (p25<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p24<=1)
states: 86,401 (4)
abstracting: (1<=p36)
states: 13,824 (4)
abstracting: (p36<=1)
states: 86,401 (4)
abstracting: (1<=p7)
states: 43,200 (4)
abstracting: (p7<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p24<=1)
states: 86,401 (4)
abstracting: (1<=p36)
states: 13,824 (4)
abstracting: (p36<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p24<=1)
states: 86,401 (4)
abstracting: (1<=p36)
states: 13,824 (4)
abstracting: (p36<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p4)
states: 43,200 (4)
abstracting: (p4<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
..-> the formula is FALSE
FORMULA SmartHome-PT-02-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: A [[AF [[[A [A [[p9<=1 & 1<=p9] U [p13<=1 & 1<=p13]] U ~ [[p12<=1 & 1<=p12]]] & [~ [[p15<=1 & 1<=p15]] & [p6<=1 & 1<=p6]]] & [[p23<=1 & 1<=p23] & [[p5<=1 & 1<=p5] & [p27<=1 & 1<=p27]]]]] | [E [[~ [[[p18<=1 & 1<=p18] & [p21<=1 & 1<=p21]]] & EX [[[p11<=1 & 1<=p11] & [p27<=1 & 1<=p27]]]] U [[p26<=1 & 1<=p26] & [p28<=1 & 1<=p28]]] & ~ [[[[~ [[[p4<=1 & 1<=p4] & [p27<=1 & 1<=p27]]] | EX [[[p13<=1 & 1<=p13] & [p31<=1 & 1<=p31]]]] & AX [[p20<=1 & 1<=p20]]] & [[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]]]]]] U [~ [A [~ [[[p16<=1 & 1<=p16] & [p24<=1 & 1<=p24]]] U [p13<=1 & 1<=p13]]] | EF [[[EX [EX [[[p24<=1 & 1<=p24] & [p27<=1 & 1<=p27]]]] | E [[p4<=1 & 1<=p4] U [p13<=1 & 1<=p13]]] | [[[p16<=1 & 1<=p16] & [p27<=1 & 1<=p27]] | [[[p1<=1 & 1<=p1] & [p10<=1 & 1<=p10]] | [p7<=1 & 1<=p7]]]]]]]
normalized: [~ [EG [~ [[E [true U [[[[p7<=1 & 1<=p7] | [[p10<=1 & 1<=p10] & [p1<=1 & 1<=p1]]] | [[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]]] | [E [[p4<=1 & 1<=p4] U [p13<=1 & 1<=p13]] | EX [EX [[[p27<=1 & 1<=p27] & [p24<=1 & 1<=p24]]]]]]] | ~ [[~ [EG [~ [[p13<=1 & 1<=p13]]]] & ~ [E [~ [[p13<=1 & 1<=p13]] U [[[p24<=1 & 1<=p24] & [p16<=1 & 1<=p16]] & ~ [[p13<=1 & 1<=p13]]]]]]]]]]] & ~ [E [~ [[E [true U [[[[p7<=1 & 1<=p7] | [[p10<=1 & 1<=p10] & [p1<=1 & 1<=p1]]] | [[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]]] | [E [[p4<=1 & 1<=p4] U [p13<=1 & 1<=p13]] | EX [EX [[[p27<=1 & 1<=p27] & [p24<=1 & 1<=p24]]]]]]] | ~ [[~ [EG [~ [[p13<=1 & 1<=p13]]]] & ~ [E [~ [[p13<=1 & 1<=p13]] U [[[p24<=1 & 1<=p24] & [p16<=1 & 1<=p16]] & ~ [[p13<=1 & 1<=p13]]]]]]]]] U [~ [[[~ [[[[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]] & [~ [EX [~ [[p20<=1 & 1<=p20]]]] & [EX [[[p31<=1 & 1<=p31] & [p13<=1 & 1<=p13]]] | ~ [[[p27<=1 & 1<=p27] & [p4<=1 & 1<=p4]]]]]]] & E [[EX [[[p27<=1 & 1<=p27] & [p11<=1 & 1<=p11]]] & ~ [[[p21<=1 & 1<=p21] & [p18<=1 & 1<=p18]]]] U [[p28<=1 & 1<=p28] & [p26<=1 & 1<=p26]]]] | ~ [EG [~ [[[[[p27<=1 & 1<=p27] & [p5<=1 & 1<=p5]] & [p23<=1 & 1<=p23]] & [[[p6<=1 & 1<=p6] & ~ [[p15<=1 & 1<=p15]]] & [~ [EG [[p12<=1 & 1<=p12]]] & ~ [E [[p12<=1 & 1<=p12] U [~ [[~ [EG [~ [[p13<=1 & 1<=p13]]]] & ~ [E [~ [[p13<=1 & 1<=p13]] U [~ [[p9<=1 & 1<=p9]] & ~ [[p13<=1 & 1<=p13]]]]]]] & [p12<=1 & 1<=p12]]]]]]]]]]]] & ~ [[E [true U [[[[p7<=1 & 1<=p7] | [[p10<=1 & 1<=p10] & [p1<=1 & 1<=p1]]] | [[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]]] | [E [[p4<=1 & 1<=p4] U [p13<=1 & 1<=p13]] | EX [EX [[[p27<=1 & 1<=p27] & [p24<=1 & 1<=p24]]]]]]] | ~ [[~ [EG [~ [[p13<=1 & 1<=p13]]]] & ~ [E [~ [[p13<=1 & 1<=p13]] U [[[p24<=1 & 1<=p24] & [p16<=1 & 1<=p16]] & ~ [[p13<=1 & 1<=p13]]]]]]]]]]]]]
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p24<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
..
EG iterations: 2
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p24<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
..abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
abstracting: (1<=p4)
states: 43,200 (4)
abstracting: (p4<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p10)
states: 43,200 (4)
abstracting: (p10<=1)
states: 86,401 (4)
abstracting: (1<=p7)
states: 43,200 (4)
abstracting: (p7<=1)
states: 86,401 (4)
abstracting: (1<=p12)
states: 43,200 (4)
abstracting: (p12<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
abstracting: (1<=p9)
states: 43,200 (4)
abstracting: (p9<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
..
EG iterations: 2
abstracting: (1<=p12)
states: 43,200 (4)
abstracting: (p12<=1)
states: 86,401 (4)
abstracting: (1<=p12)
states: 43,200 (4)
abstracting: (p12<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p15)
states: 43,200 (4)
abstracting: (p15<=1)
states: 86,401 (4)
abstracting: (1<=p6)
states: 43,200 (4)
abstracting: (p6<=1)
states: 86,401 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p23<=1)
states: 86,401 (4)
abstracting: (1<=p5)
states: 86,400 (4)
abstracting: (p5<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p26)
states: 43,200 (4)
abstracting: (p26<=1)
states: 86,401 (4)
abstracting: (1<=p28)
states: 1,152 (3)
abstracting: (p28<=1)
states: 86,401 (4)
abstracting: (1<=p18)
states: 43,200 (4)
abstracting: (p18<=1)
states: 86,401 (4)
abstracting: (1<=p21)
states: 28,800 (4)
abstracting: (p21<=1)
states: 86,401 (4)
abstracting: (1<=p11)
states: 86,400 (4)
abstracting: (p11<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
.abstracting: (1<=p4)
states: 43,200 (4)
abstracting: (p4<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
abstracting: (1<=p31)
states: 27,648 (4)
abstracting: (p31<=1)
states: 86,401 (4)
.abstracting: (1<=p20)
states: 28,800 (4)
abstracting: (p20<=1)
states: 86,401 (4)
.abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p7)
states: 43,200 (4)
abstracting: (p7<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p24<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
..
EG iterations: 2
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p24<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
..abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
abstracting: (1<=p4)
states: 43,200 (4)
abstracting: (p4<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p10)
states: 43,200 (4)
abstracting: (p10<=1)
states: 86,401 (4)
abstracting: (1<=p7)
states: 43,200 (4)
abstracting: (p7<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p24<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
..
EG iterations: 2
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p24<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
..abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
abstracting: (1<=p4)
states: 43,200 (4)
abstracting: (p4<=1)
states: 86,401 (4)
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p16<=1)
states: 86,401 (4)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (1<=p1)
states: 86,400 (4)
abstracting: (p1<=1)
states: 86,401 (4)
abstracting: (1<=p10)
states: 43,200 (4)
abstracting: (p10<=1)
states: 86,401 (4)
abstracting: (1<=p7)
states: 43,200 (4)
abstracting: (p7<=1)
states: 86,401 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA SmartHome-PT-02-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
totally nodes used: 27356 (2.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 104590 283602 388192
used/not used/entry size/cache size: 293107 66815757 16 1024MB
basic ops cache: hits/miss/sum: 32474 80906 113380
used/not used/entry size/cache size: 130397 16646819 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: 3257 7058 10315
used/not used/entry size/cache size: 7058 8381550 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 67082195
1 26012
2 627
3 30
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.076sec
BK_STOP 1679309082590
--------------------
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 CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
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:503 (10), effective:33 (0)
initing FirstDep: 0m 0.000sec
iterations count:96 (1), effective:2 (0)
iterations count:132 (2), effective:5 (0)
iterations count:49 (1), effective:0 (0)
iterations count:94 (1), effective:1 (0)
iterations count:96 (1), effective:2 (0)
iterations count:94 (1), effective:1 (0)
iterations count:51 (1), effective:1 (0)
iterations count:57 (1), effective:1 (0)
iterations count:55 (1), effective:2 (0)
iterations count:55 (1), effective:2 (0)
iterations count:143 (2), effective:9 (0)
iterations count:96 (1), effective:2 (0)
iterations count:51 (1), effective:1 (0)
iterations count:55 (1), effective:2 (0)
iterations count:51 (1), effective:1 (0)
iterations count:100 (2), effective:3 (0)
iterations count:96 (1), effective:2 (0)
iterations count:49 (1), effective:0 (0)
iterations count:49 (1), effective:0 (0)
iterations count:65 (1), effective:1 (0)
iterations count:87 (1), effective:3 (0)
iterations count:105 (2), effective:3 (0)
iterations count:87 (1), effective:3 (0)
iterations count:87 (1), effective:3 (0)
iterations count:49 (1), effective:0 (0)
iterations count:64 (1), effective:1 (0)
iterations count:105 (2), effective:4 (0)
iterations count:171 (3), effective:15 (0)
iterations count:171 (3), effective:15 (0)
iterations count:55 (1), effective:1 (0)
iterations count:171 (3), effective:15 (0)
iterations count:49 (1), effective:0 (0)
iterations count:62 (1), effective:3 (0)
iterations count:51 (1), effective:1 (0)
iterations count:49 (1), effective:0 (0)
iterations count:51 (1), effective:1 (0)
iterations count:49 (1), effective:0 (0)
iterations count:96 (1), effective:2 (0)
iterations count:62 (1), effective:3 (0)
iterations count:51 (1), effective:1 (0)
iterations count:49 (1), effective:0 (0)
iterations count:62 (1), effective:3 (0)
iterations count:51 (1), effective:1 (0)
iterations count:49 (1), effective:0 (0)
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-02"
export BK_EXAMINATION="CTLFireability"
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-02, examination is CTLFireability"
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-167912649900162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-02.tgz
mv SmartHome-PT-02 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;