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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 6.6K Feb 26 15:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 15:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 15:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 15:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 15:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 26 15:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.9K 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 RefineWMG-PT-002002-CTLCardinality-00
FORMULA_NAME RefineWMG-PT-002002-CTLCardinality-01
FORMULA_NAME RefineWMG-PT-002002-CTLCardinality-02
FORMULA_NAME RefineWMG-PT-002002-CTLCardinality-03
FORMULA_NAME RefineWMG-PT-002002-CTLCardinality-04
FORMULA_NAME RefineWMG-PT-002002-CTLCardinality-05
FORMULA_NAME RefineWMG-PT-002002-CTLCardinality-06
FORMULA_NAME RefineWMG-PT-002002-CTLCardinality-07
FORMULA_NAME RefineWMG-PT-002002-CTLCardinality-08
FORMULA_NAME RefineWMG-PT-002002-CTLCardinality-09
FORMULA_NAME RefineWMG-PT-002002-CTLCardinality-10
FORMULA_NAME RefineWMG-PT-002002-CTLCardinality-11
FORMULA_NAME RefineWMG-PT-002002-CTLCardinality-12
FORMULA_NAME RefineWMG-PT-002002-CTLCardinality-13
FORMULA_NAME RefineWMG-PT-002002-CTLCardinality-14
FORMULA_NAME RefineWMG-PT-002002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678938752558

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=RefineWMG-PT-002002
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: RefineWMG_PT_002002
(NrP: 14 NrTr: 11 NrArc: 32)

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

net check time: 0m 0.000sec

init dd package: 0m 2.767sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 104 (1.0e+02) #states 58,320 (4)



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

checking: AG [AX [1<=psecond]]
normalized: ~ [E [true U EX [~ [1<=psecond]]]]

abstracting: (1<=psecond)
states: 48,600 (4)
.-> the formula is FALSE

FORMULA RefineWMG-PT-002002-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AF [AG [p9<=3]]
normalized: ~ [EG [E [true U ~ [p9<=3]]]]

abstracting: (p9<=3)
states: 58,320 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-002002-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [~ [[AG [~ [3<=p3]] | 2<=p5]]]
normalized: EG [~ [[~ [E [true U 3<=p3]] | 2<=p5]]]

abstracting: (2<=p5)
states: 19,440 (4)
abstracting: (3<=p3)
states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA RefineWMG-PT-002002-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[~ [p1<=7] & AG [EG [EX [p6<=3]]]]]]
normalized: ~ [E [true U [~ [E [true U ~ [EG [EX [p6<=3]]]]] & ~ [p1<=7]]]]

abstracting: (p1<=7)
states: 58,320 (4)
abstracting: (p6<=3)
states: 48,600 (4)
..
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-002002-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: E [pterce<=p10 U EF [AF [AG [AF [6<=p10]]]]]
normalized: E [pterce<=p10 U E [true U ~ [EG [E [true U EG [~ [6<=p10]]]]]]]

abstracting: (6<=p10)
states: 0

EG iterations: 0

EG iterations: 0
abstracting: (pterce<=p10)
states: 19,440 (4)
-> the formula is FALSE

FORMULA RefineWMG-PT-002002-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [[EX [EX [EG [psecond<=psecond]]] & AG [~ [EG [~ [p9<=6]]]]]]
normalized: ~ [EG [~ [[~ [E [true U EG [~ [p9<=6]]]] & EX [EX [EG [psecond<=psecond]]]]]]]

abstracting: (psecond<=psecond)
states: 58,320 (4)

EG iterations: 0
..abstracting: (p9<=6)
states: 58,320 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-002002-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [AG [~ [EX [E [p9<=p4 U AG [3<=p9]]]]]]
normalized: E [true U EX [E [p9<=p4 U ~ [E [true U ~ [3<=p9]]]]]]

abstracting: (3<=p9)
states: 0
abstracting: (p9<=p4)
states: 38,880 (4)
.-> the formula is FALSE

