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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.5K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 166K Mar 26 22:42 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 Anderson-PT-05-CTLCardinality-00
FORMULA_NAME Anderson-PT-05-CTLCardinality-01
FORMULA_NAME Anderson-PT-05-CTLCardinality-02
FORMULA_NAME Anderson-PT-05-CTLCardinality-03
FORMULA_NAME Anderson-PT-05-CTLCardinality-04
FORMULA_NAME Anderson-PT-05-CTLCardinality-05
FORMULA_NAME Anderson-PT-05-CTLCardinality-06
FORMULA_NAME Anderson-PT-05-CTLCardinality-07
FORMULA_NAME Anderson-PT-05-CTLCardinality-08
FORMULA_NAME Anderson-PT-05-CTLCardinality-09
FORMULA_NAME Anderson-PT-05-CTLCardinality-10
FORMULA_NAME Anderson-PT-05-CTLCardinality-11
FORMULA_NAME Anderson-PT-05-CTLCardinality-12
FORMULA_NAME Anderson-PT-05-CTLCardinality-13
FORMULA_NAME Anderson-PT-05-CTLCardinality-14
FORMULA_NAME Anderson-PT-05-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679873472329

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-05
Not applying reductions.
Model is PT
CTLCardinality PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: anderson_05
(NrP: 161 NrTr: 365 NrArc: 1380)

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

net check time: 0m 0.000sec

init dd package: 0m 3.067sec


RS generation: 1m40.368sec


-> reachability set: #nodes 96853 (9.7e+04) #states 689,901 (5)



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

checking: AF [EF [~ [EF [p3_4_3<=0]]]]
normalized: ~ [EG [~ [E [true U ~ [E [true U p3_4_3<=0]]]]]]

abstracting: (p3_4_3<=0)
states: 684,664 (5)

EG iterations: 0
-> the formula is FALSE

FORMULA Anderson-PT-05-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.517sec

checking: ~ [EG [ncs_0_4<=p2_0_3]]
normalized: ~ [EG [ncs_0_4<=p2_0_3]]

abstracting: (ncs_0_4<=p2_0_3)
states: 635,212 (5)
.............................
EG iterations: 29
-> the formula is FALSE

FORMULA Anderson-PT-05-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.553sec

checking: AG [AG [EX [[E [cs_0_3<=1 U 1<=p3_1_0] | ~ [1<=p1_1_1]]]]]
normalized: ~ [E [true U E [true U ~ [EX [[~ [1<=p1_1_1] | E [cs_0_3<=1 U 1<=p3_1_0]]]]]]]

abstracting: (1<=p3_1_0)
states: 6,861 (3)
abstracting: (cs_0_3<=1)
states: 689,901 (5)
abstracting: (1<=p1_1_1)
states: 22,305 (4)
.-> the formula is TRUE

FORMULA Anderson-PT-05-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.368sec

checking: ~ [EG [EX [EG [A [cs_4_1<=1 U cs_3_0<=cs_4_2]]]]]
normalized: ~ [EG [EX [EG [[~ [EG [~ [cs_3_0<=cs_4_2]]] & ~ [E [~ [cs_3_0<=cs_4_2] U [~ [cs_4_1<=1] & ~ [cs_3_0<=cs_4_2]]]]]]]]]

abstracting: (cs_3_0<=cs_4_2)
states: 683,040 (5)
abstracting: (cs_4_1<=1)
states: 689,901 (5)
abstracting: (cs_3_0<=cs_4_2)
states: 683,040 (5)
abstracting: (cs_3_0<=cs_4_2)
states: 683,040 (5)
..........
EG iterations: 10

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

FORMULA Anderson-PT-05-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.373sec

checking: [E [ncs_4_4<=0 U [p1_2_8<=p1_2_8 & AX [~ [1<=p1_3_4]]]] & ~ [EG [[1<=p1_2_0 | p3_0_0<=0]]]]
normalized: [~ [EG [[1<=p1_2_0 | p3_0_0<=0]]] & E [ncs_4_4<=0 U [p1_2_8<=p1_2_8 & ~ [EX [1<=p1_3_4]]]]]

