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.r129-smll-167819403200009.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 Dekker-PT-015, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r129-smll-167819403200009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.8K Feb 26 01:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 01:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 01:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 01:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 01:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 141K 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 Dekker-PT-015-CTLCardinality-00
FORMULA_NAME Dekker-PT-015-CTLCardinality-01
FORMULA_NAME Dekker-PT-015-CTLCardinality-02
FORMULA_NAME Dekker-PT-015-CTLCardinality-03
FORMULA_NAME Dekker-PT-015-CTLCardinality-04
FORMULA_NAME Dekker-PT-015-CTLCardinality-05
FORMULA_NAME Dekker-PT-015-CTLCardinality-06
FORMULA_NAME Dekker-PT-015-CTLCardinality-07
FORMULA_NAME Dekker-PT-015-CTLCardinality-08
FORMULA_NAME Dekker-PT-015-CTLCardinality-09
FORMULA_NAME Dekker-PT-015-CTLCardinality-10
FORMULA_NAME Dekker-PT-015-CTLCardinality-11
FORMULA_NAME Dekker-PT-015-CTLCardinality-12
FORMULA_NAME Dekker-PT-015-CTLCardinality-13
FORMULA_NAME Dekker-PT-015-CTLCardinality-14
FORMULA_NAME Dekker-PT-015-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678256688529

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=Dekker-PT-015
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: Dekker_PT_015
(NrP: 75 NrTr: 255 NrArc: 1830)

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

net check time: 0m 0.000sec

init dd package: 0m 3.502sec


RS generation: 0m 0.158sec


-> reachability set: #nodes 2175 (2.2e+03) #states 278,528 (5)



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

checking: EX [AF [flag_0_6<=0]]
normalized: EX [~ [EG [~ [flag_0_6<=0]]]]

abstracting: (flag_0_6<=0)
states: 147,456 (5)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.424sec

checking: EG [1<=flag_0_2]
normalized: EG [1<=flag_0_2]

abstracting: (1<=flag_0_2)
states: 131,072 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.160sec

checking: EG [EF [AF [EG [p1_7<=flag_1_1]]]]
normalized: EG [E [true U ~ [EG [~ [EG [p1_7<=flag_1_1]]]]]]

abstracting: (p1_7<=flag_1_1)
states: 217,088 (5)
.
EG iterations: 1
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.440sec

checking: E [[1<=p1_10 & 1<=flag_1_1] U p3_5<=1]
normalized: E [[1<=p1_10 & 1<=flag_1_1] U p3_5<=1]

abstracting: (p3_5<=1)
states: 278,528 (5)
abstracting: (1<=flag_1_1)
states: 147,456 (5)
abstracting: (1<=p1_10)
states: 131,072 (5)
-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: [EF [AG [1<=flag_1_12]] & A [EX [[~ [p3_14<=0] | 1<=flag_1_12]] U p0_13<=p0_3]]
normalized: [[~ [EG [~ [p0_13<=p0_3]]] & ~ [E [~ [p0_13<=p0_3] U [~ [EX [[1<=flag_1_12 | ~ [p3_14<=0]]]] & ~ [p0_13<=p0_3]]]]] & E [true U ~ [E [true U ~ [1<=flag_1_12]]]]]

abstracting: (1<=flag_1_12)
states: 147,456 (5)
abstracting: (p0_13<=p0_3)
states: 208,896 (5)
abstracting: (p3_14<=0)
states: 262,144 (5)
abstracting: (1<=flag_1_12)
states: 147,456 (5)
.abstracting: (p0_13<=p0_3)
states: 208,896 (5)
abstracting: (p0_13<=p0_3)
states: 208,896 (5)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.100sec

checking: [~ [AG [p0_13<=p1_7]] & EF [[EG [~ [[EX [1<=p3_0] | EF [1<=flag_1_9]]]] & [p3_11<=0 | EF [~ [p0_2<=0]]]]]]
normalized: [E [true U [[p3_11<=0 | E [true U ~ [p0_2<=0]]] & EG [~ [[E [true U 1<=flag_1_9] | EX [1<=p3_0]]]]]] & E [true U ~ [p0_13<=p1_7]]]

