Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r417-tajo-167905972000193.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is ShieldRVt-PT-002A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r417-tajo-167905972000193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 23:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 23:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 23:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 23:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 23:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 23:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.2K 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 ShieldRVt-PT-002A-CTLCardinality-00
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-01
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-02
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-03
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-04
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-05
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-06
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-07
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-08
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-09
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-10
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-11
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-12
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-13
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-14
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679068947245

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=ShieldRVt-PT-002A
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: ShieldRVt_PT_002A
(NrP: 19 NrTr: 19 NrArc: 74)

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

net check time: 0m 0.000sec

init dd package: 0m 3.345sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 45 (4.5e+01) #states 513



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

checking: ~ [AF [1<=p2]]
normalized: EG [~ [1<=p2]]

abstracting: (1<=p2)
states: 256
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [EF [p2<=0]]
normalized: ~ [EG [~ [E [true U p2<=0]]]]

abstracting: (p2<=0)
states: 257
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [p13<=0 U p18<=p12]
normalized: E [p13<=0 U p18<=p12]

abstracting: (p18<=p12)
states: 385
abstracting: (p13<=0)
states: 257
-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [~ [AX [[p14<=0 & [p13<=1 & AG [1<=p0]]]]]]
normalized: E [true U EX [~ [[[~ [E [true U ~ [1<=p0]]] & p13<=1] & p14<=0]]]]

abstracting: (p14<=0)
states: 257
abstracting: (p13<=1)
states: 513
abstracting: (1<=p0)
states: 1
.-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [AF [~ [p14<=p0]] U 1<=p15]
normalized: [~ [EG [~ [1<=p15]]] & ~ [E [~ [1<=p15] U [EG [p14<=p0] & ~ [1<=p15]]]]]

abstracting: (1<=p15)
states: 256
abstracting: (p14<=p0)
states: 257
..
EG iterations: 2
abstracting: (1<=p15)
states: 256
abstracting: (1<=p15)
states: 256
..........
EG iterations: 10
-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [AG [EX [[EG [p2<=p12] | p18<=p8]]]]
normalized: EG [~ [E [true U ~ [EX [[EG [p2<=p12] | p18<=p8]]]]]]

abstracting: (p18<=p8)
states: 385
abstracting: (p2<=p12)
states: 385
.
EG iterations: 1
.
EG iterations: 0
-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [EF [[~ [AX [[1<=p12 & p1<=0]]] | AX [A [p10<=1 U p11<=1]]]]]
normalized: E [true U E [true U [~ [EX [~ [[~ [EG [~ [p11<=1]]] & ~ [E [~ [p11<=1] U [~ [p10<=1] & ~ [p11<=1]]]]]]]] | EX [~ [[1<=p12 & p1<=0]]]]]]

abstracting: (p1<=0)
states: 257
abstracting: (1<=p12)
states: 256
.abstracting: (p11<=1)
states: 513
abstracting: (p10<=1)
states: 513
abstracting: (p11<=1)
states: 513
abstracting: (p11<=1)
states: 513
.
EG iterations: 1
.-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [AG [p2<=0] & EF [~ [[AX [EG [1<=p5]] & EF [~ [[p11<=0 & 1<=p4]]]]]]]
normalized: [E [true U ~ [[~ [EX [~ [EG [1<=p5]]]] & E [true U ~ [[p11<=0 & 1<=p4]]]]]] & ~ [E [true U ~ [p2<=0]]]]

abstracting: (p2<=0)
states: 257
abstracting: (1<=p4)
states: 256
abstracting: (p11<=0)
states: 257
abstracting: (1<=p5)
states: 256
.
EG iterations: 1
.-> the formula is FALSE

FORMULA ShieldRVt-PT-002A-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [~ [[EX [~ [[[p13<=0 & 1<=p14] & E [1<=p1 U p6<=p1]]]] | ~ [EF [~ [p8<=1]]]]]]
normalized: ~ [EG [[~ [E [true U ~ [p8<=1]]] | EX [~ [[E [1<=p1 U p6<=p1] & [p13<=0 & 1<=p14]]]]]]]