abstracting: (1<=p1_3_4)
states: 27,313 (4)
.abstracting: (p1_2_8<=p1_2_8)
states: 689,901 (5)
abstracting: (ncs_4_4<=0)
states: 635,212 (5)
abstracting: (p3_0_0<=0)
states: 683,040 (5)
abstracting: (1<=p1_2_0)
states: 15,485 (4)
...........................
EG iterations: 27
-> the formula is FALSE

FORMULA Anderson-PT-05-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.604sec

checking: [EG [AX [[~ [[~ [1<=p3_2_0] | EF [p2_2_2<=1]]] | AF [[p3_3_2<=1 | p1_4_4<=0]]]]] & EF [[~ [1<=ncs_3_2] & ncs_1_3<=1]]]
normalized: [E [true U [ncs_1_3<=1 & ~ [1<=ncs_3_2]]] & EG [~ [EX [~ [[~ [EG [~ [[p3_3_2<=1 | p1_4_4<=0]]]] | ~ [[E [true U p2_2_2<=1] | ~ [1<=p3_2_0]]]]]]]]]

abstracting: (1<=p3_2_0)
states: 6,861 (3)
abstracting: (p2_2_2<=1)
states: 689,901 (5)
abstracting: (p1_4_4<=0)
states: 662,588 (5)
abstracting: (p3_3_2<=1)
states: 689,901 (5)
.
EG iterations: 1
.
EG iterations: 0
abstracting: (1<=ncs_3_2)
states: 49,197 (4)
abstracting: (ncs_1_3<=1)
states: 689,901 (5)
-> the formula is TRUE

FORMULA Anderson-PT-05-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.400sec

checking: EX [AX [[A [[p2_1_1<=cs_4_2 | AG [ncs_3_0<=0]] U 1<=cs_0_0] | AX [~ [p3_4_1<=cs_1_1]]]]]
normalized: EX [~ [EX [~ [[~ [EX [p3_4_1<=cs_1_1]] | [~ [EG [~ [1<=cs_0_0]]] & ~ [E [~ [1<=cs_0_0] U [~ [[p2_1_1<=cs_4_2 | ~ [E [true U ~ [ncs_3_0<=0]]]]] & ~ [1<=cs_0_0]]]]]]]]]]

abstracting: (1<=cs_0_0)
states: 6,861 (3)
abstracting: (ncs_3_0<=0)
states: 637,387 (5)
abstracting: (p2_1_1<=cs_4_2)
states: 658,542 (5)
abstracting: (1<=cs_0_0)
states: 6,861 (3)
abstracting: (1<=cs_0_0)
states: 6,861 (3)
............................
EG iterations: 28
abstracting: (p3_4_1<=cs_1_1)
states: 683,956 (5)
...-> the formula is FALSE

FORMULA Anderson-PT-05-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m43.652sec

checking: ~ [EF [[EF [EG [1<=p2_0_0]] & [A [1<=p1_2_8 U ~ [p1_3_2<=p3_0_0]] & A [EG [1<=p1_1_7] U next_1<=0]]]]]
normalized: ~ [E [true U [[[~ [EG [p1_3_2<=p3_0_0]] & ~ [E [p1_3_2<=p3_0_0 U [p1_3_2<=p3_0_0 & ~ [1<=p1_2_8]]]]] & [~ [EG [~ [next_1<=0]]] & ~ [E [~ [next_1<=0] U [~ [EG [1<=p1_1_7]] & ~ [next_1<=0]]]]]] & E [true U EG [1<=p2_0_0]]]]]