abstracting: (p0_13<=p1_7)
states: 208,896 (5)
abstracting: (1<=p3_0)
states: 16,384 (4)
.abstracting: (1<=flag_1_9)
states: 147,456 (5)
.
EG iterations: 1
abstracting: (p0_2<=0)
states: 147,456 (5)
abstracting: (p3_11<=0)
states: 262,144 (5)
-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.114sec

checking: ~ [[EF [AF [A [~ [flag_0_0<=p1_13] U [p3_14<=0 & flag_1_0<=flag_0_12]]]] | ~ [EG [1<=flag_0_13]]]]
normalized: ~ [[~ [EG [1<=flag_0_13]] | E [true U ~ [EG [~ [[~ [EG [~ [[p3_14<=0 & flag_1_0<=flag_0_12]]]] & ~ [E [~ [[p3_14<=0 & flag_1_0<=flag_0_12]] U [flag_0_0<=p1_13 & ~ [[p3_14<=0 & flag_1_0<=flag_0_12]]]]]]]]]]]]

abstracting: (flag_1_0<=flag_0_12)
states: 200,704 (5)
abstracting: (p3_14<=0)
states: 262,144 (5)
abstracting: (flag_0_0<=p1_13)
states: 208,896 (5)
abstracting: (flag_1_0<=flag_0_12)
states: 200,704 (5)
abstracting: (p3_14<=0)
states: 262,144 (5)
abstracting: (flag_1_0<=flag_0_12)
states: 200,704 (5)
abstracting: (p3_14<=0)
states: 262,144 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=flag_0_13)
states: 131,072 (5)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.234sec

checking: EX [AX [[[[[~ [flag_1_0<=p3_8] & EF [p0_11<=0]] & [[p3_4<=1 & flag_1_11<=0] & AG [1<=flag_0_3]]] | EF [EF [1<=p3_13]]] & ~ [p0_7<=0]]]]
normalized: EX [~ [EX [~ [[~ [p0_7<=0] & [E [true U E [true U 1<=p3_13]] | [[~ [E [true U ~ [1<=flag_0_3]]] & [p3_4<=1 & flag_1_11<=0]] & [E [true U p0_11<=0] & ~ [flag_1_0<=p3_8]]]]]]]]]

abstracting: (flag_1_0<=p3_8)
states: 139,264 (5)
abstracting: (p0_11<=0)
states: 147,456 (5)
abstracting: (flag_1_11<=0)
states: 131,072 (5)
abstracting: (p3_4<=1)
states: 278,528 (5)
abstracting: (1<=flag_0_3)
states: 131,072 (5)
abstracting: (1<=p3_13)
states: 16,384 (4)
abstracting: (p0_7<=0)
states: 147,456 (5)
..-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.233sec

checking: ~ [A [AG [[E [~ [p3_11<=flag_0_12] U [p3_2<=0 | 1<=p1_8]] & [[p0_1<=flag_0_4 & AG [1<=flag_1_2]] | ~ [p1_7<=1]]]] U ~ [EF [AF [p1_4<=0]]]]]
normalized: ~ [[~ [EG [E [true U ~ [EG [~ [p1_4<=0]]]]]] & ~ [E [E [true U ~ [EG [~ [p1_4<=0]]]] U [E [true U ~ [[[~ [p1_7<=1] | [p0_1<=flag_0_4 & ~ [E [true U ~ [1<=flag_1_2]]]]] & E [~ [p3_11<=flag_0_12] U [p3_2<=0 | 1<=p1_8]]]]] & E [true U ~ [EG [~ [p1_4<=0]]]]]]]]]

