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.r225-tall-167856407600449.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 LeafsetExtension-PT-S08C2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r225-tall-167856407600449
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 13K Feb 25 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 16:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 16:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 647K Mar 5 18:22 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 LeafsetExtension-PT-S08C2-CTLCardinality-00
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-01
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-02
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-03
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-04
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-05
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-06
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-07
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-08
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-09
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-10
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-11
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-12
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-13
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-14
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678624977734

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=LeafsetExtension-PT-S08C2
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: LeafsetExtension_PT_S08C2
(NrP: 462 NrTr: 409 NrArc: 1324)

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

net check time: 0m 0.000sec

init dd package: 0m 2.789sec


RS generation: 0m22.544sec


-> reachability set: #nodes 262827 (2.6e+05) #states 172,248 (5)



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

checking: EG [LxHasReceivedTheRequestOfNode8<=2]
normalized: EG [LxHasReceivedTheRequestOfNode8<=2]

abstracting: (LxHasReceivedTheRequestOfNode8<=2)
states: 172,248 (5)

EG iterations: 0
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: AX [EF [EG [[EG [LeafSetOfLxIsSentToNode1<=0] | AX [Node2ManageTheBreakDownOfNode7<=0]]]]]
normalized: ~ [EX [~ [E [true U EG [[EG [LeafSetOfLxIsSentToNode1<=0] | ~ [EX [~ [Node2ManageTheBreakDownOfNode7<=0]]]]]]]]]

abstracting: (Node2ManageTheBreakDownOfNode7<=0)
states: 171,687 (5)
.abstracting: (LeafSetOfLxIsSentToNode1<=0)
states: 169,566 (5)
..............
EG iterations: 14
.
EG iterations: 1
.-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 2.093sec

checking: EG [Node8HasTheLeafSetOfRxToReplaceNode6<=Node4FailureProcessedByNode8]
normalized: EG [Node8HasTheLeafSetOfRxToReplaceNode6<=Node4FailureProcessedByNode8]

abstracting: (Node8HasTheLeafSetOfRxToReplaceNode6<=Node4FailureProcessedByNode8)
states: 171,691 (5)
..............
EG iterations: 14
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.585sec

checking: AF [EG [AG [[~ [[2<=Node8DontAnswerToAnyNode & LeafSetOfRxIsSentToNode4<=0]] & ~ [[Node5WantsToManageTheBreakDownOfNode2<=2 & 2<=Node1WantsToManageTheBreakDownOfNode5]]]]]]
normalized: ~ [EG [~ [EG [~ [E [true U ~ [[~ [[Node5WantsToManageTheBreakDownOfNode2<=2 & 2<=Node1WantsToManageTheBreakDownOfNode5]] & ~ [[2<=Node8DontAnswerToAnyNode & LeafSetOfRxIsSentToNode4<=0]]]]]]]]]]

abstracting: (LeafSetOfRxIsSentToNode4<=0)
states: 170,046 (5)
abstracting: (2<=Node8DontAnswerToAnyNode)
states: 0
abstracting: (2<=Node1WantsToManageTheBreakDownOfNode5)
states: 0
abstracting: (Node5WantsToManageTheBreakDownOfNode2<=2)
states: 172,248 (5)

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

FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.302sec

checking: AG [[AG [AF [[A [2<=Node1WantsToManageTheBreakDownOfNode3 U Node7HasTheLeafSetOfLxToReplaceNode2<=1] | [Node7HasTheLeafSetOfRxToReplaceNode6<=Node4DontAnswerToAnyNode | Node8HasTheLeafSetOfRxToReplaceNode4<=2]]]] | Node2FailureProcessedByNode0<=1]]
normalized: ~ [E [true U ~ [[Node2FailureProcessedByNode0<=1 | ~ [E [true U EG [~ [[[~ [E [~ [Node7HasTheLeafSetOfLxToReplaceNode2<=1] U [~ [2<=Node1WantsToManageTheBreakDownOfNode3] & ~ [Node7HasTheLeafSetOfLxToReplaceNode2<=1]]]] & ~ [EG [~ [Node7HasTheLeafSetOfLxToReplaceNode2<=1]]]] | [Node7HasTheLeafSetOfRxToReplaceNode6<=Node4DontAnswerToAnyNode | Node8HasTheLeafSetOfRxToReplaceNode4<=2]]]]]]]]]]

abstracting: (Node8HasTheLeafSetOfRxToReplaceNode4<=2)
states: 172,248 (5)
abstracting: (Node7HasTheLeafSetOfRxToReplaceNode6<=Node4DontAnswerToAnyNode)
states: 171,688 (5)
abstracting: (Node7HasTheLeafSetOfLxToReplaceNode2<=1)
states: 172,248 (5)
.
EG iterations: 1
abstracting: (Node7HasTheLeafSetOfLxToReplaceNode2<=1)
states: 172,248 (5)
abstracting: (2<=Node1WantsToManageTheBreakDownOfNode3)
states: 0
abstracting: (Node7HasTheLeafSetOfLxToReplaceNode2<=1)
states: 172,248 (5)
.
EG iterations: 1
abstracting: (Node2FailureProcessedByNode0<=1)
states: 172,248 (5)
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.459sec

checking: [E [EX [~ [2<=RxIsActiveAndNotInTheLeafSet]] U ~ [Node7HasAskedItsLeafSetToRxToReplaceNode5<=1]] & AF [[EX [A [EG [Node7WantsToManageTheBreakDownOfNode0<=2] U ~ [Node5ManageTheBreakDownOfNode2<=LeafSetOfRxIsSentToNode5]]] | 2<=Node2HasTheLeafSetOfRxToReplaceNode6]]]
normalized: [E [EX [~ [2<=RxIsActiveAndNotInTheLeafSet]] U ~ [Node7HasAskedItsLeafSetToRxToReplaceNode5<=1]] & ~ [EG [~ [[2<=Node2HasTheLeafSetOfRxToReplaceNode6 | EX [[~ [E [Node5ManageTheBreakDownOfNode2<=LeafSetOfRxIsSentToNode5 U [Node5ManageTheBreakDownOfNode2<=LeafSetOfRxIsSentToNode5 & ~ [EG [Node7WantsToManageTheBreakDownOfNode0<=2]]]]] & ~ [EG [Node5ManageTheBreakDownOfNode2<=LeafSetOfRxIsSentToNode5]]]]]]]]]

abstracting: (Node5ManageTheBreakDownOfNode2<=LeafSetOfRxIsSentToNode5)
states: 171,691 (5)
..........
EG iterations: 10
abstracting: (Node7WantsToManageTheBreakDownOfNode0<=2)
states: 172,248 (5)

