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.r234-tall-167856420300454.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is LeafsetExtension-PT-S08C2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420300454
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-01
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-02
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-03
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-04
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-05
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-06
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-07
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-08
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-09
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-10
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-11
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-12
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-13
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-14
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679504437959

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S08C2
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 17:00:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 17:00:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:00:39] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2023-03-22 17:00:39] [INFO ] Transformed 462 places.
[2023-03-22 17:00:39] [INFO ] Transformed 409 transitions.
[2023-03-22 17:00:39] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 541 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 16) seen :5
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 120 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 114 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 115 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 409 rows 462 cols
[2023-03-22 17:00:40] [INFO ] Computed 53 place invariants in 29 ms
[2023-03-22 17:00:41] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 17:00:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 17:00:41] [INFO ] [Nat]Absence check using 11 positive and 42 generalized place invariants in 17 ms returned sat
[2023-03-22 17:00:41] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :0
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 1977 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.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.744sec


RS generation: 0m20.902sec


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



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

checking: EF [2<=Node2HasAskedItsLeafSetToLxToReplaceNode4]
normalized: E [true U 2<=Node2HasAskedItsLeafSetToLxToReplaceNode4]

abstracting: (2<=Node2HasAskedItsLeafSetToLxToReplaceNode4)
states: 0
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.091sec

checking: EF [~ [Node6WantsToManageTheBreakDownOfNode1<=2]]
normalized: E [true U ~ [Node6WantsToManageTheBreakDownOfNode1<=2]]

abstracting: (Node6WantsToManageTheBreakDownOfNode1<=2)
states: 172,248 (5)
-> the formula is FALSE

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

MC time: 0m 0.054sec

checking: AG [Node1DontAnswerToAnyNode<=2]
normalized: ~ [E [true U ~ [Node1DontAnswerToAnyNode<=2]]]

abstracting: (Node1DontAnswerToAnyNode<=2)
states: 172,248 (5)
-> the formula is TRUE

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

MC time: 0m 0.105sec

checking: AG [LeafSetOfRxIsSentToNode5<=2]
normalized: ~ [E [true U ~ [LeafSetOfRxIsSentToNode5<=2]]]

abstracting: (LeafSetOfRxIsSentToNode5<=2)
states: 172,248 (5)
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: AG [Node8HasAskedItsLeafSetToRxToReplaceNode4<=Node3ManageTheBreakDownOfNode2]
normalized: ~ [E [true U ~ [Node8HasAskedItsLeafSetToRxToReplaceNode4<=Node3ManageTheBreakDownOfNode2]]]

abstracting: (Node8HasAskedItsLeafSetToRxToReplaceNode4<=Node3ManageTheBreakDownOfNode2)
states: 169,194 (5)
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.987sec

checking: EF [~ [Node8FailureProcessedByNode2<=Node7ManageTheBreakDownOfNode4]]
normalized: E [true U ~ [Node8FailureProcessedByNode2<=Node7ManageTheBreakDownOfNode4]]

abstracting: (Node8FailureProcessedByNode2<=Node7ManageTheBreakDownOfNode4)
states: 171,192 (5)
-> the formula is TRUE

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

MC time: 0m 1.879sec

checking: AG [[Node3WantsToManageTheBreakDownOfNode8<=Node4HasTheLeafSetOfLxToReplaceNode1 | ~ [[2<=Node2IsActive & ~ [[~ [Node4WantsToManageTheBreakDownOfNode2<=Node0HasAskedItsLeafSetToLxToReplaceNode2] | 2<=LxIsActiveInTheLeafSet]]]]]]
normalized: ~ [E [true U ~ [[Node3WantsToManageTheBreakDownOfNode8<=Node4HasTheLeafSetOfLxToReplaceNode1 | ~ [[2<=Node2IsActive & ~ [[2<=LxIsActiveInTheLeafSet | ~ [Node4WantsToManageTheBreakDownOfNode2<=Node0HasAskedItsLeafSetToLxToReplaceNode2]]]]]]]]]

abstracting: (Node4WantsToManageTheBreakDownOfNode2<=Node0HasAskedItsLeafSetToLxToReplaceNode2)
states: 171,695 (5)
abstracting: (2<=LxIsActiveInTheLeafSet)
states: 0
abstracting: (2<=Node2IsActive)
states: 0
abstracting: (Node3WantsToManageTheBreakDownOfNode8<=Node4HasTheLeafSetOfLxToReplaceNode1)
states: 171,688 (5)
-> the formula is TRUE

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

MC time: 0m 0.378sec

checking: AG [[1<=Node6ManageTheBreakDownOfNode5 | [Node6DontAnswerToAnyNode<=1 & [[~ [[Node1HasTheLeafSetOfRxToReplaceNode7<=0 & ~ [[LxHasReceivedTheRequestOfNode4<=Node2WantsToManageTheBreakDownOfNode6 & ~ [1<=Node7HasAskedItsLeafSetToLxToReplaceNode2]]]]] & ~ [[Node1WantsToManageTheBreakDownOfNode7<=0 | 2<=Node2ManageTheBreakDownOfNode7]]] | Node2HasTheLeafSetOfRxToReplaceNode6<=0]]]]
normalized: ~ [E [true U ~ [[1<=Node6ManageTheBreakDownOfNode5 | [Node6DontAnswerToAnyNode<=1 & [Node2HasTheLeafSetOfRxToReplaceNode6<=0 | [~ [[Node1WantsToManageTheBreakDownOfNode7<=0 | 2<=Node2ManageTheBreakDownOfNode7]] & ~ [[Node1HasTheLeafSetOfRxToReplaceNode7<=0 & ~ [[LxHasReceivedTheRequestOfNode4<=Node2WantsToManageTheBreakDownOfNode6 & ~ [1<=Node7HasAskedItsLeafSetToLxToReplaceNode2]]]]]]]]]]]]

abstracting: (1<=Node7HasAskedItsLeafSetToLxToReplaceNode2)
states: 1,674 (3)
abstracting: (LxHasReceivedTheRequestOfNode4<=Node2WantsToManageTheBreakDownOfNode6)
states: 170,050 (5)
abstracting: (Node1HasTheLeafSetOfRxToReplaceNode7<=0)
states: 171,687 (5)
abstracting: (2<=Node2ManageTheBreakDownOfNode7)
states: 0
abstracting: (Node1WantsToManageTheBreakDownOfNode7<=0)
states: 171,687 (5)
abstracting: (Node2HasTheLeafSetOfRxToReplaceNode6<=0)
states: 171,687 (5)
abstracting: (Node6DontAnswerToAnyNode<=1)
states: 172,248 (5)
abstracting: (1<=Node6ManageTheBreakDownOfNode5)
states: 561
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.329sec

checking: EF [~ [[[[[Node7HasTheLeafSetOfRxToReplaceNode4<=Node8HasAskedItsLeafSetToRxToReplaceNode6 & ~ [Node0ManageTheBreakDownOfNode3<=Node5HasAskedItsLeafSetToLxToReplaceNode2]] & 1<=Node1HasAskedItsLeafSetToRxToReplaceNode8] | [~ [Node2ManageTheBreakDownOfNode1<=Node3WantsToManageTheBreakDownOfNode4] | 1<=LxIsActiveInTheLeafSet]] | Node6HasAskedItsLeafSetToRxToReplaceNode5<=Node6DontAnswerToAnyNode]]]
normalized: E [true U ~ [[Node6HasAskedItsLeafSetToRxToReplaceNode5<=Node6DontAnswerToAnyNode | [[1<=LxIsActiveInTheLeafSet | ~ [Node2ManageTheBreakDownOfNode1<=Node3WantsToManageTheBreakDownOfNode4]] | [1<=Node1HasAskedItsLeafSetToRxToReplaceNode8 & [Node7HasTheLeafSetOfRxToReplaceNode4<=Node8HasAskedItsLeafSetToRxToReplaceNode6 & ~ [Node0ManageTheBreakDownOfNode3<=Node5HasAskedItsLeafSetToLxToReplaceNode2]]]]]]]

abstracting: (Node0ManageTheBreakDownOfNode3<=Node5HasAskedItsLeafSetToLxToReplaceNode2)
states: 171,690 (5)
abstracting: (Node7HasTheLeafSetOfRxToReplaceNode4<=Node8HasAskedItsLeafSetToRxToReplaceNode6)
states: 171,228 (5)
abstracting: (1<=Node1HasAskedItsLeafSetToRxToReplaceNode8)
states: 1,674 (3)
abstracting: (Node2ManageTheBreakDownOfNode1<=Node3WantsToManageTheBreakDownOfNode4)
states: 171,688 (5)
abstracting: (1<=LxIsActiveInTheLeafSet)
states: 19,734 (4)
abstracting: (Node6HasAskedItsLeafSetToRxToReplaceNode5<=Node6DontAnswerToAnyNode)
states: 170,580 (5)
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.153sec

