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.r330-tall-167889203300466.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 Referendum-PT-0010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203300466
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 11K Feb 26 17:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 17:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 17:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 17:23 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 7.1K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 17:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 17:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 26 17:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 147K Feb 26 17:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 12K 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 Referendum-PT-0010-CTLFireability-00
FORMULA_NAME Referendum-PT-0010-CTLFireability-01
FORMULA_NAME Referendum-PT-0010-CTLFireability-02
FORMULA_NAME Referendum-PT-0010-CTLFireability-03
FORMULA_NAME Referendum-PT-0010-CTLFireability-04
FORMULA_NAME Referendum-PT-0010-CTLFireability-05
FORMULA_NAME Referendum-PT-0010-CTLFireability-06
FORMULA_NAME Referendum-PT-0010-CTLFireability-07
FORMULA_NAME Referendum-PT-0010-CTLFireability-08
FORMULA_NAME Referendum-PT-0010-CTLFireability-09
FORMULA_NAME Referendum-PT-0010-CTLFireability-10
FORMULA_NAME Referendum-PT-0010-CTLFireability-11
FORMULA_NAME Referendum-PT-0010-CTLFireability-12
FORMULA_NAME Referendum-PT-0010-CTLFireability-13
FORMULA_NAME Referendum-PT-0010-CTLFireability-14
FORMULA_NAME Referendum-PT-0010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679164173919

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=Referendum-PT-0010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 18:29:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 18:29:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 18:29:35] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-18 18:29:35] [INFO ] Transformed 31 places.
[2023-03-18 18:29:35] [INFO ] Transformed 21 transitions.
[2023-03-18 18:29:35] [INFO ] Found NUPN structural information;
[2023-03-18 18:29:35] [INFO ] Parsed PT model containing 31 places and 21 transitions and 51 arcs in 81 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 11 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 11 transition count 11
Applied a total of 30 rules in 9 ms. Remains 11 /31 variables (removed 20) and now considering 11/21 (removed 10) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-18 18:29:35] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-18 18:29:35] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-18 18:29:35] [INFO ] Invariant cache hit.
[2023-03-18 18:29:35] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-18 18:29:35] [INFO ] Invariant cache hit.
[2023-03-18 18:29:35] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/31 places, 11/21 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 11/31 places, 11/21 transitions.
Support contains 11 out of 11 places after structural reductions.
[2023-03-18 18:29:36] [INFO ] Flatten gal took : 16 ms
[2023-03-18 18:29:36] [INFO ] Flatten gal took : 5 ms
[2023-03-18 18:29:36] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10000 steps, including 833 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 37) seen :32
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-18 18:29:36] [INFO ] Invariant cache hit.
[2023-03-18 18:29:36] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-18 18:29:36] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2023-03-18 18:29:36] [INFO ] Flatten gal took : 4 ms
[2023-03-18 18:29:36] [INFO ] Flatten gal took : 4 ms
[2023-03-18 18:29:36] [INFO ] Input system was already deterministic with 11 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 5 formulas.
FORMULA Referendum-PT-0010-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-18 18:29:36] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:36] [INFO ] Flatten gal took : 2 ms
[2023-03-18 18:29:36] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 3 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-18 18:29:36] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:36] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:36] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-18 18:29:36] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:36] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:36] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:37] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Referendum-PT-0010-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:37] [INFO ] Input system was already deterministic with 11 transitions.
Support contains 0 out of 11 places (down from 11) after GAL structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 18:29:37] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:37] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:37] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Graph (complete) has 10 edges and 11 vertex of which 6 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Applied a total of 1 rules in 2 ms. Remains 6 /11 variables (removed 5) and now considering 6/11 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 6/11 places, 6/11 transitions.
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:29:37] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Graph (complete) has 10 edges and 11 vertex of which 2 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Applied a total of 1 rules in 0 ms. Remains 2 /11 variables (removed 9) and now considering 2/11 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 2/11 places, 2/11 transitions.
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:29:37] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6 transition count 6
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6 transition count 6
Applied a total of 10 rules in 1 ms. Remains 6 /11 variables (removed 5) and now considering 6/11 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 6/11 places, 6/11 transitions.
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:37] [INFO ] Input system was already deterministic with 6 transitions.
Support contains 0 out of 6 places (down from 5) after GAL structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3 transition count 3
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3 transition count 3
Applied a total of 16 rules in 1 ms. Remains 3 /11 variables (removed 8) and now considering 3/11 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 3/11 places, 3/11 transitions.
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:29:37] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 8 transition count 8
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 8 transition count 8
Applied a total of 6 rules in 1 ms. Remains 8 /11 variables (removed 3) and now considering 8/11 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/11 places, 8/11 transitions.
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:37] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 8 transition count 8
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 8 transition count 8
Applied a total of 6 rules in 0 ms. Remains 8 /11 variables (removed 3) and now considering 8/11 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 8/11 places, 8/11 transitions.
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:29:37] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:29:37] [INFO ] Input system was already deterministic with 11 transitions.
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 18:29:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 18:29:37] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-18 18:29:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 11 places, 11 transitions and 21 arcs took 1 ms.
Total runtime 1780 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: 11 NrTr: 11 NrArc: 21)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.764sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 21 (2.1e+01) #states 1,025 (3)



starting MCC model checker
--------------------------

checking: EG [EF [[p1<=1 & 1<=p1]]]
normalized: EG [E [true U [p1<=1 & 1<=p1]]]

abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
............
EG iterations: 12
-> the formula is FALSE

FORMULA Referendum-PT-0010-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AX [EG [[p3<=1 & 1<=p3]]]
normalized: ~ [EX [~ [EG [[p3<=1 & 1<=p3]]]]]

abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
...........
EG iterations: 11
.-> the formula is FALSE

FORMULA Referendum-PT-0010-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [[E [~ [[[EG [[p8<=1 & 1<=p8]] | AF [[p6<=1 & 1<=p6]]] & [p0<=1 & 1<=p0]]] U EF [~ [[[p7<=1 & 1<=p7] & [p10<=1 & 1<=p10]]]]] | AX [0<=0]]]
normalized: EG [[E [~ [[[p0<=1 & 1<=p0] & [~ [EG [~ [[p6<=1 & 1<=p6]]]] | EG [[p8<=1 & 1<=p8]]]]] U E [true U ~ [[[p10<=1 & 1<=p10] & [p7<=1 & 1<=p7]]]]] | ~ [EX [~ [0<=0]]]]]

