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.r321-tall-167889192000289.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 Raft-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r321-tall-167889192000289
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.8K Feb 26 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 17:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 17:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 17:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 26 17:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 13K Mar 5 18:23 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 Raft-PT-02-CTLCardinality-00
FORMULA_NAME Raft-PT-02-CTLCardinality-01
FORMULA_NAME Raft-PT-02-CTLCardinality-02
FORMULA_NAME Raft-PT-02-CTLCardinality-03
FORMULA_NAME Raft-PT-02-CTLCardinality-04
FORMULA_NAME Raft-PT-02-CTLCardinality-05
FORMULA_NAME Raft-PT-02-CTLCardinality-06
FORMULA_NAME Raft-PT-02-CTLCardinality-07
FORMULA_NAME Raft-PT-02-CTLCardinality-08
FORMULA_NAME Raft-PT-02-CTLCardinality-09
FORMULA_NAME Raft-PT-02-CTLCardinality-10
FORMULA_NAME Raft-PT-02-CTLCardinality-11
FORMULA_NAME Raft-PT-02-CTLCardinality-12
FORMULA_NAME Raft-PT-02-CTLCardinality-13
FORMULA_NAME Raft-PT-02-CTLCardinality-14
FORMULA_NAME Raft-PT-02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678927204591

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=Raft-PT-02
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: Raft_PT_02
(NrP: 28 NrTr: 52 NrArc: 159)

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

net check time: 0m 0.000sec

init dd package: 0m 2.925sec


RS generation: 0m 0.008sec


-> reachability set: #nodes 180 (1.8e+02) #states 7,381 (3)



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

checking: AG [AX [AG [AG [[p22<=1 | p14<=1]]]]]
normalized: ~ [E [true U EX [E [true U E [true U ~ [[p22<=1 | p14<=1]]]]]]]

abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (p22<=1)
states: 7,381 (3)
.-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [AG [~ [1<=p7]] U AG [EX [~ [p0<=0]]]]
normalized: E [~ [E [true U 1<=p7]] U ~ [E [true U ~ [EX [~ [p0<=0]]]]]]

abstracting: (p0<=0)
states: 7,380 (3)
.abstracting: (1<=p7)
states: 1,220 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[~ [AG [[~ [p20<=p15] | p27<=1]]] | AF [~ [AF [1<=p14]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [EG [~ [1<=p14]]]]] | E [true U ~ [[~ [p20<=p15] | p27<=1]]]]]]]

abstracting: (p27<=1)
states: 7,381 (3)
abstracting: (p20<=p15)
states: 5,381 (3)
abstracting: (1<=p14)
states: 1,220 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: ~ [EF [A [[[E [1<=p17 U 1<=p24] & A [p7<=1 U p11<=p24]] & AX [AG [p22<=1]]] U ~ [EF [1<=p23]]]]]
normalized: ~ [E [true U [~ [EG [E [true U 1<=p23]]] & ~ [E [E [true U 1<=p23] U [~ [[~ [EX [E [true U ~ [p22<=1]]]] & [[~ [EG [~ [p11<=p24]]] & ~ [E [~ [p11<=p24] U [~ [p7<=1] & ~ [p11<=p24]]]]] & E [1<=p17 U 1<=p24]]]] & E [true U 1<=p23]]]]]]]

abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (1<=p24)
states: 1,476 (3)
abstracting: (1<=p17)
states: 1,220 (3)
abstracting: (p11<=p24)
states: 6,405 (3)
abstracting: (p7<=1)
states: 7,381 (3)
abstracting: (p11<=p24)
states: 6,405 (3)
abstracting: (p11<=p24)
states: 6,405 (3)
.
EG iterations: 1
abstracting: (p22<=1)
states: 7,381 (3)
.abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (1<=p23)
states: 1,476 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: ~ [EG [[[~ [[p18<=1 & p22<=p23]] & [EG [p7<=0] & A [1<=p27 U 1<=p8]]] | AG [p5<=p11]]]]
normalized: ~ [EG [[~ [E [true U ~ [p5<=p11]]] | [[[~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [1<=p27] & ~ [1<=p8]]]]] & EG [p7<=0]] & ~ [[p18<=1 & p22<=p23]]]]]]