FORMULA RefineWMG-PT-002002-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [EF [~ [EX [[[7<=p2 & p7<=p3] | [p6<=5 | 1<=p2]]]]]]
normalized: E [true U E [true U ~ [EX [[[p6<=5 | 1<=p2] | [7<=p2 & p7<=p3]]]]]]

abstracting: (p7<=p3)
states: 38,880 (4)
abstracting: (7<=p2)
states: 0
abstracting: (1<=p2)
states: 38,880 (4)
abstracting: (p6<=5)
states: 56,376 (4)
.-> the formula is TRUE

FORMULA RefineWMG-PT-002002-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: E [7<=p2 U EF [A [E [AF [p2<=6] U ~ [2<=p]] U [psecond<=3 & ~ [[p2<=5 | p7<=7]]]]]]
normalized: E [7<=p2 U E [true U [~ [EG [~ [[~ [[p2<=5 | p7<=7]] & psecond<=3]]]] & ~ [E [~ [[~ [[p2<=5 | p7<=7]] & psecond<=3]] U [~ [E [~ [EG [~ [p2<=6]]] U ~ [2<=p]]] & ~ [[~ [[p2<=5 | p7<=7]] & psecond<=3]]]]]]]]

abstracting: (psecond<=3)
states: 38,880 (4)
abstracting: (p7<=7)
states: 58,320 (4)
abstracting: (p2<=5)
states: 58,320 (4)
abstracting: (2<=p)
states: 27,216 (4)
abstracting: (p2<=6)
states: 58,320 (4)
.
EG iterations: 1
abstracting: (psecond<=3)
states: 38,880 (4)
abstracting: (p7<=7)
states: 58,320 (4)
abstracting: (p2<=5)
states: 58,320 (4)
abstracting: (psecond<=3)
states: 38,880 (4)
abstracting: (p7<=7)
states: 58,320 (4)
abstracting: (p2<=5)
states: 58,320 (4)

EG iterations: 0
abstracting: (7<=p2)
states: 0
-> the formula is FALSE

FORMULA RefineWMG-PT-002002-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AX [E [p2<=psecond U ~ [[~ [A [4<=pterce U pterce<=5]] | [p7<=5 & [~ [pprime<=p] | [p4<=2 | p9<=5]]]]]]]
normalized: ~ [EX [~ [E [p2<=psecond U ~ [[~ [[~ [EG [~ [pterce<=5]]] & ~ [E [~ [pterce<=5] U [~ [4<=pterce] & ~ [pterce<=5]]]]]] | [[[p4<=2 | p9<=5] | ~ [pprime<=p]] & p7<=5]]]]]]]

abstracting: (p7<=5)
states: 58,320 (4)
abstracting: (pprime<=p)
states: 34,020 (4)
abstracting: (p9<=5)
states: 58,320 (4)
abstracting: (p4<=2)
states: 58,320 (4)
abstracting: (pterce<=5)
states: 58,320 (4)
abstracting: (4<=pterce)
states: 19,440 (4)
abstracting: (pterce<=5)
states: 58,320 (4)
abstracting: (pterce<=5)
states: 58,320 (4)
.
EG iterations: 1
abstracting: (p2<=psecond)
states: 48,600 (4)
.-> the formula is FALSE

FORMULA RefineWMG-PT-002002-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[p4<=p10 & [p10<=p6 & [~ [[5<=p5 | pprime<=p8]] & [EX [p<=6] & ~ [4<=psecond]]]]]] & [[~ [A [EG [p7<=3] U [p5<=4 | p8<=p6]]] & ~ [psecond<=psecond]] & ~ [EX [A [p8<=0 U 1<=p5]]]]]]
normalized: E [true U [[~ [EX [[~ [EG [~ [1<=p5]]] & ~ [E [~ [1<=p5] U [~ [p8<=0] & ~ [1<=p5]]]]]]] & [~ [psecond<=psecond] & ~ [[~ [EG [~ [[p5<=4 | p8<=p6]]]] & ~ [E [~ [[p5<=4 | p8<=p6]] U [~ [EG [p7<=3]] & ~ [[p5<=4 | p8<=p6]]]]]]]]] & ~ [[p4<=p10 & [p10<=p6 & [[~ [4<=psecond] & EX [p<=6]] & ~ [[5<=p5 | pprime<=p8]]]]]]]]