EG iterations: 0
abstracting: (Node5ManageTheBreakDownOfNode2<=LeafSetOfRxIsSentToNode5)
states: 171,691 (5)
abstracting: (Node5ManageTheBreakDownOfNode2<=LeafSetOfRxIsSentToNode5)
states: 171,691 (5)
.abstracting: (2<=Node2HasTheLeafSetOfRxToReplaceNode6)
states: 0
.
EG iterations: 1
abstracting: (Node7HasAskedItsLeafSetToRxToReplaceNode5<=1)
states: 172,248 (5)
abstracting: (2<=RxIsActiveAndNotInTheLeafSet)
states: 0
.-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.366sec

checking: ~ [[AX [~ [[[~ [[Node1ManageTheBreakDownOfNode3<=0 & Node1HasTheLeafSetOfLxToReplaceNode2<=2]] & [[Node0HasTheLeafSetOfLxToReplaceNode2<=2 & Node8ManageTheBreakDownOfNode3<=2] & AG [1<=Node8ManageTheBreakDownOfNode5]]] & AF [EF [LeafSetOfLxIsSentToNode8<=2]]]]] & ~ [AG [AF [[Node5HasAskedItsLeafSetToLxToReplaceNode2<=Node0HasAskedItsLeafSetToLxToReplaceNode3 | LxIsActiveInTheLeafSet<=1]]]]]]
normalized: ~ [[~ [EX [[~ [EG [~ [E [true U LeafSetOfLxIsSentToNode8<=2]]]] & [~ [[Node1ManageTheBreakDownOfNode3<=0 & Node1HasTheLeafSetOfLxToReplaceNode2<=2]] & [~ [E [true U ~ [1<=Node8ManageTheBreakDownOfNode5]]] & [Node0HasTheLeafSetOfLxToReplaceNode2<=2 & Node8ManageTheBreakDownOfNode3<=2]]]]]] & E [true U EG [~ [[Node5HasAskedItsLeafSetToLxToReplaceNode2<=Node0HasAskedItsLeafSetToLxToReplaceNode3 | LxIsActiveInTheLeafSet<=1]]]]]]

abstracting: (LxIsActiveInTheLeafSet<=1)
states: 172,248 (5)
abstracting: (Node5HasAskedItsLeafSetToLxToReplaceNode2<=Node0HasAskedItsLeafSetToLxToReplaceNode3)
states: 170,583 (5)
.
EG iterations: 1
abstracting: (Node8ManageTheBreakDownOfNode3<=2)
states: 172,248 (5)
abstracting: (Node0HasTheLeafSetOfLxToReplaceNode2<=2)
states: 172,248 (5)
abstracting: (1<=Node8ManageTheBreakDownOfNode5)
states: 561
abstracting: (Node1HasTheLeafSetOfLxToReplaceNode2<=2)
states: 172,248 (5)
abstracting: (Node1ManageTheBreakDownOfNode3<=0)
states: 171,687 (5)
abstracting: (LeafSetOfLxIsSentToNode8<=2)
states: 172,248 (5)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.284sec

checking: EX [E [A [E [~ [1<=LxHasReceivedTheRequestOfNode2] U [1<=Node5HasTheLeafSetOfLxToReplaceNode3 & 2<=Node4ManageTheBreakDownOfNode1]] U AF [A [1<=LeafSetOfLxIsSentToNode8 U 1<=Node8ManageTheBreakDownOfNode7]]] U E [RxHasReceivedTheRequestOfNode1<=Node5HasAskedItsLeafSetToLxToReplaceNode2 U [~ [EX [Node5WantsToManageTheBreakDownOfNode8<=Node7HasAskedItsLeafSetToRxToReplaceNode4]] | 1<=Node8HasAskedItsLeafSetToRxToReplaceNode5]]]]
normalized: EX [E [[~ [EG [EG [~ [[~ [EG [~ [1<=Node8ManageTheBreakDownOfNode7]]] & ~ [E [~ [1<=Node8ManageTheBreakDownOfNode7] U [~ [1<=LeafSetOfLxIsSentToNode8] & ~ [1<=Node8ManageTheBreakDownOfNode7]]]]]]]]] & ~ [E [EG [~ [[~ [EG [~ [1<=Node8ManageTheBreakDownOfNode7]]] & ~ [E [~ [1<=Node8ManageTheBreakDownOfNode7] U [~ [1<=LeafSetOfLxIsSentToNode8] & ~ [1<=Node8ManageTheBreakDownOfNode7]]]]]]] U [~ [E [~ [1<=LxHasReceivedTheRequestOfNode2] U [1<=Node5HasTheLeafSetOfLxToReplaceNode3 & 2<=Node4ManageTheBreakDownOfNode1]]] & EG [~ [[~ [EG [~ [1<=Node8ManageTheBreakDownOfNode7]]] & ~ [E [~ [1<=Node8ManageTheBreakDownOfNode7] U [~ [1<=LeafSetOfLxIsSentToNode8] & ~ [1<=Node8ManageTheBreakDownOfNode7]]]]]]]]]]] U E [RxHasReceivedTheRequestOfNode1<=Node5HasAskedItsLeafSetToLxToReplaceNode2 U [1<=Node8HasAskedItsLeafSetToRxToReplaceNode5 | ~ [EX [Node5WantsToManageTheBreakDownOfNode8<=Node7HasAskedItsLeafSetToRxToReplaceNode4]]]]]]

abstracting: (Node5WantsToManageTheBreakDownOfNode8<=Node7HasAskedItsLeafSetToRxToReplaceNode4)
states: 171,693 (5)
.abstracting: (1<=Node8HasAskedItsLeafSetToRxToReplaceNode5)
states: 1,671 (3)
abstracting: (RxHasReceivedTheRequestOfNode1<=Node5HasAskedItsLeafSetToLxToReplaceNode2)
states: 170,034 (5)
abstracting: (1<=Node8ManageTheBreakDownOfNode7)
states: 561
abstracting: (1<=LeafSetOfLxIsSentToNode8)
states: 2,226 (3)
abstracting: (1<=Node8ManageTheBreakDownOfNode7)
states: 561
abstracting: (1<=Node8ManageTheBreakDownOfNode7)
states: 561
............
EG iterations: 12
............
EG iterations: 12
abstracting: (2<=Node4ManageTheBreakDownOfNode1)
states: 0
abstracting: (1<=Node5HasTheLeafSetOfLxToReplaceNode3)
states: 561
abstracting: (1<=LxHasReceivedTheRequestOfNode2)
states: 2,682 (3)
abstracting: (1<=Node8ManageTheBreakDownOfNode7)
states: 561
abstracting: (1<=LeafSetOfLxIsSentToNode8)
states: 2,226 (3)
abstracting: (1<=Node8ManageTheBreakDownOfNode7)
states: 561
abstracting: (1<=Node8ManageTheBreakDownOfNode7)
states: 561
............
EG iterations: 12
............
EG iterations: 12
abstracting: (1<=Node8ManageTheBreakDownOfNode7)
states: 561
abstracting: (1<=LeafSetOfLxIsSentToNode8)
states: 2,226 (3)
abstracting: (1<=Node8ManageTheBreakDownOfNode7)
states: 561
abstracting: (1<=Node8ManageTheBreakDownOfNode7)
states: 561
............
EG iterations: 12
............
EG iterations: 12
.
EG iterations: 1
.-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 3.703sec