abstracting: (p22<=p23)
states: 5,905 (3)
abstracting: (p18<=1)
states: 7,381 (3)
abstracting: (p7<=0)
states: 6,161 (3)
.
EG iterations: 1
abstracting: (1<=p8)
states: 1,220 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (1<=p8)
states: 1,220 (3)
abstracting: (1<=p8)
states: 1,220 (3)
.
EG iterations: 1
abstracting: (p5<=p11)
states: 5,381 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: AX [[AX [~ [1<=p27]] | A [E [[[p1<=p21 | p7<=p14] & [p5<=1 & p18<=0]] U 1<=p19] U EF [1<=p7]]]]
normalized: ~ [EX [~ [[[~ [EG [~ [E [true U 1<=p7]]]] & ~ [E [~ [E [true U 1<=p7]] U [~ [E [[[p5<=1 & p18<=0] & [p1<=p21 | p7<=p14]] U 1<=p19]] & ~ [E [true U 1<=p7]]]]]] | ~ [EX [1<=p27]]]]]]

abstracting: (1<=p27)
states: 1,845 (3)
.abstracting: (1<=p7)
states: 1,220 (3)
abstracting: (1<=p19)
states: 1,220 (3)
abstracting: (p7<=p14)
states: 6,341 (3)
abstracting: (p1<=p21)
states: 6,405 (3)
abstracting: (p18<=0)
states: 6,161 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p7)
states: 1,220 (3)
abstracting: (1<=p7)
states: 1,220 (3)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: ~ [AG [E [[~ [[EG [p20<=p20] | E [p6<=p9 U p1<=p20]]] | p5<=0] U EX [[[1<=p24 | p23<=0] | EG [p3<=p6]]]]]]
normalized: E [true U ~ [E [[~ [[E [p6<=p9 U p1<=p20] | EG [p20<=p20]]] | p5<=0] U EX [[EG [p3<=p6] | [1<=p24 | p23<=0]]]]]]

abstracting: (p23<=0)
states: 5,905 (3)
abstracting: (1<=p24)
states: 1,476 (3)
abstracting: (p3<=p6)
states: 6,341 (3)
.
EG iterations: 1
.abstracting: (p5<=0)
states: 4,881 (3)
abstracting: (p20<=p20)
states: 7,381 (3)

EG iterations: 0
abstracting: (p1<=p20)
states: 6,661 (3)
abstracting: (p6<=p9)
states: 6,161 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: A [[p22<=p4 | AX [[[[~ [p20<=p21] | EX [1<=p26]] | EX [p1<=1]] & [E [p14<=1 U 1<=p4] & p14<=1]]]] U p21<=p14]
normalized: [~ [EG [~ [p21<=p14]]] & ~ [E [~ [p21<=p14] U [~ [[~ [EX [~ [[[E [p14<=1 U 1<=p4] & p14<=1] & [EX [p1<=1] | [EX [1<=p26] | ~ [p20<=p21]]]]]]] | p22<=p4]] & ~ [p21<=p14]]]]]

abstracting: (p21<=p14)
states: 6,149 (3)
abstracting: (p22<=p4)
states: 6,149 (3)
abstracting: (p20<=p21)
states: 5,381 (3)
abstracting: (1<=p26)
states: 1,845 (3)
.abstracting: (p1<=1)
states: 7,381 (3)
.abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (1<=p4)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
.abstracting: (p21<=p14)
states: 6,149 (3)
abstracting: (p21<=p14)
states: 6,149 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EX [AF [[EF [AG [p2<=p10]] | [[[[p18<=1 & p5<=p25] & ~ [p23<=0]] & ~ [EF [p10<=0]]] & E [p4<=p6 U E [1<=p25 U p3<=p13]]]]]]
normalized: EX [~ [EG [~ [[[E [p4<=p6 U E [1<=p25 U p3<=p13]] & [~ [E [true U p10<=0]] & [~ [p23<=0] & [p18<=1 & p5<=p25]]]] | E [true U ~ [E [true U ~ [p2<=p10]]]]]]]]]