checking: EF [[[~ [Node2ManageTheBreakDownOfNode8<=Node4FailureProcessedByNode5] & [[~ [1<=Node2ManageTheBreakDownOfNode5] | [~ [Node5DontAnswerToAnyNode<=Node0HasTheLeafSetOfLxToReplaceNode4] & Node3HasAskedItsLeafSetToLxToReplaceNode0<=2]] & [~ [Node1HasTheLeafSetOfRxToReplaceNode6<=Node6ManageTheBreakDownOfNode0] & 2<=LeafSetOfLxIsSentToNode4]]] & [1<=Node7FailureProcessedByNode1 | Node6FailureProcessedByNode0<=0]]]
normalized: E [true U [[1<=Node7FailureProcessedByNode1 | Node6FailureProcessedByNode0<=0] & [[[2<=LeafSetOfLxIsSentToNode4 & ~ [Node1HasTheLeafSetOfRxToReplaceNode6<=Node6ManageTheBreakDownOfNode0]] & [[Node3HasAskedItsLeafSetToLxToReplaceNode0<=2 & ~ [Node5DontAnswerToAnyNode<=Node0HasTheLeafSetOfLxToReplaceNode4]] | ~ [1<=Node2ManageTheBreakDownOfNode5]]] & ~ [Node2ManageTheBreakDownOfNode8<=Node4FailureProcessedByNode5]]]]

abstracting: (Node2ManageTheBreakDownOfNode8<=Node4FailureProcessedByNode5)
states: 171,689 (5)
abstracting: (1<=Node2ManageTheBreakDownOfNode5)
states: 561
abstracting: (Node5DontAnswerToAnyNode<=Node0HasTheLeafSetOfLxToReplaceNode4)
states: 171,681 (5)
abstracting: (Node3HasAskedItsLeafSetToLxToReplaceNode0<=2)
states: 172,248 (5)
abstracting: (Node1HasTheLeafSetOfRxToReplaceNode6<=Node6ManageTheBreakDownOfNode0)
states: 171,688 (5)
abstracting: (2<=LeafSetOfLxIsSentToNode4)
states: 6
abstracting: (Node6FailureProcessedByNode0<=0)
states: 171,188 (5)
abstracting: (1<=Node7FailureProcessedByNode1)
states: 1,060 (3)
-> the formula is FALSE

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

MC time: 0m 0.707sec

checking: EF [~ [[[[~ [1<=Node0HasTheLeafSetOfLxToReplaceNode1] | [~ [2<=Node2HasTheLeafSetOfLxToReplaceNode0] & ~ [[Node4ManageTheBreakDownOfNode8<=2 | [Node3HasTheLeafSetOfLxToReplaceNode0<=0 | [Node0HasTheLeafSetOfRxToReplaceNode7<=2 | RequestOfNode7IsSentToLx<=Node3WantsToManageTheBreakDownOfNode8]]]]]] & [~ [2<=Node7Failure] | [[[Node6HasAskedItsLeafSetToRxToReplaceNode4<=1 & RequestOfNode6IsSentToLx<=0] | ~ [[[LeafSetOfRxIsSentToNode1<=Node0HasTheLeafSetOfLxToReplaceNode2 & Node5FailureProcessedByNode4<=0] & [Node1WantsToManageTheBreakDownOfNode3<=Node4FailureProcessedByNode8 | Node3ManageTheBreakDownOfNode5<=RequestOfNode2IsSentToRx]]]] & [[~ [1<=LxHasReceivedTheRequestOfNode6] | [[Node0FailureProcessedByNode7<=Node5FailureProcessedByNode6 | LeafSetOfRxIsSentToNode1<=Node3HasTheLeafSetOfLxToReplaceNode0] & [1<=Node7HasTheLeafSetOfRxToReplaceNode4 & LxHasReceivedTheRequestOfNode7<=Node5ManageTheBreakDownOfNode7]]] | 2<=RxHasReceivedTheRequestOfNode3]]]] | [[Node6HasTheLeafSetOfLxToReplaceNode1<=Node4WantsToManageTheBreakDownOfNode7 & ~ [Node7FailureProcessedByNode3<=Node8HasAskedItsLeafSetToLxToReplaceNode3]] & 2<=Node1FailureProcessedByNode0]]]]
normalized: E [true U ~ [[[2<=Node1FailureProcessedByNode0 & [Node6HasTheLeafSetOfLxToReplaceNode1<=Node4WantsToManageTheBreakDownOfNode7 & ~ [Node7FailureProcessedByNode3<=Node8HasAskedItsLeafSetToLxToReplaceNode3]]] | [[[[2<=RxHasReceivedTheRequestOfNode3 | [[[Node0FailureProcessedByNode7<=Node5FailureProcessedByNode6 | LeafSetOfRxIsSentToNode1<=Node3HasTheLeafSetOfLxToReplaceNode0] & [1<=Node7HasTheLeafSetOfRxToReplaceNode4 & LxHasReceivedTheRequestOfNode7<=Node5ManageTheBreakDownOfNode7]] | ~ [1<=LxHasReceivedTheRequestOfNode6]]] & [~ [[[Node1WantsToManageTheBreakDownOfNode3<=Node4FailureProcessedByNode8 | Node3ManageTheBreakDownOfNode5<=RequestOfNode2IsSentToRx] & [LeafSetOfRxIsSentToNode1<=Node0HasTheLeafSetOfLxToReplaceNode2 & Node5FailureProcessedByNode4<=0]]] | [Node6HasAskedItsLeafSetToRxToReplaceNode4<=1 & RequestOfNode6IsSentToLx<=0]]] | ~ [2<=Node7Failure]] & [[~ [[Node4ManageTheBreakDownOfNode8<=2 | [Node3HasTheLeafSetOfLxToReplaceNode0<=0 | [Node0HasTheLeafSetOfRxToReplaceNode7<=2 | RequestOfNode7IsSentToLx<=Node3WantsToManageTheBreakDownOfNode8]]]] & ~ [2<=Node2HasTheLeafSetOfLxToReplaceNode0]] | ~ [1<=Node0HasTheLeafSetOfLxToReplaceNode1]]]]]]

abstracting: (1<=Node0HasTheLeafSetOfLxToReplaceNode1)
states: 561
abstracting: (2<=Node2HasTheLeafSetOfLxToReplaceNode0)
states: 0
abstracting: (RequestOfNode7IsSentToLx<=Node3WantsToManageTheBreakDownOfNode8)
states: 170,026 (5)
abstracting: (Node0HasTheLeafSetOfRxToReplaceNode7<=2)
states: 172,248 (5)
abstracting: (Node3HasTheLeafSetOfLxToReplaceNode0<=0)
states: 171,687 (5)
abstracting: (Node4ManageTheBreakDownOfNode8<=2)
states: 172,248 (5)
abstracting: (2<=Node7Failure)
states: 0
abstracting: (RequestOfNode6IsSentToLx<=0)
states: 170,022 (5)
abstracting: (Node6HasAskedItsLeafSetToRxToReplaceNode4<=1)
states: 172,248 (5)
abstracting: (Node5FailureProcessedByNode4<=0)
states: 171,186 (5)
abstracting: (LeafSetOfRxIsSentToNode1<=Node0HasTheLeafSetOfLxToReplaceNode2)
states: 170,026 (5)
abstracting: (Node3ManageTheBreakDownOfNode5<=RequestOfNode2IsSentToRx)
states: 171,690 (5)
abstracting: (Node1WantsToManageTheBreakDownOfNode3<=Node4FailureProcessedByNode8)
states: 171,691 (5)
abstracting: (1<=LxHasReceivedTheRequestOfNode6)
states: 2,226 (3)
abstracting: (LxHasReceivedTheRequestOfNode7<=Node5ManageTheBreakDownOfNode7)
states: 170,026 (5)
abstracting: (1<=Node7HasTheLeafSetOfRxToReplaceNode4)
states: 1,026 (3)
abstracting: (LeafSetOfRxIsSentToNode1<=Node3HasTheLeafSetOfLxToReplaceNode0)
states: 170,026 (5)
abstracting: (Node0FailureProcessedByNode7<=Node5FailureProcessedByNode6)
states: 171,192 (5)
abstracting: (2<=RxHasReceivedTheRequestOfNode3)
states: 6
abstracting: (Node7FailureProcessedByNode3<=Node8HasAskedItsLeafSetToLxToReplaceNode3)
states: 171,194 (5)
abstracting: (Node6HasTheLeafSetOfLxToReplaceNode1<=Node4WantsToManageTheBreakDownOfNode7)
states: 171,688 (5)
abstracting: (2<=Node1FailureProcessedByNode0)
states: 0
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.259sec