checking: [A [Node6HasTheLeafSetOfRxToReplaceNode7<=0 U ~ [E [Node3WantsToManageTheBreakDownOfNode8<=0 U EG [EG [2<=Node7ManageTheBreakDownOfNode3]]]]] | ~ [A [LeafSetOfLxIsSentToNode7<=Node3WantsToManageTheBreakDownOfNode5 U [[[EG [LeafSetOfLxIsSentToNode6<=0] & ~ [Node6FailureProcessedByNode5<=1]] & EF [Node5FailureProcessedByNode4<=Node6WantsToManageTheBreakDownOfNode2]] & Node5WantsToManageTheBreakDownOfNode6<=Node1WantsToManageTheBreakDownOfNode7]]]]
normalized: [~ [[~ [EG [~ [[Node5WantsToManageTheBreakDownOfNode6<=Node1WantsToManageTheBreakDownOfNode7 & [E [true U Node5FailureProcessedByNode4<=Node6WantsToManageTheBreakDownOfNode2] & [~ [Node6FailureProcessedByNode5<=1] & EG [LeafSetOfLxIsSentToNode6<=0]]]]]]] & ~ [E [~ [[Node5WantsToManageTheBreakDownOfNode6<=Node1WantsToManageTheBreakDownOfNode7 & [E [true U Node5FailureProcessedByNode4<=Node6WantsToManageTheBreakDownOfNode2] & [~ [Node6FailureProcessedByNode5<=1] & EG [LeafSetOfLxIsSentToNode6<=0]]]]] U [~ [[Node5WantsToManageTheBreakDownOfNode6<=Node1WantsToManageTheBreakDownOfNode7 & [E [true U Node5FailureProcessedByNode4<=Node6WantsToManageTheBreakDownOfNode2] & [~ [Node6FailureProcessedByNode5<=1] & EG [LeafSetOfLxIsSentToNode6<=0]]]]] & ~ [LeafSetOfLxIsSentToNode7<=Node3WantsToManageTheBreakDownOfNode5]]]]]] | [~ [EG [E [Node3WantsToManageTheBreakDownOfNode8<=0 U EG [EG [2<=Node7ManageTheBreakDownOfNode3]]]]] & ~ [E [E [Node3WantsToManageTheBreakDownOfNode8<=0 U EG [EG [2<=Node7ManageTheBreakDownOfNode3]]] U [~ [Node6HasTheLeafSetOfRxToReplaceNode7<=0] & E [Node3WantsToManageTheBreakDownOfNode8<=0 U EG [EG [2<=Node7ManageTheBreakDownOfNode3]]]]]]]]

abstracting: (2<=Node7ManageTheBreakDownOfNode3)
states: 0
.
EG iterations: 1
.
EG iterations: 1
abstracting: (Node3WantsToManageTheBreakDownOfNode8<=0)
states: 171,687 (5)
abstracting: (Node6HasTheLeafSetOfRxToReplaceNode7<=0)
states: 171,687 (5)
abstracting: (2<=Node7ManageTheBreakDownOfNode3)
states: 0
.
EG iterations: 1
.
EG iterations: 1
abstracting: (Node3WantsToManageTheBreakDownOfNode8<=0)
states: 171,687 (5)
abstracting: (2<=Node7ManageTheBreakDownOfNode3)
states: 0
.
EG iterations: 1
.
EG iterations: 1
abstracting: (Node3WantsToManageTheBreakDownOfNode8<=0)
states: 171,687 (5)
.
EG iterations: 1
abstracting: (LeafSetOfLxIsSentToNode7<=Node3WantsToManageTheBreakDownOfNode5)
states: 170,026 (5)
abstracting: (LeafSetOfLxIsSentToNode6<=0)
states: 170,022 (5)
.............
EG iterations: 13
abstracting: (Node6FailureProcessedByNode5<=1)
states: 172,248 (5)
abstracting: (Node5FailureProcessedByNode4<=Node6WantsToManageTheBreakDownOfNode2)
states: 171,188 (5)
abstracting: (Node5WantsToManageTheBreakDownOfNode6<=Node1WantsToManageTheBreakDownOfNode7)
states: 171,688 (5)
abstracting: (LeafSetOfLxIsSentToNode6<=0)
states: 170,022 (5)
.............
EG iterations: 13
abstracting: (Node6FailureProcessedByNode5<=1)
states: 172,248 (5)
abstracting: (Node5FailureProcessedByNode4<=Node6WantsToManageTheBreakDownOfNode2)
states: 171,188 (5)
abstracting: (Node5WantsToManageTheBreakDownOfNode6<=Node1WantsToManageTheBreakDownOfNode7)
states: 171,688 (5)
abstracting: (LeafSetOfLxIsSentToNode6<=0)
states: 170,022 (5)
.............
EG iterations: 13
abstracting: (Node6FailureProcessedByNode5<=1)
states: 172,248 (5)
abstracting: (Node5FailureProcessedByNode4<=Node6WantsToManageTheBreakDownOfNode2)
states: 171,188 (5)
abstracting: (Node5WantsToManageTheBreakDownOfNode6<=Node1WantsToManageTheBreakDownOfNode7)
states: 171,688 (5)

EG iterations: 0
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.575sec

