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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.0K Feb 26 16:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 16:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 26 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 16:02 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.4K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 16:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 16:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 16:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 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-002003-CTLCardinality-00
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-01
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-02
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-03
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-04
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-05
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-06
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-07
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-08
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-09
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-10
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-11
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-12
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-13
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-14
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678938811617

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-002003
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_002003
(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.917sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 122 (1.2e+02) #states 184,320 (5)



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

checking: EF [EX [EF [5<=p4]]]
normalized: E [true U EX [E [true U 5<=p4]]]

abstracting: (5<=p4)
states: 0
.-> the formula is FALSE

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

MC time: 0m 0.008sec

checking: AX [~ [EF [5<=p6]]]
normalized: ~ [EX [E [true U 5<=p6]]]

abstracting: (5<=p6)
states: 15,360 (4)
.-> the formula is FALSE

FORMULA RefineWMG-PT-002003-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

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

abstracting: (psecond<=5)
states: 184,320 (5)
.-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[1<=pterce | ~ [AF [AG [E [p4<=p4 U p10<=0]]]]]]
normalized: ~ [E [true U ~ [[EG [E [true U ~ [E [p4<=p4 U p10<=0]]]] | 1<=pterce]]]]

abstracting: (1<=pterce)
states: 153,600 (5)
abstracting: (p10<=0)
states: 46,080 (4)
abstracting: (p4<=p4)
states: 184,320 (5)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [EF [[p10<=p6 | pprime<=p1]]]]
normalized: E [true U ~ [E [true U [p10<=p6 | pprime<=p1]]]]

abstracting: (pprime<=p1)
states: 107,520 (5)
abstracting: (p10<=p6)
states: 113,280 (5)
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [[2<=p2 | [7<=p8 & AF [AF [[3<=p5 | 1<=pprime]]]]]]
normalized: EG [[[~ [EG [EG [~ [[3<=p5 | 1<=pprime]]]]] & 7<=p8] | 2<=p2]]

abstracting: (2<=p2)
states: 92,160 (4)
abstracting: (7<=p8)
states: 0
abstracting: (1<=pprime)
states: 129,024 (5)
abstracting: (3<=p5)
states: 46,080 (4)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [EF [[EF [[[p3<=1 & p10<=p4] & [7<=p3 | p6<=1]]] | p8<=p1]]]
normalized: ~ [E [true U ~ [E [true U [E [true U [[7<=p3 | p6<=1] & [p3<=1 & p10<=p4]]] | p8<=p1]]]]]

abstracting: (p8<=p1)
states: 113,280 (5)
abstracting: (p10<=p4)
states: 115,200 (5)
abstracting: (p3<=1)
states: 92,160 (4)
abstracting: (p6<=1)
states: 98,304 (4)
abstracting: (7<=p3)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: AG [~ [[[[5<=p1 & AG [[p2<=0 & p<=p1]]] & p1<=p6] & AF [E [AX [p10<=1] U [p6<=p9 & psecond<=2]]]]]]
normalized: ~ [E [true U [~ [EG [~ [E [~ [EX [~ [p10<=1]]] U [p6<=p9 & psecond<=2]]]]] & [[~ [E [true U ~ [[p2<=0 & p<=p1]]]] & 5<=p1] & p1<=p6]]]]

abstracting: (p1<=p6)
states: 107,520 (5)
abstracting: (5<=p1)
states: 15,360 (4)
abstracting: (p<=p1)
states: 107,520 (5)
abstracting: (p2<=0)
states: 46,080 (4)
abstracting: (psecond<=2)
states: 92,160 (4)
abstracting: (p6<=p9)
states: 109,440 (5)
abstracting: (p10<=1)
states: 92,160 (4)
..
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [~ [[[~ [[[4<=p4 & p2<=p10] | EF [4<=pprime]]] & E [EF [4<=pprime] U A [p<=p4 U p4<=5]]] | EF [EF [psecond<=p8]]]]]
normalized: E [true U ~ [[E [true U E [true U psecond<=p8]] | [E [E [true U 4<=pprime] U [~ [EG [~ [p4<=5]]] & ~ [E [~ [p4<=5] U [~ [p<=p4] & ~ [p4<=5]]]]]] & ~ [[E [true U 4<=pprime] | [4<=p4 & p2<=p10]]]]]]]