abstracting: (p1_4<=0)
states: 147,456 (5)
.
EG iterations: 1
abstracting: (1<=p1_8)
states: 131,072 (5)
abstracting: (p3_2<=0)
states: 262,144 (5)
abstracting: (p3_11<=flag_0_12)
states: 270,336 (5)
abstracting: (1<=flag_1_2)
states: 147,456 (5)
abstracting: (p0_1<=flag_0_4)
states: 208,896 (5)
abstracting: (p1_7<=1)
states: 278,528 (5)
abstracting: (p1_4<=0)
states: 147,456 (5)
.
EG iterations: 1
abstracting: (p1_4<=0)
states: 147,456 (5)
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.241sec

checking: EX [AG [[A [[p0_5<=flag_1_10 & [1<=p1_10 | p0_9<=flag_1_14]] U flag_0_7<=0] | ~ [A [[p3_2<=p0_12 & p0_1<=1] U p0_8<=0]]]]]
normalized: EX [~ [E [true U ~ [[~ [[~ [EG [~ [p0_8<=0]]] & ~ [E [~ [p0_8<=0] U [~ [[p3_2<=p0_12 & p0_1<=1]] & ~ [p0_8<=0]]]]]] | [~ [EG [~ [flag_0_7<=0]]] & ~ [E [~ [flag_0_7<=0] U [~ [[p0_5<=flag_1_10 & [1<=p1_10 | p0_9<=flag_1_14]]] & ~ [flag_0_7<=0]]]]]]]]]]

abstracting: (flag_0_7<=0)
states: 147,456 (5)
abstracting: (p0_9<=flag_1_14)
states: 217,088 (5)
abstracting: (1<=p1_10)
states: 131,072 (5)
abstracting: (p0_5<=flag_1_10)
states: 217,088 (5)
abstracting: (flag_0_7<=0)
states: 147,456 (5)
abstracting: (flag_0_7<=0)
states: 147,456 (5)
.
EG iterations: 1
abstracting: (p0_8<=0)
states: 147,456 (5)
abstracting: (p0_1<=1)
states: 278,528 (5)
abstracting: (p3_2<=p0_12)
states: 270,336 (5)
abstracting: (p0_8<=0)
states: 147,456 (5)
abstracting: (p0_8<=0)
states: 147,456 (5)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.530sec

checking: A [~ [EG [[[AX [1<=p3_1] & [[p1_4<=1 | 1<=flag_1_1] | AF [p3_5<=1]]] | [AF [flag_0_8<=p1_13] & EG [1<=flag_0_13]]]]] U AG [E [EF [[1<=flag_0_4 & p0_6<=0]] U A [~ [1<=flag_1_8] U AX [p3_13<=flag_0_1]]]]]
normalized: [~ [EG [E [true U ~ [E [E [true U [1<=flag_0_4 & p0_6<=0]] U [~ [EG [EX [~ [p3_13<=flag_0_1]]]] & ~ [E [EX [~ [p3_13<=flag_0_1]] U [1<=flag_1_8 & EX [~ [p3_13<=flag_0_1]]]]]]]]]]] & ~ [E [E [true U ~ [E [E [true U [1<=flag_0_4 & p0_6<=0]] U [~ [EG [EX [~ [p3_13<=flag_0_1]]]] & ~ [E [EX [~ [p3_13<=flag_0_1]] U [1<=flag_1_8 & EX [~ [p3_13<=flag_0_1]]]]]]]]] U [EG [[[EG [1<=flag_0_13] & ~ [EG [~ [flag_0_8<=p1_13]]]] | [[~ [EG [~ [p3_5<=1]]] | [p1_4<=1 | 1<=flag_1_1]] & ~ [EX [~ [1<=p3_1]]]]]] & E [true U ~ [E [E [true U [1<=flag_0_4 & p0_6<=0]] U [~ [EG [EX [~ [p3_13<=flag_0_1]]]] & ~ [E [EX [~ [p3_13<=flag_0_1]] U [1<=flag_1_8 & EX [~ [p3_13<=flag_0_1]]]]]]]]]]]]]

