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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.3K Feb 26 01:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.7K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 26 01:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 01:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 26 01:43 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 247K 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-020-CTLCardinality-00
FORMULA_NAME Dekker-PT-020-CTLCardinality-01
FORMULA_NAME Dekker-PT-020-CTLCardinality-02
FORMULA_NAME Dekker-PT-020-CTLCardinality-03
FORMULA_NAME Dekker-PT-020-CTLCardinality-04
FORMULA_NAME Dekker-PT-020-CTLCardinality-05
FORMULA_NAME Dekker-PT-020-CTLCardinality-06
FORMULA_NAME Dekker-PT-020-CTLCardinality-07
FORMULA_NAME Dekker-PT-020-CTLCardinality-08
FORMULA_NAME Dekker-PT-020-CTLCardinality-09
FORMULA_NAME Dekker-PT-020-CTLCardinality-10
FORMULA_NAME Dekker-PT-020-CTLCardinality-11
FORMULA_NAME Dekker-PT-020-CTLCardinality-12
FORMULA_NAME Dekker-PT-020-CTLCardinality-13
FORMULA_NAME Dekker-PT-020-CTLCardinality-14
FORMULA_NAME Dekker-PT-020-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678256725925

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-020
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_020
(NrP: 100 NrTr: 440 NrArc: 3240)

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

net check time: 0m 0.000sec

init dd package: 0m 3.496sec


RS generation: 0m 1.192sec


-> reachability set: #nodes 10584 (1.1e+04) #states 11,534,336 (7)



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

checking: EG [~ [[AF [p0_12<=0] | p1_4<=1]]]
normalized: EG [~ [[~ [EG [~ [p0_12<=0]]] | p1_4<=1]]]

abstracting: (p1_4<=1)
states: 11,534,336 (7)
abstracting: (p0_12<=0)
states: 6,029,312 (6)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Dekker-PT-020-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.319sec

checking: E [~ [1<=flag_0_0] U AG [AF [1<=p1_5]]]
normalized: E [~ [1<=flag_0_0] U ~ [E [true U EG [~ [1<=p1_5]]]]]

abstracting: (1<=p1_5)
states: 5,505,024 (6)
.
EG iterations: 1
abstracting: (1<=flag_0_0)
states: 5,505,024 (6)
-> the formula is FALSE

FORMULA Dekker-PT-020-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.791sec

checking: AG [~ [[~ [flag_0_18<=1] & EF [~ [[~ [1<=p1_18] & ~ [1<=p3_15]]]]]]]
normalized: ~ [E [true U [E [true U ~ [[~ [1<=p3_15] & ~ [1<=p1_18]]]] & ~ [flag_0_18<=1]]]]

abstracting: (flag_0_18<=1)
states: 11,534,336 (7)
abstracting: (1<=p1_18)
states: 5,505,024 (6)
abstracting: (1<=p3_15)
states: 524,288 (5)
-> the formula is TRUE

FORMULA Dekker-PT-020-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.134sec

checking: E [~ [1<=p1_6] U AG [[AX [[EX [flag_0_2<=0] & AF [1<=flag_1_13]]] | EF [EX [flag_1_11<=1]]]]]
normalized: E [~ [1<=p1_6] U ~ [E [true U ~ [[E [true U EX [flag_1_11<=1]] | ~ [EX [~ [[~ [EG [~ [1<=flag_1_13]]] & EX [flag_0_2<=0]]]]]]]]]]

abstracting: (flag_0_2<=0)
states: 6,029,312 (6)
.abstracting: (1<=flag_1_13)
states: 6,029,312 (6)
.
EG iterations: 1
.abstracting: (flag_1_11<=1)
states: 11,534,336 (7)
.abstracting: (1<=p1_6)
states: 5,505,024 (6)
-> the formula is TRUE

FORMULA Dekker-PT-020-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.303sec

checking: EX [~ [AX [[[1<=p1_2 & AF [p0_15<=0]] | ~ [flag_1_19<=flag_1_16]]]]]
normalized: EX [EX [~ [[~ [flag_1_19<=flag_1_16] | [1<=p1_2 & ~ [EG [~ [p0_15<=0]]]]]]]]

abstracting: (p0_15<=0)
states: 6,029,312 (6)
.
EG iterations: 1
abstracting: (1<=p1_2)
states: 5,505,024 (6)
abstracting: (flag_1_19<=flag_1_16)
states: 8,650,752 (6)
..-> the formula is TRUE

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