checking: AG [[~ [[[[[[[[2<=Node6WantsToManageTheBreakDownOfNode0 & Node5WantsToManageTheBreakDownOfNode8<=2] & Node1WantsToManageTheBreakDownOfNode4<=2] | [~ [Node4DontAnswerToAnyNode<=0] & [1<=Node8HasAskedItsLeafSetToRxToReplaceNode7 | 1<=Node7WantsToManageTheBreakDownOfNode2]]] & ~ [[[2<=Node6FailureProcessedByNode1 | Node2WantsToManageTheBreakDownOfNode1<=Node5HasAskedItsLeafSetToLxToReplaceNode1] | [Node1FailureProcessedByNode3<=0 | 2<=Node6WantsToManageTheBreakDownOfNode4]]]] & Node8ManageTheBreakDownOfNode1<=0] & Node6DontAnswerToAnyNode<=1] & [Node7WantsToManageTheBreakDownOfNode4<=1 & [1<=Node0ManageTheBreakDownOfNode5 & ~ [[~ [[2<=Node8FailureProcessedByNode2 | 1<=LxHasReceivedTheRequestOfNode5]] & ~ [[2<=LxHasReceivedTheRequestOfNode7 | Node1WantsToManageTheBreakDownOfNode5<=0]]]]]]]] | [[[[2<=Node3HasTheLeafSetOfRxToReplaceNode8 & Node5ManageTheBreakDownOfNode7<=Node8HasTheLeafSetOfLxToReplaceNode2] | Node0HasTheLeafSetOfLxToReplaceNode3<=0] & ~ [[[[[~ [Node2FailureProcessedByNode1<=1] | [1<=Node6HasAskedItsLeafSetToRxToReplaceNode8 & Node8WantsToManageTheBreakDownOfNode6<=2]] & ~ [[Node2FailureProcessedByNode7<=Node3HasAskedItsLeafSetToRxToReplaceNode5 | LeafSetOfRxIsSentToNode6<=Node6WantsToManageTheBreakDownOfNode1]]] | [Node8ManageTheBreakDownOfNode6<=0 | ~ [Node5HasTheLeafSetOfLxToReplaceNode3<=2]]] | 1<=RxIsActiveAndNotInTheLeafSet]]] | 1<=RequestOfNode8IsSentToRx]]]
normalized: ~ [E [true U ~ [[~ [[[Node6DontAnswerToAnyNode<=1 & [Node8ManageTheBreakDownOfNode1<=0 & [~ [[[Node1FailureProcessedByNode3<=0 | 2<=Node6WantsToManageTheBreakDownOfNode4] | [2<=Node6FailureProcessedByNode1 | Node2WantsToManageTheBreakDownOfNode1<=Node5HasAskedItsLeafSetToLxToReplaceNode1]]] & [[[1<=Node8HasAskedItsLeafSetToRxToReplaceNode7 | 1<=Node7WantsToManageTheBreakDownOfNode2] & ~ [Node4DontAnswerToAnyNode<=0]] | [Node1WantsToManageTheBreakDownOfNode4<=2 & [2<=Node6WantsToManageTheBreakDownOfNode0 & Node5WantsToManageTheBreakDownOfNode8<=2]]]]]] & [Node7WantsToManageTheBreakDownOfNode4<=1 & [1<=Node0ManageTheBreakDownOfNode5 & ~ [[~ [[2<=LxHasReceivedTheRequestOfNode7 | Node1WantsToManageTheBreakDownOfNode5<=0]] & ~ [[2<=Node8FailureProcessedByNode2 | 1<=LxHasReceivedTheRequestOfNode5]]]]]]]] | [1<=RequestOfNode8IsSentToRx | [~ [[1<=RxIsActiveAndNotInTheLeafSet | [[~ [[Node2FailureProcessedByNode7<=Node3HasAskedItsLeafSetToRxToReplaceNode5 | LeafSetOfRxIsSentToNode6<=Node6WantsToManageTheBreakDownOfNode1]] & [[1<=Node6HasAskedItsLeafSetToRxToReplaceNode8 & Node8WantsToManageTheBreakDownOfNode6<=2] | ~ [Node2FailureProcessedByNode1<=1]]] | [Node8ManageTheBreakDownOfNode6<=0 | ~ [Node5HasTheLeafSetOfLxToReplaceNode3<=2]]]]] & [Node0HasTheLeafSetOfLxToReplaceNode3<=0 | [2<=Node3HasTheLeafSetOfRxToReplaceNode8 & Node5ManageTheBreakDownOfNode7<=Node8HasTheLeafSetOfLxToReplaceNode2]]]]]]]]

abstracting: (Node5ManageTheBreakDownOfNode7<=Node8HasTheLeafSetOfLxToReplaceNode2)
states: 171,688 (5)
abstracting: (2<=Node3HasTheLeafSetOfRxToReplaceNode8)
states: 0
abstracting: (Node0HasTheLeafSetOfLxToReplaceNode3<=0)
states: 171,687 (5)
abstracting: (Node5HasTheLeafSetOfLxToReplaceNode3<=2)
states: 172,248 (5)
abstracting: (Node8ManageTheBreakDownOfNode6<=0)
states: 171,687 (5)
abstracting: (Node2FailureProcessedByNode1<=1)
states: 172,248 (5)
abstracting: (Node8WantsToManageTheBreakDownOfNode6<=2)
states: 172,248 (5)
abstracting: (1<=Node6HasAskedItsLeafSetToRxToReplaceNode8)
states: 1,671 (3)
abstracting: (LeafSetOfRxIsSentToNode6<=Node6WantsToManageTheBreakDownOfNode1)
states: 169,571 (5)
abstracting: (Node2FailureProcessedByNode7<=Node3HasAskedItsLeafSetToRxToReplaceNode5)
states: 171,194 (5)
abstracting: (1<=RxIsActiveAndNotInTheLeafSet)
states: 152,514 (5)
abstracting: (1<=RequestOfNode8IsSentToRx)
states: 2,682 (3)
abstracting: (1<=LxHasReceivedTheRequestOfNode5)
states: 2,226 (3)
abstracting: (2<=Node8FailureProcessedByNode2)
states: 0
abstracting: (Node1WantsToManageTheBreakDownOfNode5<=0)
states: 171,687 (5)
abstracting: (2<=LxHasReceivedTheRequestOfNode7)
states: 6
abstracting: (1<=Node0ManageTheBreakDownOfNode5)
states: 561
abstracting: (Node7WantsToManageTheBreakDownOfNode4<=1)
states: 172,248 (5)
abstracting: (Node5WantsToManageTheBreakDownOfNode8<=2)
states: 172,248 (5)
abstracting: (2<=Node6WantsToManageTheBreakDownOfNode0)
states: 0
abstracting: (Node1WantsToManageTheBreakDownOfNode4<=2)
states: 172,248 (5)
abstracting: (Node4DontAnswerToAnyNode<=0)
states: 171,727 (5)
abstracting: (1<=Node7WantsToManageTheBreakDownOfNode2)
states: 561
abstracting: (1<=Node8HasAskedItsLeafSetToRxToReplaceNode7)
states: 1,671 (3)
abstracting: (Node2WantsToManageTheBreakDownOfNode1<=Node5HasAskedItsLeafSetToLxToReplaceNode1)
states: 171,687 (5)
abstracting: (2<=Node6FailureProcessedByNode1)
states: 0
abstracting: (2<=Node6WantsToManageTheBreakDownOfNode4)
states: 0
abstracting: (Node1FailureProcessedByNode3<=0)
states: 171,186 (5)
abstracting: (Node8ManageTheBreakDownOfNode1<=0)
states: 171,687 (5)
abstracting: (Node6DontAnswerToAnyNode<=1)
states: 172,248 (5)
-> the formula is TRUE

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

MC time: 0m 1.771sec