abstracting: (1<=p14)
states: 256
abstracting: (p13<=0)
states: 257
abstracting: (p6<=p1)
states: 385
abstracting: (1<=p1)
states: 256
.abstracting: (p8<=1)
states: 513

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVt-PT-002A-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [AX [[p9<=1 & [E [EX [p7<=0] U E [p5<=p18 U p8<=p7]] & [EF [p15<=p11] | [p3<=0 | ~ [1<=p3]]]]]]]
normalized: ~ [E [true U EX [~ [[[[[~ [1<=p3] | p3<=0] | E [true U p15<=p11]] & E [EX [p7<=0] U E [p5<=p18 U p8<=p7]]] & p9<=1]]]]]

abstracting: (p9<=1)
states: 513
abstracting: (p8<=p7)
states: 257
abstracting: (p5<=p18)
states: 385
abstracting: (p7<=0)
states: 257
.abstracting: (p15<=p11)
states: 385
abstracting: (p3<=0)
states: 257
abstracting: (1<=p3)
states: 256
.-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: A [EX [AX [E [EG [1<=p18] U [p1<=p12 | p15<=p1]]]] U [p7<=0 & [[AG [[~ [p16<=0] & [p4<=p16 | 1<=p13]]] | E [[AX [1<=p7] & A [1<=p13 U 1<=p9]] U 1<=p16]] & 1<=p4]]]
normalized: [~ [EG [~ [[[[E [[~ [EX [~ [1<=p7]]] & [~ [EG [~ [1<=p9]]] & ~ [E [~ [1<=p9] U [~ [1<=p13] & ~ [1<=p9]]]]]] U 1<=p16] | ~ [E [true U ~ [[[p4<=p16 | 1<=p13] & ~ [p16<=0]]]]]] & 1<=p4] & p7<=0]]]] & ~ [E [~ [[[[E [[~ [EX [~ [1<=p7]]] & [~ [EG [~ [1<=p9]]] & ~ [E [~ [1<=p9] U [~ [1<=p13] & ~ [1<=p9]]]]]] U 1<=p16] | ~ [E [true U ~ [[[p4<=p16 | 1<=p13] & ~ [p16<=0]]]]]] & 1<=p4] & p7<=0]] U [~ [EX [~ [EX [~ [E [EG [1<=p18] U [p1<=p12 | p15<=p1]]]]]]] & ~ [[[[E [[~ [EX [~ [1<=p7]]] & [~ [EG [~ [1<=p9]]] & ~ [E [~ [1<=p9] U [~ [1<=p13] & ~ [1<=p9]]]]]] U 1<=p16] | ~ [E [true U ~ [[[p4<=p16 | 1<=p13] & ~ [p16<=0]]]]]] & 1<=p4] & p7<=0]]]]]]