MC time: 0m 1.179sec

checking: EF [AX [~ [[E [flag_1_7<=0 U ~ [1<=flag_1_9]] | AG [[p3_7<=p1_16 & flag_0_19<=1]]]]]]
normalized: E [true U ~ [EX [[~ [E [true U ~ [[p3_7<=p1_16 & flag_0_19<=1]]]] | E [flag_1_7<=0 U ~ [1<=flag_1_9]]]]]]

abstracting: (1<=flag_1_9)
states: 6,029,312 (6)
abstracting: (flag_1_7<=0)
states: 5,505,024 (6)
abstracting: (flag_0_19<=1)
states: 11,534,336 (7)
abstracting: (p3_7<=p1_16)
states: 11,272,192 (7)
.-> the formula is FALSE

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

MC time: 0m 3.607sec

checking: EX [AG [[EX [AX [1<=p0_3]] | [A [~ [p3_18<=1] U ~ [1<=flag_1_7]] | EG [[1<=flag_0_15 | p1_2<=p0_17]]]]]]
normalized: EX [~ [E [true U ~ [[[[~ [EG [1<=flag_1_7]] & ~ [E [1<=flag_1_7 U [1<=flag_1_7 & p3_18<=1]]]] | EG [[1<=flag_0_15 | p1_2<=p0_17]]] | EX [~ [EX [~ [1<=p0_3]]]]]]]]]

abstracting: (1<=p0_3)
states: 5,505,024 (6)
..abstracting: (p1_2<=p0_17)
states: 8,650,752 (6)
abstracting: (1<=flag_0_15)
states: 5,505,024 (6)
.
EG iterations: 1
abstracting: (p3_18<=1)
states: 11,534,336 (7)
abstracting: (1<=flag_1_7)
states: 6,029,312 (6)
abstracting: (1<=flag_1_7)
states: 6,029,312 (6)
abstracting: (1<=flag_1_7)
states: 6,029,312 (6)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Dekker-PT-020-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.044sec

checking: EF [E [AF [[EG [1<=p1_2] & ~ [[p3_0<=0 & p1_0<=p1_10]]]] U AG [E [AF [flag_0_13<=flag_1_17] U ~ [p0_6<=0]]]]]
normalized: E [true U E [~ [EG [~ [[~ [[p3_0<=0 & p1_0<=p1_10]] & EG [1<=p1_2]]]]] U ~ [E [true U ~ [E [~ [EG [~ [flag_0_13<=flag_1_17]]] U ~ [p0_6<=0]]]]]]]

abstracting: (p0_6<=0)
states: 6,029,312 (6)
abstracting: (flag_0_13<=flag_1_17)
states: 8,912,896 (6)
.
EG iterations: 1
abstracting: (1<=p1_2)
states: 5,505,024 (6)
.
EG iterations: 1
abstracting: (p1_0<=p1_10)
states: 8,650,752 (6)
abstracting: (p3_0<=0)
states: 11,010,048 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Dekker-PT-020-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.413sec

checking: E [p0_2<=p1_2 U ~ [A [~ [AG [[p3_13<=1 | flag_0_5<=p0_10]]] U [AX [p3_16<=1] | ~ [AG [1<=flag_0_3]]]]]]
normalized: E [p0_2<=p1_2 U ~ [[~ [EG [~ [[E [true U ~ [1<=flag_0_3]] | ~ [EX [~ [p3_16<=1]]]]]]] & ~ [E [~ [[E [true U ~ [1<=flag_0_3]] | ~ [EX [~ [p3_16<=1]]]]] U [~ [E [true U ~ [[p3_13<=1 | flag_0_5<=p0_10]]]] & ~ [[E [true U ~ [1<=flag_0_3]] | ~ [EX [~ [p3_16<=1]]]]]]]]]]]

abstracting: (p3_16<=1)
states: 11,534,336 (7)
.abstracting: (1<=flag_0_3)
states: 5,505,024 (6)
abstracting: (flag_0_5<=p0_10)
states: 8,650,752 (6)
abstracting: (p3_13<=1)
states: 11,534,336 (7)
abstracting: (p3_16<=1)
states: 11,534,336 (7)
.abstracting: (1<=flag_0_3)
states: 5,505,024 (6)
abstracting: (p3_16<=1)
states: 11,534,336 (7)
.abstracting: (1<=flag_0_3)
states: 5,505,024 (6)
.
EG iterations: 1
abstracting: (p0_2<=p1_2)
states: 6,029,312 (6)
-> the formula is FALSE

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