abstracting: (pprime<=p8)
states: 29,970 (4)
abstracting: (5<=p5)
states: 0
abstracting: (p<=6)
states: 57,834 (4)
.abstracting: (4<=psecond)
states: 19,440 (4)
abstracting: (p10<=p6)
states: 42,120 (4)
abstracting: (p4<=p10)
states: 38,880 (4)
abstracting: (p8<=p6)
states: 42,120 (4)
abstracting: (p5<=4)
states: 58,320 (4)
abstracting: (p7<=3)
states: 58,320 (4)

EG iterations: 0
abstracting: (p8<=p6)
states: 42,120 (4)
abstracting: (p5<=4)
states: 58,320 (4)
abstracting: (p8<=p6)
states: 42,120 (4)
abstracting: (p5<=4)
states: 58,320 (4)
.
EG iterations: 1
abstracting: (psecond<=psecond)
states: 58,320 (4)
abstracting: (1<=p5)
states: 38,880 (4)
abstracting: (p8<=0)
states: 19,440 (4)
abstracting: (1<=p5)
states: 38,880 (4)
abstracting: (1<=p5)
states: 38,880 (4)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA RefineWMG-PT-002002-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: ~ [AG [[[[p6<=p6 & [[E [p3<=p4 U p1<=5] | [p7<=p5 & p<=2]] | ~ [p3<=0]]] | [[A [5<=p4 U p<=p2] & EG [p5<=2]] & ~ [A [6<=p7 U 2<=psecond]]]] & EF [AG [p5<=pterce]]]]]
normalized: E [true U ~ [[E [true U ~ [E [true U ~ [p5<=pterce]]]] & [[~ [[~ [EG [~ [2<=psecond]]] & ~ [E [~ [2<=psecond] U [~ [6<=p7] & ~ [2<=psecond]]]]]] & [EG [p5<=2] & [~ [EG [~ [p<=p2]]] & ~ [E [~ [p<=p2] U [~ [5<=p4] & ~ [p<=p2]]]]]]] | [[~ [p3<=0] | [[p7<=p5 & p<=2] | E [p3<=p4 U p1<=5]]] & p6<=p6]]]]]

abstracting: (p6<=p6)
states: 58,320 (4)
abstracting: (p1<=5)
states: 56,376 (4)
abstracting: (p3<=p4)
states: 38,880 (4)
abstracting: (p<=2)
states: 41,310 (4)
abstracting: (p7<=p5)
states: 38,880 (4)
abstracting: (p3<=0)
states: 19,440 (4)
abstracting: (p<=p2)
states: 29,970 (4)
abstracting: (5<=p4)
states: 0
abstracting: (p<=p2)
states: 29,970 (4)
abstracting: (p<=p2)
states: 29,970 (4)
.
EG iterations: 1
abstracting: (p5<=2)
states: 58,320 (4)

EG iterations: 0
abstracting: (2<=psecond)
states: 38,880 (4)
abstracting: (6<=p7)
states: 0
abstracting: (2<=psecond)
states: 38,880 (4)
abstracting: (2<=psecond)
states: 38,880 (4)
.
EG iterations: 1
abstracting: (p5<=pterce)
states: 48,600 (4)
-> the formula is TRUE

FORMULA RefineWMG-PT-002002-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: E [[p7<=5 & [EX [p8<=2] | [pprime<=p6 & E [EX [6<=p2] U EG [p<=3]]]]] U [A [[EG [[p8<=p8 & p7<=1]] | E [[p7<=2 | p3<=p3] U [3<=pterce & psecond<=6]]] U EF [3<=p5]] | AG [E [[~ [p4<=p6] | p10<=6] U AF [p3<=p]]]]]
normalized: E [[[[E [EX [6<=p2] U EG [p<=3]] & pprime<=p6] | EX [p8<=2]] & p7<=5] U [~ [E [true U ~ [E [[~ [p4<=p6] | p10<=6] U ~ [EG [~ [p3<=p]]]]]]] | [~ [EG [~ [E [true U 3<=p5]]]] & ~ [E [~ [E [true U 3<=p5]] U [~ [[E [[p7<=2 | p3<=p3] U [3<=pterce & psecond<=6]] | EG [[p8<=p8 & p7<=1]]]] & ~ [E [true U 3<=p5]]]]]]]]

