About the Execution of Marcie+red for ShieldPPPt-PT-001A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5451.724 | 9498.00 | 15463.00 | 29.00 | TTFFFTTFFTFTTFTF | 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.r394-oct2-167903718000530.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldPPPt-PT-001A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718000530
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.8K Feb 25 20:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 20:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 20:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 20:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 20:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Feb 25 20:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 20:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 20:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 7.4K 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 ShieldPPPt-PT-001A-CTLFireability-00
FORMULA_NAME ShieldPPPt-PT-001A-CTLFireability-01
FORMULA_NAME ShieldPPPt-PT-001A-CTLFireability-02
FORMULA_NAME ShieldPPPt-PT-001A-CTLFireability-03
FORMULA_NAME ShieldPPPt-PT-001A-CTLFireability-04
FORMULA_NAME ShieldPPPt-PT-001A-CTLFireability-05
FORMULA_NAME ShieldPPPt-PT-001A-CTLFireability-06
FORMULA_NAME ShieldPPPt-PT-001A-CTLFireability-07
FORMULA_NAME ShieldPPPt-PT-001A-CTLFireability-08
FORMULA_NAME ShieldPPPt-PT-001A-CTLFireability-09
FORMULA_NAME ShieldPPPt-PT-001A-CTLFireability-10
FORMULA_NAME ShieldPPPt-PT-001A-CTLFireability-11
FORMULA_NAME ShieldPPPt-PT-001A-CTLFireability-12
FORMULA_NAME ShieldPPPt-PT-001A-CTLFireability-13
FORMULA_NAME ShieldPPPt-PT-001A-CTLFireability-14
FORMULA_NAME ShieldPPPt-PT-001A-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679523036815
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=ShieldPPPt-PT-001A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 22:10:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 22:10:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 22:10:39] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2023-03-22 22:10:39] [INFO ] Transformed 28 places.
[2023-03-22 22:10:39] [INFO ] Transformed 21 transitions.
[2023-03-22 22:10:39] [INFO ] Found NUPN structural information;
[2023-03-22 22:10:39] [INFO ] Parsed PT model containing 28 places and 21 transitions and 78 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Support contains 28 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 14 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 28 cols
[2023-03-22 22:10:40] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-22 22:10:40] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-22 22:10:40] [INFO ] Invariant cache hit.
[2023-03-22 22:10:40] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2023-03-22 22:10:40] [INFO ] Invariant cache hit.
[2023-03-22 22:10:40] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 545 ms. Remains : 28/28 places, 20/20 transitions.
Support contains 28 out of 28 places after structural reductions.
[2023-03-22 22:10:40] [INFO ] Flatten gal took : 29 ms
[2023-03-22 22:10:40] [INFO ] Flatten gal took : 7 ms
[2023-03-22 22:10:40] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 49) seen :48
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 22:10:41] [INFO ] Invariant cache hit.
[2023-03-22 22:10:41] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 22:10:41] [INFO ] After 52ms 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 16 simplifications.
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 25 ms
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:10:41] [INFO ] Input system was already deterministic with 20 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 20/20 transitions.
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 4 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 28/28 places, 20/20 transitions.
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 26 transition count 18
Applied a total of 4 rules in 3 ms. Remains 26 /28 variables (removed 2) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 26/28 places, 18/20 transitions.
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:41] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 26 transition count 18
Applied a total of 4 rules in 1 ms. Remains 26 /28 variables (removed 2) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 26/28 places, 18/20 transitions.
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:41] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 20/20 transitions.
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 20/20 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 27 transition count 19
Applied a total of 2 rules in 2 ms. Remains 27 /28 variables (removed 1) and now considering 19/20 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 27/28 places, 19/20 transitions.
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 15 ms
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:41] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 20/20 transitions.
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 20/20 transitions.
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 20/20 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 27 transition count 19
Applied a total of 2 rules in 2 ms. Remains 27 /28 variables (removed 1) and now considering 19/20 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 27/28 places, 19/20 transitions.
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 3 ms
[2023-03-22 22:10:41] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 20/20 transitions.
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 28/28 places, 20/20 transitions.
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 20/20 transitions.
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 28/28 places, 20/20 transitions.
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 20/20 transitions.
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 20/20 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 27 transition count 19
Applied a total of 2 rules in 2 ms. Remains 27 /28 variables (removed 1) and now considering 19/20 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 27/28 places, 19/20 transitions.
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Input system was already deterministic with 19 transitions.
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
FORMULA ShieldPPPt-PT-001A-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 28/28 places, 20/20 transitions.
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:41] [INFO ] Input system was already deterministic with 20 transitions.
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:41] [INFO ] Flatten gal took : 3 ms
[2023-03-22 22:10:41] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-22 22:10:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 28 places, 20 transitions and 76 arcs took 1 ms.
Total runtime 1744 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: 28 NrTr: 20 NrArc: 76)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.884sec
RS generation: 0m 0.001sec
-> reachability set: #nodes 73 (7.3e+01) #states 8,001 (3)
starting MCC model checker
--------------------------
checking: EX [[[p6<=1 & 1<=p6] & [p21<=1 & 1<=p21]]]
normalized: EX [[[p21<=1 & 1<=p21] & [p6<=1 & 1<=p6]]]
abstracting: (1<=p6)
states: 3,200 (3)
abstracting: (p6<=1)
states: 8,001 (3)
abstracting: (1<=p21)
states: 4,000 (3)
abstracting: (p21<=1)
states: 8,001 (3)
.-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AX [EX [AG [E [AF [[p26<=1 & 1<=p26]] U EG [[[p1<=1 & 1<=p1] & [p24<=1 & 1<=p24]]]]]]]
normalized: ~ [EX [~ [EX [~ [E [true U ~ [E [~ [EG [~ [[p26<=1 & 1<=p26]]]] U EG [[[p1<=1 & 1<=p1] & [p24<=1 & 1<=p24]]]]]]]]]]]
abstracting: (1<=p24)
states: 4,000 (3)
abstracting: (p24<=1)
states: 8,001 (3)
abstracting: (1<=p1)
states: 4,000 (3)
abstracting: (p1<=1)
states: 8,001 (3)
...............................
EG iterations: 31
abstracting: (1<=p26)
states: 4,000 (3)
abstracting: (p26<=1)
states: 8,001 (3)
..................................
EG iterations: 34
..-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: EF [[AG [[[p7<=1 & 1<=p7] & [p9<=1 & 1<=p9]]] & [[p3<=0 & 0<=p3] | [p26<=0 & 0<=p26]]]]
normalized: E [true U [[[p26<=0 & 0<=p26] | [p3<=0 & 0<=p3]] & ~ [E [true U ~ [[[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]]]]]]
abstracting: (1<=p7)
states: 3,200 (3)
abstracting: (p7<=1)
states: 8,001 (3)
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
abstracting: (0<=p3)
states: 8,001 (3)
abstracting: (p3<=0)
states: 4,001 (3)
abstracting: (0<=p26)
states: 8,001 (3)
abstracting: (p26<=0)
states: 4,001 (3)
-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[EF [[[p6<=1 & 1<=p6] & [p21<=1 & 1<=p21]]] | [[p5<=1 & 1<=p5] & [p22<=1 & 1<=p22]]]]
normalized: ~ [E [true U ~ [[[[p22<=1 & 1<=p22] & [p5<=1 & 1<=p5]] | E [true U [[p21<=1 & 1<=p21] & [p6<=1 & 1<=p6]]]]]]]
abstracting: (1<=p6)
states: 3,200 (3)
abstracting: (p6<=1)
states: 8,001 (3)
abstracting: (1<=p21)
states: 4,000 (3)
abstracting: (p21<=1)
states: 8,001 (3)
abstracting: (1<=p5)
states: 1,600 (3)
abstracting: (p5<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
-> the formula is TRUE
FORMULA ShieldPPPt-PT-001A-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [EG [[[[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]] & [[p16<=1 & 1<=p16] & [p27<=1 & 1<=p27]]]]]
normalized: E [true U EG [[[[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]] & [[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]]]]]
abstracting: (1<=p2)
states: 4,000 (3)
abstracting: (p2<=1)
states: 8,001 (3)
abstracting: (1<=p10)
states: 1,600 (3)
abstracting: (p10<=1)
states: 8,001 (3)
abstracting: (1<=p16)
states: 3,200 (3)
abstracting: (p16<=1)
states: 8,001 (3)
abstracting: (1<=p27)
states: 4,000 (3)
abstracting: (p27<=1)
states: 8,001 (3)
........................
EG iterations: 24
-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: E [[~ [AG [[[p5<=1 & 1<=p5] & [p22<=1 & 1<=p22]]]] | [[p3<=1 & 1<=p3] & [p26<=1 & 1<=p26]]] U AG [[[p13<=1 & 1<=p13] & [p27<=1 & 1<=p27]]]]
normalized: E [[E [true U ~ [[[p22<=1 & 1<=p22] & [p5<=1 & 1<=p5]]]] | [[p26<=1 & 1<=p26] & [p3<=1 & 1<=p3]]] U ~ [E [true U ~ [[[p27<=1 & 1<=p27] & [p13<=1 & 1<=p13]]]]]]
abstracting: (1<=p13)
states: 3,200 (3)
abstracting: (p13<=1)
states: 8,001 (3)
abstracting: (1<=p27)
states: 4,000 (3)
abstracting: (p27<=1)
states: 8,001 (3)
abstracting: (1<=p3)
states: 4,000 (3)
abstracting: (p3<=1)
states: 8,001 (3)
abstracting: (1<=p26)
states: 4,000 (3)
abstracting: (p26<=1)
states: 8,001 (3)
abstracting: (1<=p5)
states: 1,600 (3)
abstracting: (p5<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [EG [E [~ [AX [[[p4<=1 & 1<=p4] & [p23<=1 & 1<=p23]]]] U AG [AX [[[p18<=1 & 1<=p18] & [p25<=1 & 1<=p25]]]]]] & [AX [EF [EG [[[p3<=0 & 0<=p3] | [p26<=0 & 0<=p26]]]]] & EX [[[[p5<=0 & 0<=p5] | [p22<=0 & 0<=p22]] & [EF [[p26<=0 & 0<=p26]] | [[p6<=0 & 0<=p6] | [p21<=0 & 0<=p21]]]]]]]
normalized: [EG [E [EX [~ [[[p23<=1 & 1<=p23] & [p4<=1 & 1<=p4]]]] U ~ [E [true U EX [~ [[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]]]]]]] & [EX [[[E [true U [p26<=0 & 0<=p26]] | [[p21<=0 & 0<=p21] | [p6<=0 & 0<=p6]]] & [[p22<=0 & 0<=p22] | [p5<=0 & 0<=p5]]]] & ~ [EX [~ [E [true U EG [[[p26<=0 & 0<=p26] | [p3<=0 & 0<=p3]]]]]]]]]
abstracting: (0<=p3)
states: 8,001 (3)
abstracting: (p3<=0)
states: 4,001 (3)
abstracting: (0<=p26)
states: 8,001 (3)
abstracting: (p26<=0)
states: 4,001 (3)
...........................
EG iterations: 27
.abstracting: (0<=p5)
states: 8,001 (3)
abstracting: (p5<=0)
states: 6,401 (3)
abstracting: (0<=p22)
states: 8,001 (3)
abstracting: (p22<=0)
states: 4,001 (3)
abstracting: (0<=p6)
states: 8,001 (3)
abstracting: (p6<=0)
states: 4,801 (3)
abstracting: (0<=p21)
states: 8,001 (3)
abstracting: (p21<=0)
states: 4,001 (3)
abstracting: (0<=p26)
states: 8,001 (3)
abstracting: (p26<=0)
states: 4,001 (3)
.abstracting: (1<=p18)
states: 3,200 (3)
abstracting: (p18<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
.abstracting: (1<=p4)
states: 4,000 (3)
abstracting: (p4<=1)
states: 8,001 (3)
abstracting: (1<=p23)
states: 4,000 (3)
abstracting: (p23<=1)
states: 8,001 (3)
..
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: [AG [[AG [EF [[[p17<=0 & 0<=p17] | [p19<=0 & 0<=p19]]]] | AG [[[[[[p8<=1 & 1<=p8] & [p25<=1 & 1<=p25]] | [[p5<=1 & 1<=p5] & [p22<=1 & 1<=p22]]] & AG [[[p4<=1 & 1<=p4] & [p23<=1 & 1<=p23]]]] | A [[p0<=1 & 1<=p0] U [p20<=1 & 1<=p20]]]]]] & EF [[[p18<=1 & 1<=p18] & [p25<=1 & 1<=p25]]]]
normalized: [~ [E [true U ~ [[~ [E [true U ~ [[[[[[p8<=1 & 1<=p8] & [p25<=1 & 1<=p25]] | [[p22<=1 & 1<=p22] & [p5<=1 & 1<=p5]]] & ~ [E [true U ~ [[[p23<=1 & 1<=p23] & [p4<=1 & 1<=p4]]]]]] | [~ [EG [~ [[p20<=1 & 1<=p20]]]] & ~ [E [~ [[p20<=1 & 1<=p20]] U [~ [[p0<=1 & 1<=p0]] & ~ [[p20<=1 & 1<=p20]]]]]]]]]] | ~ [E [true U ~ [E [true U [[p19<=0 & 0<=p19] | [p17<=0 & 0<=p17]]]]]]]]]] & E [true U [[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]]]
abstracting: (1<=p18)
states: 3,200 (3)
abstracting: (p18<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
abstracting: (0<=p17)
states: 8,001 (3)
abstracting: (p17<=0)
states: 4,801 (3)
abstracting: (0<=p19)
states: 8,001 (3)
abstracting: (p19<=0)
states: 4,801 (3)
abstracting: (1<=p20)
states: 4,000 (3)
abstracting: (p20<=1)
states: 8,001 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 8,001 (3)
abstracting: (1<=p20)
states: 4,000 (3)
abstracting: (p20<=1)
states: 8,001 (3)
abstracting: (1<=p20)
states: 4,000 (3)
abstracting: (p20<=1)
states: 8,001 (3)
.
EG iterations: 1
abstracting: (1<=p4)
states: 4,000 (3)
abstracting: (p4<=1)
states: 8,001 (3)
abstracting: (1<=p23)
states: 4,000 (3)
abstracting: (p23<=1)
states: 8,001 (3)
abstracting: (1<=p5)
states: 1,600 (3)
abstracting: (p5<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
abstracting: (1<=p8)
states: 3,200 (3)
abstracting: (p8<=1)
states: 8,001 (3)
-> the formula is TRUE
FORMULA ShieldPPPt-PT-001A-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EG [[[AX [~ [A [[[p17<=1 & 1<=p17] & [p19<=1 & 1<=p19]] U [[p7<=1 & 1<=p7] & [p9<=1 & 1<=p9]]]]] & [[p7<=0 & 0<=p7] | [p9<=0 & 0<=p9]]] | [AG [[AF [[[p7<=0 & 0<=p7] | [p9<=0 & 0<=p9]]] | [p26<=1 & 1<=p26]]] & [AX [AF [[p22<=0 & 0<=p22]]] & AX [AG [[[p7<=0 & 0<=p7] | [p9<=0 & 0<=p9]]]]]]]]
normalized: EG [[[[~ [EX [EG [~ [[p22<=0 & 0<=p22]]]]] & ~ [EX [E [true U ~ [[[p9<=0 & 0<=p9] | [p7<=0 & 0<=p7]]]]]]] & ~ [E [true U ~ [[[p26<=1 & 1<=p26] | ~ [EG [~ [[[p9<=0 & 0<=p9] | [p7<=0 & 0<=p7]]]]]]]]]] | [[[p9<=0 & 0<=p9] | [p7<=0 & 0<=p7]] & ~ [EX [[~ [EG [~ [[[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]]]] & ~ [E [~ [[[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]] U [~ [[[p19<=1 & 1<=p19] & [p17<=1 & 1<=p17]]] & ~ [[[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]]]]]]]]]]]
abstracting: (1<=p7)
states: 3,200 (3)
abstracting: (p7<=1)
states: 8,001 (3)
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
abstracting: (1<=p17)
states: 3,200 (3)
abstracting: (p17<=1)
states: 8,001 (3)
abstracting: (1<=p19)
states: 3,200 (3)
abstracting: (p19<=1)
states: 8,001 (3)
abstracting: (1<=p7)
states: 3,200 (3)
abstracting: (p7<=1)
states: 8,001 (3)
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
abstracting: (1<=p7)
states: 3,200 (3)
abstracting: (p7<=1)
states: 8,001 (3)
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
.
EG iterations: 1
.abstracting: (0<=p7)
states: 8,001 (3)
abstracting: (p7<=0)
states: 4,801 (3)
abstracting: (0<=p9)
states: 8,001 (3)
abstracting: (p9<=0)
states: 4,801 (3)
abstracting: (0<=p7)
states: 8,001 (3)
abstracting: (p7<=0)
states: 4,801 (3)
abstracting: (0<=p9)
states: 8,001 (3)
abstracting: (p9<=0)
states: 4,801 (3)
.
EG iterations: 1
abstracting: (1<=p26)
states: 4,000 (3)
abstracting: (p26<=1)
states: 8,001 (3)
abstracting: (0<=p7)
states: 8,001 (3)
abstracting: (p7<=0)
states: 4,801 (3)
abstracting: (0<=p9)
states: 8,001 (3)
abstracting: (p9<=0)
states: 4,801 (3)
.abstracting: (0<=p22)
states: 8,001 (3)
abstracting: (p22<=0)
states: 4,001 (3)
.
EG iterations: 1
...................................
EG iterations: 34
-> the formula is TRUE
FORMULA ShieldPPPt-PT-001A-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: [EF [~ [E [[[~ [[[p13<=1 & 1<=p13] & [1<=p27 & p27<=1]]] & [p0<=1 & 1<=p0]] | [EF [[[p16<=1 & 1<=p16] & [p27<=1 & 1<=p27]]] & EX [[[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]]]]] U [AG [[[p17<=1 & 1<=p17] & [p19<=1 & 1<=p19]]] | AF [[p26<=1 & 1<=p26]]]]]] | [EX [EF [[[p18<=0 & 0<=p18] | [p25<=0 & 0<=p25]]]] & AF [[[p11<=1 & 1<=p11] & [p21<=1 & 1<=p21]]]]]
normalized: [E [true U ~ [E [[[~ [[[1<=p27 & p27<=1] & [p13<=1 & 1<=p13]]] & [p0<=1 & 1<=p0]] | [EX [[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]]] & E [true U [[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]]]]] U [~ [EG [~ [[p26<=1 & 1<=p26]]]] | ~ [E [true U ~ [[[p19<=1 & 1<=p19] & [p17<=1 & 1<=p17]]]]]]]]] | [~ [EG [~ [[[p21<=1 & 1<=p21] & [p11<=1 & 1<=p11]]]]] & EX [E [true U [[p25<=0 & 0<=p25] | [p18<=0 & 0<=p18]]]]]]
abstracting: (0<=p18)
states: 8,001 (3)
abstracting: (p18<=0)
states: 4,801 (3)
abstracting: (0<=p25)
states: 8,001 (3)
abstracting: (p25<=0)
states: 4,001 (3)
.abstracting: (1<=p11)
states: 3,200 (3)
abstracting: (p11<=1)
states: 8,001 (3)
abstracting: (1<=p21)
states: 4,000 (3)
abstracting: (p21<=1)
states: 8,001 (3)
.
EG iterations: 1
abstracting: (1<=p17)
states: 3,200 (3)
abstracting: (p17<=1)
states: 8,001 (3)
abstracting: (1<=p19)
states: 3,200 (3)
abstracting: (p19<=1)
states: 8,001 (3)
abstracting: (1<=p26)
states: 4,000 (3)
abstracting: (p26<=1)
states: 8,001 (3)
..................................
EG iterations: 34
abstracting: (1<=p16)
states: 3,200 (3)
abstracting: (p16<=1)
states: 8,001 (3)
abstracting: (1<=p27)
states: 4,000 (3)
abstracting: (p27<=1)
states: 8,001 (3)
abstracting: (1<=p2)
states: 4,000 (3)
abstracting: (p2<=1)
states: 8,001 (3)
abstracting: (1<=p10)
states: 1,600 (3)
abstracting: (p10<=1)
states: 8,001 (3)
.abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 8,001 (3)
abstracting: (1<=p13)
states: 3,200 (3)
abstracting: (p13<=1)
states: 8,001 (3)
abstracting: (p27<=1)
states: 8,001 (3)
abstracting: (1<=p27)
states: 4,000 (3)
-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AF [[[EG [[EX [[[p13<=1 & 1<=p13] & [p27<=1 & 1<=p27]]] & AG [[p20<=0 & 0<=p20]]]] & EX [[[[p17<=1 & 1<=p17] & [p19<=1 & 1<=p19]] & [[p12<=1 & 1<=p12] & [[p14<=1 & 1<=p14] & [p15<=0 & 0<=p15]]]]]] & [[p7<=1 & 1<=p7] & [[p9<=1 & 1<=p9] & [EF [[[p8<=0 & 0<=p8] | [p25<=0 & 0<=p25]]] | EG [[[p17<=0 & 0<=p17] | [p19<=0 & 0<=p19]]]]]]]]
normalized: ~ [EG [~ [[[[[EG [[[p19<=0 & 0<=p19] | [p17<=0 & 0<=p17]]] | E [true U [[p25<=0 & 0<=p25] | [p8<=0 & 0<=p8]]]] & [p9<=1 & 1<=p9]] & [p7<=1 & 1<=p7]] & [EX [[[[[p15<=0 & 0<=p15] & [p14<=1 & 1<=p14]] & [p12<=1 & 1<=p12]] & [[p19<=1 & 1<=p19] & [p17<=1 & 1<=p17]]]] & EG [[~ [E [true U ~ [[p20<=0 & 0<=p20]]]] & EX [[[p27<=1 & 1<=p27] & [p13<=1 & 1<=p13]]]]]]]]]]
abstracting: (1<=p13)
states: 3,200 (3)
abstracting: (p13<=1)
states: 8,001 (3)
abstracting: (1<=p27)
states: 4,000 (3)
abstracting: (p27<=1)
states: 8,001 (3)
.abstracting: (0<=p20)
states: 8,001 (3)
abstracting: (p20<=0)
states: 4,001 (3)
.
EG iterations: 1
abstracting: (1<=p17)
states: 3,200 (3)
abstracting: (p17<=1)
states: 8,001 (3)
abstracting: (1<=p19)
states: 3,200 (3)
abstracting: (p19<=1)
states: 8,001 (3)
abstracting: (1<=p12)
states: 3,200 (3)
abstracting: (p12<=1)
states: 8,001 (3)
abstracting: (1<=p14)
states: 3,200 (3)
abstracting: (p14<=1)
states: 8,001 (3)
abstracting: (0<=p15)
states: 8,001 (3)
abstracting: (p15<=0)
states: 6,401 (3)
.abstracting: (1<=p7)
states: 3,200 (3)
abstracting: (p7<=1)
states: 8,001 (3)
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
abstracting: (0<=p8)
states: 8,001 (3)
abstracting: (p8<=0)
states: 4,801 (3)
abstracting: (0<=p25)
states: 8,001 (3)
abstracting: (p25<=0)
states: 4,001 (3)
abstracting: (0<=p17)
states: 8,001 (3)
abstracting: (p17<=0)
states: 4,801 (3)
abstracting: (0<=p19)
states: 8,001 (3)
abstracting: (p19<=0)
states: 4,801 (3)
.........
EG iterations: 9
EG iterations: 0
-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[[[p4<=0 & 0<=p4] | [p23<=0 & 0<=p23]] | [[E [[p15<=1 & 1<=p15] U [p20<=1 & 1<=p20]] & [[[p22<=1 & 1<=p22] | [p15<=1 & 1<=p15]] | [[[p3<=1 & 1<=p3] & [p26<=1 & 1<=p26]] | [[p18<=1 & 1<=p18] & [p25<=1 & 1<=p25]]]]] | [[p15<=0 & 0<=p15] & [EX [[[p11<=0 & 0<=p11] | [p21<=0 & 0<=p21]]] | AX [[[p3<=0 & 0<=p3] | [p26<=0 & 0<=p26]]]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [EX [~ [[[p26<=0 & 0<=p26] | [p3<=0 & 0<=p3]]]]] | EX [[[p21<=0 & 0<=p21] | [p11<=0 & 0<=p11]]]] & [p15<=0 & 0<=p15]] | [[[[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]] | [[p26<=1 & 1<=p26] & [p3<=1 & 1<=p3]]] | [[p15<=1 & 1<=p15] | [p22<=1 & 1<=p22]]] & E [[p15<=1 & 1<=p15] U [p20<=1 & 1<=p20]]]] | [[p23<=0 & 0<=p23] | [p4<=0 & 0<=p4]]]]]]
abstracting: (0<=p4)
states: 8,001 (3)
abstracting: (p4<=0)
states: 4,001 (3)
abstracting: (0<=p23)
states: 8,001 (3)
abstracting: (p23<=0)
states: 4,001 (3)
abstracting: (1<=p20)
states: 4,000 (3)
abstracting: (p20<=1)
states: 8,001 (3)
abstracting: (1<=p15)
states: 1,600 (3)
abstracting: (p15<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
abstracting: (1<=p15)
states: 1,600 (3)
abstracting: (p15<=1)
states: 8,001 (3)
abstracting: (1<=p3)
states: 4,000 (3)
abstracting: (p3<=1)
states: 8,001 (3)
abstracting: (1<=p26)
states: 4,000 (3)
abstracting: (p26<=1)
states: 8,001 (3)
abstracting: (1<=p18)
states: 3,200 (3)
abstracting: (p18<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
abstracting: (0<=p15)
states: 8,001 (3)
abstracting: (p15<=0)
states: 6,401 (3)
abstracting: (0<=p11)
states: 8,001 (3)
abstracting: (p11<=0)
states: 4,801 (3)
abstracting: (0<=p21)
states: 8,001 (3)
abstracting: (p21<=0)
states: 4,001 (3)
.abstracting: (0<=p3)
states: 8,001 (3)
abstracting: (p3<=0)
states: 4,001 (3)
abstracting: (0<=p26)
states: 8,001 (3)
abstracting: (p26<=0)
states: 4,001 (3)
.-> the formula is TRUE
FORMULA ShieldPPPt-PT-001A-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[EF [[[[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]] | [[[p5<=1 & 1<=p5] & [p22<=1 & 1<=p22]] | [[p5<=1 & 1<=p5] & [p22<=1 & 1<=p22]]]]] | ~ [A [[[p7<=1 & 1<=p7] & [p9<=1 & 1<=p9]] U [EX [[p26<=1 & 1<=p26]] | [~ [[[p24<=1 & 1<=p24] | [[p12<=1 & 1<=p12] & [p14<=1 & 1<=p14]]]] | [[p8<=1 & 1<=p8] & [[p25<=1 & 1<=p25] & [p20<=1 & 1<=p20]]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [EG [~ [[[[[[p20<=1 & 1<=p20] & [p25<=1 & 1<=p25]] & [p8<=1 & 1<=p8]] | ~ [[[[p14<=1 & 1<=p14] & [p12<=1 & 1<=p12]] | [p24<=1 & 1<=p24]]]] | EX [[p26<=1 & 1<=p26]]]]]] & ~ [E [~ [[[[[[p20<=1 & 1<=p20] & [p25<=1 & 1<=p25]] & [p8<=1 & 1<=p8]] | ~ [[[[p14<=1 & 1<=p14] & [p12<=1 & 1<=p12]] | [p24<=1 & 1<=p24]]]] | EX [[p26<=1 & 1<=p26]]]] U [~ [[[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]] & ~ [[[[[[p20<=1 & 1<=p20] & [p25<=1 & 1<=p25]] & [p8<=1 & 1<=p8]] | ~ [[[[p14<=1 & 1<=p14] & [p12<=1 & 1<=p12]] | [p24<=1 & 1<=p24]]]] | EX [[p26<=1 & 1<=p26]]]]]]]]] | E [true U [[[[p22<=1 & 1<=p22] & [p5<=1 & 1<=p5]] | [[p22<=1 & 1<=p22] & [p5<=1 & 1<=p5]]] | [[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]]]]]]]]
abstracting: (1<=p2)
states: 4,000 (3)
abstracting: (p2<=1)
states: 8,001 (3)
abstracting: (1<=p10)
states: 1,600 (3)
abstracting: (p10<=1)
states: 8,001 (3)
abstracting: (1<=p5)
states: 1,600 (3)
abstracting: (p5<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
abstracting: (1<=p5)
states: 1,600 (3)
abstracting: (p5<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
abstracting: (1<=p26)
states: 4,000 (3)
abstracting: (p26<=1)
states: 8,001 (3)
.abstracting: (1<=p24)
states: 4,000 (3)
abstracting: (p24<=1)
states: 8,001 (3)
abstracting: (1<=p12)
states: 3,200 (3)
abstracting: (p12<=1)
states: 8,001 (3)
abstracting: (1<=p14)
states: 3,200 (3)
abstracting: (p14<=1)
states: 8,001 (3)
abstracting: (1<=p8)
states: 3,200 (3)
abstracting: (p8<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
abstracting: (1<=p20)
states: 4,000 (3)
abstracting: (p20<=1)
states: 8,001 (3)
abstracting: (1<=p7)
states: 3,200 (3)
abstracting: (p7<=1)
states: 8,001 (3)
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
abstracting: (1<=p26)
states: 4,000 (3)
abstracting: (p26<=1)
states: 8,001 (3)
.abstracting: (1<=p24)
states: 4,000 (3)
abstracting: (p24<=1)
states: 8,001 (3)
abstracting: (1<=p12)
states: 3,200 (3)
abstracting: (p12<=1)
states: 8,001 (3)
abstracting: (1<=p14)
states: 3,200 (3)
abstracting: (p14<=1)
states: 8,001 (3)
abstracting: (1<=p8)
states: 3,200 (3)
abstracting: (p8<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
abstracting: (1<=p20)
states: 4,000 (3)
abstracting: (p20<=1)
states: 8,001 (3)
abstracting: (1<=p26)
states: 4,000 (3)
abstracting: (p26<=1)
states: 8,001 (3)
.abstracting: (1<=p24)
states: 4,000 (3)
abstracting: (p24<=1)
states: 8,001 (3)
abstracting: (1<=p12)
states: 3,200 (3)
abstracting: (p12<=1)
states: 8,001 (3)
abstracting: (1<=p14)
states: 3,200 (3)
abstracting: (p14<=1)
states: 8,001 (3)
abstracting: (1<=p8)
states: 3,200 (3)
abstracting: (p8<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
abstracting: (1<=p20)
states: 4,000 (3)
abstracting: (p20<=1)
states: 8,001 (3)
...........................
EG iterations: 27
-> the formula is TRUE
FORMULA ShieldPPPt-PT-001A-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: [EF [[[[[[[p3<=0 & 0<=p3] | [p26<=0 & 0<=p26]] & [[[p2<=0 & 0<=p2] | [p10<=0 & 0<=p10]] & [[[p3<=0 & 0<=p3] | [p26<=0 & 0<=p26]] | [[p16<=0 & 0<=p16] | [p27<=0 & 0<=p27]]]]] | [[[p18<=0 & 0<=p18] | [p25<=0 & 0<=p25]] & [[[p2<=0 & 0<=p2] | [p10<=0 & 0<=p10]] & [[p11<=0 & 0<=p11] | [p21<=0 & 0<=p21]]]]] & [[~ [[p6<=1 & 1<=p6]] | ~ [[p21<=1 & 1<=p21]]] & [~ [[p18<=1 & 1<=p18]] | ~ [[p25<=1 & 1<=p25]]]]] | [~ [A [[[p13<=1 & 1<=p13] & [p27<=1 & 1<=p27]] U AF [[p0<=1 & 1<=p0]]]] | [AG [[[p11<=1 & 1<=p11] & [p21<=1 & 1<=p21]]] & [[p13<=1 & 1<=p13] & [p27<=1 & 1<=p27]]]]]] & EG [[AG [[p15<=0 & 0<=p15]] | [[p6<=0 & 0<=p6] | [p21<=0 & 0<=p21]]]]]
normalized: [EG [[[[p21<=0 & 0<=p21] | [p6<=0 & 0<=p6]] | ~ [E [true U ~ [[p15<=0 & 0<=p15]]]]]] & E [true U [[[[[p27<=1 & 1<=p27] & [p13<=1 & 1<=p13]] & ~ [E [true U ~ [[[p21<=1 & 1<=p21] & [p11<=1 & 1<=p11]]]]]] | ~ [[~ [EG [EG [~ [[p0<=1 & 1<=p0]]]]] & ~ [E [EG [~ [[p0<=1 & 1<=p0]]] U [~ [[[p27<=1 & 1<=p27] & [p13<=1 & 1<=p13]]] & EG [~ [[p0<=1 & 1<=p0]]]]]]]]] | [[[~ [[p25<=1 & 1<=p25]] | ~ [[p18<=1 & 1<=p18]]] & [~ [[p21<=1 & 1<=p21]] | ~ [[p6<=1 & 1<=p6]]]] & [[[[[p21<=0 & 0<=p21] | [p11<=0 & 0<=p11]] & [[p10<=0 & 0<=p10] | [p2<=0 & 0<=p2]]] & [[p25<=0 & 0<=p25] | [p18<=0 & 0<=p18]]] | [[[[[p27<=0 & 0<=p27] | [p16<=0 & 0<=p16]] | [[p26<=0 & 0<=p26] | [p3<=0 & 0<=p3]]] & [[p10<=0 & 0<=p10] | [p2<=0 & 0<=p2]]] & [[p26<=0 & 0<=p26] | [p3<=0 & 0<=p3]]]]]]]]
abstracting: (0<=p3)
states: 8,001 (3)
abstracting: (p3<=0)
states: 4,001 (3)
abstracting: (0<=p26)
states: 8,001 (3)
abstracting: (p26<=0)
states: 4,001 (3)
abstracting: (0<=p2)
states: 8,001 (3)
abstracting: (p2<=0)
states: 4,001 (3)
abstracting: (0<=p10)
states: 8,001 (3)
abstracting: (p10<=0)
states: 6,401 (3)
abstracting: (0<=p3)
states: 8,001 (3)
abstracting: (p3<=0)
states: 4,001 (3)
abstracting: (0<=p26)
states: 8,001 (3)
abstracting: (p26<=0)
states: 4,001 (3)
abstracting: (0<=p16)
states: 8,001 (3)
abstracting: (p16<=0)
states: 4,801 (3)
abstracting: (0<=p27)
states: 8,001 (3)
abstracting: (p27<=0)
states: 4,001 (3)
abstracting: (0<=p18)
states: 8,001 (3)
abstracting: (p18<=0)
states: 4,801 (3)
abstracting: (0<=p25)
states: 8,001 (3)
abstracting: (p25<=0)
states: 4,001 (3)
abstracting: (0<=p2)
states: 8,001 (3)
abstracting: (p2<=0)
states: 4,001 (3)
abstracting: (0<=p10)
states: 8,001 (3)
abstracting: (p10<=0)
states: 6,401 (3)
abstracting: (0<=p11)
states: 8,001 (3)
abstracting: (p11<=0)
states: 4,801 (3)
abstracting: (0<=p21)
states: 8,001 (3)
abstracting: (p21<=0)
states: 4,001 (3)
abstracting: (1<=p6)
states: 3,200 (3)
abstracting: (p6<=1)
states: 8,001 (3)
abstracting: (1<=p21)
states: 4,000 (3)
abstracting: (p21<=1)
states: 8,001 (3)
abstracting: (1<=p18)
states: 3,200 (3)
abstracting: (p18<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 8,001 (3)
.
EG iterations: 1
abstracting: (1<=p13)
states: 3,200 (3)
abstracting: (p13<=1)
states: 8,001 (3)
abstracting: (1<=p27)
states: 4,000 (3)
abstracting: (p27<=1)
states: 8,001 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 8,001 (3)
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 8,001 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p11)
states: 3,200 (3)
abstracting: (p11<=1)
states: 8,001 (3)
abstracting: (1<=p21)
states: 4,000 (3)
abstracting: (p21<=1)
states: 8,001 (3)
abstracting: (1<=p13)
states: 3,200 (3)
abstracting: (p13<=1)
states: 8,001 (3)
abstracting: (1<=p27)
states: 4,000 (3)
abstracting: (p27<=1)
states: 8,001 (3)
abstracting: (0<=p15)
states: 8,001 (3)
abstracting: (p15<=0)
states: 6,401 (3)
abstracting: (0<=p6)
states: 8,001 (3)
abstracting: (p6<=0)
states: 4,801 (3)
abstracting: (0<=p21)
states: 8,001 (3)
abstracting: (p21<=0)
states: 4,001 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldPPPt-PT-001A-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: [EF [[[[p12<=1 & 1<=p12] & [p14<=1 & 1<=p14]] | AG [[[p18<=1 & 1<=p18] & [p25<=1 & 1<=p25]]]]] | A [[EX [[[p11<=1 & 1<=p11] & [p21<=1 & 1<=p21]]] & ~ [A [AF [[[p8<=1 & 1<=p8] & [p25<=1 & 1<=p25]]] U [[[p11<=1 & 1<=p11] & [[p21<=1 & 1<=p21] & [p20<=1 & 1<=p20]]] | [[p22<=1 & 1<=p22] | [[p13<=1 & 1<=p13] & [p27<=1 & 1<=p27]]]]]]] U A [[AG [~ [[p15<=1 & 1<=p15]]] | [~ [[[p24<=1 & 1<=p24] | [[p16<=1 & 1<=p16] & [p27<=1 & 1<=p27]]]] & A [[p24<=1 & 1<=p24] U [[p18<=1 & 1<=p18] & [p25<=1 & 1<=p25]]]]] U E [[AF [[p22<=1 & 1<=p22]] | EX [[[p8<=1 & 1<=p8] & [p25<=1 & 1<=p25]]]] U [EF [[p20<=1 & 1<=p20]] | [[[p7<=1 & 1<=p7] & [p9<=1 & 1<=p9]] | [p26<=1 & 1<=p26]]]]]]]
normalized: [[~ [EG [~ [[~ [EG [~ [E [[EX [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]]] | ~ [EG [~ [[p22<=1 & 1<=p22]]]]] U [[[p26<=1 & 1<=p26] | [[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]] | E [true U [p20<=1 & 1<=p20]]]]]]] & ~ [E [~ [E [[EX [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]]] | ~ [EG [~ [[p22<=1 & 1<=p22]]]]] U [[[p26<=1 & 1<=p26] | [[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]] | E [true U [p20<=1 & 1<=p20]]]]] U [~ [[[[~ [EG [~ [[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]]]] & ~ [E [~ [[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]] U [~ [[p24<=1 & 1<=p24]] & ~ [[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]]]]]] & ~ [[[[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]] | [p24<=1 & 1<=p24]]]] | ~ [E [true U [p15<=1 & 1<=p15]]]]] & ~ [E [[EX [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]]] | ~ [EG [~ [[p22<=1 & 1<=p22]]]]] U [[[p26<=1 & 1<=p26] | [[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]] | E [true U [p20<=1 & 1<=p20]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [E [[EX [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]]] | ~ [EG [~ [[p22<=1 & 1<=p22]]]]] U [[[p26<=1 & 1<=p26] | [[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]] | E [true U [p20<=1 & 1<=p20]]]]]]] & ~ [E [~ [E [[EX [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]]] | ~ [EG [~ [[p22<=1 & 1<=p22]]]]] U [[[p26<=1 & 1<=p26] | [[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]] | E [true U [p20<=1 & 1<=p20]]]]] U [~ [[[[~ [EG [~ [[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]]]] & ~ [E [~ [[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]] U [~ [[p24<=1 & 1<=p24]] & ~ [[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]]]]]] & ~ [[[[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]] | [p24<=1 & 1<=p24]]]] | ~ [E [true U [p15<=1 & 1<=p15]]]]] & ~ [E [[EX [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]]] | ~ [EG [~ [[p22<=1 & 1<=p22]]]]] U [[[p26<=1 & 1<=p26] | [[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]] | E [true U [p20<=1 & 1<=p20]]]]]]]]]] U [~ [[~ [[~ [EG [~ [[[[[p27<=1 & 1<=p27] & [p13<=1 & 1<=p13]] | [p22<=1 & 1<=p22]] | [[[p20<=1 & 1<=p20] & [p21<=1 & 1<=p21]] & [p11<=1 & 1<=p11]]]]]] & ~ [E [~ [[[[[p27<=1 & 1<=p27] & [p13<=1 & 1<=p13]] | [p22<=1 & 1<=p22]] | [[[p20<=1 & 1<=p20] & [p21<=1 & 1<=p21]] & [p11<=1 & 1<=p11]]]] U [EG [~ [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]]]] & ~ [[[[[p27<=1 & 1<=p27] & [p13<=1 & 1<=p13]] | [p22<=1 & 1<=p22]] | [[[p20<=1 & 1<=p20] & [p21<=1 & 1<=p21]] & [p11<=1 & 1<=p11]]]]]]]]] & EX [[[p21<=1 & 1<=p21] & [p11<=1 & 1<=p11]]]]] & ~ [[~ [EG [~ [E [[EX [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]]] | ~ [EG [~ [[p22<=1 & 1<=p22]]]]] U [[[p26<=1 & 1<=p26] | [[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]] | E [true U [p20<=1 & 1<=p20]]]]]]] & ~ [E [~ [E [[EX [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]]] | ~ [EG [~ [[p22<=1 & 1<=p22]]]]] U [[[p26<=1 & 1<=p26] | [[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]] | E [true U [p20<=1 & 1<=p20]]]]] U [~ [[[[~ [EG [~ [[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]]]] & ~ [E [~ [[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]] U [~ [[p24<=1 & 1<=p24]] & ~ [[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]]]]]] & ~ [[[[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]] | [p24<=1 & 1<=p24]]]] | ~ [E [true U [p15<=1 & 1<=p15]]]]] & ~ [E [[EX [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]]] | ~ [EG [~ [[p22<=1 & 1<=p22]]]]] U [[[p26<=1 & 1<=p26] | [[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]] | E [true U [p20<=1 & 1<=p20]]]]]]]]]]]]]] | E [true U [~ [E [true U ~ [[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]]]] | [[p14<=1 & 1<=p14] & [p12<=1 & 1<=p12]]]]]
abstracting: (1<=p12)
states: 3,200 (3)
abstracting: (p12<=1)
states: 8,001 (3)
abstracting: (1<=p14)
states: 3,200 (3)
abstracting: (p14<=1)
states: 8,001 (3)
abstracting: (1<=p18)
states: 3,200 (3)
abstracting: (p18<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
abstracting: (1<=p20)
states: 4,000 (3)
abstracting: (p20<=1)
states: 8,001 (3)
abstracting: (1<=p7)
states: 3,200 (3)
abstracting: (p7<=1)
states: 8,001 (3)
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
abstracting: (1<=p26)
states: 4,000 (3)
abstracting: (p26<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
.
EG iterations: 1
abstracting: (1<=p8)
states: 3,200 (3)
abstracting: (p8<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
.abstracting: (1<=p15)
states: 1,600 (3)
abstracting: (p15<=1)
states: 8,001 (3)
abstracting: (1<=p24)
states: 4,000 (3)
abstracting: (p24<=1)
states: 8,001 (3)
abstracting: (1<=p16)
states: 3,200 (3)
abstracting: (p16<=1)
states: 8,001 (3)
abstracting: (1<=p27)
states: 4,000 (3)
abstracting: (p27<=1)
states: 8,001 (3)
abstracting: (1<=p18)
states: 3,200 (3)
abstracting: (p18<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
abstracting: (1<=p24)
states: 4,000 (3)
abstracting: (p24<=1)
states: 8,001 (3)
abstracting: (1<=p18)
states: 3,200 (3)
abstracting: (p18<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
abstracting: (1<=p18)
states: 3,200 (3)
abstracting: (p18<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
.................................
EG iterations: 33
abstracting: (1<=p20)
states: 4,000 (3)
abstracting: (p20<=1)
states: 8,001 (3)
abstracting: (1<=p7)
states: 3,200 (3)
abstracting: (p7<=1)
states: 8,001 (3)
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
abstracting: (1<=p26)
states: 4,000 (3)
abstracting: (p26<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
.
EG iterations: 1
abstracting: (1<=p8)
states: 3,200 (3)
abstracting: (p8<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
.abstracting: (1<=p20)
states: 4,000 (3)
abstracting: (p20<=1)
states: 8,001 (3)
abstracting: (1<=p7)
states: 3,200 (3)
abstracting: (p7<=1)
states: 8,001 (3)
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
abstracting: (1<=p26)
states: 4,000 (3)
abstracting: (p26<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
.
EG iterations: 1
abstracting: (1<=p8)
states: 3,200 (3)
abstracting: (p8<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
..
EG iterations: 1
abstracting: (1<=p11)
states: 3,200 (3)
abstracting: (p11<=1)
states: 8,001 (3)
abstracting: (1<=p21)
states: 4,000 (3)
abstracting: (p21<=1)
states: 8,001 (3)
.abstracting: (1<=p11)
states: 3,200 (3)
abstracting: (p11<=1)
states: 8,001 (3)
abstracting: (1<=p21)
states: 4,000 (3)
abstracting: (p21<=1)
states: 8,001 (3)
abstracting: (1<=p20)
states: 4,000 (3)
abstracting: (p20<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
abstracting: (1<=p13)
states: 3,200 (3)
abstracting: (p13<=1)
states: 8,001 (3)
abstracting: (1<=p27)
states: 4,000 (3)
abstracting: (p27<=1)
states: 8,001 (3)
abstracting: (1<=p8)
states: 3,200 (3)
abstracting: (p8<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
....................................
EG iterations: 36
abstracting: (1<=p11)
states: 3,200 (3)
abstracting: (p11<=1)
states: 8,001 (3)
abstracting: (1<=p21)
states: 4,000 (3)
abstracting: (p21<=1)
states: 8,001 (3)
abstracting: (1<=p20)
states: 4,000 (3)
abstracting: (p20<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
abstracting: (1<=p13)
states: 3,200 (3)
abstracting: (p13<=1)
states: 8,001 (3)
abstracting: (1<=p27)
states: 4,000 (3)
abstracting: (p27<=1)
states: 8,001 (3)
abstracting: (1<=p11)
states: 3,200 (3)
abstracting: (p11<=1)
states: 8,001 (3)
abstracting: (1<=p21)
states: 4,000 (3)
abstracting: (p21<=1)
states: 8,001 (3)
abstracting: (1<=p20)
states: 4,000 (3)
abstracting: (p20<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
abstracting: (1<=p13)
states: 3,200 (3)
abstracting: (p13<=1)
states: 8,001 (3)
abstracting: (1<=p27)
states: 4,000 (3)
abstracting: (p27<=1)
states: 8,001 (3)
.................
EG iterations: 17
abstracting: (1<=p20)
states: 4,000 (3)
abstracting: (p20<=1)
states: 8,001 (3)
abstracting: (1<=p7)
states: 3,200 (3)
abstracting: (p7<=1)
states: 8,001 (3)
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
abstracting: (1<=p26)
states: 4,000 (3)
abstracting: (p26<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
.
EG iterations: 1
abstracting: (1<=p8)
states: 3,200 (3)
abstracting: (p8<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
.abstracting: (1<=p15)
states: 1,600 (3)
abstracting: (p15<=1)
states: 8,001 (3)
abstracting: (1<=p24)
states: 4,000 (3)
abstracting: (p24<=1)
states: 8,001 (3)
abstracting: (1<=p16)
states: 3,200 (3)
abstracting: (p16<=1)
states: 8,001 (3)
abstracting: (1<=p27)
states: 4,000 (3)
abstracting: (p27<=1)
states: 8,001 (3)
abstracting: (1<=p18)
states: 3,200 (3)
abstracting: (p18<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
abstracting: (1<=p24)
states: 4,000 (3)
abstracting: (p24<=1)
states: 8,001 (3)
abstracting: (1<=p18)
states: 3,200 (3)
abstracting: (p18<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
abstracting: (1<=p18)
states: 3,200 (3)
abstracting: (p18<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
.................................
EG iterations: 33
abstracting: (1<=p20)
states: 4,000 (3)
abstracting: (p20<=1)
states: 8,001 (3)
abstracting: (1<=p7)
states: 3,200 (3)
abstracting: (p7<=1)
states: 8,001 (3)
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
abstracting: (1<=p26)
states: 4,000 (3)
abstracting: (p26<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
.
EG iterations: 1
abstracting: (1<=p8)
states: 3,200 (3)
abstracting: (p8<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
.abstracting: (1<=p20)
states: 4,000 (3)
abstracting: (p20<=1)
states: 8,001 (3)
abstracting: (1<=p7)
states: 3,200 (3)
abstracting: (p7<=1)
states: 8,001 (3)
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
abstracting: (1<=p26)
states: 4,000 (3)
abstracting: (p26<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
.
EG iterations: 1
abstracting: (1<=p8)
states: 3,200 (3)
abstracting: (p8<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
..
EG iterations: 1
abstracting: (1<=p20)
states: 4,000 (3)
abstracting: (p20<=1)
states: 8,001 (3)
abstracting: (1<=p7)
states: 3,200 (3)
abstracting: (p7<=1)
states: 8,001 (3)
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
abstracting: (1<=p26)
states: 4,000 (3)
abstracting: (p26<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
.
EG iterations: 1
abstracting: (1<=p8)
states: 3,200 (3)
abstracting: (p8<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
.abstracting: (1<=p15)
states: 1,600 (3)
abstracting: (p15<=1)
states: 8,001 (3)
abstracting: (1<=p24)
states: 4,000 (3)
abstracting: (p24<=1)
states: 8,001 (3)
abstracting: (1<=p16)
states: 3,200 (3)
abstracting: (p16<=1)
states: 8,001 (3)
abstracting: (1<=p27)
states: 4,000 (3)
abstracting: (p27<=1)
states: 8,001 (3)
abstracting: (1<=p18)
states: 3,200 (3)
abstracting: (p18<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
abstracting: (1<=p24)
states: 4,000 (3)
abstracting: (p24<=1)
states: 8,001 (3)
abstracting: (1<=p18)
states: 3,200 (3)
abstracting: (p18<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
abstracting: (1<=p18)
states: 3,200 (3)
abstracting: (p18<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
.................................
EG iterations: 33
abstracting: (1<=p20)
states: 4,000 (3)
abstracting: (p20<=1)
states: 8,001 (3)
abstracting: (1<=p7)
states: 3,200 (3)
abstracting: (p7<=1)
states: 8,001 (3)
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
abstracting: (1<=p26)
states: 4,000 (3)
abstracting: (p26<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
.
EG iterations: 1
abstracting: (1<=p8)
states: 3,200 (3)
abstracting: (p8<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
.abstracting: (1<=p20)
states: 4,000 (3)
abstracting: (p20<=1)
states: 8,001 (3)
abstracting: (1<=p7)
states: 3,200 (3)
abstracting: (p7<=1)
states: 8,001 (3)
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
abstracting: (1<=p26)
states: 4,000 (3)
abstracting: (p26<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
.
EG iterations: 1
abstracting: (1<=p8)
states: 3,200 (3)
abstracting: (p8<=1)
states: 8,001 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldPPPt-PT-001A-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
totally nodes used: 58565 (5.9e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 40020 109711 149731
used/not used/entry size/cache size: 163597 66945267 16 1024MB
basic ops cache: hits/miss/sum: 13673 29652 43325
used/not used/entry size/cache size: 61547 16715669 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: 896 972 1868
used/not used/entry size/cache size: 972 8387636 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 67051773
1 55671
2 1366
3 54
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.685sec
BK_STOP 1679523046313
--------------------
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.012sec
iterations count:311 (15), effective:76 (3)
initing FirstDep: 0m 0.000sec
iterations count:20 (1), effective:0 (0)
iterations count:23 (1), effective:1 (0)
iterations count:119 (5), effective:22 (1)
iterations count:30 (1), effective:4 (0)
iterations count:22 (1), effective:1 (0)
iterations count:69 (3), effective:11 (0)
iterations count:22 (1), effective:1 (0)
iterations count:25 (1), effective:2 (0)
iterations count:61 (3), effective:11 (0)
iterations count:21 (1), effective:1 (0)
iterations count:36 (1), effective:1 (0)
iterations count:30 (1), effective:1 (0)
iterations count:22 (1), effective:1 (0)
iterations count:21 (1), effective:1 (0)
iterations count:124 (6), effective:23 (1)
iterations count:122 (6), effective:22 (1)
iterations count:29 (1), effective:1 (0)
iterations count:21 (1), effective:1 (0)
iterations count:67 (3), effective:11 (0)
iterations count:20 (1), effective:0 (0)
iterations count:73 (3), effective:12 (0)
iterations count:37 (1), effective:5 (0)
iterations count:84 (4), effective:13 (0)
iterations count:72 (3), effective:12 (0)
iterations count:23 (1), effective:1 (0)
iterations count:30 (1), effective:4 (0)
iterations count:26 (1), effective:1 (0)
iterations count:20 (1), effective:0 (0)
iterations count:68 (3), effective:11 (0)
iterations count:29 (1), effective:1 (0)
iterations count:73 (3), effective:12 (0)
iterations count:73 (3), effective:12 (0)
iterations count:20 (1), effective:0 (0)
iterations count:68 (3), effective:11 (0)
iterations count:37 (1), effective:6 (0)
iterations count:73 (3), effective:12 (0)
iterations count:20 (1), effective:0 (0)
iterations count:73 (3), effective:12 (0)
iterations count:20 (1), effective:0 (0)
iterations count:42 (2), effective:5 (0)
iterations count:73 (3), effective:12 (0)
iterations count:20 (1), effective:0 (0)
iterations count:68 (3), effective:11 (0)
iterations count:37 (1), effective:6 (0)
iterations count:73 (3), effective:12 (0)
iterations count:20 (1), effective:0 (0)
iterations count:73 (3), effective:12 (0)
iterations count:20 (1), effective:0 (0)
iterations count:73 (3), effective:12 (0)
iterations count:20 (1), effective:0 (0)
iterations count:68 (3), effective:11 (0)
iterations count:37 (1), effective:6 (0)
iterations count:73 (3), effective:12 (0)
iterations count:20 (1), effective:0 (0)
iterations count:73 (3), effective:12 (0)
iterations count:20 (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="ShieldPPPt-PT-001A"
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 ShieldPPPt-PT-001A, 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 r394-oct2-167903718000530"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-001A.tgz
mv ShieldPPPt-PT-001A 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 ;