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.r257-smll-167863533000601.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 marcie
Input is Peterson-PT-2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r257-smll-167863533000601
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 876K
-rw-r--r-- 1 mcc users 13K Feb 25 22:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 22:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 25 22:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K Feb 25 22:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 25 22:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 25 22:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 33K Feb 25 22:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 185K Feb 25 22:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 100K 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 Peterson-PT-2-CTLCardinality-00
FORMULA_NAME Peterson-PT-2-CTLCardinality-01
FORMULA_NAME Peterson-PT-2-CTLCardinality-02
FORMULA_NAME Peterson-PT-2-CTLCardinality-03
FORMULA_NAME Peterson-PT-2-CTLCardinality-04
FORMULA_NAME Peterson-PT-2-CTLCardinality-05
FORMULA_NAME Peterson-PT-2-CTLCardinality-06
FORMULA_NAME Peterson-PT-2-CTLCardinality-07
FORMULA_NAME Peterson-PT-2-CTLCardinality-08
FORMULA_NAME Peterson-PT-2-CTLCardinality-09
FORMULA_NAME Peterson-PT-2-CTLCardinality-10
FORMULA_NAME Peterson-PT-2-CTLCardinality-11
FORMULA_NAME Peterson-PT-2-CTLCardinality-12
FORMULA_NAME Peterson-PT-2-CTLCardinality-13
FORMULA_NAME Peterson-PT-2-CTLCardinality-14
FORMULA_NAME Peterson-PT-2-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678930449598

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=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-2
Not applying reductions.
Model is PT
CTLCardinality PT
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//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Peterson_PT_2
(NrP: 102 NrTr: 126 NrArc: 384)

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

net check time: 0m 0.000sec

init dd package: 0m 3.566sec


RS generation: 0m 0.262sec


-> reachability set: #nodes 3632 (3.6e+03) #states 20,754 (4)



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

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

abstracting: (1<=TestAlone_1_0_2)
states: 742
.
EG iterations: 1
-> the formula is TRUE

FORMULA Peterson-PT-2-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.517sec

checking: EX [EG [E [1<=IsEndLoop_2_1_2 U ~ [[1<=AskForSection_2_1 | AG [TestIdentity_2_1_2<=TestIdentity_1_0_2]]]]]]
normalized: EX [EG [E [1<=IsEndLoop_2_1_2 U ~ [[~ [E [true U ~ [TestIdentity_2_1_2<=TestIdentity_1_0_2]]] | 1<=AskForSection_2_1]]]]]

abstracting: (1<=AskForSection_2_1)
states: 760
abstracting: (TestIdentity_2_1_2<=TestIdentity_1_0_2)
states: 20,516 (4)
abstracting: (1<=IsEndLoop_2_1_2)
states: 247
...............
EG iterations: 15
.-> the formula is TRUE

FORMULA Peterson-PT-2-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.146sec

checking: EG [A [TestIdentity_1_0_0<=1 U E [EF [[Turn_0_1<=IsEndLoop_0_1_1 | Turn_0_2<=TestIdentity_1_1_0]] U ~ [AX [CS_2<=0]]]]]
normalized: EG [[~ [EG [~ [E [E [true U [Turn_0_1<=IsEndLoop_0_1_1 | Turn_0_2<=TestIdentity_1_1_0]] U EX [~ [CS_2<=0]]]]]] & ~ [E [~ [E [E [true U [Turn_0_1<=IsEndLoop_0_1_1 | Turn_0_2<=TestIdentity_1_1_0]] U EX [~ [CS_2<=0]]]] U [~ [TestIdentity_1_0_0<=1] & ~ [E [E [true U [Turn_0_1<=IsEndLoop_0_1_1 | Turn_0_2<=TestIdentity_1_1_0]] U EX [~ [CS_2<=0]]]]]]]]]