MC time: 0m 0.183sec

checking: ~ [EG [[EF [[[AX [p0_7<=p3_6] & ~ [flag_0_1<=flag_0_2]] & EX [flag_1_17<=1]]] & E [AX [flag_0_4<=1] U ~ [AG [flag_1_4<=flag_0_0]]]]]]
normalized: ~ [EG [[E [~ [EX [~ [flag_0_4<=1]]] U E [true U ~ [flag_1_4<=flag_0_0]]] & E [true U [EX [flag_1_17<=1] & [~ [flag_0_1<=flag_0_2] & ~ [EX [~ [p0_7<=p3_6]]]]]]]]]

abstracting: (p0_7<=p3_6)
states: 6,291,456 (6)
.abstracting: (flag_0_1<=flag_0_2)
states: 8,650,752 (6)
abstracting: (flag_1_17<=1)
states: 11,534,336 (7)
.abstracting: (flag_1_4<=flag_0_0)
states: 8,388,608 (6)
abstracting: (flag_0_4<=1)
states: 11,534,336 (7)
.
EG iterations: 0
-> the formula is FALSE

FORMULA Dekker-PT-020-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.473sec

checking: E [p1_8<=p1_18 U EF [EF [[AG [p3_18<=1] | [[flag_0_16<=p0_1 | 1<=flag_0_19] & [p3_4<=p1_19 | 1<=p0_4]]]]]]
normalized: E [p1_8<=p1_18 U E [true U E [true U [[[p3_4<=p1_19 | 1<=p0_4] & [flag_0_16<=p0_1 | 1<=flag_0_19]] | ~ [E [true U ~ [p3_18<=1]]]]]]]

abstracting: (p3_18<=1)
states: 11,534,336 (7)
abstracting: (1<=flag_0_19)
states: 5,505,024 (6)
abstracting: (flag_0_16<=p0_1)
states: 8,650,752 (6)
abstracting: (1<=p0_4)
states: 5,505,024 (6)
abstracting: (p3_4<=p1_19)
states: 11,272,192 (7)
abstracting: (p1_8<=p1_18)
states: 8,650,752 (6)
-> the formula is TRUE

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

MC time: 0m 0.057sec

checking: EX [[~ [AF [EF [EG [flag_0_13<=flag_0_6]]]] | EF [[[EX [1<=flag_0_16] | p1_0<=flag_0_2] & [~ [flag_1_8<=p1_2] & [~ [flag_0_6<=1] & [1<=flag_0_12 | 1<=p3_19]]]]]]]
normalized: EX [[E [true U [[[[1<=flag_0_12 | 1<=p3_19] & ~ [flag_0_6<=1]] & ~ [flag_1_8<=p1_2]] & [p1_0<=flag_0_2 | EX [1<=flag_0_16]]]] | EG [~ [E [true U EG [flag_0_13<=flag_0_6]]]]]]

abstracting: (flag_0_13<=flag_0_6)
states: 8,650,752 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=flag_0_16)
states: 5,505,024 (6)
.abstracting: (p1_0<=flag_0_2)
states: 8,650,752 (6)
abstracting: (flag_1_8<=p1_2)
states: 8,388,608 (6)
abstracting: (flag_0_6<=1)
states: 11,534,336 (7)
abstracting: (1<=p3_19)
states: 524,288 (5)
abstracting: (1<=flag_0_12)
states: 5,505,024 (6)
.-> the formula is FALSE

FORMULA Dekker-PT-020-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.901sec

checking: [[EX [flag_1_11<=p0_6] & EG [~ [1<=p0_18]]] | EF [~ [[[[p0_8<=1 & [~ [1<=p3_2] | p0_16<=flag_1_5]] | p0_3<=p0_2] | AX [p0_9<=1]]]]]
normalized: [E [true U ~ [[~ [EX [~ [p0_9<=1]]] | [p0_3<=p0_2 | [p0_8<=1 & [p0_16<=flag_1_5 | ~ [1<=p3_2]]]]]]] | [EG [~ [1<=p0_18]] & EX [flag_1_11<=p0_6]]]