checking: AG [[[2<=LxHasReceivedTheRequestOfNode5 | [~ [Node5HasTheLeafSetOfRxToReplaceNode8<=Node5FailureProcessedByNode2] | [[[[[[Node5HasTheLeafSetOfRxToReplaceNode4<=2 & RequestOfNode8IsSentToRx<=1] & [Node6ManageTheBreakDownOfNode2<=0 | 2<=Node4WantsToManageTheBreakDownOfNode1]] | Node2ManageTheBreakDownOfNode4<=RequestOfNode2IsSentToLx] | Node7WantsToManageTheBreakDownOfNode5<=Node8HasAskedItsLeafSetToLxToReplaceNode0] | [~ [[~ [Node6HasTheLeafSetOfRxToReplaceNode7<=LeafSetOfLxIsSentToNode3] | [2<=Node5WantsToManageTheBreakDownOfNode6 | 2<=Node7HasAskedItsLeafSetToRxToReplaceNode5]]] & [[~ [LeafSetOfLxIsSentToNode0<=Node3WantsToManageTheBreakDownOfNode7] | [RightNodeHasDetectedBreakDownOfMaster<=Node6IsActive | Node2FailureProcessedByNode0<=0]] | Node6WantsToManageTheBreakDownOfNode1<=2]]] | Node8WantsToManageTheBreakDownOfNode6<=1]]] | [[[~ [Node6IsActive<=1] & [[[[[LxHasReceivedTheRequestOfNode7<=Node7FailureProcessedByNode6 | Node6HasAskedItsLeafSetToLxToReplaceNode2<=Node0FailureProcessedByNode5] & NoNodeManageTheBreakDownOfNode0<=Node4DontAnswerToAnyNode] & [~ [Node5HasTheLeafSetOfRxToReplaceNode7<=Node5HasAskedItsLeafSetToLxToReplaceNode0] & ~ [RxHasReceivedTheRequestOfNode5<=Node3HasTheLeafSetOfRxToReplaceNode7]]] & [[Node6WantsToManageTheBreakDownOfNode8<=2 | ~ [1<=RequestOfNode0IsSentToRx]] | [[1<=Node8HasAskedItsLeafSetToRxToReplaceNode7 & Node7HasTheLeafSetOfLxToReplaceNode2<=Node7WantsToManageTheBreakDownOfNode0] & [1<=Node7ManageTheBreakDownOfNode1 & Node3HasTheLeafSetOfRxToReplaceNode8<=2]]]] & Node5WantsToManageTheBreakDownOfNode4<=Node3HasAskedItsLeafSetToLxToReplaceNode1]] | ~ [[~ [[Node6WantsToManageTheBreakDownOfNode7<=0 | Node4ManageTheBreakDownOfNode8<=0]] & ~ [Node1IsActive<=0]]]] & ~ [LxIsActiveAndNotInTheLeafSet<=Node5HasTheLeafSetOfRxToReplaceNode7]]]]
normalized: ~ [E [true U ~ [[[~ [LxIsActiveAndNotInTheLeafSet<=Node5HasTheLeafSetOfRxToReplaceNode7] & [~ [[~ [Node1IsActive<=0] & ~ [[Node6WantsToManageTheBreakDownOfNode7<=0 | Node4ManageTheBreakDownOfNode8<=0]]]] | [[Node5WantsToManageTheBreakDownOfNode4<=Node3HasAskedItsLeafSetToLxToReplaceNode1 & [[[[1<=Node7ManageTheBreakDownOfNode1 & Node3HasTheLeafSetOfRxToReplaceNode8<=2] & [1<=Node8HasAskedItsLeafSetToRxToReplaceNode7 & Node7HasTheLeafSetOfLxToReplaceNode2<=Node7WantsToManageTheBreakDownOfNode0]] | [Node6WantsToManageTheBreakDownOfNode8<=2 | ~ [1<=RequestOfNode0IsSentToRx]]] & [[~ [RxHasReceivedTheRequestOfNode5<=Node3HasTheLeafSetOfRxToReplaceNode7] & ~ [Node5HasTheLeafSetOfRxToReplaceNode7<=Node5HasAskedItsLeafSetToLxToReplaceNode0]] & [NoNodeManageTheBreakDownOfNode0<=Node4DontAnswerToAnyNode & [LxHasReceivedTheRequestOfNode7<=Node7FailureProcessedByNode6 | Node6HasAskedItsLeafSetToLxToReplaceNode2<=Node0FailureProcessedByNode5]]]]] & ~ [Node6IsActive<=1]]]] | [2<=LxHasReceivedTheRequestOfNode5 | [[Node8WantsToManageTheBreakDownOfNode6<=1 | [[[Node6WantsToManageTheBreakDownOfNode1<=2 | [[RightNodeHasDetectedBreakDownOfMaster<=Node6IsActive | Node2FailureProcessedByNode0<=0] | ~ [LeafSetOfLxIsSentToNode0<=Node3WantsToManageTheBreakDownOfNode7]]] & ~ [[[2<=Node5WantsToManageTheBreakDownOfNode6 | 2<=Node7HasAskedItsLeafSetToRxToReplaceNode5] | ~ [Node6HasTheLeafSetOfRxToReplaceNode7<=LeafSetOfLxIsSentToNode3]]]] | [Node7WantsToManageTheBreakDownOfNode5<=Node8HasAskedItsLeafSetToLxToReplaceNode0 | [Node2ManageTheBreakDownOfNode4<=RequestOfNode2IsSentToLx | [[Node6ManageTheBreakDownOfNode2<=0 | 2<=Node4WantsToManageTheBreakDownOfNode1] & [Node5HasTheLeafSetOfRxToReplaceNode4<=2 & RequestOfNode8IsSentToRx<=1]]]]]] | ~ [Node5HasTheLeafSetOfRxToReplaceNode8<=Node5FailureProcessedByNode2]]]]]]]

abstracting: (Node5HasTheLeafSetOfRxToReplaceNode8<=Node5FailureProcessedByNode2)
states: 171,689 (5)
abstracting: (RequestOfNode8IsSentToRx<=1)
states: 172,239 (5)
abstracting: (Node5HasTheLeafSetOfRxToReplaceNode4<=2)
states: 172,248 (5)
abstracting: (2<=Node4WantsToManageTheBreakDownOfNode1)
states: 0
abstracting: (Node6ManageTheBreakDownOfNode2<=0)
states: 171,687 (5)
abstracting: (Node2ManageTheBreakDownOfNode4<=RequestOfNode2IsSentToLx)
states: 171,228 (5)
abstracting: (Node7WantsToManageTheBreakDownOfNode5<=Node8HasAskedItsLeafSetToLxToReplaceNode0)
states: 171,690 (5)
abstracting: (Node6HasTheLeafSetOfRxToReplaceNode7<=LeafSetOfLxIsSentToNode3)
states: 171,691 (5)
abstracting: (2<=Node7HasAskedItsLeafSetToRxToReplaceNode5)
states: 0
abstracting: (2<=Node5WantsToManageTheBreakDownOfNode6)
states: 0
abstracting: (LeafSetOfLxIsSentToNode0<=Node3WantsToManageTheBreakDownOfNode7)
states: 169,571 (5)
abstracting: (Node2FailureProcessedByNode0<=0)
states: 171,186 (5)
abstracting: (RightNodeHasDetectedBreakDownOfMaster<=Node6IsActive)
states: 170,804 (5)
abstracting: (Node6WantsToManageTheBreakDownOfNode1<=2)
states: 172,248 (5)
abstracting: (Node8WantsToManageTheBreakDownOfNode6<=1)
states: 172,248 (5)
abstracting: (2<=LxHasReceivedTheRequestOfNode5)
states: 6
abstracting: (Node6IsActive<=1)
states: 172,248 (5)
abstracting: (Node6HasAskedItsLeafSetToLxToReplaceNode2<=Node0FailureProcessedByNode5)
states: 170,580 (5)
abstracting: (LxHasReceivedTheRequestOfNode7<=Node7FailureProcessedByNode6)
states: 170,030 (5)
abstracting: (NoNodeManageTheBreakDownOfNode0<=Node4DontAnswerToAnyNode)
states: 167,208 (5)
abstracting: (Node5HasTheLeafSetOfRxToReplaceNode7<=Node5HasAskedItsLeafSetToLxToReplaceNode0)
states: 171,690 (5)
abstracting: (RxHasReceivedTheRequestOfNode5<=Node3HasTheLeafSetOfRxToReplaceNode7)
states: 170,073 (5)
abstracting: (1<=RequestOfNode0IsSentToRx)
states: 2,226 (3)
abstracting: (Node6WantsToManageTheBreakDownOfNode8<=2)
states: 172,248 (5)
abstracting: (Node7HasTheLeafSetOfLxToReplaceNode2<=Node7WantsToManageTheBreakDownOfNode0)
states: 171,688 (5)
abstracting: (1<=Node8HasAskedItsLeafSetToRxToReplaceNode7)
states: 1,671 (3)
abstracting: (Node3HasTheLeafSetOfRxToReplaceNode8<=2)
states: 172,248 (5)
abstracting: (1<=Node7ManageTheBreakDownOfNode1)
states: 561
abstracting: (Node5WantsToManageTheBreakDownOfNode4<=Node3HasAskedItsLeafSetToLxToReplaceNode1)
states: 171,738 (5)
abstracting: (Node4ManageTheBreakDownOfNode8<=0)
states: 171,695 (5)
abstracting: (Node6WantsToManageTheBreakDownOfNode7<=0)
states: 171,687 (5)
abstracting: (Node1IsActive<=0)
states: 35,845 (4)
abstracting: (LxIsActiveAndNotInTheLeafSet<=Node5HasTheLeafSetOfRxToReplaceNode7)
states: 20,256 (4)
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.174sec