abstracting: (p2<=p10)
states: 6,661 (3)
abstracting: (p5<=p25)
states: 5,506 (3)
abstracting: (p18<=1)
states: 7,381 (3)
abstracting: (p23<=0)
states: 5,905 (3)
abstracting: (p10<=0)
states: 4,881 (3)
abstracting: (p3<=p13)
states: 6,341 (3)
abstracting: (1<=p25)
states: 1,845 (3)
abstracting: (p4<=p6)
states: 6,341 (3)

EG iterations: 0
.-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: [[~ [AG [AG [EF [p17<=0]]]] | [A [AF [p6<=1] U A [AF [p20<=1] U ~ [EF [1<=p19]]]] & E [p25<=p14 U p13<=p7]]] | AF [AX [[1<=p6 | [E [1<=p7 U p12<=1] & [p10<=p24 | AX [p21<=1]]]]]]]
normalized: [~ [EG [EX [~ [[[[~ [EX [~ [p21<=1]]] | p10<=p24] & E [1<=p7 U p12<=1]] | 1<=p6]]]]] | [[E [p25<=p14 U p13<=p7] & [~ [EG [~ [[~ [EG [E [true U 1<=p19]]] & ~ [E [E [true U 1<=p19] U [EG [~ [p20<=1]] & E [true U 1<=p19]]]]]]]] & ~ [E [~ [[~ [EG [E [true U 1<=p19]]] & ~ [E [E [true U 1<=p19] U [EG [~ [p20<=1]] & E [true U 1<=p19]]]]]] U [EG [~ [p6<=1]] & ~ [[~ [EG [E [true U 1<=p19]]] & ~ [E [E [true U 1<=p19] U [EG [~ [p20<=1]] & E [true U 1<=p19]]]]]]]]]]] | E [true U E [true U ~ [E [true U p17<=0]]]]]]

abstracting: (p17<=0)
states: 6,161 (3)
abstracting: (1<=p19)
states: 1,220 (3)
abstracting: (p20<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p19)
states: 1,220 (3)
abstracting: (1<=p19)
states: 1,220 (3)

EG iterations: 0
abstracting: (p6<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p19)
states: 1,220 (3)
abstracting: (p20<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p19)
states: 1,220 (3)
abstracting: (1<=p19)
states: 1,220 (3)

EG iterations: 0
abstracting: (1<=p19)
states: 1,220 (3)
abstracting: (p20<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p19)
states: 1,220 (3)
abstracting: (1<=p19)
states: 1,220 (3)

EG iterations: 0

EG iterations: 0
abstracting: (p13<=p7)
states: 6,341 (3)
abstracting: (p25<=p14)
states: 5,841 (3)
abstracting: (1<=p6)
states: 1,220 (3)
abstracting: (p12<=1)
states: 7,381 (3)
abstracting: (1<=p7)
states: 1,220 (3)
abstracting: (p10<=p24)
states: 5,381 (3)
abstracting: (p21<=1)
states: 7,381 (3)
...
EG iterations: 1
-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: E [[1<=p24 | ~ [AX [AG [EF [p14<=0]]]]] U [[~ [AF [1<=p13]] & AG [AG [AF [1<=p10]]]] | [EG [AF [A [1<=p5 U 1<=p2]]] | [AX [[[1<=p17 & p14<=p19] & [p14<=p20 & p19<=p26]]] | AX [AF [p8<=0]]]]]]
normalized: E [[EX [E [true U ~ [E [true U p14<=0]]]] | 1<=p24] U [[[~ [EX [EG [~ [p8<=0]]]] | ~ [EX [~ [[[p14<=p20 & p19<=p26] & [1<=p17 & p14<=p19]]]]]] | EG [~ [EG [~ [[~ [EG [~ [1<=p2]]] & ~ [E [~ [1<=p2] U [~ [1<=p5] & ~ [1<=p2]]]]]]]]]] | [~ [E [true U E [true U EG [~ [1<=p10]]]]] & EG [~ [1<=p13]]]]]