abstracting: (1<=p2_0_0)
states: 30,545 (4)
..........................
EG iterations: 26
abstracting: (next_1<=0)
states: 595,515 (5)
abstracting: (1<=p1_1_7)
states: 17,988 (4)
..........................
EG iterations: 26
abstracting: (next_1<=0)
states: 595,515 (5)
abstracting: (next_1<=0)
states: 595,515 (5)
.....................
EG iterations: 21
abstracting: (1<=p1_2_8)
states: 9,864 (3)
abstracting: (p1_3_2<=p3_0_0)
states: 662,889 (5)
abstracting: (p1_3_2<=p3_0_0)
states: 662,889 (5)
abstracting: (p1_3_2<=p3_0_0)
states: 662,889 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Anderson-PT-05-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.092sec

checking: AG [EG [[EG [A [next_0<=1 U 1<=cs_4_1]] | [EF [[ncs_4_3<=p3_0_1 | 1<=p2_0_1]] & E [1<=p2_1_0 U ncs_2_1<=p1_1_3]]]]]
normalized: ~ [E [true U ~ [EG [[[E [1<=p2_1_0 U ncs_2_1<=p1_1_3] & E [true U [ncs_4_3<=p3_0_1 | 1<=p2_0_1]]] | EG [[~ [EG [~ [1<=cs_4_1]]] & ~ [E [~ [1<=cs_4_1] U [~ [next_0<=1] & ~ [1<=cs_4_1]]]]]]]]]]]

abstracting: (1<=cs_4_1)
states: 5,945 (3)
abstracting: (next_0<=1)
states: 689,901 (5)
abstracting: (1<=cs_4_1)
states: 5,945 (3)
abstracting: (1<=cs_4_1)
states: 5,945 (3)
............................
EG iterations: 28
.............................
EG iterations: 29
abstracting: (1<=p2_0_1)
states: 31,449 (4)
abstracting: (ncs_4_3<=p3_0_1)
states: 642,017 (5)
abstracting: (ncs_2_1<=p1_1_3)
states: 641,267 (5)
abstracting: (1<=p2_1_0)
states: 30,545 (4)
........................
EG iterations: 24
-> the formula is FALSE

FORMULA Anderson-PT-05-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m51.772sec

checking: AG [[AF [EX [[[ncs_2_3<=1 & p1_0_3<=0] | p1_2_3<=1]]] | EX [E [cs_4_0<=1 U [[p1_3_8<=cs_4_0 & p3_1_4<=ncs_0_1] & AX [next_4<=1]]]]]]
normalized: ~ [E [true U ~ [[EX [E [cs_4_0<=1 U [~ [EX [~ [next_4<=1]]] & [p1_3_8<=cs_4_0 & p3_1_4<=ncs_0_1]]]] | ~ [EG [~ [EX [[p1_2_3<=1 | [ncs_2_3<=1 & p1_0_3<=0]]]]]]]]]]

abstracting: (p1_0_3<=0)
states: 658,784 (5)
abstracting: (ncs_2_3<=1)
states: 689,901 (5)
abstracting: (p1_2_3<=1)
states: 689,901 (5)
..
EG iterations: 1
abstracting: (p3_1_4<=ncs_0_1)
states: 682,534 (5)
abstracting: (p1_3_8<=cs_4_0)
states: 680,109 (5)
abstracting: (next_4<=1)
states: 689,901 (5)
.abstracting: (cs_4_0<=1)
states: 689,901 (5)
.-> the formula is TRUE

FORMULA Anderson-PT-05-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.112sec

checking: AF [[[[[[EG [1<=ncs_3_1] & ~ [cs_3_3<=0]] & p3_1_0<=p1_4_3] | AF [~ [[slot_F_F_T_F_F<=p1_1_2 & p1_1_6<=p1_1_6]]]] & ~ [EG [~ [p1_1_1<=0]]]] & 1<=p2_3_1]]
normalized: ~ [EG [~ [[1<=p2_3_1 & [~ [EG [~ [p1_1_1<=0]]] & [~ [EG [[slot_F_F_T_F_F<=p1_1_2 & p1_1_6<=p1_1_6]]] | [p3_1_0<=p1_4_3 & [~ [cs_3_3<=0] & EG [1<=ncs_3_1]]]]]]]]]