abstracting: (flag_1_11<=p0_6)
states: 8,388,608 (6)
.abstracting: (1<=p0_18)
states: 5,505,024 (6)
.
EG iterations: 1
abstracting: (1<=p3_2)
states: 524,288 (5)
abstracting: (p0_16<=flag_1_5)
states: 8,912,896 (6)
abstracting: (p0_8<=1)
states: 11,534,336 (7)
abstracting: (p0_3<=p0_2)
states: 8,650,752 (6)
abstracting: (p0_9<=1)
states: 11,534,336 (7)
.-> the formula is FALSE

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

MC time: 0m 0.755sec

checking: AG [[~ [[[AG [[1<=flag_0_5 & p3_0<=1]] | AX [[flag_0_17<=1 & p0_6<=0]]] & p3_9<=flag_1_6]] & AF [[[flag_0_2<=1 & EF [p1_14<=0]] | [E [flag_1_6<=flag_1_7 U flag_1_11<=1] & flag_0_12<=p3_0]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[flag_0_12<=p3_0 & E [flag_1_6<=flag_1_7 U flag_1_11<=1]] | [flag_0_2<=1 & E [true U p1_14<=0]]]]]] & ~ [[p3_9<=flag_1_6 & [~ [EX [~ [[flag_0_17<=1 & p0_6<=0]]]] | ~ [E [true U ~ [[1<=flag_0_5 & p3_0<=1]]]]]]]]]]]

abstracting: (p3_0<=1)
states: 11,534,336 (7)
abstracting: (1<=flag_0_5)
states: 5,505,024 (6)
abstracting: (p0_6<=0)
states: 6,029,312 (6)
abstracting: (flag_0_17<=1)
states: 11,534,336 (7)
.abstracting: (p3_9<=flag_1_6)
states: 11,272,192 (7)
abstracting: (p1_14<=0)
states: 6,029,312 (6)
abstracting: (flag_0_2<=1)
states: 11,534,336 (7)
abstracting: (flag_1_11<=1)
states: 11,534,336 (7)
abstracting: (flag_1_6<=flag_1_7)
states: 8,650,752 (6)
abstracting: (flag_0_12<=p3_0)
states: 6,291,456 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Dekker-PT-020-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.035sec

checking: [EF [~ [[EX [[[flag_1_13<=1 | p0_13<=p3_5] & [1<=flag_0_13 & 1<=p1_12]]] | [flag_1_7<=1 & [[p0_10<=1 & [p3_0<=p1_17 & p1_8<=flag_0_16]] | AF [flag_1_14<=1]]]]]] | EF [E [EG [p0_18<=p0_15] U AF [flag_1_6<=p0_6]]]]
normalized: [E [true U E [EG [p0_18<=p0_15] U ~ [EG [~ [flag_1_6<=p0_6]]]]] | E [true U ~ [[[flag_1_7<=1 & [~ [EG [~ [flag_1_14<=1]]] | [p0_10<=1 & [p3_0<=p1_17 & p1_8<=flag_0_16]]]] | EX [[[1<=flag_0_13 & 1<=p1_12] & [flag_1_13<=1 | p0_13<=p3_5]]]]]]]

abstracting: (p0_13<=p3_5)
states: 6,291,456 (6)
abstracting: (flag_1_13<=1)
states: 11,534,336 (7)
abstracting: (1<=p1_12)
states: 5,505,024 (6)
abstracting: (1<=flag_0_13)
states: 5,505,024 (6)
.abstracting: (p1_8<=flag_0_16)
states: 8,650,752 (6)
abstracting: (p3_0<=p1_17)
states: 11,272,192 (7)
abstracting: (p0_10<=1)
states: 11,534,336 (7)
abstracting: (flag_1_14<=1)
states: 11,534,336 (7)
.
EG iterations: 1
abstracting: (flag_1_7<=1)
states: 11,534,336 (7)
abstracting: (flag_1_6<=p0_6)
states: 5,505,024 (6)
.
EG iterations: 1
abstracting: (p0_18<=p0_15)
states: 8,650,752 (6)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 1.898sec