abstracting: (p3_13<=flag_0_1)
states: 270,336 (5)
.abstracting: (1<=flag_1_8)
states: 147,456 (5)
abstracting: (p3_13<=flag_0_1)
states: 270,336 (5)
.abstracting: (p3_13<=flag_0_1)
states: 270,336 (5)
..
EG iterations: 1
abstracting: (p0_6<=0)
states: 147,456 (5)
abstracting: (1<=flag_0_4)
states: 131,072 (5)
abstracting: (1<=p3_1)
states: 16,384 (4)
.abstracting: (1<=flag_1_1)
states: 147,456 (5)
abstracting: (p1_4<=1)
states: 278,528 (5)
abstracting: (p3_5<=1)
states: 278,528 (5)
.
EG iterations: 1
abstracting: (flag_0_8<=p1_13)
states: 208,896 (5)
.
EG iterations: 1
abstracting: (1<=flag_0_13)
states: 131,072 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p3_13<=flag_0_1)
states: 270,336 (5)
.abstracting: (1<=flag_1_8)
states: 147,456 (5)
abstracting: (p3_13<=flag_0_1)
states: 270,336 (5)
.abstracting: (p3_13<=flag_0_1)
states: 270,336 (5)
..
EG iterations: 1
abstracting: (p0_6<=0)
states: 147,456 (5)
abstracting: (1<=flag_0_4)
states: 131,072 (5)
abstracting: (p3_13<=flag_0_1)
states: 270,336 (5)
.abstracting: (1<=flag_1_8)
states: 147,456 (5)
abstracting: (p3_13<=flag_0_1)
states: 270,336 (5)
.abstracting: (p3_13<=flag_0_1)
states: 270,336 (5)
..
EG iterations: 1
abstracting: (p0_6<=0)
states: 147,456 (5)
abstracting: (1<=flag_0_4)
states: 131,072 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.222sec

checking: E [E [EF [[E [flag_0_14<=p0_4 U flag_0_13<=1] & flag_1_10<=flag_0_12]] U ~ [A [~ [EX [p1_10<=1]] U [~ [1<=flag_0_3] | AG [p3_11<=0]]]]] U ~ [[[~ [AF [EX [1<=flag_1_7]]] & [~ [AF [1<=p3_11]] & EF [EG [1<=p1_6]]]] | AF [[A [flag_0_11<=p0_5 U 1<=p0_0] | flag_1_12<=p1_12]]]]]
normalized: E [E [E [true U [flag_1_10<=flag_0_12 & E [flag_0_14<=p0_4 U flag_0_13<=1]]] U ~ [[~ [EG [~ [[~ [E [true U ~ [p3_11<=0]]] | ~ [1<=flag_0_3]]]]] & ~ [E [~ [[~ [E [true U ~ [p3_11<=0]]] | ~ [1<=flag_0_3]]] U [EX [p1_10<=1] & ~ [[~ [E [true U ~ [p3_11<=0]]] | ~ [1<=flag_0_3]]]]]]]]] U ~ [[~ [EG [~ [[flag_1_12<=p1_12 | [~ [EG [~ [1<=p0_0]]] & ~ [E [~ [1<=p0_0] U [~ [flag_0_11<=p0_5] & ~ [1<=p0_0]]]]]]]]] | [[E [true U EG [1<=p1_6]] & EG [~ [1<=p3_11]]] & EG [~ [EX [1<=flag_1_7]]]]]]]

abstracting: (1<=flag_1_7)
states: 147,456 (5)
..
EG iterations: 1
abstracting: (1<=p3_11)
states: 16,384 (4)
.
EG iterations: 1
abstracting: (1<=p1_6)
states: 131,072 (5)
.
EG iterations: 1
abstracting: (1<=p0_0)
states: 131,072 (5)
abstracting: (flag_0_11<=p0_5)
states: 208,896 (5)
abstracting: (1<=p0_0)
states: 131,072 (5)
abstracting: (1<=p0_0)
states: 131,072 (5)
.
EG iterations: 1
abstracting: (flag_1_12<=p1_12)
states: 262,144 (5)
.
EG iterations: 1
abstracting: (1<=flag_0_3)
states: 131,072 (5)
abstracting: (p3_11<=0)
states: 262,144 (5)
abstracting: (p1_10<=1)
states: 278,528 (5)
.abstracting: (1<=flag_0_3)
states: 131,072 (5)
abstracting: (p3_11<=0)
states: 262,144 (5)
abstracting: (1<=flag_0_3)
states: 131,072 (5)
abstracting: (p3_11<=0)
states: 262,144 (5)
.
EG iterations: 1
abstracting: (flag_0_13<=1)
states: 278,528 (5)
abstracting: (flag_0_14<=p0_4)
states: 208,896 (5)
abstracting: (flag_1_10<=flag_0_12)
states: 200,704 (5)
-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.748sec