abstracting: (CS_2<=0)
states: 20,507 (4)
.abstracting: (Turn_0_2<=TestIdentity_1_1_0)
states: 15,702 (4)
abstracting: (Turn_0_1<=IsEndLoop_0_1_1)
states: 14,714 (4)
abstracting: (TestIdentity_1_0_0<=1)
states: 20,754 (4)
abstracting: (CS_2<=0)
states: 20,507 (4)
.abstracting: (Turn_0_2<=TestIdentity_1_1_0)
states: 15,702 (4)
abstracting: (Turn_0_1<=IsEndLoop_0_1_1)
states: 14,714 (4)
abstracting: (CS_2<=0)
states: 20,507 (4)
.abstracting: (Turn_0_2<=TestIdentity_1_1_0)
states: 15,702 (4)
abstracting: (Turn_0_1<=IsEndLoop_0_1_1)
states: 14,714 (4)
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA Peterson-PT-2-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.337sec

checking: EF [[AX [[[1<=Turn_1_2 | [~ [1<=BeginLoop_2_1_0] | AG [TestAlone_0_0_2<=TestAlone_2_1_0]]] | 1<=TestIdentity_1_1_1]] & AG [EX [EX [CS_1<=WantSection_1_T]]]]]
normalized: E [true U [~ [E [true U ~ [EX [EX [CS_1<=WantSection_1_T]]]]] & ~ [EX [~ [[1<=TestIdentity_1_1_1 | [1<=Turn_1_2 | [~ [E [true U ~ [TestAlone_0_0_2<=TestAlone_2_1_0]]] | ~ [1<=BeginLoop_2_1_0]]]]]]]]]

abstracting: (1<=BeginLoop_2_1_0)
states: 412
abstracting: (TestAlone_0_0_2<=TestAlone_2_1_0)
states: 20,276 (4)
abstracting: (1<=Turn_1_2)
states: 7,490 (3)
abstracting: (1<=TestIdentity_1_1_1)
states: 196
.abstracting: (CS_1<=WantSection_1_T)
states: 20,754 (4)
..-> the formula is TRUE

FORMULA Peterson-PT-2-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.335sec

checking: AF [[[AF [~ [AX [WantSection_1_T<=1]]] & IsEndLoop_0_1_2<=1] | [[E [EX [1<=WantSection_1_F] U BeginLoop_1_0_1<=EndTurn_0_0] & [AF [1<=BeginLoop_0_1_0] | 1<=IsEndLoop_2_1_0]] | AG [EF [EF [TestIdentity_0_1_2<=TestAlone_1_1_0]]]]]]
normalized: ~ [EG [~ [[[~ [E [true U ~ [E [true U E [true U TestIdentity_0_1_2<=TestAlone_1_1_0]]]]] | [[1<=IsEndLoop_2_1_0 | ~ [EG [~ [1<=BeginLoop_0_1_0]]]] & E [EX [1<=WantSection_1_F] U BeginLoop_1_0_1<=EndTurn_0_0]]] | [IsEndLoop_0_1_2<=1 & ~ [EG [~ [EX [~ [WantSection_1_T<=1]]]]]]]]]]

abstracting: (WantSection_1_T<=1)
states: 20,754 (4)
.
EG iterations: 0
abstracting: (IsEndLoop_0_1_2<=1)
states: 20,754 (4)
abstracting: (BeginLoop_1_0_1<=EndTurn_0_0)
states: 20,024 (4)
abstracting: (1<=WantSection_1_F)
states: 1,076 (3)
.abstracting: (1<=BeginLoop_0_1_0)
states: 276
.
EG iterations: 1
abstracting: (1<=IsEndLoop_2_1_0)
states: 247
abstracting: (TestIdentity_0_1_2<=TestAlone_1_1_0)
states: 20,658 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Peterson-PT-2-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.063sec