abstracting: (1<=p13)
states: 1,220 (3)
.
EG iterations: 1
abstracting: (1<=p10)
states: 2,500 (3)
..
EG iterations: 2
abstracting: (1<=p2)
states: 1,220 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (1<=p2)
states: 1,220 (3)
abstracting: (1<=p2)
states: 1,220 (3)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p14<=p19)
states: 6,341 (3)
abstracting: (1<=p17)
states: 1,220 (3)
abstracting: (p19<=p26)
states: 6,466 (3)
abstracting: (p14<=p20)
states: 6,661 (3)
.abstracting: (p8<=0)
states: 6,161 (3)
.
EG iterations: 1
.abstracting: (1<=p24)
states: 1,476 (3)
abstracting: (p14<=0)
states: 6,161 (3)
.-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: E [[~ [AG [[AF [1<=p22] | [p16<=0 & p22<=p19]]]] & [AG [[EG [p17<=1] & ~ [[1<=p26 & p27<=0]]]] & [EG [[~ [p5<=1] | [p3<=1 & p5<=p9]]] | A [p20<=1 U 1<=p21]]]] U AF [AG [[p4<=1 | ~ [[p3<=0 | p1<=0]]]]]]
normalized: E [[[[[~ [EG [~ [1<=p21]]] & ~ [E [~ [1<=p21] U [~ [p20<=1] & ~ [1<=p21]]]]] | EG [[[p3<=1 & p5<=p9] | ~ [p5<=1]]]] & ~ [E [true U ~ [[~ [[1<=p26 & p27<=0]] & EG [p17<=1]]]]]] & E [true U ~ [[[p16<=0 & p22<=p19] | ~ [EG [~ [1<=p22]]]]]]] U ~ [EG [E [true U ~ [[~ [[p3<=0 | p1<=0]] | p4<=1]]]]]]

abstracting: (p4<=1)
states: 7,381 (3)
abstracting: (p1<=0)
states: 6,161 (3)
abstracting: (p3<=0)
states: 6,161 (3)
.
EG iterations: 1
abstracting: (1<=p22)
states: 1,476 (3)
.
EG iterations: 1
abstracting: (p22<=p19)
states: 6,149 (3)
abstracting: (p16<=0)
states: 6,161 (3)
abstracting: (p17<=1)
states: 7,381 (3)

EG iterations: 0
abstracting: (p27<=0)
states: 5,536 (3)
abstracting: (1<=p26)
states: 1,845 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (p5<=p9)
states: 5,381 (3)
abstracting: (p3<=1)
states: 7,381 (3)
..
EG iterations: 2
abstracting: (1<=p21)
states: 1,476 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p21)
states: 1,476 (3)
abstracting: (1<=p21)
states: 1,476 (3)
..
EG iterations: 2
-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EF [~ [[AX [A [[1<=p25 & p25<=p0] U [p5<=p5 | 1<=p27]]] | [[EG [p7<=p21] | ~ [[AX [1<=p7] | AF [p8<=p22]]]] & [AG [p24<=p25] | ~ [[[p27<=p18 & p4<=0] & AG [1<=p16]]]]]]]]
normalized: E [true U ~ [[~ [EX [~ [[~ [EG [~ [[p5<=p5 | 1<=p27]]]] & ~ [E [~ [[p5<=p5 | 1<=p27]] U [~ [[1<=p25 & p25<=p0]] & ~ [[p5<=p5 | 1<=p27]]]]]]]]] | [[~ [[~ [E [true U ~ [1<=p16]]] & [p27<=p18 & p4<=0]]] | ~ [E [true U ~ [p24<=p25]]]] & [~ [[~ [EG [~ [p8<=p22]]] | ~ [EX [~ [1<=p7]]]]] | EG [p7<=p21]]]]]]