abstracting: (p7<=0)
states: 257
abstracting: (1<=p4)
states: 256
abstracting: (p16<=0)
states: 257
abstracting: (1<=p13)
states: 256
abstracting: (p4<=p16)
states: 385
abstracting: (1<=p16)
states: 256
abstracting: (1<=p9)
states: 256
abstracting: (1<=p13)
states: 256
abstracting: (1<=p9)
states: 256
abstracting: (1<=p9)
states: 256
.
EG iterations: 1
abstracting: (1<=p7)
states: 256
.abstracting: (p15<=p1)
states: 385
abstracting: (p1<=p12)
states: 385
abstracting: (1<=p18)
states: 256
....
EG iterations: 4
..abstracting: (p7<=0)
states: 257
abstracting: (1<=p4)
states: 256
abstracting: (p16<=0)
states: 257
abstracting: (1<=p13)
states: 256
abstracting: (p4<=p16)
states: 385
abstracting: (1<=p16)
states: 256
abstracting: (1<=p9)
states: 256
abstracting: (1<=p13)
states: 256
abstracting: (1<=p9)
states: 256
abstracting: (1<=p9)
states: 256
.
EG iterations: 1
abstracting: (1<=p7)
states: 256
.abstracting: (p7<=0)
states: 257
abstracting: (1<=p4)
states: 256
abstracting: (p16<=0)
states: 257
abstracting: (1<=p13)
states: 256
abstracting: (p4<=p16)
states: 385
abstracting: (1<=p16)
states: 256
abstracting: (1<=p9)
states: 256
abstracting: (1<=p13)
states: 256
abstracting: (1<=p9)
states: 256
abstracting: (1<=p9)
states: 256
.
EG iterations: 1
abstracting: (1<=p7)
states: 256
...
EG iterations: 2
-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: [[EG [p17<=p6] & AX [~ [p5<=p4]]] & [AX [EG [[A [p0<=p3 U 1<=p11] | ~ [EX [p1<=p10]]]]] & [EF [[EF [[p9<=0 & p18<=p4]] | ~ [EF [p4<=p7]]]] & ~ [[~ [[EG [1<=p15] | AF [p8<=1]]] & E [p0<=p0 U AX [1<=p7]]]]]]]
normalized: [[~ [EX [~ [EG [[~ [EX [p1<=p10]] | [~ [EG [~ [1<=p11]]] & ~ [E [~ [1<=p11] U [~ [p0<=p3] & ~ [1<=p11]]]]]]]]]] & [~ [[E [p0<=p0 U ~ [EX [~ [1<=p7]]]] & ~ [[~ [EG [~ [p8<=1]]] | EG [1<=p15]]]]] & E [true U [~ [E [true U p4<=p7]] | E [true U [p9<=0 & p18<=p4]]]]]] & [~ [EX [p5<=p4]] & EG [p17<=p6]]]

abstracting: (p17<=p6)
states: 385
.
EG iterations: 1
abstracting: (p5<=p4)
states: 385
.abstracting: (p18<=p4)
states: 385
abstracting: (p9<=0)
states: 257
abstracting: (p4<=p7)
states: 385
abstracting: (1<=p15)
states: 256
..........
EG iterations: 10
abstracting: (p8<=1)
states: 513
.
EG iterations: 1
abstracting: (1<=p7)
states: 256
.abstracting: (p0<=p0)
states: 513
abstracting: (1<=p11)
states: 256
abstracting: (p0<=p3)
states: 512
abstracting: (1<=p11)
states: 256
abstracting: (1<=p11)
states: 256
.
EG iterations: 1
abstracting: (p1<=p10)
states: 385
..
EG iterations: 1
.-> the formula is FALSE

FORMULA ShieldRVt-PT-002A-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [A [AX [AG [~ [[p17<=p10 | 1<=p15]]]] U [p0<=0 | [~ [E [p1<=1 U p3<=0]] | ~ [1<=p5]]]] | ~ [AG [[EG [[1<=p13 | EF [p9<=p18]]] & [A [AX [p18<=p0] U [p0<=0 | p18<=p14]] & ~ [[~ [p8<=p10] & [1<=p15 & p14<=p17]]]]]]]]
normalized: [E [true U ~ [[[~ [[[1<=p15 & p14<=p17] & ~ [p8<=p10]]] & [~ [EG [~ [[p0<=0 | p18<=p14]]]] & ~ [E [~ [[p0<=0 | p18<=p14]] U [EX [~ [p18<=p0]] & ~ [[p0<=0 | p18<=p14]]]]]]] & EG [[E [true U p9<=p18] | 1<=p13]]]]] | [~ [EG [~ [[[~ [1<=p5] | ~ [E [p1<=1 U p3<=0]]] | p0<=0]]]] & ~ [E [~ [[[~ [1<=p5] | ~ [E [p1<=1 U p3<=0]]] | p0<=0]] U [EX [E [true U [p17<=p10 | 1<=p15]]] & ~ [[[~ [1<=p5] | ~ [E [p1<=1 U p3<=0]]] | p0<=0]]]]]]]