checking: EX [[[E [AG [E [Node6FailureProcessedByNode1<=RxHasReceivedTheRequestOfNode2 U Node4FailureProcessedByNode2<=ANodeFromTheLeafSetOfLxIsACtiveInTheLeafSet]] U [~ [Node0ManageTheBreakDownOfNode1<=Node7IsActive] & ~ [2<=Node7HasAskedItsLeafSetToRxToReplaceNode8]]] & A [EX [[1<=Node0ManageTheBreakDownOfNode7 | 2<=Node1WantsToManageTheBreakDownOfNode4]] U AG [EG [Node0ManageTheBreakDownOfNode4<=0]]]] & EX [AF [~ [Node2HasAskedItsLeafSetToLxToReplaceNode3<=Node7IsActive]]]]]
normalized: EX [[EX [~ [EG [Node2HasAskedItsLeafSetToLxToReplaceNode3<=Node7IsActive]]] & [[~ [EG [E [true U ~ [EG [Node0ManageTheBreakDownOfNode4<=0]]]]] & ~ [E [E [true U ~ [EG [Node0ManageTheBreakDownOfNode4<=0]]] U [~ [EX [[1<=Node0ManageTheBreakDownOfNode7 | 2<=Node1WantsToManageTheBreakDownOfNode4]]] & E [true U ~ [EG [Node0ManageTheBreakDownOfNode4<=0]]]]]]] & E [~ [E [true U ~ [E [Node6FailureProcessedByNode1<=RxHasReceivedTheRequestOfNode2 U Node4FailureProcessedByNode2<=ANodeFromTheLeafSetOfLxIsACtiveInTheLeafSet]]]] U [~ [2<=Node7HasAskedItsLeafSetToRxToReplaceNode8] & ~ [Node0ManageTheBreakDownOfNode1<=Node7IsActive]]]]]]

abstracting: (Node0ManageTheBreakDownOfNode1<=Node7IsActive)
states: 172,183 (5)
abstracting: (2<=Node7HasAskedItsLeafSetToRxToReplaceNode8)
states: 0
abstracting: (Node4FailureProcessedByNode2<=ANodeFromTheLeafSetOfLxIsACtiveInTheLeafSet)
states: 171,346 (5)
abstracting: (Node6FailureProcessedByNode1<=RxHasReceivedTheRequestOfNode2)
states: 171,194 (5)
abstracting: (Node0ManageTheBreakDownOfNode4<=0)
states: 171,222 (5)
............
EG iterations: 12
abstracting: (2<=Node1WantsToManageTheBreakDownOfNode4)
states: 0
abstracting: (1<=Node0ManageTheBreakDownOfNode7)
states: 561
.abstracting: (Node0ManageTheBreakDownOfNode4<=0)
states: 171,222 (5)
............
EG iterations: 12
abstracting: (Node0ManageTheBreakDownOfNode4<=0)
states: 171,222 (5)
............
EG iterations: 12
...............
EG iterations: 15
abstracting: (Node2HasAskedItsLeafSetToLxToReplaceNode3<=Node7IsActive)
states: 172,053 (5)
...........
EG iterations: 11
..-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.412sec

checking: ~ [AF [[[~ [AF [Node1WantsToManageTheBreakDownOfNode6<=RequestOfNode4IsSentToLx]] | 1<=Node2WantsToManageTheBreakDownOfNode8] & [AG [~ [RequestOfNode3IsSentToRx<=Node1DontAnswerToAnyNode]] & [~ [[Node6ManageTheBreakDownOfNode5<=Node2HasAskedItsLeafSetToLxToReplaceNode1 & LxHasReceivedTheRequestOfNode0<=Node2ManageTheBreakDownOfNode7]] | [[[Node3WantsToManageTheBreakDownOfNode4<=1 | 1<=Node2HasAskedItsLeafSetToRxToReplaceNode8] & [LeafSetOfRxIsSentToNode6<=Node2HasTheLeafSetOfLxToReplaceNode1 | Node2HasTheLeafSetOfLxToReplaceNode0<=2]] & EF [Node0HasTheLeafSetOfLxToReplaceNode3<=1]]]]]]]
normalized: EG [~ [[[[[E [true U Node0HasTheLeafSetOfLxToReplaceNode3<=1] & [[LeafSetOfRxIsSentToNode6<=Node2HasTheLeafSetOfLxToReplaceNode1 | Node2HasTheLeafSetOfLxToReplaceNode0<=2] & [Node3WantsToManageTheBreakDownOfNode4<=1 | 1<=Node2HasAskedItsLeafSetToRxToReplaceNode8]]] | ~ [[Node6ManageTheBreakDownOfNode5<=Node2HasAskedItsLeafSetToLxToReplaceNode1 & LxHasReceivedTheRequestOfNode0<=Node2ManageTheBreakDownOfNode7]]] & ~ [E [true U RequestOfNode3IsSentToRx<=Node1DontAnswerToAnyNode]]] & [1<=Node2WantsToManageTheBreakDownOfNode8 | EG [~ [Node1WantsToManageTheBreakDownOfNode6<=RequestOfNode4IsSentToLx]]]]]]

abstracting: (Node1WantsToManageTheBreakDownOfNode6<=RequestOfNode4IsSentToLx)
states: 171,691 (5)
............
EG iterations: 12
abstracting: (1<=Node2WantsToManageTheBreakDownOfNode8)
states: 561
abstracting: (RequestOfNode3IsSentToRx<=Node1DontAnswerToAnyNode)
states: 170,026 (5)
abstracting: (LxHasReceivedTheRequestOfNode0<=Node2ManageTheBreakDownOfNode7)
states: 169,571 (5)
abstracting: (Node6ManageTheBreakDownOfNode5<=Node2HasAskedItsLeafSetToLxToReplaceNode1)
states: 171,690 (5)
abstracting: (1<=Node2HasAskedItsLeafSetToRxToReplaceNode8)
states: 1,674 (3)
abstracting: (Node3WantsToManageTheBreakDownOfNode4<=1)
states: 172,248 (5)
abstracting: (Node2HasTheLeafSetOfLxToReplaceNode0<=2)
states: 172,248 (5)
abstracting: (LeafSetOfRxIsSentToNode6<=Node2HasTheLeafSetOfLxToReplaceNode1)
states: 169,571 (5)
abstracting: (Node0HasTheLeafSetOfLxToReplaceNode3<=1)
states: 172,248 (5)

EG iterations: 0
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.341sec