checking: ~ [[[A [EF [[flag_1_9<=p3_9 & ~ [p3_8<=p1_14]]] U EX [~ [flag_1_8<=1]]] | [EF [EG [AG [p1_12<=p0_14]]] | AX [p1_14<=0]]] & [EG [E [[[p3_1<=p3_7 & flag_0_0<=flag_0_8] | [p1_11<=flag_0_8 & flag_0_1<=p1_5]] U [1<=flag_1_2 | p0_6<=flag_0_1]]] | AG [~ [[EF [1<=p0_8] & AX [1<=flag_0_9]]]]]]]
normalized: ~ [[[~ [E [true U [~ [EX [~ [1<=flag_0_9]]] & E [true U 1<=p0_8]]]] | EG [E [[[p1_11<=flag_0_8 & flag_0_1<=p1_5] | [p3_1<=p3_7 & flag_0_0<=flag_0_8]] U [1<=flag_1_2 | p0_6<=flag_0_1]]]] & [[~ [EX [~ [p1_14<=0]]] | E [true U EG [~ [E [true U ~ [p1_12<=p0_14]]]]]] | [~ [EG [~ [EX [~ [flag_1_8<=1]]]]] & ~ [E [~ [EX [~ [flag_1_8<=1]]] U [~ [E [true U [flag_1_9<=p3_9 & ~ [p3_8<=p1_14]]]] & ~ [EX [~ [flag_1_8<=1]]]]]]]]]]

abstracting: (flag_1_8<=1)
states: 278,528 (5)
.abstracting: (p3_8<=p1_14)
states: 270,336 (5)
abstracting: (flag_1_9<=p3_9)
states: 147,456 (5)
abstracting: (flag_1_8<=1)
states: 278,528 (5)
.abstracting: (flag_1_8<=1)
states: 278,528 (5)
.
EG iterations: 0
abstracting: (p1_12<=p0_14)
states: 208,896 (5)
.
EG iterations: 1
abstracting: (p1_14<=0)
states: 147,456 (5)
.abstracting: (p0_6<=flag_0_1)
states: 208,896 (5)
abstracting: (1<=flag_1_2)
states: 147,456 (5)
abstracting: (flag_0_0<=flag_0_8)
states: 208,896 (5)
abstracting: (p3_1<=p3_7)
states: 262,144 (5)
abstracting: (flag_0_1<=p1_5)
states: 208,896 (5)
abstracting: (p1_11<=flag_0_8)
states: 208,896 (5)
.
EG iterations: 1
abstracting: (1<=p0_8)
states: 131,072 (5)
abstracting: (1<=flag_0_9)
states: 131,072 (5)
.-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.402sec