abstracting: (p0<=0)
states: 512
abstracting: (p3<=0)
states: 257
abstracting: (p1<=1)
states: 513
abstracting: (1<=p5)
states: 256
abstracting: (1<=p15)
states: 256
abstracting: (p17<=p10)
states: 385
.abstracting: (p0<=0)
states: 512
abstracting: (p3<=0)
states: 257
abstracting: (p1<=1)
states: 513
abstracting: (1<=p5)
states: 256
abstracting: (p0<=0)
states: 512
abstracting: (p3<=0)
states: 257
abstracting: (p1<=1)
states: 513
abstracting: (1<=p5)
states: 256
.
EG iterations: 1
abstracting: (1<=p13)
states: 256
abstracting: (p9<=p18)
states: 385

EG iterations: 0
abstracting: (p18<=p14)
states: 385
abstracting: (p0<=0)
states: 512
abstracting: (p18<=p0)
states: 257
.abstracting: (p18<=p14)
states: 385
abstracting: (p0<=0)
states: 512
abstracting: (p18<=p14)
states: 385
abstracting: (p0<=0)
states: 512
.
EG iterations: 1
abstracting: (p8<=p10)
states: 385
abstracting: (p14<=p17)
states: 385
abstracting: (1<=p15)
states: 256
-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [AF [AF [1<=p2]] | A [EX [AF [AX [1<=p8]]] U [~ [EX [[[p1<=p2 | p6<=p5] | [p5<=p5 & p8<=p0]]]] & [[~ [E [1<=p3 U p15<=0]] & [~ [p15<=p6] | p2<=1]] | [[1<=p4 & ~ [[p5<=p9 & 1<=p5]]] & AX [~ [p3<=0]]]]]]]
normalized: [[~ [EG [~ [[[[~ [EX [p3<=0]] & [~ [[p5<=p9 & 1<=p5]] & 1<=p4]] | [[~ [p15<=p6] | p2<=1] & ~ [E [1<=p3 U p15<=0]]]] & ~ [EX [[[p5<=p5 & p8<=p0] | [p1<=p2 | p6<=p5]]]]]]]] & ~ [E [~ [[[[~ [EX [p3<=0]] & [~ [[p5<=p9 & 1<=p5]] & 1<=p4]] | [[~ [p15<=p6] | p2<=1] & ~ [E [1<=p3 U p15<=0]]]] & ~ [EX [[[p5<=p5 & p8<=p0] | [p1<=p2 | p6<=p5]]]]]] U [~ [EX [~ [EG [EX [~ [1<=p8]]]]]] & ~ [[[[~ [EX [p3<=0]] & [~ [[p5<=p9 & 1<=p5]] & 1<=p4]] | [[~ [p15<=p6] | p2<=1] & ~ [E [1<=p3 U p15<=0]]]] & ~ [EX [[[p5<=p5 & p8<=p0] | [p1<=p2 | p6<=p5]]]]]]]]]] | ~ [EG [EG [~ [1<=p2]]]]]