abstracting: (3<=p5)
states: 0
abstracting: (p7<=1)
states: 38,880 (4)
abstracting: (p8<=p8)
states: 58,320 (4)
.
EG iterations: 1
abstracting: (psecond<=6)
states: 58,320 (4)
abstracting: (3<=pterce)
states: 29,160 (4)
abstracting: (p3<=p3)
states: 58,320 (4)
abstracting: (p7<=2)
states: 58,320 (4)
abstracting: (3<=p5)
states: 0
abstracting: (3<=p5)
states: 0

EG iterations: 0
abstracting: (p3<=p)
states: 42,120 (4)
.
EG iterations: 1
abstracting: (p10<=6)
states: 58,320 (4)
abstracting: (p4<=p6)
states: 42,120 (4)
abstracting: (p7<=5)
states: 58,320 (4)
abstracting: (p8<=2)
states: 58,320 (4)
.abstracting: (pprime<=p6)
states: 34,020 (4)
abstracting: (p<=3)
states: 48,600 (4)
.
EG iterations: 1
abstracting: (6<=p2)
states: 0
.-> the formula is TRUE

FORMULA RefineWMG-PT-002002-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: ~ [E [[~ [[~ [A [p3<=p7 U p5<=p9]] & [p5<=0 | [p5<=p3 & 4<=p8]]]] & [~ [[p<=0 & 2<=p2]] & AX [[p4<=4 & p3<=2]]]] U A [A [3<=p8 U [2<=p6 | p5<=7]] U [[A [6<=p1 U 7<=p5] & [psecond<=p3 | 2<=psecond]] & EX [2<=p8]]]]]
normalized: ~ [E [[[~ [EX [~ [[p4<=4 & p3<=2]]]] & ~ [[p<=0 & 2<=p2]]] & ~ [[[[p5<=p3 & 4<=p8] | p5<=0] & ~ [[~ [EG [~ [p5<=p9]]] & ~ [E [~ [p5<=p9] U [~ [p3<=p7] & ~ [p5<=p9]]]]]]]]] U [~ [EG [~ [[EX [2<=p8] & [[psecond<=p3 | 2<=psecond] & [~ [EG [~ [7<=p5]]] & ~ [E [~ [7<=p5] U [~ [6<=p1] & ~ [7<=p5]]]]]]]]]] & ~ [E [~ [[EX [2<=p8] & [[psecond<=p3 | 2<=psecond] & [~ [EG [~ [7<=p5]]] & ~ [E [~ [7<=p5] U [~ [6<=p1] & ~ [7<=p5]]]]]]]] U [~ [[~ [EG [~ [[2<=p6 | p5<=7]]]] & ~ [E [~ [[2<=p6 | p5<=7]] U [~ [3<=p8] & ~ [[2<=p6 | p5<=7]]]]]]] & ~ [[EX [2<=p8] & [[psecond<=p3 | 2<=psecond] & [~ [EG [~ [7<=p5]]] & ~ [E [~ [7<=p5] U [~ [6<=p1] & ~ [7<=p5]]]]]]]]]]]]]]

abstracting: (7<=p5)
states: 0
abstracting: (6<=p1)
states: 1,944 (3)
abstracting: (7<=p5)
states: 0
abstracting: (7<=p5)
states: 0