abstracting: (p2<=p10)
states: 115,200 (5)
abstracting: (4<=p4)
states: 0
abstracting: (4<=pprime)
states: 30,720 (4)
abstracting: (p4<=5)
states: 184,320 (5)
abstracting: (p<=p4)
states: 109,440 (5)
abstracting: (p4<=5)
states: 184,320 (5)
abstracting: (p4<=5)
states: 184,320 (5)
.
EG iterations: 1
abstracting: (4<=pprime)
states: 30,720 (4)
abstracting: (psecond<=p8)
states: 76,800 (4)
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: E [~ [7<=p2] U [pprime<=p5 & AG [A [[[3<=p2 | p1<=5] | [p8<=pterce | psecond<=pprime]] U [EX [p4<=7] | ~ [3<=p3]]]]]]
normalized: E [~ [7<=p2] U [~ [E [true U ~ [[~ [EG [~ [[~ [3<=p3] | EX [p4<=7]]]]] & ~ [E [~ [[~ [3<=p3] | EX [p4<=7]]] U [~ [[[p8<=pterce | psecond<=pprime] | [3<=p2 | p1<=5]]] & ~ [[~ [3<=p3] | EX [p4<=7]]]]]]]]]] & pprime<=p5]]

abstracting: (pprime<=p5)
states: 109,440 (5)
abstracting: (p4<=7)
states: 184,320 (5)
.abstracting: (3<=p3)
states: 46,080 (4)
abstracting: (p1<=5)
states: 178,176 (5)
abstracting: (3<=p2)
states: 46,080 (4)
abstracting: (psecond<=pprime)
states: 83,200 (4)
abstracting: (p8<=pterce)
states: 138,240 (5)
abstracting: (p4<=7)
states: 184,320 (5)
.abstracting: (3<=p3)
states: 46,080 (4)
abstracting: (p4<=7)
states: 184,320 (5)
.abstracting: (3<=p3)
states: 46,080 (4)
.
EG iterations: 1
abstracting: (7<=p2)
states: 0
-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EX [[[~ [AG [[~ [6<=p2] | [p<=p5 & p5<=pprime]]]] & ~ [[EG [AX [3<=p10]] & EG [p4<=p7]]]] | EF [~ [[EX [pterce<=p9] | AG [p5<=7]]]]]]
normalized: EX [[E [true U ~ [[~ [E [true U ~ [p5<=7]]] | EX [pterce<=p9]]]] | [~ [[EG [p4<=p7] & EG [~ [EX [~ [3<=p10]]]]]] & E [true U ~ [[[p<=p5 & p5<=pprime] | ~ [6<=p2]]]]]]]

abstracting: (6<=p2)
states: 0
abstracting: (p5<=pprime)
states: 113,280 (5)
abstracting: (p<=p5)
states: 109,440 (5)
abstracting: (3<=p10)
states: 46,080 (4)
..
EG iterations: 1
abstracting: (p4<=p7)
states: 115,200 (5)
.
EG iterations: 1
abstracting: (pterce<=p9)
states: 76,800 (4)
.abstracting: (p5<=7)
states: 184,320 (5)
.-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: AX [[AX [[[~ [[p7<=p2 & p3<=6]] & [~ [p7<=p10] & [p7<=p8 | p1<=5]]] | AG [~ [p4<=4]]]] | E [p1<=2 U AX [p7<=4]]]]
normalized: ~ [EX [~ [[E [p1<=2 U ~ [EX [~ [p7<=4]]]] | ~ [EX [~ [[~ [E [true U p4<=4]] | [[[p7<=p8 | p1<=5] & ~ [p7<=p10]] & ~ [[p7<=p2 & p3<=6]]]]]]]]]]]