abstracting: (1<=p2)
states: 256
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p6<=p5)
states: 257
abstracting: (p1<=p2)
states: 257
abstracting: (p8<=p0)
states: 257
abstracting: (p5<=p5)
states: 513
.abstracting: (p15<=0)
states: 257
abstracting: (1<=p3)
states: 256
abstracting: (p2<=1)
states: 513
abstracting: (p15<=p6)
states: 385
abstracting: (1<=p4)
states: 256
abstracting: (1<=p5)
states: 256
abstracting: (p5<=p9)
states: 385
abstracting: (p3<=0)
states: 257
.abstracting: (1<=p8)
states: 256
..
EG iterations: 1
.abstracting: (p6<=p5)
states: 257
abstracting: (p1<=p2)
states: 257
abstracting: (p8<=p0)
states: 257
abstracting: (p5<=p5)
states: 513
.abstracting: (p15<=0)
states: 257
abstracting: (1<=p3)
states: 256
abstracting: (p2<=1)
states: 513
abstracting: (p15<=p6)
states: 385
abstracting: (1<=p4)
states: 256
abstracting: (1<=p5)
states: 256
abstracting: (p5<=p9)
states: 385
abstracting: (p3<=0)
states: 257
.abstracting: (p6<=p5)
states: 257
abstracting: (p1<=p2)
states: 257
abstracting: (p8<=p0)
states: 257
abstracting: (p5<=p5)
states: 513
.abstracting: (p15<=0)
states: 257
abstracting: (1<=p3)
states: 256
abstracting: (p2<=1)
states: 513
abstracting: (p15<=p6)
states: 385
abstracting: (1<=p4)
states: 256
abstracting: (1<=p5)
states: 256
abstracting: (p5<=p9)
states: 385
abstracting: (p3<=0)
states: 257
.
EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVt-PT-002A-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[p1<=p15 | E [[A [[p14<=p17 & p13<=p9] U p15<=0] | [[EF [1<=p7] | EG [p0<=p18]] | p10<=p15]] U [[[[1<=p8 | 1<=p17] | [1<=p15 | p14<=p13]] & p15<=p11] & ~ [E [p3<=p6 U p7<=p6]]]]]]
normalized: ~ [E [true U ~ [[E [[[[EG [p0<=p18] | E [true U 1<=p7]] | p10<=p15] | [~ [EG [~ [p15<=0]]] & ~ [E [~ [p15<=0] U [~ [[p14<=p17 & p13<=p9]] & ~ [p15<=0]]]]]] U [~ [E [p3<=p6 U p7<=p6]] & [[[1<=p15 | p14<=p13] | [1<=p8 | 1<=p17]] & p15<=p11]]] | p1<=p15]]]]

abstracting: (p1<=p15)
states: 385
abstracting: (p15<=p11)
states: 385
abstracting: (1<=p17)
states: 256
abstracting: (1<=p8)
states: 256
abstracting: (p14<=p13)
states: 257
abstracting: (1<=p15)
states: 256
abstracting: (p7<=p6)
states: 385
abstracting: (p3<=p6)
states: 385
abstracting: (p15<=0)
states: 257
abstracting: (p13<=p9)
states: 385
abstracting: (p14<=p17)
states: 385
abstracting: (p15<=0)
states: 257
abstracting: (p15<=0)
states: 257
..........
EG iterations: 10
abstracting: (p10<=p15)
states: 385
abstracting: (1<=p7)
states: 256
abstracting: (p0<=p18)
states: 512
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: A [AG [[~ [EG [EF [p15<=0]]] | [p10<=1 & [[[p8<=p3 | p15<=p0] | p6<=1] | [A [1<=p11 U p0<=0] | AX [1<=p16]]]]]] U [[[[1<=p3 | E [EG [p1<=p3] U A [p14<=p9 U p18<=p17]]] & [[A [p4<=0 U p17<=0] & [[p3<=0 & p10<=p4] & EX [p1<=p3]]] | [[AF [p9<=p9] | 1<=p16] & EX [p3<=0]]]] & ~ [[[[~ [p12<=p6] & EX [p12<=p8]] & 1<=p16] | EX [AF [p13<=0]]]]] & ~ [[[p15<=p7 | EX [p2<=p8]] | [p13<=p9 | [EG [p5<=p3] | [1<=p5 & [p0<=p17 | 1<=p15]]]]]]]]
normalized: [~ [EG [~ [[~ [[[[[[p0<=p17 | 1<=p15] & 1<=p5] | EG [p5<=p3]] | p13<=p9] | [EX [p2<=p8] | p15<=p7]]] & [~ [[EX [~ [EG [~ [p13<=0]]]] | [[EX [p12<=p8] & ~ [p12<=p6]] & 1<=p16]]] & [[[EX [p3<=0] & [~ [EG [~ [p9<=p9]]] | 1<=p16]] | [[EX [p1<=p3] & [p3<=0 & p10<=p4]] & [~ [EG [~ [p17<=0]]] & ~ [E [~ [p17<=0] U [~ [p4<=0] & ~ [p17<=0]]]]]]] & [E [EG [p1<=p3] U [~ [EG [~ [p18<=p17]]] & ~ [E [~ [p18<=p17] U [~ [p14<=p9] & ~ [p18<=p17]]]]]] | 1<=p3]]]]]]] & ~ [E [~ [[~ [[[[[[p0<=p17 | 1<=p15] & 1<=p5] | EG [p5<=p3]] | p13<=p9] | [EX [p2<=p8] | p15<=p7]]] & [~ [[EX [~ [EG [~ [p13<=0]]]] | [[EX [p12<=p8] & ~ [p12<=p6]] & 1<=p16]]] & [[[EX [p3<=0] & [~ [EG [~ [p9<=p9]]] | 1<=p16]] | [[EX [p1<=p3] & [p3<=0 & p10<=p4]] & [~ [EG [~ [p17<=0]]] & ~ [E [~ [p17<=0] U [~ [p4<=0] & ~ [p17<=0]]]]]]] & [E [EG [p1<=p3] U [~ [EG [~ [p18<=p17]]] & ~ [E [~ [p18<=p17] U [~ [p14<=p9] & ~ [p18<=p17]]]]]] | 1<=p3]]]]] U [E [true U ~ [[[[[~ [EX [~ [1<=p16]]] | [~ [EG [~ [p0<=0]]] & ~ [E [~ [p0<=0] U [~ [1<=p11] & ~ [p0<=0]]]]]] | [[p8<=p3 | p15<=p0] | p6<=1]] & p10<=1] | ~ [EG [E [true U p15<=0]]]]]] & ~ [[~ [[[[[[p0<=p17 | 1<=p15] & 1<=p5] | EG [p5<=p3]] | p13<=p9] | [EX [p2<=p8] | p15<=p7]]] & [~ [[EX [~ [EG [~ [p13<=0]]]] | [[EX [p12<=p8] & ~ [p12<=p6]] & 1<=p16]]] & [[[EX [p3<=0] & [~ [EG [~ [p9<=p9]]] | 1<=p16]] | [[EX [p1<=p3] & [p3<=0 & p10<=p4]] & [~ [EG [~ [p17<=0]]] & ~ [E [~ [p17<=0] U [~ [p4<=0] & ~ [p17<=0]]]]]]] & [E [EG [p1<=p3] U [~ [EG [~ [p18<=p17]]] & ~ [E [~ [p18<=p17] U [~ [p14<=p9] & ~ [p18<=p17]]]]]] | 1<=p3]]]]]]]]]