checking: EF [[[~ [[~ [[[[Node1DontAnswerToAnyNode<=Node6HasTheLeafSetOfRxToReplaceNode4 & 2<=Node8WantsToManageTheBreakDownOfNode1] & Node2ManageTheBreakDownOfNode1<=0] | [~ [Node0HasTheLeafSetOfRxToReplaceNode6<=Node3WantsToManageTheBreakDownOfNode4] & Node2ManageTheBreakDownOfNode5<=LxHasReceivedTheRequestOfNode7]]] | [[[[Node7WantsToManageTheBreakDownOfNode8<=Node0WantsToManageTheBreakDownOfNode1 & Node8HasAskedItsLeafSetToLxToReplaceNode1<=1] & [RequestOfNode2IsSentToRx<=1 | Node4FailureProcessedByNode8<=1]] | ~ [[2<=Node6FailureProcessedByNode5 & Node4HasAskedItsLeafSetToLxToReplaceNode1<=Node6WantsToManageTheBreakDownOfNode8]]] | [[~ [2<=Node4ManageTheBreakDownOfNode6] | Node6ManageTheBreakDownOfNode8<=RequestOfNode7IsSentToRx] | [~ [Node7FailureProcessedByNode6<=2] & ~ [2<=Node5WantsToManageTheBreakDownOfNode2]]]]]] | [Node7ManageTheBreakDownOfNode3<=0 | [Node0WantsToManageTheBreakDownOfNode7<=0 | Node4ManageTheBreakDownOfNode3<=0]]] & [[[ANodeFromTheLeafSetOfLxIsACtiveInTheLeafSet<=1 & ~ [[[~ [[Node4HasTheLeafSetOfRxToReplaceNode5<=0 | Node0FailureProcessedByNode8<=Node1FailureProcessedByNode2]] | Node5WantsToManageTheBreakDownOfNode6<=1] | ~ [2<=Node6FailureProcessedByNode4]]]] & ~ [Node8FailureProcessedByNode5<=Node7WantsToManageTheBreakDownOfNode3]] & [1<=Node2WantsToManageTheBreakDownOfNode0 & [[~ [[Node0HasTheLeafSetOfRxToReplaceNode8<=0 & [NoNodeManageTheBreakDownOfNode7<=0 | Node3WantsToManageTheBreakDownOfNode4<=2]]] & [[[LeafSetOfLxIsSentToNode3<=Node5HasTheLeafSetOfRxToReplaceNode4 & [1<=Node1HasTheLeafSetOfLxToReplaceNode4 & 2<=Node6HasTheLeafSetOfLxToReplaceNode2]] | 2<=Node7HasTheLeafSetOfLxToReplaceNode3] & [[~ [Node5FailureProcessedByNode1<=2] | [1<=Node0HasTheLeafSetOfLxToReplaceNode4 & Node8Failure<=NoNodeManageTheBreakDownOfNode2]] & ~ [RequestOfNode7IsSentToLx<=Node8FailureProcessedByNode4]]]] & [Node5FailureProcessedByNode8<=Node4ManageTheBreakDownOfNode3 & [~ [[2<=RxHasReceivedTheRequestOfNode3 & RxHasReceivedTheRequestOfNode4<=RxHasReceivedTheRequestOfNode4]] | ~ [1<=Node4FailureProcessedByNode7]]]]]]]]
normalized: E [true U [[~ [[[[[~ [2<=Node5WantsToManageTheBreakDownOfNode2] & ~ [Node7FailureProcessedByNode6<=2]] | [Node6ManageTheBreakDownOfNode8<=RequestOfNode7IsSentToRx | ~ [2<=Node4ManageTheBreakDownOfNode6]]] | [~ [[2<=Node6FailureProcessedByNode5 & Node4HasAskedItsLeafSetToLxToReplaceNode1<=Node6WantsToManageTheBreakDownOfNode8]] | [[RequestOfNode2IsSentToRx<=1 | Node4FailureProcessedByNode8<=1] & [Node7WantsToManageTheBreakDownOfNode8<=Node0WantsToManageTheBreakDownOfNode1 & Node8HasAskedItsLeafSetToLxToReplaceNode1<=1]]]] | ~ [[[Node2ManageTheBreakDownOfNode1<=0 & [Node1DontAnswerToAnyNode<=Node6HasTheLeafSetOfRxToReplaceNode4 & 2<=Node8WantsToManageTheBreakDownOfNode1]] | [Node2ManageTheBreakDownOfNode5<=LxHasReceivedTheRequestOfNode7 & ~ [Node0HasTheLeafSetOfRxToReplaceNode6<=Node3WantsToManageTheBreakDownOfNode4]]]]]] | [Node7ManageTheBreakDownOfNode3<=0 | [Node0WantsToManageTheBreakDownOfNode7<=0 | Node4ManageTheBreakDownOfNode3<=0]]] & [[1<=Node2WantsToManageTheBreakDownOfNode0 & [[[[~ [RequestOfNode7IsSentToLx<=Node8FailureProcessedByNode4] & [[1<=Node0HasTheLeafSetOfLxToReplaceNode4 & Node8Failure<=NoNodeManageTheBreakDownOfNode2] | ~ [Node5FailureProcessedByNode1<=2]]] & [2<=Node7HasTheLeafSetOfLxToReplaceNode3 | [LeafSetOfLxIsSentToNode3<=Node5HasTheLeafSetOfRxToReplaceNode4 & [1<=Node1HasTheLeafSetOfLxToReplaceNode4 & 2<=Node6HasTheLeafSetOfLxToReplaceNode2]]]] & ~ [[Node0HasTheLeafSetOfRxToReplaceNode8<=0 & [NoNodeManageTheBreakDownOfNode7<=0 | Node3WantsToManageTheBreakDownOfNode4<=2]]]] & [Node5FailureProcessedByNode8<=Node4ManageTheBreakDownOfNode3 & [~ [1<=Node4FailureProcessedByNode7] | ~ [[2<=RxHasReceivedTheRequestOfNode3 & RxHasReceivedTheRequestOfNode4<=RxHasReceivedTheRequestOfNode4]]]]]] & [~ [Node8FailureProcessedByNode5<=Node7WantsToManageTheBreakDownOfNode3] & [ANodeFromTheLeafSetOfLxIsACtiveInTheLeafSet<=1 & ~ [[~ [2<=Node6FailureProcessedByNode4] | [Node5WantsToManageTheBreakDownOfNode6<=1 | ~ [[Node4HasTheLeafSetOfRxToReplaceNode5<=0 | Node0FailureProcessedByNode8<=Node1FailureProcessedByNode2]]]]]]]]]]

abstracting: (Node0FailureProcessedByNode8<=Node1FailureProcessedByNode2)
states: 171,190 (5)
abstracting: (Node4HasTheLeafSetOfRxToReplaceNode5<=0)
states: 171,687 (5)
abstracting: (Node5WantsToManageTheBreakDownOfNode6<=1)
states: 172,248 (5)
abstracting: (2<=Node6FailureProcessedByNode4)
states: 0
abstracting: (ANodeFromTheLeafSetOfLxIsACtiveInTheLeafSet<=1)
states: 171,653 (5)
abstracting: (Node8FailureProcessedByNode5<=Node7WantsToManageTheBreakDownOfNode3)
states: 171,188 (5)
abstracting: (RxHasReceivedTheRequestOfNode4<=RxHasReceivedTheRequestOfNode4)
states: 172,248 (5)
abstracting: (2<=RxHasReceivedTheRequestOfNode3)
states: 6
abstracting: (1<=Node4FailureProcessedByNode7)
states: 1,928 (3)
abstracting: (Node5FailureProcessedByNode8<=Node4ManageTheBreakDownOfNode3)
states: 171,188 (5)
abstracting: (Node3WantsToManageTheBreakDownOfNode4<=2)
states: 172,248 (5)
abstracting: (NoNodeManageTheBreakDownOfNode7<=0)
states: 167,199 (5)
abstracting: (Node0HasTheLeafSetOfRxToReplaceNode8<=0)
states: 171,687 (5)
abstracting: (2<=Node6HasTheLeafSetOfLxToReplaceNode2)
states: 0
abstracting: (1<=Node1HasTheLeafSetOfLxToReplaceNode4)
states: 1,026 (3)
abstracting: (LeafSetOfLxIsSentToNode3<=Node5HasTheLeafSetOfRxToReplaceNode4)
states: 170,073 (5)
abstracting: (2<=Node7HasTheLeafSetOfLxToReplaceNode3)
states: 0
abstracting: (Node5FailureProcessedByNode1<=2)
states: 172,248 (5)
abstracting: (Node8Failure<=NoNodeManageTheBreakDownOfNode2)
states: 136,980 (5)
abstracting: (1<=Node0HasTheLeafSetOfLxToReplaceNode4)
states: 1,026 (3)
abstracting: (RequestOfNode7IsSentToLx<=Node8FailureProcessedByNode4)
states: 170,030 (5)
abstracting: (1<=Node2WantsToManageTheBreakDownOfNode0)
states: 561
abstracting: (Node4ManageTheBreakDownOfNode3<=0)
states: 171,687 (5)
abstracting: (Node0WantsToManageTheBreakDownOfNode7<=0)
states: 171,687 (5)
abstracting: (Node7ManageTheBreakDownOfNode3<=0)
states: 171,687 (5)
abstracting: (Node0HasTheLeafSetOfRxToReplaceNode6<=Node3WantsToManageTheBreakDownOfNode4)
states: 171,688 (5)
abstracting: (Node2ManageTheBreakDownOfNode5<=LxHasReceivedTheRequestOfNode7)
states: 171,691 (5)
abstracting: (2<=Node8WantsToManageTheBreakDownOfNode1)
states: 0
abstracting: (Node1DontAnswerToAnyNode<=Node6HasTheLeafSetOfRxToReplaceNode4)
states: 171,681 (5)
abstracting: (Node2ManageTheBreakDownOfNode1<=0)
states: 171,687 (5)
abstracting: (Node8HasAskedItsLeafSetToLxToReplaceNode1<=1)
states: 172,248 (5)
abstracting: (Node7WantsToManageTheBreakDownOfNode8<=Node0WantsToManageTheBreakDownOfNode1)
states: 171,688 (5)
abstracting: (Node4FailureProcessedByNode8<=1)
states: 172,248 (5)
abstracting: (RequestOfNode2IsSentToRx<=1)
states: 172,242 (5)
abstracting: (Node4HasAskedItsLeafSetToLxToReplaceNode1<=Node6WantsToManageTheBreakDownOfNode8)
states: 170,601 (5)
abstracting: (2<=Node6FailureProcessedByNode5)
states: 0
abstracting: (2<=Node4ManageTheBreakDownOfNode6)
states: 0
abstracting: (Node6ManageTheBreakDownOfNode8<=RequestOfNode7IsSentToRx)
states: 171,691 (5)
abstracting: (Node7FailureProcessedByNode6<=2)
states: 172,248 (5)
abstracting: (2<=Node5WantsToManageTheBreakDownOfNode2)
states: 0
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.753sec