checking: EF [[[AX [[[~ [RxHasReceivedTheRequestOfNode0<=2] & Node3HasAskedItsLeafSetToLxToReplaceNode4<=Node8HasTheLeafSetOfLxToReplaceNode0] & [RequestOfNode8IsSentToLx<=Node7IsActive | Node3ManageTheBreakDownOfNode2<=0]]] & [[[NoNodeManageTheBreakDownOfNode4<=0 & ~ [AF [Node4HasAskedItsLeafSetToRxToReplaceNode6<=RequestOfNode1IsSentToLx]]] | EX [AG [2<=Node2WantsToManageTheBreakDownOfNode4]]] | [[EX [1<=Node5ManageTheBreakDownOfNode7] | ~ [[Node0HasTheLeafSetOfLxToReplaceNode1<=RequestOfNode7IsSentToLx & 1<=RequestOfNode0IsSentToLx]]] & Node8IsActive<=1]]] & 2<=Node2ManageTheBreakDownOfNode4]]
normalized: E [true U [2<=Node2ManageTheBreakDownOfNode4 & [[[Node8IsActive<=1 & [EX [1<=Node5ManageTheBreakDownOfNode7] | ~ [[Node0HasTheLeafSetOfLxToReplaceNode1<=RequestOfNode7IsSentToLx & 1<=RequestOfNode0IsSentToLx]]]] | [EX [~ [E [true U ~ [2<=Node2WantsToManageTheBreakDownOfNode4]]]] | [NoNodeManageTheBreakDownOfNode4<=0 & EG [~ [Node4HasAskedItsLeafSetToRxToReplaceNode6<=RequestOfNode1IsSentToLx]]]]] & ~ [EX [~ [[[Node3HasAskedItsLeafSetToLxToReplaceNode4<=Node8HasTheLeafSetOfLxToReplaceNode0 & ~ [RxHasReceivedTheRequestOfNode0<=2]] & [RequestOfNode8IsSentToLx<=Node7IsActive | Node3ManageTheBreakDownOfNode2<=0]]]]]]]]

abstracting: (Node3ManageTheBreakDownOfNode2<=0)
states: 171,687 (5)
abstracting: (RequestOfNode8IsSentToLx<=Node7IsActive)
states: 171,982 (5)
abstracting: (RxHasReceivedTheRequestOfNode0<=2)
states: 172,248 (5)
abstracting: (Node3HasAskedItsLeafSetToLxToReplaceNode4<=Node8HasTheLeafSetOfLxToReplaceNode0)
states: 170,721 (5)
.abstracting: (Node4HasAskedItsLeafSetToRxToReplaceNode6<=RequestOfNode1IsSentToLx)
states: 170,613 (5)
............
EG iterations: 12
abstracting: (NoNodeManageTheBreakDownOfNode4<=0)
states: 164,545 (5)
abstracting: (2<=Node2WantsToManageTheBreakDownOfNode4)
states: 0
.abstracting: (1<=RequestOfNode0IsSentToLx)
states: 2,682 (3)
abstracting: (Node0HasTheLeafSetOfLxToReplaceNode1<=RequestOfNode7IsSentToLx)
states: 171,690 (5)
abstracting: (1<=Node5ManageTheBreakDownOfNode7)
states: 561
.abstracting: (Node8IsActive<=1)
states: 172,248 (5)
abstracting: (2<=Node2ManageTheBreakDownOfNode4)
states: 0
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.622sec

checking: ~ [AF [[~ [A [[1<=RequestOfNode4IsSentToRx & [Node6FailureProcessedByNode4<=Node1HasTheLeafSetOfRxToReplaceNode5 & Node7FailureProcessedByNode5<=Node3HasAskedItsLeafSetToRxToReplaceNode8]] U [EG [Node1ManageTheBreakDownOfNode6<=Node3ManageTheBreakDownOfNode6] & EX [Node3Failure<=0]]]] & [AX [[[Node5ManageTheBreakDownOfNode2<=Node6HasTheLeafSetOfLxToReplaceNode0 & 2<=RequestOfNode8IsSentToLx] | ~ [Node5WantsToManageTheBreakDownOfNode7<=2]]] & A [A [Node1HasAskedItsLeafSetToRxToReplaceNode8<=Node7HasTheLeafSetOfLxToReplaceNode2 U Node8HasAskedItsLeafSetToRxToReplaceNode5<=1] U AF [ANodeFromTheLeafSetOfRxIsACtiveInTheLeafSet<=Node7WantsToManageTheBreakDownOfNode1]]]]]]
normalized: EG [~ [[[[~ [EG [EG [~ [ANodeFromTheLeafSetOfRxIsACtiveInTheLeafSet<=Node7WantsToManageTheBreakDownOfNode1]]]] & ~ [E [EG [~ [ANodeFromTheLeafSetOfRxIsACtiveInTheLeafSet<=Node7WantsToManageTheBreakDownOfNode1]] U [~ [[~ [E [~ [Node8HasAskedItsLeafSetToRxToReplaceNode5<=1] U [~ [Node1HasAskedItsLeafSetToRxToReplaceNode8<=Node7HasTheLeafSetOfLxToReplaceNode2] & ~ [Node8HasAskedItsLeafSetToRxToReplaceNode5<=1]]]] & ~ [EG [~ [Node8HasAskedItsLeafSetToRxToReplaceNode5<=1]]]]] & EG [~ [ANodeFromTheLeafSetOfRxIsACtiveInTheLeafSet<=Node7WantsToManageTheBreakDownOfNode1]]]]]] & ~ [EX [~ [[[Node5ManageTheBreakDownOfNode2<=Node6HasTheLeafSetOfLxToReplaceNode0 & 2<=RequestOfNode8IsSentToLx] | ~ [Node5WantsToManageTheBreakDownOfNode7<=2]]]]]] & ~ [[~ [EG [~ [[EX [Node3Failure<=0] & EG [Node1ManageTheBreakDownOfNode6<=Node3ManageTheBreakDownOfNode6]]]]] & ~ [E [~ [[EX [Node3Failure<=0] & EG [Node1ManageTheBreakDownOfNode6<=Node3ManageTheBreakDownOfNode6]]] U [~ [[1<=RequestOfNode4IsSentToRx & [Node6FailureProcessedByNode4<=Node1HasTheLeafSetOfRxToReplaceNode5 & Node7FailureProcessedByNode5<=Node3HasAskedItsLeafSetToRxToReplaceNode8]]] & ~ [[EX [Node3Failure<=0] & EG [Node1ManageTheBreakDownOfNode6<=Node3ManageTheBreakDownOfNode6]]]]]]]]]]]