abstracting: (p3<=6)
states: 184,320 (5)
abstracting: (p7<=p2)
states: 115,200 (5)
abstracting: (p7<=p10)
states: 115,200 (5)
abstracting: (p1<=5)
states: 178,176 (5)
abstracting: (p7<=p8)
states: 92,160 (4)
abstracting: (p4<=4)
states: 184,320 (5)
.abstracting: (p7<=4)
states: 184,320 (5)
.abstracting: (p1<=2)
states: 130,560 (5)
.-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: AG [[EF [E [AG [p6<=p3] U 1<=p2]] & ~ [[EX [[EX [p3<=p2] & [p4<=p1 | pprime<=psecond]]] & AG [[AX [pterce<=4] | [p7<=p3 | p6<=3]]]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [E [true U ~ [[[p7<=p3 | p6<=3] | ~ [EX [~ [pterce<=4]]]]]]] & EX [[[p4<=p1 | pprime<=psecond] & EX [p3<=p2]]]]] & E [true U E [~ [E [true U ~ [p6<=p3]]] U 1<=p2]]]]]]

abstracting: (1<=p2)
states: 138,240 (5)
abstracting: (p6<=p3)
states: 109,440 (5)
abstracting: (p3<=p2)
states: 92,160 (4)
.abstracting: (pprime<=psecond)
states: 130,816 (5)
abstracting: (p4<=p1)
states: 113,280 (5)
.abstracting: (pterce<=4)
states: 153,600 (5)
.abstracting: (p6<=3)
states: 153,600 (5)
abstracting: (p7<=p3)
states: 115,200 (5)
-> the formula is TRUE

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

MC time: 0m 0.009sec

checking: E [E [E [AF [EG [p<=5]] U [EF [p6<=psecond] & [AG [p9<=0] | AX [2<=p4]]]] U EF [1<=p2]] U [[[p6<=1 & p3<=p3] & ~ [p3<=pterce]] & psecond<=p1]]
normalized: E [E [E [~ [EG [~ [EG [p<=5]]]] U [[~ [EX [~ [2<=p4]]] | ~ [E [true U ~ [p9<=0]]]] & E [true U p6<=psecond]]] U E [true U 1<=p2]] U [psecond<=p1 & [~ [p3<=pterce] & [p6<=1 & p3<=p3]]]]

abstracting: (p3<=p3)
states: 184,320 (5)
abstracting: (p6<=1)
states: 98,304 (4)
abstracting: (p3<=pterce)
states: 138,240 (5)
abstracting: (psecond<=p1)
states: 83,200 (4)
abstracting: (1<=p2)
states: 138,240 (5)
abstracting: (p6<=psecond)
states: 130,816 (5)
abstracting: (p9<=0)
states: 46,080 (4)
abstracting: (2<=p4)
states: 92,160 (4)
.abstracting: (p<=5)
states: 178,176 (5)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.005sec

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

abstracting: (p8<=p5)
states: 115,200 (5)
abstracting: (p10<=4)
states: 184,320 (5)

EG iterations: 0
abstracting: (4<=p5)
states: 0
.abstracting: (2<=p)
states: 86,016 (4)
abstracting: (1<=p4)
states: 138,240 (5)
abstracting: (3<=p4)
states: 46,080 (4)
abstracting: (3<=p7)
states: 46,080 (4)
.abstracting: (2<=p9)
states: 92,160 (4)
.abstracting: (p<=psecond)
states: 130,816 (5)
abstracting: (p<=p2)
states: 109,440 (5)
abstracting: (6<=psecond)
states: 0
abstracting: (pprime<=7)
states: 184,320 (5)
abstracting: (1<=p6)
states: 129,024 (5)
abstracting: (pterce<=1)
states: 61,440 (4)
abstracting: (p8<=p5)
states: 115,200 (5)
abstracting: (p10<=4)
states: 184,320 (5)

EG iterations: 0
abstracting: (4<=p5)
states: 0
.abstracting: (2<=p)
states: 86,016 (4)
abstracting: (1<=p4)
states: 138,240 (5)
abstracting: (3<=p4)
states: 46,080 (4)
abstracting: (3<=p7)
states: 46,080 (4)
.abstracting: (2<=p9)
states: 92,160 (4)
.abstracting: (p<=psecond)
states: 130,816 (5)
abstracting: (p<=p2)
states: 109,440 (5)
abstracting: (6<=psecond)
states: 0
abstracting: (pprime<=7)
states: 184,320 (5)
abstracting: (1<=p6)
states: 129,024 (5)
abstracting: (p8<=p5)
states: 115,200 (5)
abstracting: (p10<=4)
states: 184,320 (5)