checking: EF [[~ [[[[~ [[~ [[Node3Failure<=0 | LeafSetOfLxIsSentToNode3<=RxHasReceivedTheRequestOfNode4]] | ~ [Node6ManageTheBreakDownOfNode7<=Node7WantsToManageTheBreakDownOfNode8]]] | [[~ [[Node2ManageTheBreakDownOfNode3<=0 & 1<=Node5HasTheLeafSetOfLxToReplaceNode2]] | 1<=Node7WantsToManageTheBreakDownOfNode0] | [~ [Node8HasAskedItsLeafSetToRxToReplaceNode4<=0] & 2<=Node3WantsToManageTheBreakDownOfNode2]]] & [[~ [2<=Node0HasAskedItsLeafSetToRxToReplaceNode6] | ~ [1<=Node6ManageTheBreakDownOfNode0]] & ~ [[~ [[RxIsActiveInTheLeafSet<=0 | 1<=RequestOfNode7IsSentToLx]] | [[Node4HasTheLeafSetOfLxToReplaceNode0<=0 & Node8HasTheLeafSetOfLxToReplaceNode2<=Node7HasTheLeafSetOfRxToReplaceNode8] | ~ [Node4HasTheLeafSetOfLxToReplaceNode3<=RequestOfNode2IsSentToRx]]]]]] | [[~ [1<=NoNodeManageTheBreakDownOfNode1] | ~ [[~ [[Node2Failure<=1 & Node8FailureProcessedByNode4<=1]] | ~ [[Node0HasAskedItsLeafSetToLxToReplaceNode2<=2 | Node3HasTheLeafSetOfLxToReplaceNode4<=Node3DontAnswerToAnyNode]]]]] | Node1FailureProcessedByNode5<=Node0WantsToManageTheBreakDownOfNode2]]] & [[[1<=Node7HasTheLeafSetOfRxToReplaceNode6 | Node5IsActive<=RequestOfNode1IsSentToRx] & [[[[1<=Node1FailureProcessedByNode8 & [~ [LxHasReceivedTheRequestOfNode2<=0] | 1<=NoNodeManageTheBreakDownOfNode6]] & [Node8ManageTheBreakDownOfNode6<=Node4ManageTheBreakDownOfNode5 & Node7HasAskedItsLeafSetToRxToReplaceNode5<=Node7HasAskedItsLeafSetToRxToReplaceNode4]] & [[[[Node3ManageTheBreakDownOfNode1<=Node3HasAskedItsLeafSetToLxToReplaceNode4 | Node1HasAskedItsLeafSetToLxToReplaceNode4<=Node1FailureProcessedByNode0] & [1<=Node8WantsToManageTheBreakDownOfNode5 | RxHasReceivedTheRequestOfNode6<=Node3HasTheLeafSetOfLxToReplaceNode2]] | ~ [[Node5WantsToManageTheBreakDownOfNode4<=2 & 2<=Node4FailureProcessedByNode5]]] | ~ [[[Node1FailureProcessedByNode4<=Node5FailureProcessedByNode7 & Node5WantsToManageTheBreakDownOfNode0<=0] & [2<=Node6FailureProcessedByNode2 & RxHasReceivedTheRequestOfNode5<=1]]]]] & [[~ [RequestOfNode0IsSentToLx<=1] & [Node1FailureProcessedByNode5<=1 | [1<=RequestOfNode7IsSentToLx & 2<=Node3ManageTheBreakDownOfNode7]]] | ~ [Node3WantsToManageTheBreakDownOfNode4<=Node6HasAskedItsLeafSetToRxToReplaceNode8]]]] | Node7DontAnswerToAnyNode<=Node3HasAskedItsLeafSetToLxToReplaceNode4]]]
normalized: E [true U [~ [[[[[[1<=Node7WantsToManageTheBreakDownOfNode0 | ~ [[Node2ManageTheBreakDownOfNode3<=0 & 1<=Node5HasTheLeafSetOfLxToReplaceNode2]]] | [2<=Node3WantsToManageTheBreakDownOfNode2 & ~ [Node8HasAskedItsLeafSetToRxToReplaceNode4<=0]]] | ~ [[~ [Node6ManageTheBreakDownOfNode7<=Node7WantsToManageTheBreakDownOfNode8] | ~ [[Node3Failure<=0 | LeafSetOfLxIsSentToNode3<=RxHasReceivedTheRequestOfNode4]]]]] & [~ [[[~ [Node4HasTheLeafSetOfLxToReplaceNode3<=RequestOfNode2IsSentToRx] | [Node4HasTheLeafSetOfLxToReplaceNode0<=0 & Node8HasTheLeafSetOfLxToReplaceNode2<=Node7HasTheLeafSetOfRxToReplaceNode8]] | ~ [[RxIsActiveInTheLeafSet<=0 | 1<=RequestOfNode7IsSentToLx]]]] & [~ [1<=Node6ManageTheBreakDownOfNode0] | ~ [2<=Node0HasAskedItsLeafSetToRxToReplaceNode6]]]] | [Node1FailureProcessedByNode5<=Node0WantsToManageTheBreakDownOfNode2 | [~ [[~ [[Node0HasAskedItsLeafSetToLxToReplaceNode2<=2 | Node3HasTheLeafSetOfLxToReplaceNode4<=Node3DontAnswerToAnyNode]] | ~ [[Node2Failure<=1 & Node8FailureProcessedByNode4<=1]]]] | ~ [1<=NoNodeManageTheBreakDownOfNode1]]]]] & [Node7DontAnswerToAnyNode<=Node3HasAskedItsLeafSetToLxToReplaceNode4 | [[[[~ [[[2<=Node6FailureProcessedByNode2 & RxHasReceivedTheRequestOfNode5<=1] & [Node1FailureProcessedByNode4<=Node5FailureProcessedByNode7 & Node5WantsToManageTheBreakDownOfNode0<=0]]] | [~ [[Node5WantsToManageTheBreakDownOfNode4<=2 & 2<=Node4FailureProcessedByNode5]] | [[1<=Node8WantsToManageTheBreakDownOfNode5 | RxHasReceivedTheRequestOfNode6<=Node3HasTheLeafSetOfLxToReplaceNode2] & [Node3ManageTheBreakDownOfNode1<=Node3HasAskedItsLeafSetToLxToReplaceNode4 | Node1HasAskedItsLeafSetToLxToReplaceNode4<=Node1FailureProcessedByNode0]]]] & [[Node8ManageTheBreakDownOfNode6<=Node4ManageTheBreakDownOfNode5 & Node7HasAskedItsLeafSetToRxToReplaceNode5<=Node7HasAskedItsLeafSetToRxToReplaceNode4] & [1<=Node1FailureProcessedByNode8 & [1<=NoNodeManageTheBreakDownOfNode6 | ~ [LxHasReceivedTheRequestOfNode2<=0]]]]] & [[~ [RequestOfNode0IsSentToLx<=1] & [Node1FailureProcessedByNode5<=1 | [1<=RequestOfNode7IsSentToLx & 2<=Node3ManageTheBreakDownOfNode7]]] | ~ [Node3WantsToManageTheBreakDownOfNode4<=Node6HasAskedItsLeafSetToRxToReplaceNode8]]] & [1<=Node7HasTheLeafSetOfRxToReplaceNode6 | Node5IsActive<=RequestOfNode1IsSentToRx]]]]]