abstracting: (0<=0)
states: 1,025 (3)
.abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
...........
EG iterations: 11
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
..
EG iterations: 2
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,025 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA Referendum-PT-0010-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [[p3<=1 & 1<=p3] U EF [~ [A [[[p7<=1 & 1<=p7] | [[p9<=1 & 1<=p9] | ~ [[p2<=1 & 1<=p2]]]] U [AF [[p3<=1 & 1<=p3]] | ~ [[p8<=1 & 1<=p8]]]]]]]
normalized: E [[p3<=1 & 1<=p3] U E [true U ~ [[~ [EG [~ [[~ [[p8<=1 & 1<=p8]] | ~ [EG [~ [[p3<=1 & 1<=p3]]]]]]]] & ~ [E [~ [[~ [[p8<=1 & 1<=p8]] | ~ [EG [~ [[p3<=1 & 1<=p3]]]]]] U [~ [[[~ [[p2<=1 & 1<=p2]] | [p9<=1 & 1<=p9]] | [p7<=1 & 1<=p7]]] & ~ [[~ [[p8<=1 & 1<=p8]] | ~ [EG [~ [[p3<=1 & 1<=p3]]]]]]]]]]]]]

abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
..
EG iterations: 2
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
..
EG iterations: 2
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
..
EG iterations: 2
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
..........
EG iterations: 10
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
-> the formula is TRUE

FORMULA Referendum-PT-0010-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [AG [~ [[p10<=1 & 1<=p10]]] U [~ [[[p4<=1 & 1<=p4] & EX [[p2<=1 & 1<=p2]]]] & [[[p3<=1 & 1<=p3] | [p7<=1 & 1<=p7]] | [[p9<=1 & 1<=p9] | [[p10<=1 & 1<=p10] | AG [~ [AX [[p0<=1 & 1<=p0]]]]]]]]]
normalized: E [~ [E [true U [p10<=1 & 1<=p10]]] U [[[[~ [E [true U ~ [EX [~ [[p0<=1 & 1<=p0]]]]]] | [p10<=1 & 1<=p10]] | [p9<=1 & 1<=p9]] | [[p7<=1 & 1<=p7] | [p3<=1 & 1<=p3]]] & ~ [[EX [[p2<=1 & 1<=p2]] & [p4<=1 & 1<=p4]]]]]

abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
.abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,025 (3)
.abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
-> the formula is FALSE

FORMULA Referendum-PT-0010-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [AF [~ [AG [AF [[p0<=1 & 1<=p0]]]]] U [[p6<=1 & 1<=p6] | [A [AG [~ [[p1<=1 & 1<=p1]]] U ~ [AX [[p3<=1 & 1<=p3]]]] & [[p7<=1 & 1<=p7] | AG [[[[p2<=1 & 1<=p2] & [p9<=1 & 1<=p9]] | [[p7<=1 & 1<=p7] | [p9<=1 & 1<=p9]]]]]]]]
normalized: [~ [EG [~ [[[[~ [E [true U ~ [[[[p9<=1 & 1<=p9] | [p7<=1 & 1<=p7]] | [[p9<=1 & 1<=p9] & [p2<=1 & 1<=p2]]]]]] | [p7<=1 & 1<=p7]] & [~ [EG [~ [EX [~ [[p3<=1 & 1<=p3]]]]]] & ~ [E [~ [EX [~ [[p3<=1 & 1<=p3]]]] U [E [true U [p1<=1 & 1<=p1]] & ~ [EX [~ [[p3<=1 & 1<=p3]]]]]]]]] | [p6<=1 & 1<=p6]]]]] & ~ [E [~ [[[[~ [E [true U ~ [[[[p9<=1 & 1<=p9] | [p7<=1 & 1<=p7]] | [[p9<=1 & 1<=p9] & [p2<=1 & 1<=p2]]]]]] | [p7<=1 & 1<=p7]] & [~ [EG [~ [EX [~ [[p3<=1 & 1<=p3]]]]]] & ~ [E [~ [EX [~ [[p3<=1 & 1<=p3]]]] U [E [true U [p1<=1 & 1<=p1]] & ~ [EX [~ [[p3<=1 & 1<=p3]]]]]]]]] | [p6<=1 & 1<=p6]]] U [EG [~ [E [true U EG [~ [[p0<=1 & 1<=p0]]]]]] & ~ [[[[~ [E [true U ~ [[[[p9<=1 & 1<=p9] | [p7<=1 & 1<=p7]] | [[p9<=1 & 1<=p9] & [p2<=1 & 1<=p2]]]]]] | [p7<=1 & 1<=p7]] & [~ [EG [~ [EX [~ [[p3<=1 & 1<=p3]]]]]] & ~ [E [~ [EX [~ [[p3<=1 & 1<=p3]]]] U [E [true U [p1<=1 & 1<=p1]] & ~ [EX [~ [[p3<=1 & 1<=p3]]]]]]]]] | [p6<=1 & 1<=p6]]]]]]]

abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
.abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
.abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
...
EG iterations: 2
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,025 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
.abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
.abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
...
EG iterations: 2
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
.abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
.abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
...
EG iterations: 2
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
..
EG iterations: 2
-> the formula is TRUE

FORMULA Referendum-PT-0010-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [[[[~ [[p1<=1 & 1<=p1]] & ~ [[p2<=1 & 1<=p2]]] & [~ [[p3<=1 & 1<=p3]] & [~ [[p4<=1 & 1<=p4]] & ~ [[p5<=1 & 1<=p5]]]]] & [[~ [[p6<=1 & 1<=p6]] & ~ [[p7<=1 & 1<=p7]]] & [~ [[p8<=1 & 1<=p8]] & [~ [[p9<=1 & 1<=p9]] & ~ [[p10<=1 & 1<=p10]]]]]]]
normalized: EG [[[[[~ [[p10<=1 & 1<=p10]] & ~ [[p9<=1 & 1<=p9]]] & ~ [[p8<=1 & 1<=p8]]] & [~ [[p7<=1 & 1<=p7]] & ~ [[p6<=1 & 1<=p6]]]] & [[[~ [[p5<=1 & 1<=p5]] & ~ [[p4<=1 & 1<=p4]]] & ~ [[p3<=1 & 1<=p3]]] & [~ [[p2<=1 & 1<=p2]] & ~ [[p1<=1 & 1<=p1]]]]]]

abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
..
EG iterations: 2
-> the formula is FALSE