abstracting: (1<=ncs_3_1)
states: 50,661 (4)
.
EG iterations: 1
abstracting: (cs_3_3<=0)
states: 684,664 (5)
abstracting: (p3_1_0<=p1_4_3)
states: 683,376 (5)
abstracting: (p1_1_6<=p1_1_6)
states: 689,901 (5)
abstracting: (slot_F_F_T_F_F<=p1_1_2)
states: 594,406 (5)
................................
EG iterations: 32
abstracting: (p1_1_1<=0)
states: 667,596 (5)
.........................
EG iterations: 25
abstracting: (1<=p2_3_1)
states: 31,449 (4)
..........................
EG iterations: 26
-> the formula is FALSE

FORMULA Anderson-PT-05-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.992sec

checking: ~ [AG [~ [[[AG [~ [cs_2_1<=p1_3_4]] & E [~ [cs_0_3<=p2_0_3] U [cs_0_2<=0 | cs_0_3<=ncs_3_1]]] & [1<=p1_0_6 | AG [[1<=cs_3_3 & next_2<=ncs_1_0]]]]]]]
normalized: E [true U [[1<=p1_0_6 | ~ [E [true U ~ [[1<=cs_3_3 & next_2<=ncs_1_0]]]]] & [E [~ [cs_0_3<=p2_0_3] U [cs_0_2<=0 | cs_0_3<=ncs_3_1]] & ~ [E [true U cs_2_1<=p1_3_4]]]]]

abstracting: (cs_2_1<=p1_3_4)
states: 684,256 (5)
abstracting: (cs_0_3<=ncs_3_1)
states: 685,161 (5)
abstracting: (cs_0_2<=0)
states: 684,484 (5)
abstracting: (cs_0_3<=p2_0_3)
states: 684,664 (5)
abstracting: (next_2<=ncs_1_0)
states: 581,855 (5)
abstracting: (1<=cs_3_3)
states: 5,237 (3)
abstracting: (1<=p1_0_6)
states: 24,946 (4)
-> the formula is FALSE

FORMULA Anderson-PT-05-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.132sec

checking: EG [~ [[[[[AF [1<=p1_3_8] & EX [ncs_4_4<=ncs_1_0]] & AG [next_9<=p1_3_6]] & EG [[1<=p3_1_1 | slot_F_F_F_T_F<=p2_0_0]]] & [EG [[ncs_4_1<=ncs_2_2 | p1_1_1<=1]] | ~ [AG [cs_3_4<=0]]]]]]
normalized: EG [~ [[[E [true U ~ [cs_3_4<=0]] | EG [[ncs_4_1<=ncs_2_2 | p1_1_1<=1]]] & [EG [[1<=p3_1_1 | slot_F_F_F_T_F<=p2_0_0]] & [~ [E [true U ~ [next_9<=p1_3_6]]] & [EX [ncs_4_4<=ncs_1_0] & ~ [EG [~ [1<=p1_3_8]]]]]]]]]

abstracting: (1<=p1_3_8)
states: 9,864 (3)
.
EG iterations: 1
abstracting: (ncs_4_4<=ncs_1_0)
states: 640,004 (5)
.abstracting: (next_9<=p1_3_6)
states: 688,173 (5)

before gc: list nodes free: 235946

after gc: idd nodes used:471277, unused:63528723; list nodes free:291531198
abstracting: (slot_F_F_F_T_F<=p2_0_0)
states: 600,965 (5)
abstracting: (1<=p3_1_1)
states: 5,945 (3)
..........................
EG iterations: 26
abstracting: (p1_1_1<=1)
states: 689,901 (5)
abstracting: (ncs_4_1<=ncs_2_2)
states: 643,390 (5)

EG iterations: 0
abstracting: (cs_3_4<=0)
states: 681,824 (5)

EG iterations: 0
-> the formula is TRUE

FORMULA Anderson-PT-05-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m29.890sec