abstracting: (Node1ManageTheBreakDownOfNode6<=Node3ManageTheBreakDownOfNode6)
states: 171,687 (5)
............
EG iterations: 12
abstracting: (Node3Failure<=0)
states: 136,344 (5)
.abstracting: (Node7FailureProcessedByNode5<=Node3HasAskedItsLeafSetToRxToReplaceNode8)
states: 171,192 (5)
abstracting: (Node6FailureProcessedByNode4<=Node1HasTheLeafSetOfRxToReplaceNode5)
states: 171,202 (5)
abstracting: (1<=RequestOfNode4IsSentToRx)
states: 2,202 (3)
abstracting: (Node1ManageTheBreakDownOfNode6<=Node3ManageTheBreakDownOfNode6)
states: 171,687 (5)
............
EG iterations: 12
abstracting: (Node3Failure<=0)
states: 136,344 (5)
.abstracting: (Node1ManageTheBreakDownOfNode6<=Node3ManageTheBreakDownOfNode6)
states: 171,687 (5)
............
EG iterations: 12
abstracting: (Node3Failure<=0)
states: 136,344 (5)
............
EG iterations: 11
abstracting: (Node5WantsToManageTheBreakDownOfNode7<=2)
states: 172,248 (5)
abstracting: (2<=RequestOfNode8IsSentToLx)
states: 6
abstracting: (Node5ManageTheBreakDownOfNode2<=Node6HasTheLeafSetOfLxToReplaceNode0)
states: 171,688 (5)
.abstracting: (ANodeFromTheLeafSetOfRxIsACtiveInTheLeafSet<=Node7WantsToManageTheBreakDownOfNode1)
states: 151,957 (5)
...........
EG iterations: 11
abstracting: (Node8HasAskedItsLeafSetToRxToReplaceNode5<=1)
states: 172,248 (5)
.
EG iterations: 1
abstracting: (Node8HasAskedItsLeafSetToRxToReplaceNode5<=1)
states: 172,248 (5)
abstracting: (Node1HasAskedItsLeafSetToRxToReplaceNode8<=Node7HasTheLeafSetOfLxToReplaceNode2)
states: 170,577 (5)
abstracting: (Node8HasAskedItsLeafSetToRxToReplaceNode5<=1)
states: 172,248 (5)
abstracting: (ANodeFromTheLeafSetOfRxIsACtiveInTheLeafSet<=Node7WantsToManageTheBreakDownOfNode1)
states: 151,957 (5)
...........
EG iterations: 11
abstracting: (ANodeFromTheLeafSetOfRxIsACtiveInTheLeafSet<=Node7WantsToManageTheBreakDownOfNode1)
states: 151,957 (5)
...........
EG iterations: 11
.
EG iterations: 1
...........
before gc: list nodes free: 1586074

after gc: idd nodes used:1035163, unused:62964837; list nodes free:345521519
........
EG iterations: 19
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m46.703sec

checking: [EX [[[~ [1<=Node0WantsToManageTheBreakDownOfNode6] & AG [Node8FailureProcessedByNode5<=Node1HasAskedItsLeafSetToRxToReplaceNode6]] & ~ [AG [E [2<=Node7WantsToManageTheBreakDownOfNode8 U Node4WantsToManageTheBreakDownOfNode8<=2]]]]] | AG [AF [[[AF [Node6FailureProcessedByNode2<=Node5ManageTheBreakDownOfNode1] | [A [Node0FailureProcessedByNode7<=Node1WantsToManageTheBreakDownOfNode4 U 1<=Node5ManageTheBreakDownOfNode1] | ~ [Node3HasAskedItsLeafSetToLxToReplaceNode2<=1]]] & [E [Node3WantsToManageTheBreakDownOfNode1<=LeafSetOfLxIsSentToNode7 U 2<=Node5HasAskedItsLeafSetToRxToReplaceNode7] & [[Node6FailureProcessedByNode1<=1 & Node1ManageTheBreakDownOfNode7<=Node8ManageTheBreakDownOfNode3] | AF [Node6FailureProcessedByNode2<=1]]]]]]]
normalized: [~ [E [true U EG [~ [[[[~ [EG [~ [Node6FailureProcessedByNode2<=1]]] | [Node6FailureProcessedByNode1<=1 & Node1ManageTheBreakDownOfNode7<=Node8ManageTheBreakDownOfNode3]] & E [Node3WantsToManageTheBreakDownOfNode1<=LeafSetOfLxIsSentToNode7 U 2<=Node5HasAskedItsLeafSetToRxToReplaceNode7]] & [[~ [Node3HasAskedItsLeafSetToLxToReplaceNode2<=1] | [~ [EG [~ [1<=Node5ManageTheBreakDownOfNode1]]] & ~ [E [~ [1<=Node5ManageTheBreakDownOfNode1] U [~ [Node0FailureProcessedByNode7<=Node1WantsToManageTheBreakDownOfNode4] & ~ [1<=Node5ManageTheBreakDownOfNode1]]]]]] | ~ [EG [~ [Node6FailureProcessedByNode2<=Node5ManageTheBreakDownOfNode1]]]]]]]]] | EX [[E [true U ~ [E [2<=Node7WantsToManageTheBreakDownOfNode8 U Node4WantsToManageTheBreakDownOfNode8<=2]]] & [~ [E [true U ~ [Node8FailureProcessedByNode5<=Node1HasAskedItsLeafSetToRxToReplaceNode6]]] & ~ [1<=Node0WantsToManageTheBreakDownOfNode6]]]]]

abstracting: (1<=Node0WantsToManageTheBreakDownOfNode6)
states: 561
abstracting: (Node8FailureProcessedByNode5<=Node1HasAskedItsLeafSetToRxToReplaceNode6)
states: 171,192 (5)
abstracting: (Node4WantsToManageTheBreakDownOfNode8<=2)
states: 172,248 (5)
abstracting: (2<=Node7WantsToManageTheBreakDownOfNode8)
states: 0
.abstracting: (Node6FailureProcessedByNode2<=Node5ManageTheBreakDownOfNode1)
states: 171,190 (5)
...
EG iterations: 3
abstracting: (1<=Node5ManageTheBreakDownOfNode1)
states: 561
abstracting: (Node0FailureProcessedByNode7<=Node1WantsToManageTheBreakDownOfNode4)
states: 171,192 (5)
abstracting: (1<=Node5ManageTheBreakDownOfNode1)
states: 561
abstracting: (1<=Node5ManageTheBreakDownOfNode1)
states: 561
............
EG iterations: 12
abstracting: (Node3HasAskedItsLeafSetToLxToReplaceNode2<=1)
states: 172,248 (5)
abstracting: (2<=Node5HasAskedItsLeafSetToRxToReplaceNode7)
states: 0
abstracting: (Node3WantsToManageTheBreakDownOfNode1<=LeafSetOfLxIsSentToNode7)
states: 171,690 (5)
abstracting: (Node1ManageTheBreakDownOfNode7<=Node8ManageTheBreakDownOfNode3)
states: 171,688 (5)
abstracting: (Node6FailureProcessedByNode1<=1)
states: 172,248 (5)
abstracting: (Node6FailureProcessedByNode2<=1)
states: 172,248 (5)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m48.667sec