abstracting: (Node5IsActive<=RequestOfNode1IsSentToRx)
states: 37,383 (4)
abstracting: (1<=Node7HasTheLeafSetOfRxToReplaceNode6)
states: 561
abstracting: (Node3WantsToManageTheBreakDownOfNode4<=Node6HasAskedItsLeafSetToRxToReplaceNode8)
states: 171,738 (5)
abstracting: (2<=Node3ManageTheBreakDownOfNode7)
states: 0
abstracting: (1<=RequestOfNode7IsSentToLx)
states: 2,226 (3)
abstracting: (Node1FailureProcessedByNode5<=1)
states: 172,248 (5)
abstracting: (RequestOfNode0IsSentToLx<=1)
states: 172,239 (5)
abstracting: (LxHasReceivedTheRequestOfNode2<=0)
states: 169,566 (5)
abstracting: (1<=NoNodeManageTheBreakDownOfNode6)
states: 5,049 (3)
abstracting: (1<=Node1FailureProcessedByNode8)
states: 1,060 (3)
abstracting: (Node7HasAskedItsLeafSetToRxToReplaceNode5<=Node7HasAskedItsLeafSetToRxToReplaceNode4)
states: 170,589 (5)
abstracting: (Node8ManageTheBreakDownOfNode6<=Node4ManageTheBreakDownOfNode5)
states: 171,688 (5)
abstracting: (Node1HasAskedItsLeafSetToLxToReplaceNode4<=Node1FailureProcessedByNode0)
states: 169,200 (5)
abstracting: (Node3ManageTheBreakDownOfNode1<=Node3HasAskedItsLeafSetToLxToReplaceNode4)
states: 171,690 (5)
abstracting: (RxHasReceivedTheRequestOfNode6<=Node3HasTheLeafSetOfLxToReplaceNode2)
states: 169,571 (5)
abstracting: (1<=Node8WantsToManageTheBreakDownOfNode5)
states: 561
abstracting: (2<=Node4FailureProcessedByNode5)
states: 0
abstracting: (Node5WantsToManageTheBreakDownOfNode4<=2)
states: 172,248 (5)
abstracting: (Node5WantsToManageTheBreakDownOfNode0<=0)
states: 171,687 (5)
abstracting: (Node1FailureProcessedByNode4<=Node5FailureProcessedByNode7)
states: 171,204 (5)
abstracting: (RxHasReceivedTheRequestOfNode5<=1)
states: 172,242 (5)
abstracting: (2<=Node6FailureProcessedByNode2)
states: 0
abstracting: (Node7DontAnswerToAnyNode<=Node3HasAskedItsLeafSetToLxToReplaceNode4)
states: 171,682 (5)
abstracting: (1<=NoNodeManageTheBreakDownOfNode1)
states: 5,049 (3)
abstracting: (Node8FailureProcessedByNode4<=1)
states: 172,248 (5)
abstracting: (Node2Failure<=1)
states: 172,248 (5)
abstracting: (Node3HasTheLeafSetOfLxToReplaceNode4<=Node3DontAnswerToAnyNode)
states: 171,736 (5)
abstracting: (Node0HasAskedItsLeafSetToLxToReplaceNode2<=2)
states: 172,248 (5)
abstracting: (Node1FailureProcessedByNode5<=Node0WantsToManageTheBreakDownOfNode2)
states: 171,190 (5)
abstracting: (2<=Node0HasAskedItsLeafSetToRxToReplaceNode6)
states: 0
abstracting: (1<=Node6ManageTheBreakDownOfNode0)
states: 561
abstracting: (1<=RequestOfNode7IsSentToLx)
states: 2,226 (3)
abstracting: (RxIsActiveInTheLeafSet<=0)
states: 152,514 (5)
abstracting: (Node8HasTheLeafSetOfLxToReplaceNode2<=Node7HasTheLeafSetOfRxToReplaceNode8)
states: 171,688 (5)
abstracting: (Node4HasTheLeafSetOfLxToReplaceNode0<=0)
states: 171,695 (5)
abstracting: (Node4HasTheLeafSetOfLxToReplaceNode3<=RequestOfNode2IsSentToRx)
states: 171,691 (5)
abstracting: (LeafSetOfLxIsSentToNode3<=RxHasReceivedTheRequestOfNode4)
states: 170,086 (5)
abstracting: (Node3Failure<=0)
states: 136,344 (5)
abstracting: (Node6ManageTheBreakDownOfNode7<=Node7WantsToManageTheBreakDownOfNode8)
states: 171,688 (5)
abstracting: (Node8HasAskedItsLeafSetToRxToReplaceNode4<=0)
states: 169,188 (5)
abstracting: (2<=Node3WantsToManageTheBreakDownOfNode2)
states: 0
abstracting: (1<=Node5HasTheLeafSetOfLxToReplaceNode2)
states: 561
abstracting: (Node2ManageTheBreakDownOfNode3<=0)
states: 171,687 (5)
abstracting: (1<=Node7WantsToManageTheBreakDownOfNode0)
states: 561
-> the formula is FALSE

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

MC time: 0m 3.121sec

checking: EF [[[[[~ [[[[~ [Node1DontAnswerToAnyNode<=Node4ManageTheBreakDownOfNode5] | 1<=Node4FailureProcessedByNode3] | [~ [Node0HasTheLeafSetOfRxToReplaceNode6<=Node3HasTheLeafSetOfLxToReplaceNode0] & [RequestOfNode0IsSentToLx<=Node6HasAskedItsLeafSetToLxToReplaceNode0 & Node5FailureProcessedByNode3<=RxHasReceivedTheRequestOfNode3]]] & 2<=Node7ManageTheBreakDownOfNode5]] & [[[~ [[Node2FailureProcessedByNode7<=Node2ManageTheBreakDownOfNode8 & Node1ManageTheBreakDownOfNode3<=1]] & [~ [Node1ManageTheBreakDownOfNode0<=2] & ~ [2<=LeafSetOfRxIsSentToNode3]]] | [[1<=BreakDownReservoir | [Node5FailureProcessedByNode3<=2 & 2<=Node3HasTheLeafSetOfLxToReplaceNode4]] & [~ [Node5WantsToManageTheBreakDownOfNode4<=2] & [NoNodeManageTheBreakDownOfNode3<=2 | 1<=Node3ManageTheBreakDownOfNode4]]]] & ~ [[NoNodeManageTheBreakDownOfNode1<=2 & ~ [Node1ManageTheBreakDownOfNode2<=Node6HasTheLeafSetOfRxToReplaceNode5]]]]] & 1<=Node5FailureProcessedByNode3] & [[~ [Node8DontAnswerToAnyNode<=2] & ~ [Node2ManageTheBreakDownOfNode6<=Node1ManageTheBreakDownOfNode6]] & [~ [[1<=Node2WantsToManageTheBreakDownOfNode8 & [1<=Node5ManageTheBreakDownOfNode3 & [Node1HasTheLeafSetOfRxToReplaceNode5<=1 | 1<=Node4HasAskedItsLeafSetToRxToReplaceNode7]]]] | [[Node1FailureProcessedByNode4<=Node4FailureProcessedByNode8 | [Node0HasAskedItsLeafSetToLxToReplaceNode2<=Node3HasTheLeafSetOfLxToReplaceNode1 & [[2<=Node4FailureProcessedByNode5 | 2<=Node1FailureProcessedByNode2] | ~ [Node1HasTheLeafSetOfRxToReplaceNode8<=Node0WantsToManageTheBreakDownOfNode5]]]] & [Node7WantsToManageTheBreakDownOfNode2<=0 & [[[Node0HasAskedItsLeafSetToLxToReplaceNode3<=0 & 1<=Node5ManageTheBreakDownOfNode1] | [RequestOfNode1IsSentToRx<=1 | Node2HasTheLeafSetOfRxToReplaceNode5<=Node7FailureProcessedByNode8]] | [[RequestOfNode0IsSentToRx<=Node2HasAskedItsLeafSetToLxToReplaceNode1 | Node3FailureProcessedByNode5<=Node4WantsToManageTheBreakDownOfNode3] | ~ [Node1ManageTheBreakDownOfNode2<=0]]]]]]]] & [~ [[[~ [[~ [1<=Node3FailureProcessedByNode4] & [~ [Node4HasAskedItsLeafSetToLxToReplaceNode3<=1] | [Node6HasAskedItsLeafSetToRxToReplaceNode5<=1 | 1<=Node5DontAnswerToAnyNode]]]] & [~ [Node3HasTheLeafSetOfRxToReplaceNode5<=Node0ManageTheBreakDownOfNode8] | ~ [Node4FailureProcessedByNode5<=Node4Failure]]] & Node0WantsToManageTheBreakDownOfNode7<=LeafSetOfLxIsSentToNode0]] & 2<=Node3HasTheLeafSetOfLxToReplaceNode0]]]
normalized: E [true U [[2<=Node3HasTheLeafSetOfLxToReplaceNode0 & ~ [[Node0WantsToManageTheBreakDownOfNode7<=LeafSetOfLxIsSentToNode0 & [[~ [Node3HasTheLeafSetOfRxToReplaceNode5<=Node0ManageTheBreakDownOfNode8] | ~ [Node4FailureProcessedByNode5<=Node4Failure]] & ~ [[[[Node6HasAskedItsLeafSetToRxToReplaceNode5<=1 | 1<=Node5DontAnswerToAnyNode] | ~ [Node4HasAskedItsLeafSetToLxToReplaceNode3<=1]] & ~ [1<=Node3FailureProcessedByNode4]]]]]]] & [[[[[Node7WantsToManageTheBreakDownOfNode2<=0 & [[~ [Node1ManageTheBreakDownOfNode2<=0] | [RequestOfNode0IsSentToRx<=Node2HasAskedItsLeafSetToLxToReplaceNode1 | Node3FailureProcessedByNode5<=Node4WantsToManageTheBreakDownOfNode3]] | [[RequestOfNode1IsSentToRx<=1 | Node2HasTheLeafSetOfRxToReplaceNode5<=Node7FailureProcessedByNode8] | [Node0HasAskedItsLeafSetToLxToReplaceNode3<=0 & 1<=Node5ManageTheBreakDownOfNode1]]]] & [Node1FailureProcessedByNode4<=Node4FailureProcessedByNode8 | [Node0HasAskedItsLeafSetToLxToReplaceNode2<=Node3HasTheLeafSetOfLxToReplaceNode1 & [~ [Node1HasTheLeafSetOfRxToReplaceNode8<=Node0WantsToManageTheBreakDownOfNode5] | [2<=Node4FailureProcessedByNode5 | 2<=Node1FailureProcessedByNode2]]]]] | ~ [[1<=Node2WantsToManageTheBreakDownOfNode8 & [1<=Node5ManageTheBreakDownOfNode3 & [Node1HasTheLeafSetOfRxToReplaceNode5<=1 | 1<=Node4HasAskedItsLeafSetToRxToReplaceNode7]]]]] & [~ [Node2ManageTheBreakDownOfNode6<=Node1ManageTheBreakDownOfNode6] & ~ [Node8DontAnswerToAnyNode<=2]]] & [1<=Node5FailureProcessedByNode3 & [[~ [[NoNodeManageTheBreakDownOfNode1<=2 & ~ [Node1ManageTheBreakDownOfNode2<=Node6HasTheLeafSetOfRxToReplaceNode5]]] & [[[[NoNodeManageTheBreakDownOfNode3<=2 | 1<=Node3ManageTheBreakDownOfNode4] & ~ [Node5WantsToManageTheBreakDownOfNode4<=2]] & [1<=BreakDownReservoir | [Node5FailureProcessedByNode3<=2 & 2<=Node3HasTheLeafSetOfLxToReplaceNode4]]] | [[~ [2<=LeafSetOfRxIsSentToNode3] & ~ [Node1ManageTheBreakDownOfNode0<=2]] & ~ [[Node2FailureProcessedByNode7<=Node2ManageTheBreakDownOfNode8 & Node1ManageTheBreakDownOfNode3<=1]]]]] & ~ [[2<=Node7ManageTheBreakDownOfNode5 & [[[RequestOfNode0IsSentToLx<=Node6HasAskedItsLeafSetToLxToReplaceNode0 & Node5FailureProcessedByNode3<=RxHasReceivedTheRequestOfNode3] & ~ [Node0HasTheLeafSetOfRxToReplaceNode6<=Node3HasTheLeafSetOfLxToReplaceNode0]] | [1<=Node4FailureProcessedByNode3 | ~ [Node1DontAnswerToAnyNode<=Node4ManageTheBreakDownOfNode5]]]]]]]]]]