abstracting: (1<=p3)
states: 256
abstracting: (p18<=p17)
states: 257
abstracting: (p14<=p9)
states: 385
abstracting: (p18<=p17)
states: 257
abstracting: (p18<=p17)
states: 257
....
EG iterations: 4
abstracting: (p1<=p3)
states: 385
..
EG iterations: 2
abstracting: (p17<=0)
states: 257
abstracting: (p4<=0)
states: 257
abstracting: (p17<=0)
states: 257
abstracting: (p17<=0)
states: 257
....
EG iterations: 4
abstracting: (p10<=p4)
states: 385
abstracting: (p3<=0)
states: 257
abstracting: (p1<=p3)
states: 385
.abstracting: (1<=p16)
states: 256
abstracting: (p9<=p9)
states: 513
.
EG iterations: 1
abstracting: (p3<=0)
states: 257
.abstracting: (1<=p16)
states: 256
abstracting: (p12<=p6)
states: 385
abstracting: (p12<=p8)
states: 385
.abstracting: (p13<=0)
states: 257
.
EG iterations: 1
.abstracting: (p15<=p7)
states: 385
abstracting: (p2<=p8)
states: 385
.abstracting: (p13<=p9)
states: 385
abstracting: (p5<=p3)
states: 385
.
EG iterations: 1
abstracting: (1<=p5)
states: 256
abstracting: (1<=p15)
states: 256
abstracting: (p0<=p17)
states: 512
abstracting: (p15<=0)
states: 257