checking: ~ [[~ [EF [AX [[~ [TestAlone_1_1_2<=AskForSection_2_1] | [1<=BeginLoop_0_0_1 & IsEndLoop_0_0_1<=0]]]]] & EF [AF [[~ [E [1<=IsEndLoop_0_0_0 U BeginLoop_0_1_0<=BeginLoop_2_0_1]] & [IsEndLoop_0_1_1<=TestIdentity_1_0_1 & EF [Turn_1_1<=TestIdentity_0_0_1]]]]]]]
normalized: ~ [[E [true U ~ [EG [~ [[[IsEndLoop_0_1_1<=TestIdentity_1_0_1 & E [true U Turn_1_1<=TestIdentity_0_0_1]] & ~ [E [1<=IsEndLoop_0_0_0 U BeginLoop_0_1_0<=BeginLoop_2_0_1]]]]]]] & ~ [E [true U ~ [EX [~ [[[1<=BeginLoop_0_0_1 & IsEndLoop_0_0_1<=0] | ~ [TestAlone_1_1_2<=AskForSection_2_1]]]]]]]]]

abstracting: (TestAlone_1_1_2<=AskForSection_2_1)
states: 20,565 (4)
abstracting: (IsEndLoop_0_0_1<=0)
states: 20,270 (4)
abstracting: (1<=BeginLoop_0_0_1)
states: 1,762 (3)
.abstracting: (BeginLoop_0_1_0<=BeginLoop_2_0_1)
states: 20,482 (4)
abstracting: (1<=IsEndLoop_0_0_0)
states: 1,762 (3)
abstracting: (Turn_1_1<=TestIdentity_0_0_1)
states: 14,506 (4)
abstracting: (IsEndLoop_0_1_1<=TestIdentity_1_0_1)
states: 20,654 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Peterson-PT-2-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.653sec

checking: ~ [EF [AF [[sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=4 & AX [[63<=sum(Idle_1, Idle_2, Idle_0) & 2<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)]]]]]]
normalized: ~ [E [true U ~ [EG [~ [[sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=4 & ~ [EX [~ [[63<=sum(Idle_1, Idle_2, Idle_0) & 2<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)]]]]]]]]]]

abstracting: (2<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0))
states: 75
abstracting: (63<=sum(Idle_1, Idle_2, Idle_0))
states: 0
.abstracting: (sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=4)
states: 20,754 (4)

EG iterations: 0
-> the formula is TRUE

FORMULA Peterson-PT-2-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.107sec

checking: EX [[[[EF [~ [BeginLoop_2_1_1<=1]] & [[~ [Turn_0_2<=1] & WantSection_0_T<=0] | [TestTurn_0_1<=1 & [~ [1<=TestAlone_0_0_2] & TestIdentity_0_0_0<=IsEndLoop_2_0_1]]]] & [EG [[[1<=EndTurn_2_1 | WantSection_1_T<=AskForSection_2_1] & [1<=AskForSection_0_0 & IsEndLoop_1_1_0<=1]]] | BeginLoop_2_0_2<=BeginLoop_2_1_1]] & TestAlone_1_0_0<=0]]
normalized: EX [[TestAlone_1_0_0<=0 & [[BeginLoop_2_0_2<=BeginLoop_2_1_1 | EG [[[1<=AskForSection_0_0 & IsEndLoop_1_1_0<=1] & [1<=EndTurn_2_1 | WantSection_1_T<=AskForSection_2_1]]]] & [[[TestTurn_0_1<=1 & [TestIdentity_0_0_0<=IsEndLoop_2_0_1 & ~ [1<=TestAlone_0_0_2]]] | [WantSection_0_T<=0 & ~ [Turn_0_2<=1]]] & E [true U ~ [BeginLoop_2_1_1<=1]]]]]]

abstracting: (BeginLoop_2_1_1<=1)
states: 20,754 (4)
abstracting: (Turn_0_2<=1)
states: 20,754 (4)
abstracting: (WantSection_0_T<=0)
states: 1,300 (3)
abstracting: (1<=TestAlone_0_0_2)
states: 484
abstracting: (TestIdentity_0_0_0<=IsEndLoop_2_0_1)
states: 19,053 (4)
abstracting: (TestTurn_0_1<=1)
states: 20,754 (4)
abstracting: (WantSection_1_T<=AskForSection_2_1)
states: 1,797 (3)
abstracting: (1<=EndTurn_2_1)
states: 247
abstracting: (IsEndLoop_1_1_0<=1)
states: 20,754 (4)
abstracting: (1<=AskForSection_0_0)
states: 1,300 (3)
.
EG iterations: 1
abstracting: (BeginLoop_2_0_2<=BeginLoop_2_1_1)
states: 20,125 (4)
abstracting: (TestAlone_1_0_0<=0)
states: 18,768 (4)
.-> the formula is FALSE