checking: ~ [EG [[E [Node4HasAskedItsLeafSetToRxToReplaceNode5<=LxIsActiveAndNotInTheLeafSet U [A [1<=Node3ManageTheBreakDownOfNode1 U Node8HasTheLeafSetOfLxToReplaceNode3<=Node8HasTheLeafSetOfLxToReplaceNode2] | EG [1<=Node6HasTheLeafSetOfLxToReplaceNode2]]] & [[[EG [RequestOfNode2IsSentToRx<=Node1FailureProcessedByNode4] | [AF [1<=Node1HasTheLeafSetOfLxToReplaceNode2] & AF [Node6ManageTheBreakDownOfNode7<=1]]] | [[EX [Node4Failure<=2] | AG [2<=Node3HasAskedItsLeafSetToRxToReplaceNode8]] | ~ [[LeafSetOfRxIsSentToNode0<=Node4WantsToManageTheBreakDownOfNode8 & LxHasReceivedTheRequestOfNode0<=Node4HasTheLeafSetOfRxToReplaceNode6]]]] & [~ [[[Node8FailureProcessedByNode3<=Node6Failure & Node2HasAskedItsLeafSetToRxToReplaceNode6<=1] & A [Node3HasTheLeafSetOfLxToReplaceNode0<=2 U 2<=LeafSetOfRxIsSentToNode5]]] | [[[Node5WantsToManageTheBreakDownOfNode3<=0 | Node3WantsToManageTheBreakDownOfNode4<=2] | EX [1<=RxHasReceivedTheRequestOfNode3]] & 1<=Node0FailureProcessedByNode5]]]]]]
normalized: ~ [EG [[E [Node4HasAskedItsLeafSetToRxToReplaceNode5<=LxIsActiveAndNotInTheLeafSet U [EG [1<=Node6HasTheLeafSetOfLxToReplaceNode2] | [~ [EG [~ [Node8HasTheLeafSetOfLxToReplaceNode3<=Node8HasTheLeafSetOfLxToReplaceNode2]]] & ~ [E [~ [Node8HasTheLeafSetOfLxToReplaceNode3<=Node8HasTheLeafSetOfLxToReplaceNode2] U [~ [Node8HasTheLeafSetOfLxToReplaceNode3<=Node8HasTheLeafSetOfLxToReplaceNode2] & ~ [1<=Node3ManageTheBreakDownOfNode1]]]]]]] & [[[EG [RequestOfNode2IsSentToRx<=Node1FailureProcessedByNode4] | [~ [EG [~ [Node6ManageTheBreakDownOfNode7<=1]]] & ~ [EG [~ [1<=Node1HasTheLeafSetOfLxToReplaceNode2]]]]] | [~ [[LeafSetOfRxIsSentToNode0<=Node4WantsToManageTheBreakDownOfNode8 & LxHasReceivedTheRequestOfNode0<=Node4HasTheLeafSetOfRxToReplaceNode6]] | [EX [Node4Failure<=2] | ~ [E [true U ~ [2<=Node3HasAskedItsLeafSetToRxToReplaceNode8]]]]]] & [[1<=Node0FailureProcessedByNode5 & [[Node5WantsToManageTheBreakDownOfNode3<=0 | Node3WantsToManageTheBreakDownOfNode4<=2] | EX [1<=RxHasReceivedTheRequestOfNode3]]] | ~ [[[~ [E [~ [2<=LeafSetOfRxIsSentToNode5] U [~ [Node3HasTheLeafSetOfLxToReplaceNode0<=2] & ~ [2<=LeafSetOfRxIsSentToNode5]]]] & ~ [EG [~ [2<=LeafSetOfRxIsSentToNode5]]]] & [Node8FailureProcessedByNode3<=Node6Failure & Node2HasAskedItsLeafSetToRxToReplaceNode6<=1]]]]]]]]

abstracting: (Node2HasAskedItsLeafSetToRxToReplaceNode6<=1)
states: 172,248 (5)
abstracting: (Node8FailureProcessedByNode3<=Node6Failure)
states: 171,302 (5)
abstracting: (2<=LeafSetOfRxIsSentToNode5)
states: 6
.
EG iterations: 1
abstracting: (2<=LeafSetOfRxIsSentToNode5)
states: 6
abstracting: (Node3HasTheLeafSetOfLxToReplaceNode0<=2)
states: 172,248 (5)
abstracting: (2<=LeafSetOfRxIsSentToNode5)
states: 6
abstracting: (1<=RxHasReceivedTheRequestOfNode3)
states: 2,226 (3)
.abstracting: (Node3WantsToManageTheBreakDownOfNode4<=2)
states: 172,248 (5)
abstracting: (Node5WantsToManageTheBreakDownOfNode3<=0)
states: 171,687 (5)
abstracting: (1<=Node0FailureProcessedByNode5)
states: 1,060 (3)
abstracting: (2<=Node3HasAskedItsLeafSetToRxToReplaceNode8)
states: 0
abstracting: (Node4Failure<=2)
states: 172,248 (5)
.abstracting: (LxHasReceivedTheRequestOfNode0<=Node4HasTheLeafSetOfRxToReplaceNode6)
states: 169,571 (5)
abstracting: (LeafSetOfRxIsSentToNode0<=Node4WantsToManageTheBreakDownOfNode8)
states: 170,025 (5)
abstracting: (1<=Node1HasTheLeafSetOfLxToReplaceNode2)
states: 561
..............
EG iterations: 14
abstracting: (Node6ManageTheBreakDownOfNode7<=1)
states: 172,248 (5)
.
EG iterations: 1
abstracting: (RequestOfNode2IsSentToRx<=Node1FailureProcessedByNode4)
states: 170,030 (5)
............
EG iterations: 12
abstracting: (1<=Node3ManageTheBreakDownOfNode1)
states: 561
abstracting: (Node8HasTheLeafSetOfLxToReplaceNode3<=Node8HasTheLeafSetOfLxToReplaceNode2)
states: 171,688 (5)
abstracting: (Node8HasTheLeafSetOfLxToReplaceNode3<=Node8HasTheLeafSetOfLxToReplaceNode2)
states: 171,688 (5)
abstracting: (Node8HasTheLeafSetOfLxToReplaceNode3<=Node8HasTheLeafSetOfLxToReplaceNode2)
states: 171,688 (5)
............
EG iterations: 12
abstracting: (1<=Node6HasTheLeafSetOfLxToReplaceNode2)
states: 561
............
EG iterations: 12
abstracting: (Node4HasAskedItsLeafSetToRxToReplaceNode5<=LxIsActiveAndNotInTheLeafSet)
states: 172,131 (5)
....
EG iterations: 4
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m49.547sec

