About the Execution of Marcie for S_Peterson-PT-2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5451.610 | 3600000.00 | 3600224.00 | 20.40 | TTFTFFTF?TTTFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-2979
Executing tool marcie
Input is S_Peterson-PT-2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r173kn-ebro-146433146100601
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-0
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-1
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-10
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-11
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-12
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-13
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-14
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-15
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-2
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-3
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-4
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-5
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-6
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-7
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-8
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1464803776349
Marcie rev. 8535M (built: crohr on 2016-04-27)
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: marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --mcc-mode --memory=6 --suppress
parse successfull
net created successfully
Net: Peterson_PT_2
(NrP: 102 NrTr: 126 NrArc: 384)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec
init dd package: 0m 7.776sec
RS generation: 0m 0.788sec
-> reachability set: #nodes 3632 (3.6e+03) #states 20,754 (4)
starting MCC model checker
--------------------------
checking: AG [~ [~ [sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)]]]
normalized: ~ [E [true U ~ [sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)]]]
abstracting: (sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)) states: 20,754 (4)
-> the formula is TRUE
FORMULA Peterson-COL-2-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.263sec
checking: EF [sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)]
normalized: E [true U sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)]
abstracting: (sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)) states: 66
-> the formula is TRUE
FORMULA Peterson-COL-2-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.371sec
checking: AG [sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)]
normalized: ~ [E [true U ~ [sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)]]]
abstracting: (sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)) states: 20,688 (4)
-> the formula is FALSE
FORMULA Peterson-COL-2-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.388sec
checking: AG [~ [~ [sum(CS_2, CS_1, CS_0)<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)]]]
normalized: ~ [E [true U ~ [sum(CS_2, CS_1, CS_0)<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)]]]
abstracting: (sum(CS_2, CS_1, CS_0)<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)) states: 20,427 (4)
-> the formula is FALSE
FORMULA Peterson-COL-2-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.446sec
checking: AG [sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)]
normalized: ~ [E [true U ~ [sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)]]]
abstracting: (sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)) states: 20,724 (4)
-> the formula is FALSE
FORMULA Peterson-COL-2-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m19.594sec
checking: AG [~ [[~ [1<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)] & [sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0) & sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)<=sum(Idle_1, Idle_2, Idle_0)]]]]
normalized: ~ [E [true U [~ [1<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)] & [sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0) & sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)<=sum(Idle_1, Idle_2, Idle_0)]]]]
abstracting: (sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)<=sum(Idle_1, Idle_2, Idle_0)) states: 3
abstracting: (sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)) states: 20,742 (4)
abstracting: (1<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)) states: 20,754 (4)
-> the formula is TRUE
FORMULA Peterson-COL-2-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.244sec
checking: AG [~ [[[2<=sum(Idle_1, Idle_2, Idle_0) & 3<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)] & sum(CS_2, CS_1, CS_0)<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)]]]
normalized: ~ [E [true U [sum(CS_2, CS_1, CS_0)<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1) & [2<=sum(Idle_1, Idle_2, Idle_0) & 3<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)]]]]
abstracting: (3<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)) states: 194
abstracting: (2<=sum(Idle_1, Idle_2, Idle_0)) states: 180
abstracting: (sum(CS_2, CS_1, CS_0)<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)) states: 20,295 (4)
-> the formula is TRUE
FORMULA Peterson-COL-2-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.497sec
checking: AG [[~ [[1<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T) & sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)]] | [~ [3<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)] | 2<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)]]]
normalized: ~ [E [true U ~ [[~ [[1<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T) & sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)]] | [2<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T) | ~ [3<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)]]]]]]
abstracting: (3<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)) states: 12
abstracting: (2<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)) states: 20,754 (4)
abstracting: (sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)) states: 12,257 (4)
abstracting: (1<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)) states: 20,754 (4)
-> the formula is TRUE
FORMULA Peterson-COL-2-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m18.776sec
checking: EF [~ [~ [[sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0) & 3<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)]]]]
normalized: E [true U [sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0) & 3<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)]]
abstracting: (3<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)) states: 30
abstracting: (sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)) states: 16,948 (4)
-> the formula is TRUE
FORMULA Peterson-COL-2-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m20.501sec
checking: AG [~ [~ [[sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T) | sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)]]]]
normalized: ~ [E [true U ~ [[sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T) | sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)]]]]
abstracting: (sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)) states: 15,671 (4)
abstracting: (sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)) states: 20,754 (4)
-> the formula is TRUE
FORMULA Peterson-COL-2-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 22m46.499sec
checking: EF [~ [[sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0) | [sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1) | 3<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)]]]]
normalized: E [true U ~ [[sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0) | [sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1) | 3<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)]]]]
abstracting: (3<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)) states: 20,754 (4)
abstracting: (sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)) states: 378
abstracting: (sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)) states: 19,260 (4)
-> the formula is FALSE
FORMULA Peterson-COL-2-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m22.656sec
checking: EF [[~ [~ [sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)]] & [[sum(CS_2, CS_1, CS_0)<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0) & 3<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)] & [2<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1) | sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)]]]]
normalized: E [true U [sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0) & [[2<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1) | sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)] & [sum(CS_2, CS_1, CS_0)<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0) & 3<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)]]]]
abstracting: (3<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)) states: 0
abstracting: (sum(CS_2, CS_1, CS_0)<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)) states: 20,241 (4)
abstracting: (sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)) states: 0
abstracting: (2<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)) states: 378
abstracting: (sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)) states: 20,733 (4)
-> the formula is FALSE
FORMULA Peterson-COL-2-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.564sec
checking: AG [[[~ [sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)] | 3<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)] | sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)]]
normalized: ~ [E [true U ~ [[sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0) | [3<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0) | ~ [sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)]]]]]]
abstracting: (sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)) states: 18,885 (4)
abstracting: (3<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)) states: 30
abstracting: (sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)) states: 20,724 (4)
-> the formula is TRUE
FORMULA Peterson-COL-2-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m22.272sec
checking: AG [[[[sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)<=sum(Idle_1, Idle_2, Idle_0) | sum(Idle_1, Idle_2, Idle_0)<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)] | ~ [sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)]] | sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=sum(Idle_1, Idle_2, Idle_0)]]
normalized: ~ [E [true U ~ [[sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=sum(Idle_1, Idle_2, Idle_0) | [~ [sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)] | [sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)<=sum(Idle_1, Idle_2, Idle_0) | sum(Idle_1, Idle_2, Idle_0)<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)]]]]]]
abstracting: (sum(Idle_1, Idle_2, Idle_0)<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)) states: 18,849 (4)
abstracting: (sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)<=sum(Idle_1, Idle_2, Idle_0)) states: 14,154 (4)
abstracting: (sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)) states: 20,754 (4)
abstracting: (sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=sum(Idle_1, Idle_2, Idle_0)) states: 18,516 (4)
-> the formula is TRUE
FORMULA Peterson-COL-2-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.750sec
checking: AG [[[sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1) & ~ [sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)]] | [sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1) | [1<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0) | sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)]]]]
normalized: ~ [E [true U ~ [[[sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1) & ~ [sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)]] | [sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1) | [1<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0) | sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)]]]]]]
abstracting: (sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)) states: 17,248 (4)
abstracting: (1<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)) states: 20,754 (4)
abstracting: (sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)) states: 15,615 (4)
abstracting: (sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)) states: 14,593 (4)
abstracting: (sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)) states: 378
-> the formula is TRUE
FORMULA Peterson-COL-2-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m44.063sec
checking: EF [[[~ [sum(Idle_1, Idle_2, Idle_0)<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)] & [sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0) | sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)]] & 2<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)]]
normalized: E [true U [2<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0) & [[sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndL
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
check for maximal unmarked siphon
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
807 1404 2360 2611 2913 3208 3251 3843 3819
iterations count:9670 (76), effective:632 (5)
initing FirstDep: 0m 0.000sec
2476 3659 3795 3625 3705
iterations count:5831 (46), effective:240 (1)
2476 3659 3795 3625 3705
iterations count:5831 (46), effective:240 (1)
2328 2992 3282 4221 3635 3746 4016
iterations count:7271 (57), effective:362 (2)
1572 2093 2718 2943 3968 3726 3756 4298 4196
iterations count:9712 (77), effective:473 (3)
1572 2093 2718 2943 3968 3726 3756 4298 4196
iterations count:9712 (77), effective:473 (3)
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="S_Peterson-PT-2"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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
tar xzf /home/mcc/BenchKit/INPUTS/S_Peterson-PT-2.tgz
mv S_Peterson-PT-2 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is S_Peterson-PT-2, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r173kn-ebro-146433146100601"
echo "====================================================================="
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 '
echo "FORMULA_NAME $x"
done
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 ;