FORMULA Peterson-PT-2-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: EX [[[[~ [[[[TestIdentity_1_1_2<=0 & TestIdentity_1_0_1<=BeginLoop_1_0_0] & AF [EndTurn_1_0<=0]] | E [1<=BeginLoop_2_0_1 U TestTurn_2_0<=TestIdentity_0_1_2]]] | [[~ [CS_1<=0] | AF [AskForSection_2_1<=AskForSection_1_1]] & ~ [1<=TestAlone_0_1_1]]] & [AX [E [BeginLoop_0_1_2<=TestIdentity_2_1_2 U 1<=EndTurn_0_1]] | 1<=TestIdentity_1_0_2]] & AG [IsEndLoop_0_1_2<=WantSection_2_F]]]
normalized: EX [[~ [E [true U ~ [IsEndLoop_0_1_2<=WantSection_2_F]]] & [[1<=TestIdentity_1_0_2 | ~ [EX [~ [E [BeginLoop_0_1_2<=TestIdentity_2_1_2 U 1<=EndTurn_0_1]]]]] & [[~ [1<=TestAlone_0_1_1] & [~ [EG [~ [AskForSection_2_1<=AskForSection_1_1]]] | ~ [CS_1<=0]]] | ~ [[E [1<=BeginLoop_2_0_1 U TestTurn_2_0<=TestIdentity_0_1_2] | [~ [EG [~ [EndTurn_1_0<=0]]] & [TestIdentity_1_1_2<=0 & TestIdentity_1_0_1<=BeginLoop_1_0_0]]]]]]]]

abstracting: (TestIdentity_1_0_1<=BeginLoop_1_0_0)
states: 20,012 (4)
abstracting: (TestIdentity_1_1_2<=0)
states: 20,558 (4)
abstracting: (EndTurn_1_0<=0)
states: 20,036 (4)
.
EG iterations: 1
abstracting: (TestTurn_2_0<=TestIdentity_0_1_2)
states: 18,878 (4)
abstracting: (1<=BeginLoop_2_0_1)
states: 832
abstracting: (CS_1<=0)
states: 20,558 (4)
abstracting: (AskForSection_2_1<=AskForSection_1_1)
states: 20,015 (4)
.
EG iterations: 1
abstracting: (1<=TestAlone_0_1_1)
states: 276
abstracting: (1<=EndTurn_0_1)
states: 100
abstracting: (BeginLoop_0_1_2<=TestIdentity_2_1_2)
states: 20,654 (4)
.abstracting: (1<=TestIdentity_1_0_2)
states: 742
abstracting: (IsEndLoop_0_1_2<=WantSection_2_F)
states: 20,660 (4)
.-> the formula is FALSE

FORMULA Peterson-PT-2-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.425sec

checking: AG [EF [~ [E [~ [A [20<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1) U sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)<=3]] U sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=11]]]]
normalized: ~ [E [true U ~ [E [true U ~ [E [~ [[~ [EG [~ [sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)<=3]]] & ~ [E [~ [sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)<=3] U [~ [20<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)] & ~ [sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)<=3]]]]]] U sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=11]]]]]]

abstracting: (sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=11)
states: 20,754 (4)
abstracting: (sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)<=3)
states: 20,754 (4)
abstracting: (20<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1))
states: 0
abstracting: (sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)<=3)
states: 20,754 (4)
abstracting: (sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)<=3)
states: 20,754 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Peterson-PT-2-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.676sec

checking: ~ [AG [~ [AF [[sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0) & EX [61<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)]]]]]]
normalized: E [true U ~ [EG [~ [[sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0) & EX [61<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)]]]]]]

abstracting: (61<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0))
states: 0
.abstracting: (sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0))
states: 75