checking: AG [EF [[[EX [[p1_2_8<=cs_3_3 | 1<=ncs_2_4]] | [~ [1<=p3_2_4] & [~ [1<=ncs_3_2] | next_9<=1]]] & [EF [A [ncs_1_3<=cs_2_1 U 1<=p3_2_2]] & [~ [[p2_3_2<=p1_4_7 & 1<=cs_0_1]] | p3_1_3<=0]]]]]
normalized: ~ [E [true U ~ [E [true U [[[p3_1_3<=0 | ~ [[p2_3_2<=p1_4_7 & 1<=cs_0_1]]] & E [true U [~ [EG [~ [1<=p3_2_2]]] & ~ [E [~ [1<=p3_2_2] U [~ [ncs_1_3<=cs_2_1] & ~ [1<=p3_2_2]]]]]]] & [[[next_9<=1 | ~ [1<=ncs_3_2]] & ~ [1<=p3_2_4]] | EX [[p1_2_8<=cs_3_3 | 1<=ncs_2_4]]]]]]]]

abstracting: (1<=ncs_2_4)
states: 54,689 (4)
abstracting: (p1_2_8<=cs_3_3)
states: 680,037 (5)
.abstracting: (1<=p3_2_4)
states: 8,077 (3)
abstracting: (1<=ncs_3_2)
states: 49,197 (4)
abstracting: (next_9<=1)
states: 689,901 (5)
abstracting: (1<=p3_2_2)
states: 5,417 (3)
abstracting: (ncs_1_3<=cs_2_1)
states: 642,017 (5)
abstracting: (1<=p3_2_2)
states: 5,417 (3)
abstracting: (1<=p3_2_2)
states: 5,417 (3)
...........................
EG iterations: 27
abstracting: (1<=cs_0_1)
states: 5,945 (3)
abstracting: (p2_3_2<=p1_4_7)
states: 658,620 (5)
abstracting: (p3_1_3<=0)
states: 684,664 (5)
-> the formula is TRUE

FORMULA Anderson-PT-05-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m53.924sec

checking: EX [AG [[A [[[p2_3_2<=p1_2_8 & cs_1_3<=1] | p3_0_3<=0] U EG [ncs_2_4<=1]] | [1<=p1_4_7 | E [[p2_4_0<=p3_2_3 | p3_2_3<=p3_0_1] U [ncs_1_4<=p1_3_3 & 1<=p2_2_4]]]]]]
normalized: EX [~ [E [true U ~ [[[1<=p1_4_7 | E [[p2_4_0<=p3_2_3 | p3_2_3<=p3_0_1] U [ncs_1_4<=p1_3_3 & 1<=p2_2_4]]] | [~ [EG [~ [EG [ncs_2_4<=1]]]] & ~ [E [~ [EG [ncs_2_4<=1]] U [~ [[p3_0_3<=0 | [p2_3_2<=p1_2_8 & cs_1_3<=1]]] & ~ [EG [ncs_2_4<=1]]]]]]]]]]]

abstracting: (ncs_2_4<=1)
states: 689,901 (5)

EG iterations: 0
abstracting: (cs_1_3<=1)
states: 689,901 (5)
abstracting: (p2_3_2<=p1_2_8)
states: 659,376 (5)
abstracting: (p3_0_3<=0)
states: 684,664 (5)
abstracting: (ncs_2_4<=1)
states: 689,901 (5)

EG iterations: 0
abstracting: (ncs_2_4<=1)
states: 689,901 (5)

EG iterations: 0
.
EG iterations: 1
abstracting: (1<=p2_2_4)
states: 40,005 (4)
abstracting: (ncs_1_4<=p1_3_3)
states: 637,311 (5)
abstracting: (p3_2_3<=p3_0_1)
states: 684,664 (5)
abstracting: (p2_4_0<=p3_2_3)
states: 659,728 (5)
abstracting: (1<=p1_4_7)
states: 17,988 (4)
.-> the formula is TRUE

FORMULA Anderson-PT-05-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m25.547sec