checking: AG [[[AF [flag_1_2<=0] | [[[1<=p3_5 | [AX [p0_16<=flag_1_1] | EF [flag_1_3<=flag_1_5]]] | E [A [p0_8<=0 U flag_1_14<=flag_0_15] U [flag_0_0<=1 & flag_0_19<=p3_19]]] | [~ [p1_17<=p3_17] | ~ [[[p1_1<=flag_1_10 | p3_2<=0] | ~ [flag_0_10<=p1_8]]]]]] | AG [E [[[p3_1<=1 & p0_1<=0] | A [1<=p3_8 U 1<=p3_11]] U AF [p3_8<=p1_9]]]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [E [[[~ [EG [~ [1<=p3_11]]] & ~ [E [~ [1<=p3_11] U [~ [1<=p3_8] & ~ [1<=p3_11]]]]] | [p3_1<=1 & p0_1<=0]] U ~ [EG [~ [p3_8<=p1_9]]]]]]] | [[[~ [[~ [flag_0_10<=p1_8] | [p1_1<=flag_1_10 | p3_2<=0]]] | ~ [p1_17<=p3_17]] | [E [[~ [EG [~ [flag_1_14<=flag_0_15]]] & ~ [E [~ [flag_1_14<=flag_0_15] U [~ [p0_8<=0] & ~ [flag_1_14<=flag_0_15]]]]] U [flag_0_0<=1 & flag_0_19<=p3_19]] | [1<=p3_5 | [E [true U flag_1_3<=flag_1_5] | ~ [EX [~ [p0_16<=flag_1_1]]]]]]] | ~ [EG [~ [flag_1_2<=0]]]]]]]]

abstracting: (flag_1_2<=0)
states: 5,505,024 (6)
.
EG iterations: 1
abstracting: (p0_16<=flag_1_1)
states: 8,912,896 (6)
.abstracting: (flag_1_3<=flag_1_5)
states: 8,650,752 (6)
abstracting: (1<=p3_5)
states: 524,288 (5)
abstracting: (flag_0_19<=p3_19)
states: 6,029,312 (6)
abstracting: (flag_0_0<=1)
states: 11,534,336 (7)
abstracting: (flag_1_14<=flag_0_15)
states: 8,388,608 (6)
abstracting: (p0_8<=0)
states: 6,029,312 (6)
abstracting: (flag_1_14<=flag_0_15)
states: 8,388,608 (6)
abstracting: (flag_1_14<=flag_0_15)
states: 8,388,608 (6)
.
EG iterations: 1
abstracting: (p1_17<=p3_17)
states: 6,029,312 (6)
abstracting: (p3_2<=0)
states: 11,010,048 (7)
abstracting: (p1_1<=flag_1_10)
states: 8,912,896 (6)
abstracting: (flag_0_10<=p1_8)
states: 8,650,752 (6)
abstracting: (p3_8<=p1_9)
states: 11,272,192 (7)
.
EG iterations: 1
abstracting: (p0_1<=0)
states: 6,029,312 (6)
abstracting: (p3_1<=1)
states: 11,534,336 (7)
abstracting: (1<=p3_11)
states: 524,288 (5)
abstracting: (1<=p3_8)
states: 524,288 (5)
abstracting: (1<=p3_11)
states: 524,288 (5)
abstracting: (1<=p3_11)
states: 524,288 (5)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 5.018sec

totally nodes used: 5892941 (5.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 8770237 75011957 83782194
used/not used/entry size/cache size: 46293826 20815038 16 1024MB
basic ops cache: hits/miss/sum: 601450 3814552 4416002
used/not used/entry size/cache size: 5039937 11737279 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: 46381 334638 381019
used/not used/entry size/cache size: 328142 8060466 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 62013428
1 4410253
2 585117
3 88902
4 10150
5 945
6 63
7 5
8 0
9 0
>= 10 1

Total processing time: 0m38.030sec


BK_STOP 1678256764026

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

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


initing FirstDep: 0m 0.001sec


iterations count:11782 (26), effective:296 (0)

initing FirstDep: 0m 0.001sec


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

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

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

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

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

iterations count:5263 (11), effective:105 (0)

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

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

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

iterations count:1068 (2), effective:7 (0)

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

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

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

iterations count:5112 (11), effective:96 (0)

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

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

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

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

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

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

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

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

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

iterations count:4937 (11), effective:92 (0)

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

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

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

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

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

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

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

iterations count:5971 (13), effective:141 (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-020"
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-020, 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-167819403200017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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