checking: ~ [E [[[AG [1<=p3_0] | ~ [[[flag_1_3<=flag_1_8 | 1<=p3_13] & [1<=p0_1 | flag_0_14<=1]]]] & AF [[[[p1_6<=p1_7 | p3_3<=0] | ~ [p1_11<=1]] | [AG [p3_2<=0] & 1<=flag_0_1]]]] U ~ [A [[[EF [1<=p0_3] & [p0_7<=flag_0_14 | p1_13<=0]] & [AF [1<=p0_13] & flag_0_13<=flag_0_3]] U [~ [1<=flag_1_4] | [p0_3<=1 & ~ [p1_13<=flag_0_14]]]]]]]
normalized: ~ [E [[~ [EG [~ [[[1<=flag_0_1 & ~ [E [true U ~ [p3_2<=0]]]] | [~ [p1_11<=1] | [p1_6<=p1_7 | p3_3<=0]]]]]] & [~ [[[1<=p0_1 | flag_0_14<=1] & [flag_1_3<=flag_1_8 | 1<=p3_13]]] | ~ [E [true U ~ [1<=p3_0]]]]] U ~ [[~ [EG [~ [[[p0_3<=1 & ~ [p1_13<=flag_0_14]] | ~ [1<=flag_1_4]]]]] & ~ [E [~ [[[p0_3<=1 & ~ [p1_13<=flag_0_14]] | ~ [1<=flag_1_4]]] U [~ [[[flag_0_13<=flag_0_3 & ~ [EG [~ [1<=p0_13]]]] & [[p0_7<=flag_0_14 | p1_13<=0] & E [true U 1<=p0_3]]]] & ~ [[[p0_3<=1 & ~ [p1_13<=flag_0_14]] | ~ [1<=flag_1_4]]]]]]]]]]

abstracting: (1<=flag_1_4)
states: 147,456 (5)
abstracting: (p1_13<=flag_0_14)
states: 208,896 (5)
abstracting: (p0_3<=1)
states: 278,528 (5)
abstracting: (1<=p0_3)
states: 131,072 (5)
abstracting: (p1_13<=0)
states: 147,456 (5)
abstracting: (p0_7<=flag_0_14)
states: 208,896 (5)
abstracting: (1<=p0_13)
states: 131,072 (5)
.
EG iterations: 1
abstracting: (flag_0_13<=flag_0_3)
states: 208,896 (5)
abstracting: (1<=flag_1_4)
states: 147,456 (5)
abstracting: (p1_13<=flag_0_14)
states: 208,896 (5)
abstracting: (p0_3<=1)
states: 278,528 (5)
abstracting: (1<=flag_1_4)
states: 147,456 (5)
abstracting: (p1_13<=flag_0_14)
states: 208,896 (5)
abstracting: (p0_3<=1)
states: 278,528 (5)
.
EG iterations: 1
abstracting: (1<=p3_0)
states: 16,384 (4)
abstracting: (1<=p3_13)
states: 16,384 (4)
abstracting: (flag_1_3<=flag_1_8)
states: 208,896 (5)
abstracting: (flag_0_14<=1)
states: 278,528 (5)
abstracting: (1<=p0_1)
states: 131,072 (5)
abstracting: (p3_3<=0)
states: 262,144 (5)
abstracting: (p1_6<=p1_7)
states: 208,896 (5)
abstracting: (p1_11<=1)
states: 278,528 (5)
abstracting: (p3_2<=0)
states: 262,144 (5)
abstracting: (1<=flag_0_1)
states: 131,072 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.507sec

checking: EX [[[[[[1<=p1_10 | p3_10<=p3_8] | [~ [flag_0_13<=0] & AX [flag_0_4<=1]]] | ~ [p3_7<=1]] | E [~ [p0_4<=p1_7] U 1<=flag_0_2]] & [[[~ [[[p3_13<=p0_1 & flag_1_2<=p0_9] & [1<=flag_0_13 | p1_11<=0]]] | [[p0_3<=0 | [p0_5<=flag_1_14 | 1<=p3_4]] | [EF [p1_1<=p1_14] | [flag_1_7<=p0_11 | p3_7<=0]]]] & 1<=p1_5] | 1<=flag_1_0]]]
normalized: EX [[[1<=flag_1_0 | [1<=p1_5 & [[[[flag_1_7<=p0_11 | p3_7<=0] | E [true U p1_1<=p1_14]] | [p0_3<=0 | [p0_5<=flag_1_14 | 1<=p3_4]]] | ~ [[[1<=flag_0_13 | p1_11<=0] & [p3_13<=p0_1 & flag_1_2<=p0_9]]]]]] & [E [~ [p0_4<=p1_7] U 1<=flag_0_2] | [~ [p3_7<=1] | [[~ [EX [~ [flag_0_4<=1]]] & ~ [flag_0_13<=0]] | [1<=p1_10 | p3_10<=p3_8]]]]]]