checking: AG [[[Node4ManageTheBreakDownOfNode1<=Node1WantsToManageTheBreakDownOfNode6 | [~ [EF [[2<=Node3IsActive & Node0ManageTheBreakDownOfNode4<=Node8FailureProcessedByNode7]]] & Node3isTheNodeMaster<=Node2ManageTheBreakDownOfNode5]] & [EG [EX [AG [Node2ManageTheBreakDownOfNode6<=Node2ManageTheBreakDownOfNode3]]] | [AF [[[Node7WantsToManageTheBreakDownOfNode1<=1 & Node0FailureProcessedByNode2<=Node4HasTheLeafSetOfLxToReplaceNode0] & EX [1<=Node0FailureProcessedByNode2]]] & [[[[Node0WantsToManageTheBreakDownOfNode4<=Node1HasTheLeafSetOfLxToReplaceNode4 | 2<=Node8IsActive] | EX [RequestOfNode1IsSentToLx<=Node6HasTheLeafSetOfRxToReplaceNode8]] | [[Node5WantsToManageTheBreakDownOfNode2<=Node4ManageTheBreakDownOfNode2 | RequestOfNode0IsSentToRx<=0] | Node2HasAskedItsLeafSetToLxToReplaceNode4<=1]] & ~ [[[LeafSetOfLxIsSentToNode6<=Node7ManageTheBreakDownOfNode4 | RxHasReceivedTheRequestOfNode2<=2] | ~ [Node4ManageTheBreakDownOfNode3<=1]]]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [[[LeafSetOfLxIsSentToNode6<=Node7ManageTheBreakDownOfNode4 | RxHasReceivedTheRequestOfNode2<=2] | ~ [Node4ManageTheBreakDownOfNode3<=1]]] & [[Node2HasAskedItsLeafSetToLxToReplaceNode4<=1 | [Node5WantsToManageTheBreakDownOfNode2<=Node4ManageTheBreakDownOfNode2 | RequestOfNode0IsSentToRx<=0]] | [EX [RequestOfNode1IsSentToLx<=Node6HasTheLeafSetOfRxToReplaceNode8] | [Node0WantsToManageTheBreakDownOfNode4<=Node1HasTheLeafSetOfLxToReplaceNode4 | 2<=Node8IsActive]]]] & ~ [EG [~ [[EX [1<=Node0FailureProcessedByNode2] & [Node7WantsToManageTheBreakDownOfNode1<=1 & Node0FailureProcessedByNode2<=Node4HasTheLeafSetOfLxToReplaceNode0]]]]]] | EG [EX [~ [E [true U ~ [Node2ManageTheBreakDownOfNode6<=Node2ManageTheBreakDownOfNode3]]]]]] & [Node4ManageTheBreakDownOfNode1<=Node1WantsToManageTheBreakDownOfNode6 | [Node3isTheNodeMaster<=Node2ManageTheBreakDownOfNode5 & ~ [E [true U [2<=Node3IsActive & Node0ManageTheBreakDownOfNode4<=Node8FailureProcessedByNode7]]]]]]]]]

abstracting: (Node0ManageTheBreakDownOfNode4<=Node8FailureProcessedByNode7)
states: 171,226 (5)
abstracting: (2<=Node3IsActive)
states: 0
abstracting: (Node3isTheNodeMaster<=Node2ManageTheBreakDownOfNode5)
states: 156,660 (5)
abstracting: (Node4ManageTheBreakDownOfNode1<=Node1WantsToManageTheBreakDownOfNode6)
states: 171,696 (5)
abstracting: (Node2ManageTheBreakDownOfNode6<=Node2ManageTheBreakDownOfNode3)
states: 171,688 (5)
.....................
EG iterations: 20
abstracting: (Node0FailureProcessedByNode2<=Node4HasTheLeafSetOfLxToReplaceNode0)
states: 171,186 (5)
abstracting: (Node7WantsToManageTheBreakDownOfNode1<=1)
states: 172,248 (5)
abstracting: (1<=Node0FailureProcessedByNode2)
states: 1,062 (3)
...............
EG iterations: 14
abstracting: (2<=Node8IsActive)
states: 0
abstracting: (Node0WantsToManageTheBreakDownOfNode4<=Node1HasTheLeafSetOfLxToReplaceNode4)
states: 171,222 (5)
abstracting: (RequestOfNode1IsSentToLx<=Node6HasTheLeafSetOfRxToReplaceNode8)
states: 169,571 (5)
.abstracting: (RequestOfNode0IsSentToRx<=0)
states: 170,022 (5)
abstracting: (Node5WantsToManageTheBreakDownOfNode2<=Node4ManageTheBreakDownOfNode2)
states: 171,687 (5)
abstracting: (Node2HasAskedItsLeafSetToLxToReplaceNode4<=1)
states: 172,248 (5)
abstracting: (Node4ManageTheBreakDownOfNode3<=1)
states: 172,248 (5)
abstracting: (RxHasReceivedTheRequestOfNode2<=2)
states: 172,248 (5)
abstracting: (LeafSetOfLxIsSentToNode6<=Node7ManageTheBreakDownOfNode4)
states: 170,030 (5)
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m43.260sec

totally nodes used: 111877974 (1.1e+08)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 346744087 1326910978 1673655065
used/not used/entry size/cache size: 66930519 178345 16 1024MB
basic ops cache: hits/miss/sum: 3287034 35128241 38415275
used/not used/entry size/cache size: 10389298 6387918 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: 543755 1609136 2152891
used/not used/entry size/cache size: 704458 7684150 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 34053379
1 21386884
2 8409552
3 2506879
4 604213
5 122467
6 21683
7 3303
8 439
9 58
>= 10 7

Total processing time: 10m13.875sec


BK_STOP 1678625591782

--------------------
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.001sec


iterations count:84418 (206), effective:1549 (3)

initing FirstDep: 0m 0.001sec


iterations count:477 (1), effective:10 (0)

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

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

iterations count:63794 (155), effective:898 (2)

iterations count:1834 (4), effective:14 (0)

iterations count:1834 (4), effective:14 (0)

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

iterations count:1834 (4), effective:14 (0)

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

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

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

iterations count:1882 (4), effective:17 (0)

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

iterations count:7218 (17), effective:93 (0)

iterations count:1453 (3), effective:23 (0)

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

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

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

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

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

iterations count:879 (2), effective:3 (0)

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

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

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

iterations count:3036 (7), effective:25 (0)

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

iterations count:1335 (3), effective:13 (0)

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

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

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

iterations count:1071 (2), effective:8 (0)

iterations count:603 (1), effective:4 (0)

iterations count:409 (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="LeafsetExtension-PT-S08C2"
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 LeafsetExtension-PT-S08C2, 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 r225-tall-167856407600449"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S08C2.tgz
mv LeafsetExtension-PT-S08C2 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 ;