EG iterations: 0
-> the formula is FALSE

FORMULA Peterson-PT-2-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.646sec

checking: ~ [E [sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=55 U EG [AF [sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)]]]]
normalized: ~ [E [sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=55 U EG [~ [EG [~ [sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)]]]]]]

abstracting: (sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0))
states: 2,389 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=55)
states: 20,754 (4)
-> the formula is FALSE

FORMULA Peterson-PT-2-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m39.597sec

checking: E [~ [6<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)] U ~ [EG [[[A [sum(Idle_1, Idle_2, Idle_0)<=43 U 31<=sum(Idle_1, Idle_2, Idle_0)] | 16<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)] | ~ [AG [sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=97]]]]]]
normalized: E [~ [6<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)] U ~ [EG [[E [true U ~ [sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=97]] | [16<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0) | [~ [EG [~ [31<=sum(Idle_1, Idle_2, Idle_0)]]] & ~ [E [~ [31<=sum(Idle_1, Idle_2, Idle_0)] U [~ [sum(Idle_1, Idle_2, Idle_0)<=43] & ~ [31<=sum(Idle_1, Idle_2, Idle_0)]]]]]]]]]]

abstracting: (31<=sum(Idle_1, Idle_2, Idle_0))
states: 0
abstracting: (sum(Idle_1, Idle_2, Idle_0)<=43)
states: 20,754 (4)
abstracting: (31<=sum(Idle_1, Idle_2, Idle_0))
states: 0
abstracting: (31<=sum(Idle_1, Idle_2, Idle_0))
states: 0

EG iterations: 0
abstracting: (16<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0))
states: 0
abstracting: (sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=97)
states: 20,754 (4)
.
EG iterations: 1
abstracting: (6<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0))
states: 0
-> the formula is TRUE

FORMULA Peterson-PT-2-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.763sec

checking: EF [~ [[EF [77<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)] | E [EG [[33<=sum(Idle_1, Idle_2, Idle_0) & 11<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)]] U EF [EG [6<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)]]]]]]
normalized: E [true U ~ [[E [EG [[33<=sum(Idle_1, Idle_2, Idle_0) & 11<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)]] U E [true U EG [6<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)]]] | E [true U 77<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)]]]]

abstracting: (77<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0))
states: 0
abstracting: (6<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0))
states: 0
.
EG iterations: 1
abstracting: (11<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0))
states: 0
abstracting: (33<=sum(Idle_1, Idle_2, Idle_0))
states: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA Peterson-PT-2-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.820sec

checking: ~ [[[EG [[[AF [sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=51] & [EX [78<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)] | AG [sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=13]]] & 49<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)]] | A [~ [EF [sum(Idle_1, Idle_2, Idle_0)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)]] U [EF [EG [51<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)]] | ~ [AG [sum(Idle_1, Idle_2, Idle_0)<=38]]]]] & EF [EG [sum(CS_2, CS_1, CS_0)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)]]]]
normalized: ~ [[E [true U EG [sum(CS_2, CS_1, CS_0)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)]] & [[~ [EG [~ [[E [true U ~ [sum(Idle_1, Idle_2, Idle_0)<=38]] | E [true U EG [51<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)]]]]]] & ~ [E [~ [[E [true U ~ [sum(Idle_1, Idle_2, Idle_0)<=38]] | E [true U EG [51<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)]]]] U [E [true U sum(Idle_1, Idle_2, Idle_0)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)] & ~ [[E [true U ~ [sum(Idle_1, Idle_2, Idle_0)<=38]] | E [true U EG [51<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)]]]]]]]] | EG [[49<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0) & [[~ [E [true U ~ [sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=13]]] | EX [78<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)]] & ~ [EG [~ [sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=51]]]]]]]]]