abstracting: (p3_10<=p3_8)
states: 262,144 (5)
abstracting: (1<=p1_10)
states: 131,072 (5)
abstracting: (flag_0_13<=0)
states: 147,456 (5)
abstracting: (flag_0_4<=1)
states: 278,528 (5)
.abstracting: (p3_7<=1)
states: 278,528 (5)
abstracting: (1<=flag_0_2)
states: 131,072 (5)
abstracting: (p0_4<=p1_7)
states: 208,896 (5)
abstracting: (flag_1_2<=p0_9)
states: 200,704 (5)
abstracting: (p3_13<=p0_1)
states: 270,336 (5)
abstracting: (p1_11<=0)
states: 147,456 (5)
abstracting: (1<=flag_0_13)
states: 131,072 (5)
abstracting: (1<=p3_4)
states: 16,384 (4)
abstracting: (p0_5<=flag_1_14)
states: 217,088 (5)
abstracting: (p0_3<=0)
states: 147,456 (5)
abstracting: (p1_1<=p1_14)
states: 208,896 (5)
abstracting: (p3_7<=0)
states: 262,144 (5)
abstracting: (flag_1_7<=p0_11)
states: 200,704 (5)
abstracting: (1<=p1_5)
states: 131,072 (5)
abstracting: (1<=flag_1_0)
states: 147,456 (5)
.-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.374sec

checking: [EF [~ [[[[~ [p3_9<=p1_10] | ~ [AF [1<=flag_0_1]]] & EF [EF [p0_3<=p1_6]]] & [flag_0_6<=p3_9 & EF [EF [1<=p3_13]]]]]] & ~ [[A [[[EX [1<=flag_0_12] | [1<=p0_11 & A [p0_14<=1 U 1<=p3_4]]] & [[1<=flag_1_13 & [p1_5<=1 | p1_14<=p3_8]] | A [1<=p3_12 U 1<=p0_1]]] U E [[AX [p0_14<=0] | EF [flag_1_7<=0]] U ~ [p0_0<=1]]] & EF [~ [[AX [flag_0_10<=flag_0_5] & ~ [[p1_1<=flag_0_7 | p0_0<=p0_14]]]]]]]]
normalized: [~ [[E [true U ~ [[~ [[p1_1<=flag_0_7 | p0_0<=p0_14]] & ~ [EX [~ [flag_0_10<=flag_0_5]]]]]] & [~ [EG [~ [E [[E [true U flag_1_7<=0] | ~ [EX [~ [p0_14<=0]]]] U ~ [p0_0<=1]]]]] & ~ [E [~ [E [[E [true U flag_1_7<=0] | ~ [EX [~ [p0_14<=0]]]] U ~ [p0_0<=1]]] U [~ [[[[~ [EG [~ [1<=p0_1]]] & ~ [E [~ [1<=p0_1] U [~ [1<=p3_12] & ~ [1<=p0_1]]]]] | [1<=flag_1_13 & [p1_5<=1 | p1_14<=p3_8]]] & [[1<=p0_11 & [~ [EG [~ [1<=p3_4]]] & ~ [E [~ [1<=p3_4] U [~ [p0_14<=1] & ~ [1<=p3_4]]]]]] | EX [1<=flag_0_12]]]] & ~ [E [[E [true U flag_1_7<=0] | ~ [EX [~ [p0_14<=0]]]] U ~ [p0_0<=1]]]]]]]]] & E [true U ~ [[[flag_0_6<=p3_9 & E [true U E [true U 1<=p3_13]]] & [E [true U E [true U p0_3<=p1_6]] & [EG [~ [1<=flag_0_1]] | ~ [p3_9<=p1_10]]]]]]]