abstracting: (Node1DontAnswerToAnyNode<=Node4ManageTheBreakDownOfNode5)
states: 171,680 (5)
abstracting: (1<=Node4FailureProcessedByNode3)
states: 964
abstracting: (Node0HasTheLeafSetOfRxToReplaceNode6<=Node3HasTheLeafSetOfLxToReplaceNode0)
states: 171,688 (5)
abstracting: (Node5FailureProcessedByNode3<=RxHasReceivedTheRequestOfNode3)
states: 171,194 (5)
abstracting: (RequestOfNode0IsSentToLx<=Node6HasAskedItsLeafSetToLxToReplaceNode0)
states: 169,581 (5)
abstracting: (2<=Node7ManageTheBreakDownOfNode5)
states: 0
abstracting: (Node1ManageTheBreakDownOfNode3<=1)
states: 172,248 (5)
abstracting: (Node2FailureProcessedByNode7<=Node2ManageTheBreakDownOfNode8)
states: 171,190 (5)
abstracting: (Node1ManageTheBreakDownOfNode0<=2)
states: 172,248 (5)
abstracting: (2<=LeafSetOfRxIsSentToNode3)
states: 6
abstracting: (2<=Node3HasTheLeafSetOfLxToReplaceNode4)
states: 0
abstracting: (Node5FailureProcessedByNode3<=2)
states: 172,248 (5)
abstracting: (1<=BreakDownReservoir)
states: 634
abstracting: (Node5WantsToManageTheBreakDownOfNode4<=2)
states: 172,248 (5)
abstracting: (1<=Node3ManageTheBreakDownOfNode4)
states: 513
abstracting: (NoNodeManageTheBreakDownOfNode3<=2)
states: 172,248 (5)
abstracting: (Node1ManageTheBreakDownOfNode2<=Node6HasTheLeafSetOfRxToReplaceNode5)
states: 171,688 (5)
abstracting: (NoNodeManageTheBreakDownOfNode1<=2)
states: 172,248 (5)
abstracting: (1<=Node5FailureProcessedByNode3)
states: 1,060 (3)
abstracting: (Node8DontAnswerToAnyNode<=2)
states: 172,248 (5)
abstracting: (Node2ManageTheBreakDownOfNode6<=Node1ManageTheBreakDownOfNode6)
states: 171,687 (5)
abstracting: (1<=Node4HasAskedItsLeafSetToRxToReplaceNode7)
states: 1,650 (3)
abstracting: (Node1HasTheLeafSetOfRxToReplaceNode5<=1)
states: 172,248 (5)
abstracting: (1<=Node5ManageTheBreakDownOfNode3)
states: 561
abstracting: (1<=Node2WantsToManageTheBreakDownOfNode8)
states: 561
abstracting: (2<=Node1FailureProcessedByNode2)
states: 0
abstracting: (2<=Node4FailureProcessedByNode5)
states: 0
abstracting: (Node1HasTheLeafSetOfRxToReplaceNode8<=Node0WantsToManageTheBreakDownOfNode5)
states: 171,688 (5)
abstracting: (Node0HasAskedItsLeafSetToLxToReplaceNode2<=Node3HasTheLeafSetOfLxToReplaceNode1)
states: 170,580 (5)
abstracting: (Node1FailureProcessedByNode4<=Node4FailureProcessedByNode8)
states: 171,208 (5)
abstracting: (1<=Node5ManageTheBreakDownOfNode1)
states: 561
abstracting: (Node0HasAskedItsLeafSetToLxToReplaceNode3<=0)
states: 170,577 (5)
abstracting: (Node2HasTheLeafSetOfRxToReplaceNode5<=Node7FailureProcessedByNode8)
states: 171,689 (5)
abstracting: (RequestOfNode1IsSentToRx<=1)
states: 172,242 (5)
abstracting: (Node3FailureProcessedByNode5<=Node4WantsToManageTheBreakDownOfNode3)
states: 171,188 (5)
abstracting: (RequestOfNode0IsSentToRx<=Node2HasAskedItsLeafSetToLxToReplaceNode1)
states: 170,034 (5)
abstracting: (Node1ManageTheBreakDownOfNode2<=0)
states: 171,687 (5)
abstracting: (Node7WantsToManageTheBreakDownOfNode2<=0)
states: 171,687 (5)
abstracting: (1<=Node3FailureProcessedByNode4)
states: 1,062 (3)
abstracting: (Node4HasAskedItsLeafSetToLxToReplaceNode3<=1)
states: 172,248 (5)
abstracting: (1<=Node5DontAnswerToAnyNode)
states: 569
abstracting: (Node6HasAskedItsLeafSetToRxToReplaceNode5<=1)
states: 172,248 (5)
abstracting: (Node4FailureProcessedByNode5<=Node4Failure)
states: 172,248 (5)
abstracting: (Node3HasTheLeafSetOfRxToReplaceNode5<=Node0ManageTheBreakDownOfNode8)
states: 171,688 (5)
abstracting: (Node0WantsToManageTheBreakDownOfNode7<=LeafSetOfLxIsSentToNode0)
states: 171,692 (5)
abstracting: (2<=Node3HasTheLeafSetOfLxToReplaceNode0)
states: 0
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.799sec

totally nodes used: 3545287 (3.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 10285465 123643252 133928717
used/not used/entry size/cache size: 56576351 10532513 16 1024MB
basic ops cache: hits/miss/sum: 3136872 34861211 37998083
used/not used/entry size/cache size: 15178070 1599146 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: 812504 1948691 2761195
used/not used/entry size/cache size: 1742711 6645897 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 64032529
1 2672573
2 345646
3 51651
4 5901
5 522
6 40
7 1
8 1
9 0
>= 10 0

Total processing time: 0m52.590sec


BK_STOP 1679504495032

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


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

initing FirstDep: 0m 0.000sec


iterations count:962 (2), effective:5 (0)

iterations count:1737 (4), effective:23 (0)

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

iterations count:828 (2), effective:6 (0)

iterations count:1193 (2), effective:21 (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="ReachabilityCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is LeafsetExtension-PT-S08C2, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856420300454"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;