FORMULA Referendum-PT-0010-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [AF [[~ [A [[p10<=1 & 1<=p10] U ~ [[p4<=1 & 1<=p4]]]] | [[p1<=0 & 0<=p1] & [AG [[p2<=0 & 0<=p2]] | [p7<=0 & 0<=p7]]]]] & [EG [AF [[[p8<=1 & 1<=p8] & EG [[p10<=1 & 1<=p10]]]]] & [EG [~ [A [AX [[p10<=1 & 1<=p10]] U EX [[p8<=1 & 1<=p8]]]]] | EF [[[[EX [[p3<=1 & 1<=p3]] & [AX [[p6<=0 & 0<=p6]] & [p10<=1 & 1<=p10]]] | E [AF [[p6<=1 & 1<=p6]] U ~ [[p9<=1 & 1<=p9]]]] | [[[p6<=0 & 0<=p6] & [p3<=0 & 0<=p3]] | [p2<=1 & 1<=p2]]]]]]]
normalized: [[EG [~ [EG [~ [[EG [[p10<=1 & 1<=p10]] & [p8<=1 & 1<=p8]]]]]] & [E [true U [[[p2<=1 & 1<=p2] | [[p3<=0 & 0<=p3] & [p6<=0 & 0<=p6]]] | [E [~ [EG [~ [[p6<=1 & 1<=p6]]]] U ~ [[p9<=1 & 1<=p9]]] | [[[p10<=1 & 1<=p10] & ~ [EX [~ [[p6<=0 & 0<=p6]]]]] & EX [[p3<=1 & 1<=p3]]]]]] | EG [~ [[~ [EG [~ [EX [[p8<=1 & 1<=p8]]]]] & ~ [E [~ [EX [[p8<=1 & 1<=p8]]] U [EX [~ [[p10<=1 & 1<=p10]]] & ~ [EX [[p8<=1 & 1<=p8]]]]]]]]]]] & ~ [EG [~ [[[[[p7<=0 & 0<=p7] | ~ [E [true U ~ [[p2<=0 & 0<=p2]]]]] & [p1<=0 & 0<=p1]] | ~ [[~ [EG [[p4<=1 & 1<=p4]]] & ~ [E [[p4<=1 & 1<=p4] U [~ [[p10<=1 & 1<=p10]] & [p4<=1 & 1<=p4]]]]]]]]]]]

abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
...........
EG iterations: 11
abstracting: (0<=p1)
states: 1,025 (3)
abstracting: (p1<=0)
states: 513
abstracting: (0<=p2)
states: 1,025 (3)
abstracting: (p2<=0)
states: 513
abstracting: (0<=p7)
states: 1,025 (3)
abstracting: (p7<=0)
states: 513
..........
EG iterations: 10
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
.abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
.abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
.abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
..
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
.abstracting: (0<=p6)
states: 1,025 (3)
abstracting: (p6<=0)
states: 513
.abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
..
EG iterations: 2
abstracting: (0<=p6)
states: 1,025 (3)
abstracting: (p6<=0)
states: 513
abstracting: (0<=p3)
states: 1,025 (3)
abstracting: (p3<=0)
states: 513
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
...........
EG iterations: 11

EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA Referendum-PT-0010-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [AG [[[[[p1<=0 & 0<=p1] & [p2<=0 & 0<=p2]] & [[p3<=0 & 0<=p3] & [[p4<=0 & 0<=p4] & [p5<=0 & 0<=p5]]]] & [[[p6<=0 & 0<=p6] & [p7<=0 & 0<=p7]] & [[p8<=0 & 0<=p8] & [[p9<=0 & 0<=p9] & [p10<=0 & 0<=p10]]]]]] | [AX [~ [E [~ [[[[[p1<=1 & 1<=p1] | [p2<=1 & 1<=p2]] | [[p3<=1 & 1<=p3] | [[p4<=1 & 1<=p4] | [p5<=1 & 1<=p5]]]] | [[[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]]] U [[[[p1<=1 & 1<=p1] | [p2<=1 & 1<=p2]] | [[p3<=1 & 1<=p3] | [[p4<=1 & 1<=p4] | [p5<=1 & 1<=p5]]]] | [[[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]]]]] | EX [AX [EG [[p0<=0 & 0<=p0]]]]]]
normalized: [[EX [~ [EX [~ [EG [[p0<=0 & 0<=p0]]]]]] | ~ [EX [E [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]] U [[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]]] | ~ [E [true U ~ [[[[[[p10<=0 & 0<=p10] & [p9<=0 & 0<=p9]] & [p8<=0 & 0<=p8]] & [[p7<=0 & 0<=p7] & [p6<=0 & 0<=p6]]] & [[[[p5<=0 & 0<=p5] & [p4<=0 & 0<=p4]] & [p3<=0 & 0<=p3]] & [[p2<=0 & 0<=p2] & [p1<=0 & 0<=p1]]]]]]]]

abstracting: (0<=p1)
states: 1,025 (3)
abstracting: (p1<=0)
states: 513
abstracting: (0<=p2)
states: 1,025 (3)
abstracting: (p2<=0)
states: 513
abstracting: (0<=p3)
states: 1,025 (3)
abstracting: (p3<=0)
states: 513
abstracting: (0<=p4)
states: 1,025 (3)
abstracting: (p4<=0)
states: 513
abstracting: (0<=p5)
states: 1,025 (3)
abstracting: (p5<=0)
states: 513
abstracting: (0<=p6)
states: 1,025 (3)
abstracting: (p6<=0)
states: 513
abstracting: (0<=p7)
states: 1,025 (3)
abstracting: (p7<=0)
states: 513
abstracting: (0<=p8)
states: 1,025 (3)
abstracting: (p8<=0)
states: 513
abstracting: (0<=p9)
states: 1,025 (3)
abstracting: (p9<=0)
states: 513
abstracting: (0<=p10)
states: 1,025 (3)
abstracting: (p10<=0)
states: 513
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
.abstracting: (0<=p0)
states: 1,025 (3)
abstracting: (p0<=0)
states: 1,024 (3)
.
EG iterations: 1
..-> the formula is TRUE

FORMULA Referendum-PT-0010-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [[[EX [EF [[[[[p1<=0 & 0<=p1] & [p2<=0 & 0<=p2]] & [[p3<=0 & 0<=p3] & [[p4<=0 & 0<=p4] & [p5<=0 & 0<=p5]]]] & [[[p6<=0 & 0<=p6] & [p7<=0 & 0<=p7]] & [[p8<=0 & 0<=p8] & [[p9<=0 & 0<=p9] & [p10<=0 & 0<=p10]]]]]]] & EF [[[[EX [[p0<=1 & 1<=p0]] | [EG [[p0<=1 & 1<=p0]] | [p1<=1 & 1<=p1]]] | [[p2<=1 & 1<=p2] | [[p3<=1 & 1<=p3] | [p4<=1 & 1<=p4]]]] | [[[p5<=1 & 1<=p5] | [[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]]]] & [AX [[p0<=0 & 0<=p0]] & [AF [[[[[p1<=1 & 1<=p1] | [p2<=1 & 1<=p2]] | [[p3<=1 & 1<=p3] | [[p4<=1 & 1<=p4] | [p5<=1 & 1<=p5]]]] | [[[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]]] | [AG [AX [[p0<=1 & 1<=p0]]] | [p0<=0 & 0<=p0]]]]]]
normalized: EX [[[E [true U [[[[[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]] | [p5<=1 & 1<=p5]] | [[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]]] | [[[[p4<=1 & 1<=p4] | [p3<=1 & 1<=p3]] | [p2<=1 & 1<=p2]] | [[[p1<=1 & 1<=p1] | EG [[p0<=1 & 1<=p0]]] | EX [[p0<=1 & 1<=p0]]]]]] & EX [E [true U [[[[[p10<=0 & 0<=p10] & [p9<=0 & 0<=p9]] & [p8<=0 & 0<=p8]] & [[p7<=0 & 0<=p7] & [p6<=0 & 0<=p6]]] & [[[[p5<=0 & 0<=p5] & [p4<=0 & 0<=p4]] & [p3<=0 & 0<=p3]] & [[p2<=0 & 0<=p2] & [p1<=0 & 0<=p1]]]]]]] & [[[[p0<=0 & 0<=p0] | ~ [E [true U EX [~ [[p0<=1 & 1<=p0]]]]]] | ~ [EG [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]]] & ~ [EX [~ [[p0<=0 & 0<=p0]]]]]]]

abstracting: (0<=p0)
states: 1,025 (3)
abstracting: (p0<=0)
states: 1,024 (3)
.abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
..
EG iterations: 2
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,025 (3)
.abstracting: (0<=p0)
states: 1,025 (3)
abstracting: (p0<=0)
states: 1,024 (3)
abstracting: (0<=p1)
states: 1,025 (3)
abstracting: (p1<=0)
states: 513
abstracting: (0<=p2)
states: 1,025 (3)
abstracting: (p2<=0)
states: 513
abstracting: (0<=p3)
states: 1,025 (3)
abstracting: (p3<=0)
states: 513
abstracting: (0<=p4)
states: 1,025 (3)
abstracting: (p4<=0)
states: 513
abstracting: (0<=p5)
states: 1,025 (3)
abstracting: (p5<=0)
states: 513
abstracting: (0<=p6)
states: 1,025 (3)
abstracting: (p6<=0)
states: 513
abstracting: (0<=p7)
states: 1,025 (3)
abstracting: (p7<=0)
states: 513
abstracting: (0<=p8)
states: 1,025 (3)
abstracting: (p8<=0)
states: 513
abstracting: (0<=p9)
states: 1,025 (3)
abstracting: (p9<=0)
states: 513
abstracting: (0<=p10)
states: 1,025 (3)
abstracting: (p10<=0)
states: 513
.abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,025 (3)
.abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,025 (3)
..
EG iterations: 2
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
.-> the formula is TRUE

FORMULA Referendum-PT-0010-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [[EX [[AG [[[[[p1<=0 & 0<=p1] & [p2<=0 & 0<=p2]] & [[p3<=0 & 0<=p3] & [[p4<=0 & 0<=p4] & [p5<=0 & 0<=p5]]]] & [[[p6<=0 & 0<=p6] & [p7<=0 & 0<=p7]] & [[p8<=0 & 0<=p8] & [[p9<=0 & 0<=p9] & [p10<=0 & 0<=p10]]]]]] | [[[[[p1<=0 & 0<=p1] & [p2<=0 & 0<=p2]] & [[p3<=0 & 0<=p3] & [[p4<=0 & 0<=p4] & [p5<=0 & 0<=p5]]]] & [[[p6<=0 & 0<=p6] & [p7<=0 & 0<=p7]] & [[p8<=0 & 0<=p8] & [[p9<=0 & 0<=p9] & [p10<=0 & 0<=p10]]]]] | [[[[p1<=0 & 0<=p1] & [p2<=0 & 0<=p2]] & [[p3<=0 & 0<=p3] & [[p4<=0 & 0<=p4] & [p5<=0 & 0<=p5]]]] & [[[p6<=0 & 0<=p6] & [p7<=0 & 0<=p7]] & [[p8<=0 & 0<=p8] & [[p9<=0 & 0<=p9] & [p10<=0 & 0<=p10]]]]]]]] & EX [[[[[p1<=1 & 1<=p1] | [p2<=1 & 1<=p2]] | [[p3<=1 & 1<=p3] | [[p4<=1 & 1<=p4] | [p5<=1 & 1<=p5]]]] | [[[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]]]]]
normalized: ~ [EG [~ [[EX [[~ [E [true U ~ [[[[[[p10<=0 & 0<=p10] & [p9<=0 & 0<=p9]] & [p8<=0 & 0<=p8]] & [[p7<=0 & 0<=p7] & [p6<=0 & 0<=p6]]] & [[[[p5<=0 & 0<=p5] & [p4<=0 & 0<=p4]] & [p3<=0 & 0<=p3]] & [[p2<=0 & 0<=p2] & [p1<=0 & 0<=p1]]]]]]] | [[[[[[p10<=0 & 0<=p10] & [p9<=0 & 0<=p9]] & [p8<=0 & 0<=p8]] & [[p7<=0 & 0<=p7] & [p6<=0 & 0<=p6]]] & [[[[p5<=0 & 0<=p5] & [p4<=0 & 0<=p4]] & [p3<=0 & 0<=p3]] & [[p2<=0 & 0<=p2] & [p1<=0 & 0<=p1]]]] | [[[[[p10<=0 & 0<=p10] & [p9<=0 & 0<=p9]] & [p8<=0 & 0<=p8]] & [[p7<=0 & 0<=p7] & [p6<=0 & 0<=p6]]] & [[[[p5<=0 & 0<=p5] & [p4<=0 & 0<=p4]] & [p3<=0 & 0<=p3]] & [[p2<=0 & 0<=p2] & [p1<=0 & 0<=p1]]]]]]] & EX [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]]]]

abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
.abstracting: (0<=p1)
states: 1,025 (3)
abstracting: (p1<=0)
states: 513
abstracting: (0<=p2)
states: 1,025 (3)
abstracting: (p2<=0)
states: 513
abstracting: (0<=p3)
states: 1,025 (3)
abstracting: (p3<=0)
states: 513
abstracting: (0<=p4)
states: 1,025 (3)
abstracting: (p4<=0)
states: 513
abstracting: (0<=p5)
states: 1,025 (3)
abstracting: (p5<=0)
states: 513
abstracting: (0<=p6)
states: 1,025 (3)
abstracting: (p6<=0)
states: 513
abstracting: (0<=p7)
states: 1,025 (3)
abstracting: (p7<=0)
states: 513
abstracting: (0<=p8)
states: 1,025 (3)
abstracting: (p8<=0)
states: 513
abstracting: (0<=p9)
states: 1,025 (3)
abstracting: (p9<=0)
states: 513
abstracting: (0<=p10)
states: 1,025 (3)
abstracting: (p10<=0)
states: 513
abstracting: (0<=p1)
states: 1,025 (3)
abstracting: (p1<=0)
states: 513
abstracting: (0<=p2)
states: 1,025 (3)
abstracting: (p2<=0)
states: 513
abstracting: (0<=p3)
states: 1,025 (3)
abstracting: (p3<=0)
states: 513
abstracting: (0<=p4)
states: 1,025 (3)
abstracting: (p4<=0)
states: 513
abstracting: (0<=p5)
states: 1,025 (3)
abstracting: (p5<=0)
states: 513
abstracting: (0<=p6)
states: 1,025 (3)
abstracting: (p6<=0)
states: 513
abstracting: (0<=p7)
states: 1,025 (3)
abstracting: (p7<=0)
states: 513
abstracting: (0<=p8)
states: 1,025 (3)
abstracting: (p8<=0)
states: 513
abstracting: (0<=p9)
states: 1,025 (3)
abstracting: (p9<=0)
states: 513
abstracting: (0<=p10)
states: 1,025 (3)
abstracting: (p10<=0)
states: 513
abstracting: (0<=p1)
states: 1,025 (3)
abstracting: (p1<=0)
states: 513
abstracting: (0<=p2)
states: 1,025 (3)
abstracting: (p2<=0)
states: 513
abstracting: (0<=p3)
states: 1,025 (3)
abstracting: (p3<=0)
states: 513
abstracting: (0<=p4)
states: 1,025 (3)
abstracting: (p4<=0)
states: 513
abstracting: (0<=p5)
states: 1,025 (3)
abstracting: (p5<=0)
states: 513
abstracting: (0<=p6)
states: 1,025 (3)
abstracting: (p6<=0)
states: 513
abstracting: (0<=p7)
states: 1,025 (3)
abstracting: (p7<=0)
states: 513
abstracting: (0<=p8)
states: 1,025 (3)
abstracting: (p8<=0)
states: 513
abstracting: (0<=p9)
states: 1,025 (3)
abstracting: (p9<=0)
states: 513
abstracting: (0<=p10)
states: 1,025 (3)
abstracting: (p10<=0)
states: 513
.
EG iterations: 0
-> the formula is FALSE

FORMULA Referendum-PT-0010-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [AX [EF [EG [AG [[1<=p0 & p0<=1]]]]] | [E [[p0<=1 & 1<=p0] U [[[[[p1<=1 & 1<=p1] | [p2<=1 & 1<=p2]] | [[p3<=1 & 1<=p3] | [[p4<=1 & 1<=p4] | [p5<=1 & 1<=p5]]]] | [[[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]] & [AX [[[[[p1<=1 & 1<=p1] | [p2<=1 & 1<=p2]] | [[p3<=1 & 1<=p3] | [[p4<=1 & 1<=p4] | [p5<=1 & 1<=p5]]]] | [[[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]]] | EG [[[[[p1<=1 & 1<=p1] | [p2<=1 & 1<=p2]] | [[p3<=1 & 1<=p3] | [[p4<=1 & 1<=p4] | [p5<=1 & 1<=p5]]]] | [[[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]]]]]] & A [EF [[p0<=1 & 1<=p0]] U [AG [[[[[p1<=1 & 1<=p1] | [p2<=1 & 1<=p2]] | [[p3<=1 & 1<=p3] | [[p4<=1 & 1<=p4] | [p5<=1 & 1<=p5]]]] | [[[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]]] & ~ [EX [A [[[[[p1<=1 & 1<=p1] | [p2<=1 & 1<=p2]] | [[p3<=1 & 1<=p3] | [[p4<=1 & 1<=p4] | [p5<=1 & 1<=p5]]]] | [[[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]] U [[[[p1<=1 & 1<=p1] | [p2<=1 & 1<=p2]] | [[p3<=1 & 1<=p3] | [[p4<=1 & 1<=p4] | [p5<=1 & 1<=p5]]]] | [[[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]]]]]]]]]
normalized: [[[~ [EG [~ [[~ [EX [[~ [EG [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]] & ~ [E [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]] U [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]] & ~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]]]]]] & ~ [E [true U ~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]]]]]] & ~ [E [~ [[~ [EX [[~ [EG [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]] & ~ [E [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]] U [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]] & ~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]]]]]] & ~ [E [true U ~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]]]] U [~ [E [true U [p0<=1 & 1<=p0]]] & ~ [[~ [EX [[~ [EG [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]] & ~ [E [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]] U [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]] & ~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]]]]]] & ~ [E [true U ~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]]]]]]]] & E [[p0<=1 & 1<=p0] U [[EG [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]] | ~ [EX [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]]] & [[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]] | ~ [EX [~ [E [true U EG [~ [E [true U ~ [[1<=p0 & p0<=1]]]]]]]]]]

abstracting: (p0<=1)
states: 1,025 (3)
abstracting: (1<=p0)
states: 1
.
EG iterations: 1
.abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
.abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
...........
EG iterations: 11
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
..
EG iterations: 2
.abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
..
EG iterations: 2
.abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
..
EG iterations: 2
.
EG iterations: 0
-> the formula is FALSE

FORMULA Referendum-PT-0010-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [[EX [[[[AF [[[[[p1<=0 & 0<=p1] & [p2<=0 & 0<=p2]] & [[p3<=0 & 0<=p3] & [[p4<=0 & 0<=p4] & [p5<=0 & 0<=p5]]]] & [[[p6<=0 & 0<=p6] & [p7<=0 & 0<=p7]] & [[p8<=0 & 0<=p8] & [[p9<=0 & 0<=p9] & [p10<=0 & 0<=p10]]]]]] & [AG [[p0<=0 & 0<=p0]] & AX [[[[[p1<=0 & 0<=p1] & [p2<=0 & 0<=p2]] & [[p3<=0 & 0<=p3] & [[p4<=0 & 0<=p4] & [p5<=0 & 0<=p5]]]] & [[[p6<=0 & 0<=p6] & [p7<=0 & 0<=p7]] & [[p8<=0 & 0<=p8] & [[p9<=0 & 0<=p9] & [p10<=0 & 0<=p10]]]]]]]] & [[[p1<=0 & 0<=p1] & [p2<=0 & 0<=p2]] & [[p3<=0 & 0<=p3] & [p4<=0 & 0<=p4]]]] & [[[p5<=0 & 0<=p5] & [[p6<=0 & 0<=p6] & [p7<=0 & 0<=p7]]] & [[[p8<=0 & 0<=p8] & [p9<=0 & 0<=p9]] & [[p10<=0 & 0<=p10] & [p0<=1 & 1<=p0]]]]]] | EX [AG [[[[EF [[[[[p1<=1 & 1<=p1] | [p2<=1 & 1<=p2]] | [[p3<=1 & 1<=p3] | [[p4<=1 & 1<=p4] | [p5<=1 & 1<=p5]]]] | [[[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]]] | [p1<=1 & 1<=p1]] | [[p2<=1 & 1<=p2] | [[p3<=1 & 1<=p3] | [p4<=1 & 1<=p4]]]] | [[[p5<=1 & 1<=p5] | [[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]]]]] & [AF [[[[[p1<=0 & 0<=p1] & [p2<=0 & 0<=p2]] & [[p3<=0 & 0<=p3] & [[p4<=0 & 0<=p4] & [p5<=0 & 0<=p5]]]] & [[[p6<=0 & 0<=p6] & [p7<=0 & 0<=p7]] & [[p8<=0 & 0<=p8] & [[p9<=0 & 0<=p9] & [p10<=0 & 0<=p10]]]]]] | AX [EX [[p0<=0 & 0<=p0]]]]]
normalized: [[~ [EX [~ [EX [[p0<=0 & 0<=p0]]]]] | ~ [EG [~ [[[[[[p10<=0 & 0<=p10] & [p9<=0 & 0<=p9]] & [p8<=0 & 0<=p8]] & [[p7<=0 & 0<=p7] & [p6<=0 & 0<=p6]]] & [[[[p5<=0 & 0<=p5] & [p4<=0 & 0<=p4]] & [p3<=0 & 0<=p3]] & [[p2<=0 & 0<=p2] & [p1<=0 & 0<=p1]]]]]]]] & [EX [~ [E [true U ~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]] | [p5<=1 & 1<=p5]]] | [[[[p4<=1 & 1<=p4] | [p3<=1 & 1<=p3]] | [p2<=1 & 1<=p2]] | [[p1<=1 & 1<=p1] | E [true U [[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]]]]]]] | EX [[[[[[p0<=1 & 1<=p0] & [p10<=0 & 0<=p10]] & [[p9<=0 & 0<=p9] & [p8<=0 & 0<=p8]]] & [[[p7<=0 & 0<=p7] & [p6<=0 & 0<=p6]] & [p5<=0 & 0<=p5]]] & [[[[p4<=0 & 0<=p4] & [p3<=0 & 0<=p3]] & [[p2<=0 & 0<=p2] & [p1<=0 & 0<=p1]]] & [[~ [EX [~ [[[[[[p10<=0 & 0<=p10] & [p9<=0 & 0<=p9]] & [p8<=0 & 0<=p8]] & [[p7<=0 & 0<=p7] & [p6<=0 & 0<=p6]]] & [[[[p5<=0 & 0<=p5] & [p4<=0 & 0<=p4]] & [p3<=0 & 0<=p3]] & [[p2<=0 & 0<=p2] & [p1<=0 & 0<=p1]]]]]]] & ~ [E [true U ~ [[p0<=0 & 0<=p0]]]]] & ~ [EG [~ [[[[[[p10<=0 & 0<=p10] & [p9<=0 & 0<=p9]] & [p8<=0 & 0<=p8]] & [[p7<=0 & 0<=p7] & [p6<=0 & 0<=p6]]] & [[[[p5<=0 & 0<=p5] & [p4<=0 & 0<=p4]] & [p3<=0 & 0<=p3]] & [[p2<=0 & 0<=p2] & [p1<=0 & 0<=p1]]]]]]]]]]]]]

abstracting: (0<=p1)
states: 1,025 (3)
abstracting: (p1<=0)
states: 513
abstracting: (0<=p2)
states: 1,025 (3)
abstracting: (p2<=0)
states: 513
abstracting: (0<=p3)
states: 1,025 (3)
abstracting: (p3<=0)
states: 513
abstracting: (0<=p4)
states: 1,025 (3)
abstracting: (p4<=0)
states: 513
abstracting: (0<=p5)
states: 1,025 (3)
abstracting: (p5<=0)
states: 513
abstracting: (0<=p6)
states: 1,025 (3)
abstracting: (p6<=0)
states: 513
abstracting: (0<=p7)
states: 1,025 (3)
abstracting: (p7<=0)
states: 513
abstracting: (0<=p8)
states: 1,025 (3)
abstracting: (p8<=0)
states: 513
abstracting: (0<=p9)
states: 1,025 (3)
abstracting: (p9<=0)
states: 513
abstracting: (0<=p10)
states: 1,025 (3)
abstracting: (p10<=0)
states: 513
...........
EG iterations: 11
abstracting: (0<=p0)
states: 1,025 (3)
abstracting: (p0<=0)
states: 1,024 (3)
abstracting: (0<=p1)
states: 1,025 (3)
abstracting: (p1<=0)
states: 513
abstracting: (0<=p2)
states: 1,025 (3)
abstracting: (p2<=0)
states: 513
abstracting: (0<=p3)
states: 1,025 (3)
abstracting: (p3<=0)
states: 513
abstracting: (0<=p4)
states: 1,025 (3)
abstracting: (p4<=0)
states: 513
abstracting: (0<=p5)
states: 1,025 (3)
abstracting: (p5<=0)
states: 513
abstracting: (0<=p6)
states: 1,025 (3)
abstracting: (p6<=0)
states: 513
abstracting: (0<=p7)
states: 1,025 (3)
abstracting: (p7<=0)
states: 513
abstracting: (0<=p8)
states: 1,025 (3)
abstracting: (p8<=0)
states: 513
abstracting: (0<=p9)
states: 1,025 (3)
abstracting: (p9<=0)
states: 513
abstracting: (0<=p10)
states: 1,025 (3)
abstracting: (p10<=0)
states: 513
.abstracting: (0<=p1)
states: 1,025 (3)
abstracting: (p1<=0)
states: 513
abstracting: (0<=p2)
states: 1,025 (3)
abstracting: (p2<=0)
states: 513
abstracting: (0<=p3)
states: 1,025 (3)
abstracting: (p3<=0)
states: 513
abstracting: (0<=p4)
states: 1,025 (3)
abstracting: (p4<=0)
states: 513
abstracting: (0<=p5)
states: 1,025 (3)
abstracting: (p5<=0)
states: 513
abstracting: (0<=p6)
states: 1,025 (3)
abstracting: (p6<=0)
states: 513
abstracting: (0<=p7)
states: 1,025 (3)
abstracting: (p7<=0)
states: 513
abstracting: (0<=p8)
states: 1,025 (3)
abstracting: (p8<=0)
states: 513
abstracting: (0<=p9)
states: 1,025 (3)
abstracting: (p9<=0)
states: 513
abstracting: (0<=p10)
states: 1,025 (3)
abstracting: (p10<=0)
states: 513
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,025 (3)
.abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
.abstracting: (0<=p1)
states: 1,025 (3)
abstracting: (p1<=0)
states: 513
abstracting: (0<=p2)
states: 1,025 (3)
abstracting: (p2<=0)
states: 513
abstracting: (0<=p3)
states: 1,025 (3)
abstracting: (p3<=0)
states: 513
abstracting: (0<=p4)
states: 1,025 (3)
abstracting: (p4<=0)
states: 513
abstracting: (0<=p5)
states: 1,025 (3)
abstracting: (p5<=0)
states: 513
abstracting: (0<=p6)
states: 1,025 (3)
abstracting: (p6<=0)
states: 513
abstracting: (0<=p7)
states: 1,025 (3)
abstracting: (p7<=0)
states: 513
abstracting: (0<=p8)
states: 1,025 (3)
abstracting: (p8<=0)
states: 513
abstracting: (0<=p9)
states: 1,025 (3)
abstracting: (p9<=0)
states: 513
abstracting: (0<=p10)
states: 1,025 (3)
abstracting: (p10<=0)
states: 513
...........
EG iterations: 11
abstracting: (0<=p0)
states: 1,025 (3)
abstracting: (p0<=0)
states: 1,024 (3)
..-> the formula is FALSE

FORMULA Referendum-PT-0010-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [EF [[[[[[p1<=1 & 1<=p1] | [p2<=1 & 1<=p2]] | [[p3<=1 & 1<=p3] | [[p4<=1 & 1<=p4] | [p5<=1 & 1<=p5]]]] | [[[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]] & EG [[A [[p0<=1 & 1<=p0] U [[[[p1<=1 & 1<=p1] | [p2<=1 & 1<=p2]] | [[p3<=1 & 1<=p3] | [[p4<=1 & 1<=p4] | [p5<=1 & 1<=p5]]]] | [[[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]]] | [[[[[p1<=0 & 0<=p1] & [p2<=0 & 0<=p2]] & [[p3<=0 & 0<=p3] & [[p4<=0 & 0<=p4] & [p5<=0 & 0<=p5]]]] & [[[p6<=0 & 0<=p6] & [p7<=0 & 0<=p7]] & [[p8<=0 & 0<=p8] & [[p9<=0 & 0<=p9] & [p10<=0 & 0<=p10]]]]] | [[p0<=1 & 1<=p0] & [[[[p1<=1 & 1<=p1] | [p2<=1 & 1<=p2]] | [[p3<=1 & 1<=p3] | [[p4<=1 & 1<=p4] | [p5<=1 & 1<=p5]]]] | [[[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]]]]]]]] & A [~ [AF [EG [~ [[[[[p1<=1 & 1<=p1] | [p2<=1 & 1<=p2]] | [[p3<=1 & 1<=p3] | [[p4<=1 & 1<=p4] | [p5<=1 & 1<=p5]]]] | [[[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]]]]]] U [[[AX [[[[[[p1<=1 & 1<=p1] | [p2<=1 & 1<=p2]] | [[p3<=1 & 1<=p3] | [[p4<=1 & 1<=p4] | [p5<=1 & 1<=p5]]]] | [[[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]] & [AF [[[[[p1<=1 & 1<=p1] | [p2<=1 & 1<=p2]] | [[p3<=1 & 1<=p3] | [[p4<=1 & 1<=p4] | [p5<=1 & 1<=p5]]]] | [[[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]]] & AF [[[[[p1<=1 & 1<=p1] | [p2<=1 & 1<=p2]] | [[p3<=1 & 1<=p3] | [[p4<=1 & 1<=p4] | [p5<=1 & 1<=p5]]]] | [[[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]]]]]] | [p1<=1 & 1<=p1]] | [[p2<=1 & 1<=p2] | [[p3<=1 & 1<=p3] | [p4<=1 & 1<=p4]]]] | [[[p5<=1 & 1<=p5] | [[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]]] | [[p8<=1 & 1<=p8] | [[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]]]]]
normalized: [[~ [EG [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]] | [p5<=1 & 1<=p5]]] | [[[[p4<=1 & 1<=p4] | [p3<=1 & 1<=p3]] | [p2<=1 & 1<=p2]] | [[p1<=1 & 1<=p1] | ~ [EX [~ [[[~ [EG [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]] & ~ [EG [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]]] & [[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]]]]]]]]] & ~ [E [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]] | [p5<=1 & 1<=p5]]] | [[[[p4<=1 & 1<=p4] | [p3<=1 & 1<=p3]] | [p2<=1 & 1<=p2]] | [[p1<=1 & 1<=p1] | ~ [EX [~ [[[~ [EG [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]] & ~ [EG [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]]] & [[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]]]]]]] U [~ [EG [~ [EG [~ [[[[[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]] | [[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]]] | [[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]]]]]]]] & ~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]] | [p5<=1 & 1<=p5]]] | [[[[p4<=1 & 1<=p4] | [p3<=1 & 1<=p3]] | [p2<=1 & 1<=p2]] | [[p1<=1 & 1<=p1] | ~ [EX [~ [[[~ [EG [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]] & ~ [EG [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]]] & [[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]]]]]]]]]]] & E [true U [EG [[[[[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]] & [p0<=1 & 1<=p0]] | [[[[[p10<=0 & 0<=p10] & [p9<=0 & 0<=p9]] & [p8<=0 & 0<=p8]] & [[p7<=0 & 0<=p7] & [p6<=0 & 0<=p6]]] & [[[[p5<=0 & 0<=p5] & [p4<=0 & 0<=p4]] & [p3<=0 & 0<=p3]] & [[p2<=0 & 0<=p2] & [p1<=0 & 0<=p1]]]]] | [~ [EG [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]] & ~ [E [~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]] U [~ [[p0<=1 & 1<=p0]] & ~ [[[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]]]]]] & [[[[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]] | [p8<=1 & 1<=p8]] | [[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]]] | [[[[p5<=1 & 1<=p5] | [p4<=1 & 1<=p4]] | [p3<=1 & 1<=p3]] | [[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]]]]]]]

abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
..
EG iterations: 2
abstracting: (0<=p1)
states: 1,025 (3)
abstracting: (p1<=0)
states: 513
abstracting: (0<=p2)
states: 1,025 (3)
abstracting: (p2<=0)
states: 513
abstracting: (0<=p3)
states: 1,025 (3)
abstracting: (p3<=0)
states: 513
abstracting: (0<=p4)
states: 1,025 (3)
abstracting: (p4<=0)
states: 513
abstracting: (0<=p5)
states: 1,025 (3)
abstracting: (p5<=0)
states: 513
abstracting: (0<=p6)
states: 1,025 (3)
abstracting: (p6<=0)
states: 513
abstracting: (0<=p7)
states: 1,025 (3)
abstracting: (p7<=0)
states: 513
abstracting: (0<=p8)
states: 1,025 (3)
abstracting: (p8<=0)
states: 513
abstracting: (0<=p9)
states: 1,025 (3)
abstracting: (p9<=0)
states: 513
abstracting: (0<=p10)
states: 1,025 (3)
abstracting: (p10<=0)
states: 513
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)

EG iterations: 0
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
..
EG iterations: 2
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
..
EG iterations: 2
.abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
..
EG iterations: 2
............
EG iterations: 12
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
..
EG iterations: 2
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
..
EG iterations: 2
.abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
..
EG iterations: 2
abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
..
EG iterations: 2
.abstracting: (1<=p1)
states: 512
abstracting: (p1<=1)
states: 1,025 (3)
abstracting: (1<=p2)
states: 512
abstracting: (p2<=1)
states: 1,025 (3)
abstracting: (1<=p3)
states: 512
abstracting: (p3<=1)
states: 1,025 (3)
abstracting: (1<=p4)
states: 512
abstracting: (p4<=1)
states: 1,025 (3)
abstracting: (1<=p5)
states: 512
abstracting: (p5<=1)
states: 1,025 (3)
abstracting: (1<=p6)
states: 512
abstracting: (p6<=1)
states: 1,025 (3)
abstracting: (1<=p7)
states: 512
abstracting: (p7<=1)
states: 1,025 (3)
abstracting: (1<=p8)
states: 512
abstracting: (p8<=1)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
abstracting: (p9<=1)
states: 1,025 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,025 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Referendum-PT-0010-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

totally nodes used: 6706 (6.7e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4818 5888 10706
used/not used/entry size/cache size: 10914 67097950 16 1024MB
basic ops cache: hits/miss/sum: 5778 5769 11547
used/not used/entry size/cache size: 10934 16766282 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: 1316 188 1504
used/not used/entry size/cache size: 188 8388420 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 67102366
1 6309
2 170
3 19
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.398sec


BK_STOP 1679164182398

--------------------
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:32 (2), effective:11 (1)

initing FirstDep: 0m 0.000sec


iterations count:21 (1), effective:1 (0)

iterations count:12 (1), effective:1 (0)

iterations count:11 (1), effective:0 (0)

iterations count:13 (1), effective:2 (0)

iterations count:22 (2), effective:2 (0)

iterations count:11 (1), effective:0 (0)

iterations count:32 (2), effective:11 (1)

iterations count:21 (1), effective:1 (0)

iterations count:12 (1), effective:1 (0)

iterations count:21 (1), effective:1 (0)

iterations count:11 (1), effective:0 (0)

iterations count:13 (1), effective:2 (0)

iterations count:21 (1), effective:1 (0)

iterations count:21 (1), effective:1 (0)

iterations count:11 (1), effective:0 (0)

iterations count:13 (1), effective:2 (0)

iterations count:21 (1), effective:1 (0)

iterations count:11 (1), effective:0 (0)

iterations count:13 (1), effective:2 (0)

iterations count:13 (1), effective:1 (0)

iterations count:21 (1), effective:1 (0)

iterations count:11 (1), effective:0 (0)

iterations count:12 (1), effective:1 (0)

iterations count:12 (1), effective:1 (0)

iterations count:21 (1), effective:1 (0)

iterations count:21 (1), effective:1 (0)

iterations count:11 (1), effective:0 (0)

iterations count:22 (2), effective:10 (0)

iterations count:21 (1), effective:1 (0)

iterations count:21 (1), effective:1 (0)

iterations count:21 (1), effective:1 (0)

iterations count:21 (1), effective:1 (0)

iterations count:22 (2), effective:10 (0)

iterations count:11 (1), effective:0 (0)

iterations count:11 (1), effective:0 (0)

iterations count:22 (2), effective:10 (0)

iterations count:11 (1), effective:0 (0)

iterations count:21 (1), effective:1 (0)

iterations count:22 (2), effective:10 (0)

iterations count:11 (1), effective:0 (0)

iterations count:11 (1), effective:0 (0)

iterations count:21 (1), effective:1 (0)

iterations count:32 (2), effective:11 (1)

iterations count:11 (1), effective:0 (0)

iterations count:21 (1), effective:1 (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="Referendum-PT-0010"
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 Referendum-PT-0010, 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 r330-tall-167889203300466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0010.tgz
mv Referendum-PT-0010 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;