abstracting: (p7<=p21)
states: 6,405 (3)
.
EG iterations: 1
abstracting: (1<=p7)
states: 1,220 (3)
.abstracting: (p8<=p22)
states: 6,405 (3)
.
EG iterations: 1
abstracting: (p24<=p25)
states: 6,274 (3)
abstracting: (p4<=0)
states: 6,161 (3)
abstracting: (p27<=p18)
states: 5,841 (3)
abstracting: (1<=p16)
states: 1,220 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p5<=p5)
states: 7,381 (3)
abstracting: (p25<=p0)
states: 5,536 (3)
abstracting: (1<=p25)
states: 1,845 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p5<=p5)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p5<=p5)
states: 7,381 (3)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [EX [EX [[~ [p20<=1] | AF [~ [1<=p4]]]]] | A [AX [p1<=1] U [[[AF [[p23<=1 & p8<=0]] | [[[p14<=1 | 1<=p14] | [p12<=0 & p18<=p17]] & [EF [p16<=1] | EF [p10<=0]]]] | [AF [p5<=1] & [1<=p5 & [p10<=1 | [1<=p5 & p2<=0]]]]] & ~ [[[~ [p4<=p8] | EF [p8<=p11]] | ~ [p24<=1]]]]]]
normalized: [[~ [EG [~ [[~ [[~ [p24<=1] | [E [true U p8<=p11] | ~ [p4<=p8]]]] & [[[[[1<=p5 & p2<=0] | p10<=1] & 1<=p5] & ~ [EG [~ [p5<=1]]]] | [[[E [true U p10<=0] | E [true U p16<=1]] & [[p12<=0 & p18<=p17] | [p14<=1 | 1<=p14]]] | ~ [EG [~ [[p23<=1 & p8<=0]]]]]]]]]] & ~ [E [~ [[~ [[~ [p24<=1] | [E [true U p8<=p11] | ~ [p4<=p8]]]] & [[[[[1<=p5 & p2<=0] | p10<=1] & 1<=p5] & ~ [EG [~ [p5<=1]]]] | [[[E [true U p10<=0] | E [true U p16<=1]] & [[p12<=0 & p18<=p17] | [p14<=1 | 1<=p14]]] | ~ [EG [~ [[p23<=1 & p8<=0]]]]]]]] U [EX [~ [p1<=1]] & ~ [[~ [[~ [p24<=1] | [E [true U p8<=p11] | ~ [p4<=p8]]]] & [[[[[1<=p5 & p2<=0] | p10<=1] & 1<=p5] & ~ [EG [~ [p5<=1]]]] | [[[E [true U p10<=0] | E [true U p16<=1]] & [[p12<=0 & p18<=p17] | [p14<=1 | 1<=p14]]] | ~ [EG [~ [[p23<=1 & p8<=0]]]]]]]]]]]] | EX [EX [[~ [EG [1<=p4]] | ~ [p20<=1]]]]]

abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p4)
states: 1,220 (3)
.
EG iterations: 1
..abstracting: (p8<=0)
states: 6,161 (3)
abstracting: (p23<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (p18<=p17)
states: 6,161 (3)
abstracting: (p12<=0)
states: 6,161 (3)
abstracting: (p16<=1)
states: 7,381 (3)
abstracting: (p10<=0)
states: 4,881 (3)
abstracting: (p5<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (p2<=0)
states: 6,161 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p4<=p8)
states: 6,341 (3)
abstracting: (p8<=p11)
states: 6,341 (3)
abstracting: (p24<=1)
states: 7,381 (3)
abstracting: (p1<=1)
states: 7,381 (3)
.abstracting: (p8<=0)
states: 6,161 (3)
abstracting: (p23<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (p18<=p17)
states: 6,161 (3)
abstracting: (p12<=0)
states: 6,161 (3)
abstracting: (p16<=1)
states: 7,381 (3)
abstracting: (p10<=0)
states: 4,881 (3)
abstracting: (p5<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (p2<=0)
states: 6,161 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p4<=p8)
states: 6,341 (3)
abstracting: (p8<=p11)
states: 6,341 (3)
abstracting: (p24<=1)
states: 7,381 (3)
abstracting: (p8<=0)
states: 6,161 (3)
abstracting: (p23<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (p18<=p17)
states: 6,161 (3)
abstracting: (p12<=0)
states: 6,161 (3)
abstracting: (p16<=1)
states: 7,381 (3)
abstracting: (p10<=0)
states: 4,881 (3)
abstracting: (p5<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (p2<=0)
states: 6,161 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p4<=p8)
states: 6,341 (3)
abstracting: (p8<=p11)
states: 6,341 (3)
abstracting: (p24<=1)
states: 7,381 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AX [[[[EG [E [p11<=0 U 1<=p23]] & ~ [AX [~ [1<=p8]]]] | [AG [1<=p20] | ~ [[[p15<=0 | p1<=p26] & [p14<=1 & p15<=1]]]]] & E [[[EG [p14<=0] & [~ [p18<=p10] & p20<=p5]] & [~ [EG [p21<=p0]] & AX [p5<=p18]]] U AG [[[1<=p20 | p4<=p4] | [p24<=0 & p23<=0]]]]]]
normalized: ~ [EX [~ [[E [[[~ [EX [~ [p5<=p18]]] & ~ [EG [p21<=p0]]] & [[p20<=p5 & ~ [p18<=p10]] & EG [p14<=0]]] U ~ [E [true U ~ [[[p24<=0 & p23<=0] | [1<=p20 | p4<=p4]]]]]] & [[~ [[[p14<=1 & p15<=1] & [p15<=0 | p1<=p26]]] | ~ [E [true U ~ [1<=p20]]]] | [EX [1<=p8] & EG [E [p11<=0 U 1<=p23]]]]]]]]

abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p11<=0)
states: 6,161 (3)
.
EG iterations: 1
abstracting: (1<=p8)
states: 1,220 (3)
.abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p1<=p26)
states: 6,466 (3)
abstracting: (p15<=0)
states: 4,881 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (p4<=p4)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p23<=0)
states: 5,905 (3)
abstracting: (p24<=0)
states: 5,905 (3)
abstracting: (p14<=0)
states: 6,161 (3)
.
EG iterations: 1
abstracting: (p18<=p10)
states: 6,661 (3)
abstracting: (p20<=p5)
states: 5,381 (3)
abstracting: (p21<=p0)
states: 5,905 (3)
..
EG iterations: 2
abstracting: (p5<=p18)
states: 5,381 (3)
..-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: AF [[[[[AF [AG [p12<=1]] | EG [AG [p15<=1]]] | E [[1<=p7 & ~ [p0<=p13]] U [[p12<=1 | p18<=1] | [1<=p22 & 1<=p1]]]] | [1<=p9 | A [[E [1<=p2 U p10<=1] & [p0<=p26 & p11<=1]] U 1<=p3]]] | AF [[EF [[1<=p8 & p13<=p0]] & [p26<=0 & [1<=p8 | EX [p23<=p25]]]]]]]
normalized: ~ [EG [~ [[~ [EG [~ [[[p26<=0 & [1<=p8 | EX [p23<=p25]]] & E [true U [1<=p8 & p13<=p0]]]]]] | [[1<=p9 | [~ [EG [~ [1<=p3]]] & ~ [E [~ [1<=p3] U [~ [[[p0<=p26 & p11<=1] & E [1<=p2 U p10<=1]]] & ~ [1<=p3]]]]]] | [E [[1<=p7 & ~ [p0<=p13]] U [[1<=p22 & 1<=p1] | [p12<=1 | p18<=1]]] | [EG [~ [E [true U ~ [p15<=1]]]] | ~ [EG [E [true U ~ [p12<=1]]]]]]]]]]]