abstracting: (p3_9<=p1_10)
states: 270,336 (5)
abstracting: (1<=flag_0_1)
states: 131,072 (5)
.
EG iterations: 1
abstracting: (p0_3<=p1_6)
states: 208,896 (5)
abstracting: (1<=p3_13)
states: 16,384 (4)
abstracting: (flag_0_6<=p3_9)
states: 155,648 (5)
abstracting: (p0_0<=1)
states: 278,528 (5)
abstracting: (p0_14<=0)
states: 147,456 (5)
.abstracting: (flag_1_7<=0)
states: 131,072 (5)
abstracting: (1<=flag_0_12)
states: 131,072 (5)
.abstracting: (1<=p3_4)
states: 16,384 (4)
abstracting: (p0_14<=1)
states: 278,528 (5)
abstracting: (1<=p3_4)
states: 16,384 (4)
abstracting: (1<=p3_4)
states: 16,384 (4)
.
EG iterations: 1
abstracting: (1<=p0_11)
states: 131,072 (5)
abstracting: (p1_14<=p3_8)
states: 155,648 (5)
abstracting: (p1_5<=1)
states: 278,528 (5)
abstracting: (1<=flag_1_13)
states: 147,456 (5)
abstracting: (1<=p0_1)
states: 131,072 (5)
abstracting: (1<=p3_12)
states: 16,384 (4)
abstracting: (1<=p0_1)
states: 131,072 (5)
abstracting: (1<=p0_1)
states: 131,072 (5)
.
EG iterations: 1
abstracting: (p0_0<=1)
states: 278,528 (5)
abstracting: (p0_14<=0)
states: 147,456 (5)
.abstracting: (flag_1_7<=0)
states: 131,072 (5)
abstracting: (p0_0<=1)
states: 278,528 (5)
abstracting: (p0_14<=0)
states: 147,456 (5)
.abstracting: (flag_1_7<=0)
states: 131,072 (5)

EG iterations: 0
abstracting: (flag_0_10<=flag_0_5)
states: 208,896 (5)
.abstracting: (p0_0<=p0_14)
states: 208,896 (5)
abstracting: (p1_1<=flag_0_7)
states: 208,896 (5)
-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.622sec

totally nodes used: 1340076 (1.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1694164 13167793 14861957
used/not used/entry size/cache size: 12803687 54305177 16 1024MB
basic ops cache: hits/miss/sum: 212258 1045993 1258251
used/not used/entry size/cache size: 1540311 15236905 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: 11789 76287 88076
used/not used/entry size/cache size: 75998 8312610 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 65907402
1 1081278
2 103560
3 14947
4 1557
5 112
6 7
7 1
8 0
9 0
>= 10 0

Total processing time: 0m10.827sec


BK_STOP 1678256699427

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


iterations count:4866 (19), effective:171 (0)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

iterations count:271 (1), effective:3 (0)

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

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

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

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

iterations count:4433 (17), effective:162 (0)

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

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

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

iterations count:271 (1), effective:3 (0)

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

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

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

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

iterations count:713 (2), effective:10 (0)

iterations count:2203 (8), effective:43 (0)

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:6319 (24), effective:210 (0)

iterations count:6319 (24), effective:210 (0)

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

iterations count:6319 (24), effective:210 (0)

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

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

iterations count:288 (1), effective:3 (0)

iterations count:5272 (20), effective:186 (0)

iterations count:3294 (12), effective:124 (0)

iterations count:458 (1), effective:3 (0)

iterations count:264 (1), effective:3 (0)

iterations count:385 (1), effective:3 (0)

iterations count:288 (1), effective:3 (0)

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

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

iterations count:2228 (8), effective:45 (0)

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

iterations count:271 (1), effective:3 (0)

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

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

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

iterations count:4433 (17), effective:162 (0)

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

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

iterations count:348 (1), effective:3 (0)

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

iterations count:348 (1), effective:3 (0)

iterations count:482 (1), effective:5 (0)

iterations count:348 (1), effective:3 (0)

iterations count:256 (1), effective:1 (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="Dekker-PT-015"
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 Dekker-PT-015, 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 r129-smll-167819403200009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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