abstracting: (sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=51)
states: 20,754 (4)
.
EG iterations: 1
abstracting: (78<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0))
states: 0
.abstracting: (sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=13)
states: 20,754 (4)
abstracting: (49<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0))
states: 0
.
EG iterations: 1
abstracting: (51<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0))
states: 0
.
EG iterations: 1
abstracting: (sum(Idle_1, Idle_2, Idle_0)<=38)
states: 20,754 (4)
abstracting: (sum(Idle_1, Idle_2, Idle_0)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T))
states: 20,754 (4)
abstracting: (51<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0))
states: 0
.
EG iterations: 1
abstracting: (sum(Idle_1, Idle_2, Idle_0)<=38)
states: 20,754 (4)
abstracting: (51<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0))
states: 0
.
EG iterations: 1
abstracting: (sum(Idle_1, Idle_2, Idle_0)<=38)
states: 20,754 (4)

EG iterations: 0
abstracting: (sum(CS_2, CS_1, CS_0)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0))
states: 20,754 (4)

EG iterations: 0
-> the formula is TRUE

FORMULA Peterson-PT-2-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.860sec

checking: ~ [AG [[EX [[~ [EG [sum(Idle_1, Idle_2, Idle_0)<=sum(CS_2, CS_1, CS_0)]] | [[sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0) | sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)] | [33<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1) & sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)]]]] | A [sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T) U [84<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0) & AF [76<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)]]]]]]
normalized: E [true U ~ [[[~ [EG [~ [[84<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0) & ~ [EG [~ [76<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)]]]]]]] & ~ [E [~ [[84<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0) & ~ [EG [~ [76<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)]]]]] U [~ [sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)] & ~ [[84<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0) & ~ [EG [~ [76<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)]]]]]]]]] | EX [[[[33<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1) & sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)] | [sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0) | sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)]] | ~ [EG [sum(Idle_1, Idle_2, Idle_0)<=sum(CS_2, CS_1, CS_0)]]]]]]]

abstracting: (sum(Idle_1, Idle_2, Idle_0)<=sum(CS_2, CS_1, CS_0))
states: 17,760 (4)
.
EG iterations: 1
abstracting: (sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1))
states: 20,754 (4)
abstracting: (sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0))
states: 20,754 (4)
abstracting: (sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0))
states: 12,257 (4)
abstracting: (33<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1))
states: 0
.abstracting: (76<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1))
states: 0

EG iterations: 0
abstracting: (84<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0))
states: 0
abstracting: (sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T))
states: 20,754 (4)
abstracting: (76<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1))
states: 0

EG iterations: 0
abstracting: (84<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0))
states: 0
abstracting: (76<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1))
states: 0

EG iterations: 0
abstracting: (84<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0))
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA Peterson-PT-2-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.703sec

totally nodes used: 1146419 (1.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2716117 7579057 10295174
used/not used/entry size/cache size: 8148344 58960520 16 1024MB
basic ops cache: hits/miss/sum: 410323 1145615 1555938
used/not used/entry size/cache size: 1876626 14900590 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 52442887 52442887
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 11558 35271 46829
used/not used/entry size/cache size: 35209 8353399 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 66069259
1 946603
2 80679
3 10961
4 1241
5 115
6 6
7 0
8 0
9 0
>= 10 0

Total processing time: 1m15.333sec


BK_STOP 1678930525286

--------------------
content from stderr:

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:9670 (76), effective:632 (5)

initing FirstDep: 0m 0.004sec


iterations count:7609 (60), effective:359 (2)

iterations count:2910 (23), effective:192 (1)

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

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

iterations count:7089 (56), effective:372 (2)

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

iterations count:7089 (56), effective:372 (2)

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

iterations count:7089 (56), effective:372 (2)

iterations count:7100 (56), effective:369 (2)

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

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

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

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

iterations count:7351 (58), effective:381 (3)

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

iterations count:1248 (9), effective:45 (0)

iterations count:5999 (47), effective:272 (2)

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

iterations count:8558 (67), effective:375 (2)

iterations count:2961 (23), effective:189 (1)

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

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

iterations count:4259 (33), effective:150 (1)

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

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

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

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-2"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
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 marcie"
echo " Input is Peterson-PT-2, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r257-smll-167863533000601"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-2.tgz
mv Peterson-PT-2 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;