EG iterations: 0
abstracting: (2<=psecond)
states: 38,880 (4)
abstracting: (psecond<=p3)
states: 19,440 (4)
abstracting: (2<=p8)
states: 19,440 (4)
.abstracting: (p5<=7)
states: 58,320 (4)
abstracting: (2<=p6)
states: 27,216 (4)
abstracting: (3<=p8)
states: 0
abstracting: (p5<=7)
states: 58,320 (4)
abstracting: (2<=p6)
states: 27,216 (4)
abstracting: (p5<=7)
states: 58,320 (4)
abstracting: (2<=p6)
states: 27,216 (4)
.
EG iterations: 1
abstracting: (7<=p5)
states: 0
abstracting: (6<=p1)
states: 1,944 (3)
abstracting: (7<=p5)
states: 0
abstracting: (7<=p5)
states: 0

EG iterations: 0
abstracting: (2<=psecond)
states: 38,880 (4)
abstracting: (psecond<=p3)
states: 19,440 (4)
abstracting: (2<=p8)
states: 19,440 (4)
.abstracting: (7<=p5)
states: 0
abstracting: (6<=p1)
states: 1,944 (3)
abstracting: (7<=p5)
states: 0
abstracting: (7<=p5)
states: 0

EG iterations: 0
abstracting: (2<=psecond)
states: 38,880 (4)
abstracting: (psecond<=p3)
states: 19,440 (4)
abstracting: (2<=p8)
states: 19,440 (4)
.
EG iterations: 0
abstracting: (p5<=p9)
states: 38,880 (4)
abstracting: (p3<=p7)
states: 38,880 (4)
abstracting: (p5<=p9)
states: 38,880 (4)
abstracting: (p5<=p9)
states: 38,880 (4)
.
EG iterations: 1
abstracting: (p5<=0)
states: 19,440 (4)
abstracting: (4<=p8)
states: 0
abstracting: (p5<=p3)
states: 38,880 (4)
abstracting: (2<=p2)
states: 19,440 (4)
abstracting: (p<=0)
states: 17,496 (4)
abstracting: (p3<=2)
states: 58,320 (4)
abstracting: (p4<=4)
states: 58,320 (4)
.-> the formula is TRUE

FORMULA RefineWMG-PT-002002-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: ~ [[E [[p5<=0 | [[[[p4<=p | 5<=p9] & 6<=p9] | E [psecond<=1 U p6<=3]] & EF [~ [psecond<=p4]]]] U E [p7<=4 U [[AF [p1<=pprime] & 5<=p5] | ~ [[3<=pprime | 4<=p4]]]]] & EG [AF [[[[3<=p4 | p7<=0] & E [p<=p1 U p8<=1]] & AG [p4<=p4]]]]]]
normalized: ~ [[EG [~ [EG [~ [[~ [E [true U ~ [p4<=p4]]] & [E [p<=p1 U p8<=1] & [3<=p4 | p7<=0]]]]]]] & E [[[E [true U ~ [psecond<=p4]] & [E [psecond<=1 U p6<=3] | [[p4<=p | 5<=p9] & 6<=p9]]] | p5<=0] U E [p7<=4 U [~ [[3<=pprime | 4<=p4]] | [~ [EG [~ [p1<=pprime]]] & 5<=p5]]]]]]