checking: E [EX [[EX [[~ [p1_1_3<=p1_3_3] & AF [p2_4_2<=p3_0_4]]] | [cs_1_2<=1 | EG [~ [p2_1_1<=ncs_0_2]]]]] U E [[[~ [AF [1<=p2_4_4]] | 1<=p1_0_7] & 1<=p2_4_0] U AX [[[[p1_4_7<=1 | p1_4_5<=cs_3_4] & AG [1<=p1_2_4]] & slot_T_F_F_F_F<=slot_F_F_F_T_F]]]]
normalized: E [EX [[[cs_1_2<=1 | EG [~ [p2_1_1<=ncs_0_2]]] | EX [[~ [EG [~ [p2_4_2<=p3_0_4]]] & ~ [p1_1_3<=p1_3_3]]]]] U E [[1<=p2_4_0 & [1<=p1_0_7 | EG [~ [1<=p2_4_4]]]] U ~ [EX [~ [[slot_T_F_F_F_F<=slot_F_F_F_T_F & [~ [E [true U ~ [1<=p1_2_4]]] & [p1_4_7<=1 | p1_4_5<=cs_3_4]]]]]]]]

abstracting: (p1_4_5<=cs_3_4)
states: 660,322 (5)
abstracting: (p1_4_7<=1)
states: 689,901 (5)
abstracting: (1<=p1_2_4)
states: 27,313 (4)
abstracting: (slot_T_F_F_F_F<=slot_F_F_F_T_F)
states: 565,319 (5)
.abstracting: (1<=p2_4_4)
states: 40,005 (4)
..........................
EG iterations: 26
abstracting: (1<=p1_0_7)
states: 17,988 (4)
abstracting: (1<=p2_4_0)
states: 30,545 (4)
abstracting: (p1_1_3<=p1_3_3)
states: 658,784 (5)
abstracting: (p2_4_2<=p3_0_4)
states: 658,980 (5)
..........................
EG iterations: 26
.abstracting: (p2_1_1<=ncs_0_2)
states: 660,464 (5)
..........................
EG iterations: 26
abstracting: (cs_1_2<=1)
states: 689,901 (5)
.-> the formula is FALSE

FORMULA Anderson-PT-05-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.498sec

totally nodes used: 122623279 (1.2e+08)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 436318221 1312577167 1748895388
used/not used/entry size/cache size: 66988252 120612 16 1024MB
basic ops cache: hits/miss/sum: 48082374 104451099 152533473
used/not used/entry size/cache size: 16734623 42593 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: 183640 762604 946244
used/not used/entry size/cache size: 287818 8100790 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 28313588
1 23909648
2 10646439
3 3278498
4 780494
5 151139
6 25082
7 3498
8 425
9 43
>= 10 10

Total processing time: 8m10.155sec


BK_STOP 1679873962553

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

check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec

72018 85209 85910 90069 97548 103176 98546 87712 92509 97784 103981 104284 100856 100448 100199
iterations count:1524211 (4175), effective:15193 (41)

initing FirstDep: 0m 0.001sec


iterations count:406 (1), effective:1 (0)
87818
iterations count:173476 (475), effective:1179 (3)

iterations count:3260 (8), effective:33 (0)

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

iterations count:4452 (12), effective:36 (0)
100474
iterations count:172278 (471), effective:1176 (3)
93975
iterations count:130492 (357), effective:992 (2)

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

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

iterations count:5228 (14), effective:58 (0)

iterations count:1990 (5), effective:13 (0)
99204
iterations count:166812 (457), effective:1232 (3)

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

iterations count:6152 (16), effective:181 (0)

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

iterations count:3362 (9), effective:43 (0)
2930 2943 2996 2938 3360 3661 76878
iterations count:789975 (2164), effective:7955 (21)
85008
iterations count:191909 (525), effective:1324 (3)
92072
iterations count:186232 (510), effective:1253 (3)
106239
iterations count:139626 (382), effective:1072 (2)

iterations count:365 (1), effective:0 (0)
105976
iterations count:125686 (344), effective:1097 (3)

iterations count:1135 (3), effective:5 (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="Anderson-PT-05"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marcie"
echo " Input is Anderson-PT-05, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r513-tall-167987240400009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-05.tgz
mv Anderson-PT-05 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;