EG iterations: 0
abstracting: (p10<=1)
states: 513
abstracting: (p6<=1)
states: 513
abstracting: (p15<=p0)
states: 257
abstracting: (p8<=p3)
states: 385
abstracting: (p0<=0)
states: 512
abstracting: (1<=p11)
states: 256
abstracting: (p0<=0)
states: 512
abstracting: (p0<=0)
states: 512
..
EG iterations: 2
abstracting: (1<=p16)
states: 256
.abstracting: (1<=p3)
states: 256
abstracting: (p18<=p17)
states: 257
abstracting: (p14<=p9)
states: 385
abstracting: (p18<=p17)
states: 257
abstracting: (p18<=p17)
states: 257
....
EG iterations: 4
abstracting: (p1<=p3)
states: 385
..
EG iterations: 2
abstracting: (p17<=0)
states: 257
abstracting: (p4<=0)
states: 257
abstracting: (p17<=0)
states: 257
abstracting: (p17<=0)
states: 257
....
EG iterations: 4
abstracting: (p10<=p4)
states: 385
abstracting: (p3<=0)
states: 257
abstracting: (p1<=p3)
states: 385
.abstracting: (1<=p16)
states: 256
abstracting: (p9<=p9)
states: 513
.
EG iterations: 1
abstracting: (p3<=0)
states: 257
.abstracting: (1<=p16)
states: 256
abstracting: (p12<=p6)
states: 385
abstracting: (p12<=p8)
states: 385
.abstracting: (p13<=0)
states: 257
.
EG iterations: 1
.abstracting: (p15<=p7)
states: 385
abstracting: (p2<=p8)
states: 385
.abstracting: (p13<=p9)
states: 385
abstracting: (p5<=p3)
states: 385
.
EG iterations: 1
abstracting: (1<=p5)
states: 256
abstracting: (1<=p15)
states: 256
abstracting: (p0<=p17)
states: 512
abstracting: (1<=p3)
states: 256
abstracting: (p18<=p17)
states: 257
abstracting: (p14<=p9)
states: 385
abstracting: (p18<=p17)
states: 257
abstracting: (p18<=p17)
states: 257
....
EG iterations: 4
abstracting: (p1<=p3)
states: 385
..
EG iterations: 2
abstracting: (p17<=0)
states: 257
abstracting: (p4<=0)
states: 257
abstracting: (p17<=0)
states: 257
abstracting: (p17<=0)
states: 257
....
EG iterations: 4
abstracting: (p10<=p4)
states: 385
abstracting: (p3<=0)
states: 257
abstracting: (p1<=p3)
states: 385
.abstracting: (1<=p16)
states: 256
abstracting: (p9<=p9)
states: 513
.
EG iterations: 1
abstracting: (p3<=0)
states: 257
.abstracting: (1<=p16)
states: 256
abstracting: (p12<=p6)
states: 385
abstracting: (p12<=p8)
states: 385
.abstracting: (p13<=0)
states: 257
.
EG iterations: 1
.abstracting: (p15<=p7)
states: 385
abstracting: (p2<=p8)
states: 385
.abstracting: (p13<=p9)
states: 385
abstracting: (p5<=p3)
states: 385
.
EG iterations: 1
abstracting: (1<=p5)
states: 256
abstracting: (1<=p15)
states: 256
abstracting: (p0<=p17)
states: 512

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVt-PT-002A-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

totally nodes used: 6045 (6.0e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 9484 19875 29359
used/not used/entry size/cache size: 25827 67083037 16 1024MB
basic ops cache: hits/miss/sum: 3655 6951 10606
used/not used/entry size/cache size: 12808 16764408 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: 505 591 1096
used/not used/entry size/cache size: 591 8388017 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 67102845
1 5993
2 26
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.579sec


BK_STOP 1679068952889

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


iterations count:165 (8), effective:39 (2)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:80 (4), effective:16 (0)

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

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

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

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

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

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

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

iterations count:97 (5), effective:21 (1)

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

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

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

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

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

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

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

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

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

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-002A"
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 ShieldRVt-PT-002A, 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 r417-tajo-167905972000193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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