abstracting: (5<=p5)
states: 0
abstracting: (p1<=pprime)
states: 34,020 (4)
.
EG iterations: 1
abstracting: (4<=p4)
states: 0
abstracting: (3<=pprime)
states: 17,010 (4)
abstracting: (p7<=4)
states: 58,320 (4)
abstracting: (p5<=0)
states: 19,440 (4)
abstracting: (6<=p9)
states: 0
abstracting: (5<=p9)
states: 0
abstracting: (p4<=p)
states: 42,120 (4)
abstracting: (p6<=3)
states: 48,600 (4)
abstracting: (psecond<=1)
states: 19,440 (4)
abstracting: (psecond<=p4)
states: 19,440 (4)
abstracting: (p7<=0)
states: 19,440 (4)
abstracting: (3<=p4)
states: 0
abstracting: (p8<=1)
states: 38,880 (4)
abstracting: (p<=p1)
states: 34,020 (4)
abstracting: (p4<=p4)
states: 58,320 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-002002-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [~ [EF [E [[~ [[1<=p10 | psecond<=7]] & ~ [EX [psecond<=p]]] U A [[7<=p8 | 6<=p6] U [7<=p2 & p6<=p6]]]]] & [AG [[~ [psecond<=p2] | p1<=7]] & EF [[EF [[A [4<=p U psecond<=p10] & EX [7<=pprime]]] | ~ [[4<=p5 | [p4<=pterce | [pterce<=p5 | 2<=psecond]]]]]]]]
normalized: [[E [true U [~ [[4<=p5 | [p4<=pterce | [pterce<=p5 | 2<=psecond]]]] | E [true U [EX [7<=pprime] & [~ [EG [~ [psecond<=p10]]] & ~ [E [~ [psecond<=p10] U [~ [4<=p] & ~ [psecond<=p10]]]]]]]]] & ~ [E [true U ~ [[p1<=7 | ~ [psecond<=p2]]]]]] & ~ [E [true U E [[~ [EX [psecond<=p]] & ~ [[1<=p10 | psecond<=7]]] U [~ [EG [~ [[7<=p2 & p6<=p6]]]] & ~ [E [~ [[7<=p2 & p6<=p6]] U [~ [[7<=p8 | 6<=p6]] & ~ [[7<=p2 & p6<=p6]]]]]]]]]]

abstracting: (p6<=p6)
states: 58,320 (4)
abstracting: (7<=p2)
states: 0
abstracting: (6<=p6)
states: 1,944 (3)
abstracting: (7<=p8)
states: 0
abstracting: (p6<=p6)
states: 58,320 (4)
abstracting: (7<=p2)
states: 0
abstracting: (p6<=p6)
states: 58,320 (4)
abstracting: (7<=p2)
states: 0

EG iterations: 0
abstracting: (psecond<=7)
states: 58,320 (4)
abstracting: (1<=p10)
states: 38,880 (4)
abstracting: (psecond<=p)
states: 26,325 (4)
.abstracting: (psecond<=p2)
states: 19,440 (4)
abstracting: (p1<=7)
states: 58,320 (4)
abstracting: (psecond<=p10)
states: 19,440 (4)
abstracting: (4<=p)
states: 9,720 (3)
abstracting: (psecond<=p10)
states: 19,440 (4)
abstracting: (psecond<=p10)
states: 19,440 (4)
.
EG iterations: 1
abstracting: (7<=pprime)
states: 486
.abstracting: (2<=psecond)
states: 38,880 (4)
abstracting: (pterce<=p5)
states: 19,440 (4)
abstracting: (p4<=pterce)
states: 48,600 (4)
abstracting: (4<=p5)
states: 0
-> the formula is TRUE

FORMULA RefineWMG-PT-002002-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

totally nodes used: 13690 (1.4e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 43630 33565 77195
used/not used/entry size/cache size: 43026 67065838 16 1024MB
basic ops cache: hits/miss/sum: 23515 24615 48130
used/not used/entry size/cache size: 41136 16736080 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: 2929 2381 5310
used/not used/entry size/cache size: 2381 8386227 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 67096753
1 11693
2 229
3 95
4 13
5 5
6 8
7 7
8 15
9 5
>= 10 41

Total processing time: 0m 4.405sec


BK_STOP 1678938757009

--------------------
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:577 (52), effective:244 (22)

initing FirstDep: 0m 0.000sec


iterations count:306 (27), effective:128 (11)

iterations count:142 (12), effective:53 (4)

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

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

iterations count:267 (24), effective:105 (9)

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

iterations count:53 (4), effective:18 (1)

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

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

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

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

iterations count:93 (8), effective:36 (3)

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

iterations count:159 (14), effective:64 (5)

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

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

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

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

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

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

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

iterations count:27 (2), effective:6 (0)

iterations count:35 (3), effective:12 (1)

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

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

iterations count:70 (6), effective:26 (2)

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

iterations count:41 (3), effective:13 (1)

iterations count:394 (35), effective:167 (15)

iterations count:11 (1), effective:0 (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="RefineWMG-PT-002002"
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 RefineWMG-PT-002002, 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-167889192300529"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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