EG iterations: 0
abstracting: (4<=p5)
states: 0
.abstracting: (2<=p)
states: 86,016 (4)
abstracting: (1<=p4)
states: 138,240 (5)
abstracting: (3<=p4)
states: 46,080 (4)
abstracting: (3<=p7)
states: 46,080 (4)
.abstracting: (2<=p9)
states: 92,160 (4)
.abstracting: (p<=psecond)
states: 130,816 (5)
abstracting: (p<=p2)
states: 109,440 (5)
abstracting: (6<=psecond)
states: 0
abstracting: (pprime<=7)
states: 184,320 (5)
abstracting: (1<=p6)
states: 129,024 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: E [[~ [[2<=p1 | ~ [E [p7<=pprime U p4<=p]]]] | [[[A [~ [p6<=p10] U EX [p1<=5]] | AX [EX [p8<=p]]] | ~ [[[[2<=p3 | 7<=p7] & ~ [7<=p]] & ~ [EG [p8<=p8]]]]] & [~ [EG [E [p1<=0 U 5<=pprime]]] & 4<=p6]]] U 5<=p3]
normalized: E [[[[4<=p6 & ~ [EG [E [p1<=0 U 5<=pprime]]]] & [~ [[~ [EG [p8<=p8]] & [~ [7<=p] & [2<=p3 | 7<=p7]]]] | [~ [EX [~ [EX [p8<=p]]]] | [~ [EG [~ [EX [p1<=5]]]] & ~ [E [~ [EX [p1<=5]] U [p6<=p10 & ~ [EX [p1<=5]]]]]]]]] | ~ [[2<=p1 | ~ [E [p7<=pprime U p4<=p]]]]] U 5<=p3]

abstracting: (5<=p3)
states: 0
abstracting: (p4<=p)
states: 113,280 (5)
abstracting: (p7<=pprime)
states: 113,280 (5)
abstracting: (2<=p1)
states: 86,016 (4)
abstracting: (p1<=5)
states: 178,176 (5)
.abstracting: (p6<=p10)
states: 109,440 (5)
abstracting: (p1<=5)
states: 178,176 (5)
.abstracting: (p1<=5)
states: 178,176 (5)
..
EG iterations: 1
abstracting: (p8<=p)
states: 113,280 (5)
..abstracting: (7<=p7)
states: 0
abstracting: (2<=p3)
states: 92,160 (4)
abstracting: (7<=p)
states: 1,536 (3)
abstracting: (p8<=p8)
states: 184,320 (5)

EG iterations: 0
abstracting: (5<=pprime)
states: 15,360 (4)
abstracting: (p1<=0)
states: 55,296 (4)
.
EG iterations: 1
abstracting: (4<=p6)
states: 30,720 (4)
-> the formula is FALSE

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

MC time: 0m 0.003sec

totally nodes used: 22482 (2.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 66008 51415 117423
used/not used/entry size/cache size: 67539 67041325 16 1024MB
basic ops cache: hits/miss/sum: 37748 37091 74839
used/not used/entry size/cache size: 66090 16711126 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: 4390 3452 7842
used/not used/entry size/cache size: 3452 8385156 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 67088403
1 19787
2 383
3 159
4 27
5 8
6 12
7 12
8 17
9 4
>= 10 52

Total processing time: 0m 4.708sec


BK_STOP 1678938816373

--------------------
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:581 (52), effective:246 (22)

initing FirstDep: 0m 0.000sec


iterations count:169 (15), effective:63 (5)

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

iterations count:165 (15), effective:67 (6)

iterations count:26 (2), effective:9 (0)

iterations count:75 (6), effective:30 (2)

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

iterations count:34 (3), effective:8 (0)

iterations count:113 (10), effective:46 (4)

iterations count:87 (7), effective:33 (3)

iterations count:87 (7), effective:33 (3)

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

iterations count:88 (8), effective:35 (3)

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

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

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

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

iterations count:94 (8), effective:30 (2)

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

iterations count:34 (3), effective:8 (0)

iterations count:456 (41), effective:190 (17)

iterations count:34 (3), effective:8 (0)

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

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

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

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

iterations count:103 (9), effective:43 (3)

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

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

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

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

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

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

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

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

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

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

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

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-002003"
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-002003, 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-167889192300537"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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