abstracting: (p12<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (p15<=1)
states: 7,381 (3)

EG iterations: 0
abstracting: (p18<=1)
states: 7,381 (3)
abstracting: (p12<=1)
states: 7,381 (3)
abstracting: (1<=p1)
states: 1,220 (3)
abstracting: (1<=p22)
states: 1,476 (3)
abstracting: (p0<=p13)
states: 7,380 (3)
abstracting: (1<=p7)
states: 1,220 (3)
abstracting: (1<=p3)
states: 1,220 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (1<=p2)
states: 1,220 (3)
abstracting: (p11<=1)
states: 7,381 (3)
abstracting: (p0<=p26)
states: 7,380 (3)
abstracting: (1<=p3)
states: 1,220 (3)
abstracting: (1<=p3)
states: 1,220 (3)
.
EG iterations: 1
abstracting: (1<=p9)
states: 1,220 (3)
abstracting: (p13<=p0)
states: 6,161 (3)
abstracting: (1<=p8)
states: 1,220 (3)
abstracting: (p23<=p25)
states: 6,274 (3)
.abstracting: (1<=p8)
states: 1,220 (3)
abstracting: (p26<=0)
states: 5,536 (3)
....
EG iterations: 4
.
EG iterations: 1
-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

totally nodes used: 47432 (4.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 100866 211179 312045
used/not used/entry size/cache size: 245355 66863509 16 1024MB
basic ops cache: hits/miss/sum: 38179 54620 92799
used/not used/entry size/cache size: 101563 16675653 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: 2159 3665 5824
used/not used/entry size/cache size: 3665 8384943 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 67063249
1 43897
2 1622
3 93
4 3
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.794sec


BK_STOP 1678927209436

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


iterations count:2392 (46), effective:186 (3)

initing FirstDep: 0m 0.000sec


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

iterations count:238 (4), effective:15 (0)

iterations count:275 (5), effective:18 (0)

iterations count:432 (8), effective:30 (0)

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

iterations count:432 (8), effective:30 (0)

iterations count:406 (7), effective:29 (0)

iterations count:432 (8), effective:30 (0)

iterations count:505 (9), effective:35 (0)

iterations count:302 (5), effective:20 (0)

iterations count:283 (5), effective:13 (0)

iterations count:238 (4), effective:15 (0)

iterations count:249 (4), effective:12 (0)

iterations count:238 (4), effective:15 (0)

iterations count:238 (4), effective:15 (0)

iterations count:127 (2), effective:4 (0)

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

iterations count:313 (6), effective:16 (0)

iterations count:331 (6), effective:17 (0)

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

iterations count:221 (4), effective:17 (0)

iterations count:277 (5), effective:21 (0)

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

iterations count:318 (6), effective:16 (0)

iterations count:318 (6), effective:16 (0)

iterations count:318 (6), effective:16 (0)

iterations count:318 (6), effective:16 (0)

iterations count:318 (6), effective:16 (0)

iterations count:318 (6), effective:16 (0)

iterations count:318 (6), effective:16 (0)

iterations count:318 (6), effective:16 (0)

iterations count:318 (6), effective:16 (0)

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

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

iterations count:185 (3), effective:6 (0)

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

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

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

iterations count:204 (3), effective:16 (0)

iterations count:557 (10), effective:38 (0)

iterations count:639 (12), effective:47 (0)

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:333 (6), effective:23 (0)

iterations count:169 (3), effective:9 (0)

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

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

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

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

iterations count:266 (5), effective:17 (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="Raft-PT-02"
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 Raft-PT-02, 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 r321-tall-167889192000289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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