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.r001-oct2-167813588800561.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutonomousCar-PT-03a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r001-oct2-167813588800561
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 42K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-00
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-01
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-02
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-03
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-04
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-05
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-06
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-07
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-08
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-09
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-10
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-11
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-12
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-13
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-14
FORMULA_NAME AutonomousCar-PT-03a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678395353917

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=AutonomousCar-PT-03a
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: AutonomousCar_PT_03a
(NrP: 41 NrTr: 121 NrArc: 745)

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

net check time: 0m 0.000sec

init dd package: 0m 2.964sec


RS generation: 0m 0.039sec


-> reachability set: #nodes 1148 (1.1e+03) #states 22,521 (4)



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

checking: EF [EG [[AG [p29<=0] | AX [EG [p11<=1]]]]]
normalized: E [true U EG [[~ [E [true U ~ [p29<=0]]] | ~ [EX [~ [EG [p11<=1]]]]]]]

abstracting: (p11<=1)
states: 22,521 (4)

EG iterations: 0
.abstracting: (p29<=0)
states: 21,835 (4)

EG iterations: 0
-> the formula is TRUE

FORMULA AutonomousCar-PT-03a-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.087sec

checking: AG [AF [~ [AF [AG [p17<=p14]]]]]
normalized: ~ [E [true U EG [~ [EG [E [true U ~ [p17<=p14]]]]]]]

abstracting: (p17<=p14)
states: 18,506 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.105sec

checking: EX [[EX [AG [AG [p16<=1]]] | AG [~ [E [~ [1<=p40] U ~ [p31<=1]]]]]]
normalized: EX [[~ [E [true U E [~ [1<=p40] U ~ [p31<=1]]]] | EX [~ [E [true U E [true U ~ [p16<=1]]]]]]]

abstracting: (p16<=1)
states: 22,521 (4)
.abstracting: (p31<=1)
states: 22,521 (4)
abstracting: (1<=p40)
states: 3,010 (3)
.-> the formula is TRUE

FORMULA AutonomousCar-PT-03a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [AF [A [~ [[~ [p4<=0] & p37<=p1]] U EX [AX [p0<=0]]]]]
normalized: ~ [E [true U EG [~ [[~ [EG [~ [EX [~ [EX [~ [p0<=0]]]]]]] & ~ [E [~ [EX [~ [EX [~ [p0<=0]]]]] U [[p37<=p1 & ~ [p4<=0]] & ~ [EX [~ [EX [~ [p0<=0]]]]]]]]]]]]]

abstracting: (p0<=0)
states: 22,520 (4)
..abstracting: (p4<=0)
states: 17,536 (4)
abstracting: (p37<=p1)
states: 22,521 (4)
abstracting: (p0<=0)
states: 22,520 (4)
..abstracting: (p0<=0)
states: 22,520 (4)
...
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.083sec

checking: AG [AX [A [[EX [1<=p39] | p40<=p1] U ~ [p1<=p18]]]]
normalized: ~ [E [true U EX [~ [[~ [EG [p1<=p18]] & ~ [E [p1<=p18 U [p1<=p18 & ~ [[p40<=p1 | EX [1<=p39]]]]]]]]]]]

abstracting: (1<=p39)
states: 10,784 (4)
.abstracting: (p40<=p1)
states: 22,521 (4)
abstracting: (p1<=p18)
states: 2,918 (3)
abstracting: (p1<=p18)
states: 2,918 (3)
abstracting: (p1<=p18)
states: 2,918 (3)
..........
EG iterations: 10
.-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.082sec

checking: EF [~ [[E [p15<=p6 U [AG [p2<=0] | ~ [AG [1<=p22]]]] | p2<=0]]]
normalized: E [true U ~ [[p2<=0 | E [p15<=p6 U [E [true U ~ [1<=p22]] | ~ [E [true U ~ [p2<=0]]]]]]]]

abstracting: (p2<=0)
states: 18,531 (4)
abstracting: (1<=p22)
states: 2,917 (3)
abstracting: (p15<=p6)
states: 20,197 (4)
abstracting: (p2<=0)
states: 18,531 (4)
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: A [[1<=p10 | p0<=p3] U EX [[AG [[~ [1<=p38] | EX [p2<=1]]] & p7<=p14]]]
normalized: [~ [EG [~ [EX [[p7<=p14 & ~ [E [true U ~ [[EX [p2<=1] | ~ [1<=p38]]]]]]]]]] & ~ [E [~ [EX [[p7<=p14 & ~ [E [true U ~ [[EX [p2<=1] | ~ [1<=p38]]]]]]]] U [~ [EX [[p7<=p14 & ~ [E [true U ~ [[EX [p2<=1] | ~ [1<=p38]]]]]]]] & ~ [[1<=p10 | p0<=p3]]]]]]

abstracting: (p0<=p3)
states: 22,520 (4)
abstracting: (1<=p10)
states: 4,015 (3)
abstracting: (1<=p38)
states: 4,363 (3)
abstracting: (p2<=1)
states: 22,521 (4)
.abstracting: (p7<=p14)
states: 19,959 (4)
.abstracting: (1<=p38)
states: 4,363 (3)
abstracting: (p2<=1)
states: 22,521 (4)
.abstracting: (p7<=p14)
states: 19,959 (4)
.abstracting: (1<=p38)
states: 4,363 (3)
abstracting: (p2<=1)
states: 22,521 (4)
.abstracting: (p7<=p14)
states: 19,959 (4)
.......
EG iterations: 6
-> the formula is TRUE

FORMULA AutonomousCar-PT-03a-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: AF [AX [~ [[AF [[p6<=p3 | 1<=p1]] & [[AF [p16<=p32] & p8<=1] | [A [p34<=p20 U 1<=p2] | 1<=p32]]]]]]
normalized: ~ [EG [EX [[[[1<=p32 | [~ [EG [~ [1<=p2]]] & ~ [E [~ [1<=p2] U [~ [p34<=p20] & ~ [1<=p2]]]]]] | [p8<=1 & ~ [EG [~ [p16<=p32]]]]] & ~ [EG [~ [[p6<=p3 | 1<=p1]]]]]]]]

abstracting: (1<=p1)
states: 22,520 (4)
abstracting: (p6<=p3)
states: 17,734 (4)
.
EG iterations: 1
abstracting: (p16<=p32)
states: 20,036 (4)
.......
EG iterations: 7
abstracting: (p8<=1)
states: 22,521 (4)
abstracting: (1<=p2)
states: 3,990 (3)
abstracting: (p34<=p20)
states: 17,687 (4)
abstracting: (1<=p2)
states: 3,990 (3)
abstracting: (1<=p2)
states: 3,990 (3)
............
EG iterations: 12
abstracting: (1<=p32)
states: 3,204 (3)
.....................................
EG iterations: 36
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.283sec

checking: EF [[[A [E [~ [1<=p35] U AG [1<=p8]] U 1<=p20] | [1<=p4 & EG [EX [p40<=p40]]]] & AF [~ [[[~ [p5<=0] | p37<=p4] & p16<=p21]]]]]
normalized: E [true U [~ [EG [[p16<=p21 & [p37<=p4 | ~ [p5<=0]]]]] & [[1<=p4 & EG [EX [p40<=p40]]] | [~ [EG [~ [1<=p20]]] & ~ [E [~ [1<=p20] U [~ [E [~ [1<=p35] U ~ [E [true U ~ [1<=p8]]]]] & ~ [1<=p20]]]]]]]]

abstracting: (1<=p20)
states: 4,016 (3)
abstracting: (1<=p8)
states: 2,917 (3)
abstracting: (1<=p35)
states: 4,363 (3)
abstracting: (1<=p20)
states: 4,016 (3)
abstracting: (1<=p20)
states: 4,016 (3)
....
EG iterations: 4
abstracting: (p40<=p40)
states: 22,521 (4)
.....................................
EG iterations: 36
abstracting: (1<=p4)
states: 4,985 (3)
abstracting: (p5<=0)
states: 17,536 (4)
abstracting: (p37<=p4)
states: 19,155 (4)
abstracting: (p16<=p21)
states: 20,043 (4)
.........
EG iterations: 9
-> the formula is TRUE

FORMULA AutonomousCar-PT-03a-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.307sec

checking: EF [~ [[A [[[[p38<=1 & 1<=p16] & E [p27<=p15 U p30<=1]] & p22<=1] U [~ [1<=p27] | E [1<=p29 U p2<=1]]] & EF [[~ [p28<=1] & ~ [1<=p0]]]]]]
normalized: E [true U ~ [[E [true U [~ [1<=p0] & ~ [p28<=1]]] & [~ [EG [~ [[E [1<=p29 U p2<=1] | ~ [1<=p27]]]]] & ~ [E [~ [[E [1<=p29 U p2<=1] | ~ [1<=p27]]] U [~ [[p22<=1 & [E [p27<=p15 U p30<=1] & [p38<=1 & 1<=p16]]]] & ~ [[E [1<=p29 U p2<=1] | ~ [1<=p27]]]]]]]]]]

abstracting: (1<=p27)
states: 4,016 (3)
abstracting: (p2<=1)
states: 22,521 (4)
abstracting: (1<=p29)
states: 686
abstracting: (1<=p16)
states: 2,821 (3)
abstracting: (p38<=1)
states: 22,521 (4)
abstracting: (p30<=1)
states: 22,521 (4)
abstracting: (p27<=p15)
states: 19,082 (4)
abstracting: (p22<=1)
states: 22,521 (4)
abstracting: (1<=p27)
states: 4,016 (3)
abstracting: (p2<=1)
states: 22,521 (4)
abstracting: (1<=p29)
states: 686
abstracting: (1<=p27)
states: 4,016 (3)
abstracting: (p2<=1)
states: 22,521 (4)
abstracting: (1<=p29)
states: 686
.
EG iterations: 1
abstracting: (p28<=1)
states: 22,521 (4)
abstracting: (1<=p0)
states: 1
-> the formula is TRUE

FORMULA AutonomousCar-PT-03a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: E [~ [[A [EX [~ [p38<=0]] U ~ [1<=p12]] | [[~ [EG [p6<=0]] & [[[p30<=1 | p3<=0] & [p23<=p21 | 1<=p3]] & 1<=p10]] & [1<=p38 & EG [[1<=p10 & p29<=p12]]]]]] U ~ [EF [~ [EG [~ [1<=p30]]]]]]
normalized: E [~ [[[[1<=p38 & EG [[1<=p10 & p29<=p12]]] & [[1<=p10 & [[p23<=p21 | 1<=p3] & [p30<=1 | p3<=0]]] & ~ [EG [p6<=0]]]] | [~ [EG [1<=p12]] & ~ [E [1<=p12 U [1<=p12 & ~ [EX [~ [p38<=0]]]]]]]]] U ~ [E [true U ~ [EG [~ [1<=p30]]]]]]

abstracting: (1<=p30)
states: 686
.............
EG iterations: 13
abstracting: (p38<=0)
states: 18,158 (4)
.abstracting: (1<=p12)
states: 2,917 (3)
abstracting: (1<=p12)
states: 2,917 (3)
abstracting: (1<=p12)
states: 2,917 (3)
..........
EG iterations: 10
abstracting: (p6<=0)
states: 17,734 (4)
........
EG iterations: 8
abstracting: (p3<=0)
states: 18,748 (4)
abstracting: (p30<=1)
states: 22,521 (4)
abstracting: (1<=p3)
states: 3,773 (3)
abstracting: (p23<=p21)
states: 19,700 (4)
abstracting: (1<=p10)
states: 4,015 (3)
abstracting: (p29<=p12)
states: 21,933 (4)
abstracting: (1<=p10)
states: 4,015 (3)
.......
EG iterations: 7
abstracting: (1<=p38)
states: 4,363 (3)
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.258sec

checking: ~ [[[~ [A [AF [AX [p19<=1]] U EX [~ [p16<=1]]]] & E [[~ [EX [p21<=p6]] & E [~ [p25<=0] U ~ [p33<=p12]]] U ~ [A [[p21<=p16 | p2<=p11] U [p0<=p27 & p0<=1]]]]] | EG [p27<=1]]]
normalized: ~ [[EG [p27<=1] | [E [[E [~ [p25<=0] U ~ [p33<=p12]] & ~ [EX [p21<=p6]]] U ~ [[~ [EG [~ [[p0<=p27 & p0<=1]]]] & ~ [E [~ [[p0<=p27 & p0<=1]] U [~ [[p21<=p16 | p2<=p11]] & ~ [[p0<=p27 & p0<=1]]]]]]]] & ~ [[~ [EG [~ [EX [~ [p16<=1]]]]] & ~ [E [~ [EX [~ [p16<=1]]] U [EG [EX [~ [p19<=1]]] & ~ [EX [~ [p16<=1]]]]]]]]]]]

abstracting: (p16<=1)
states: 22,521 (4)
.abstracting: (p19<=1)
states: 22,521 (4)
..
EG iterations: 1
abstracting: (p16<=1)
states: 22,521 (4)
.abstracting: (p16<=1)
states: 22,521 (4)
.
EG iterations: 0
abstracting: (p0<=1)
states: 22,521 (4)
abstracting: (p0<=p27)
states: 22,520 (4)
abstracting: (p2<=p11)
states: 19,106 (4)
abstracting: (p21<=p16)
states: 19,947 (4)
abstracting: (p0<=1)
states: 22,521 (4)
abstracting: (p0<=p27)
states: 22,520 (4)
abstracting: (p0<=1)
states: 22,521 (4)
abstracting: (p0<=p27)
states: 22,520 (4)
..
EG iterations: 2
abstracting: (p21<=p6)
states: 20,197 (4)
.abstracting: (p33<=p12)
states: 15,579 (4)
abstracting: (p25<=0)
states: 19,604 (4)
abstracting: (p27<=1)
states: 22,521 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: E [~ [[1<=p4 | [[[AG [1<=p19] | [AG [p23<=0] & [p14<=p27 & 1<=p38]]] | p37<=p28] | 1<=p5]]] U EF [[E [1<=p1 U EG [p11<=0]] & [AG [[p20<=1 & p17<=1]] & E [[1<=p4 | 1<=p21] U EF [1<=p11]]]]]]
normalized: E [~ [[1<=p4 | [1<=p5 | [p37<=p28 | [[[p14<=p27 & 1<=p38] & ~ [E [true U ~ [p23<=0]]]] | ~ [E [true U ~ [1<=p19]]]]]]]] U E [true U [[E [[1<=p4 | 1<=p21] U E [true U 1<=p11]] & ~ [E [true U ~ [[p20<=1 & p17<=1]]]]] & E [1<=p1 U EG [p11<=0]]]]]

abstracting: (p11<=0)
states: 19,604 (4)
.
EG iterations: 1
abstracting: (1<=p1)
states: 22,520 (4)
abstracting: (p17<=1)
states: 22,521 (4)
abstracting: (p20<=1)
states: 22,521 (4)
abstracting: (1<=p11)
states: 2,917 (3)
abstracting: (1<=p21)
states: 2,917 (3)
abstracting: (1<=p4)
states: 4,985 (3)
abstracting: (1<=p19)
states: 2,917 (3)
abstracting: (p23<=0)
states: 19,700 (4)
abstracting: (1<=p38)
states: 4,363 (3)
abstracting: (p14<=p27)
states: 20,181 (4)
abstracting: (p37<=p28)
states: 18,158 (4)
abstracting: (1<=p5)
states: 4,985 (3)
abstracting: (1<=p4)
states: 4,985 (3)
-> the formula is TRUE

FORMULA AutonomousCar-PT-03a-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.136sec

checking: [AF [[~ [[[EF [p21<=p27] & EG [p1<=0]] | ~ [EX [p40<=p22]]]] & [1<=p2 & [AG [[1<=p10 & 1<=p4]] & [[[p2<=p14 | p29<=p2] | p11<=p11] | ~ [1<=p7]]]]]] | AG [AF [AX [[[1<=p9 | p19<=p37] & EF [p5<=1]]]]]]
normalized: [~ [E [true U EG [EX [~ [[E [true U p5<=1] & [1<=p9 | p19<=p37]]]]]]] | ~ [EG [~ [[[1<=p2 & [[~ [1<=p7] | [p11<=p11 | [p2<=p14 | p29<=p2]]] & ~ [E [true U ~ [[1<=p10 & 1<=p4]]]]]] & ~ [[~ [EX [p40<=p22]] | [EG [p1<=0] & E [true U p21<=p27]]]]]]]]]

abstracting: (p21<=p27)
states: 19,604 (4)
abstracting: (p1<=0)
states: 1
..
EG iterations: 2
abstracting: (p40<=p22)
states: 19,898 (4)
.abstracting: (1<=p4)
states: 4,985 (3)
abstracting: (1<=p10)
states: 4,015 (3)
abstracting: (p29<=p2)
states: 22,178 (4)
abstracting: (p2<=p14)
states: 19,106 (4)
abstracting: (p11<=p11)
states: 22,521 (4)
abstracting: (1<=p7)
states: 2,917 (3)
abstracting: (1<=p2)
states: 3,990 (3)

EG iterations: 0
abstracting: (p19<=p37)
states: 20,163 (4)
abstracting: (1<=p9)
states: 2,821 (3)
abstracting: (p5<=1)
states: 22,521 (4)
..............
EG iterations: 13
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.105sec

checking: E [[[EG [AX [[1<=p23 | p4<=1]]] | [AX [~ [A [p3<=0 U p29<=0]]] | ~ [A [[1<=p29 | p33<=p31] U [p23<=0 & p12<=1]]]]] & [~ [A [p0<=1 U [[p15<=p40 | p33<=1] | p3<=p0]]] | A [1<=p14 U [E [1<=p18 U 1<=p1] | [E [p25<=p18 U 1<=p9] & p19<=p19]]]]] U ~ [p26<=1]]
normalized: E [[[[~ [EG [~ [[[p19<=p19 & E [p25<=p18 U 1<=p9]] | E [1<=p18 U 1<=p1]]]]] & ~ [E [~ [[[p19<=p19 & E [p25<=p18 U 1<=p9]] | E [1<=p18 U 1<=p1]]] U [~ [1<=p14] & ~ [[[p19<=p19 & E [p25<=p18 U 1<=p9]] | E [1<=p18 U 1<=p1]]]]]]] | ~ [[~ [EG [~ [[p3<=p0 | [p15<=p40 | p33<=1]]]]] & ~ [E [~ [[p3<=p0 | [p15<=p40 | p33<=1]]] U [~ [p0<=1] & ~ [[p3<=p0 | [p15<=p40 | p33<=1]]]]]]]]] & [[~ [[~ [EG [~ [[p23<=0 & p12<=1]]]] & ~ [E [~ [[p23<=0 & p12<=1]] U [~ [[1<=p29 | p33<=p31]] & ~ [[p23<=0 & p12<=1]]]]]]] | ~ [EX [[~ [EG [~ [p29<=0]]] & ~ [E [~ [p29<=0] U [~ [p3<=0] & ~ [p29<=0]]]]]]]] | EG [~ [EX [~ [[1<=p23 | p4<=1]]]]]]] U ~ [p26<=1]]

abstracting: (p26<=1)
states: 22,521 (4)
abstracting: (p4<=1)
states: 22,521 (4)
abstracting: (1<=p23)
states: 2,821 (3)
.
EG iterations: 0
abstracting: (p29<=0)
states: 21,835 (4)
abstracting: (p3<=0)
states: 18,748 (4)
abstracting: (p29<=0)
states: 21,835 (4)
abstracting: (p29<=0)
states: 21,835 (4)
.
EG iterations: 1
.abstracting: (p12<=1)
states: 22,521 (4)
abstracting: (p23<=0)
states: 19,700 (4)
abstracting: (p33<=p31)
states: 14,416 (4)
abstracting: (1<=p29)
states: 686
abstracting: (p12<=1)
states: 22,521 (4)
abstracting: (p23<=0)
states: 19,700 (4)
abstracting: (p12<=1)
states: 22,521 (4)
abstracting: (p23<=0)
states: 19,700 (4)
..........
EG iterations: 10
abstracting: (p33<=1)
states: 22,521 (4)
abstracting: (p15<=p40)
states: 19,991 (4)
abstracting: (p3<=p0)
states: 18,748 (4)
abstracting: (p0<=1)
states: 22,521 (4)
abstracting: (p33<=1)
states: 22,521 (4)
abstracting: (p15<=p40)
states: 19,991 (4)
abstracting: (p3<=p0)
states: 18,748 (4)
abstracting: (p33<=1)
states: 22,521 (4)
abstracting: (p15<=p40)
states: 19,991 (4)
abstracting: (p3<=p0)
states: 18,748 (4)
.
EG iterations: 1
abstracting: (1<=p1)
states: 22,520 (4)
abstracting: (1<=p18)
states: 2,917 (3)
abstracting: (1<=p9)
states: 2,821 (3)
abstracting: (p25<=p18)
states: 19,959 (4)
abstracting: (p19<=p19)
states: 22,521 (4)
abstracting: (1<=p14)
states: 2,917 (3)
abstracting: (1<=p1)
states: 22,520 (4)
abstracting: (1<=p18)
states: 2,917 (3)
abstracting: (1<=p9)
states: 2,821 (3)
abstracting: (p25<=p18)
states: 19,959 (4)
abstracting: (p19<=p19)
states: 22,521 (4)
abstracting: (1<=p1)
states: 22,520 (4)
abstracting: (1<=p18)
states: 2,917 (3)
abstracting: (1<=p9)
states: 2,821 (3)
abstracting: (p25<=p18)
states: 19,959 (4)
abstracting: (p19<=p19)
states: 22,521 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.132sec

checking: [[A [E [[EF [p17<=p11] & EG [1<=p25]] U AX [[1<=p21 | 1<=p4]]] U [p31<=p2 & p4<=1]] & A [p22<=p6 U AF [[EG [1<=p21] & EG [1<=p3]]]]] & EX [[A [1<=p32 U [EF [p39<=p4] & [[p3<=1 | p0<=1] | [p32<=p21 & p39<=0]]]] | [EX [[[p12<=0 & p18<=p12] & [p21<=0 & 1<=p4]]] | [p17<=p22 & [~ [p38<=0] & 1<=p8]]]]]]
normalized: [EX [[[[p17<=p22 & [1<=p8 & ~ [p38<=0]]] | EX [[[p21<=0 & 1<=p4] & [p12<=0 & p18<=p12]]]] | [~ [EG [~ [[[[p32<=p21 & p39<=0] | [p3<=1 | p0<=1]] & E [true U p39<=p4]]]]] & ~ [E [~ [[[[p32<=p21 & p39<=0] | [p3<=1 | p0<=1]] & E [true U p39<=p4]]] U [~ [1<=p32] & ~ [[[[p32<=p21 & p39<=0] | [p3<=1 | p0<=1]] & E [true U p39<=p4]]]]]]]]] & [[~ [EG [EG [~ [[EG [1<=p3] & EG [1<=p21]]]]]] & ~ [E [EG [~ [[EG [1<=p3] & EG [1<=p21]]]] U [~ [p22<=p6] & EG [~ [[EG [1<=p3] & EG [1<=p21]]]]]]]] & [~ [EG [~ [[p31<=p2 & p4<=1]]]] & ~ [E [~ [[p31<=p2 & p4<=1]] U [~ [E [[EG [1<=p25] & E [true U p17<=p11]] U ~ [EX [~ [[1<=p21 | 1<=p4]]]]]] & ~ [[p31<=p2 & p4<=1]]]]]]]]

abstracting: (p4<=1)
states: 22,521 (4)
abstracting: (p31<=p2)
states: 19,317 (4)
abstracting: (1<=p4)
states: 4,985 (3)
abstracting: (1<=p21)
states: 2,917 (3)
.abstracting: (p17<=p11)
states: 19,083 (4)
abstracting: (1<=p25)
states: 2,917 (3)
..........
EG iterations: 10
abstracting: (p4<=1)
states: 22,521 (4)
abstracting: (p31<=p2)
states: 19,317 (4)
abstracting: (p4<=1)
states: 22,521 (4)
abstracting: (p31<=p2)
states: 19,317 (4)
......
EG iterations: 6
abstracting: (1<=p21)
states: 2,917 (3)
...
EG iterations: 3
abstracting: (1<=p3)
states: 3,773 (3)
............
EG iterations: 12
......
EG iterations: 6
abstracting: (p22<=p6)
states: 20,197 (4)
abstracting: (1<=p21)
states: 2,917 (3)
...
EG iterations: 3
abstracting: (1<=p3)
states: 3,773 (3)
............
EG iterations: 12
......
EG iterations: 6
abstracting: (1<=p21)
states: 2,917 (3)
...
EG iterations: 3
abstracting: (1<=p3)
states: 3,773 (3)
............
EG iterations: 12
......
EG iterations: 6
.
EG iterations: 1
abstracting: (p39<=p4)
states: 13,731 (4)
abstracting: (p0<=1)
states: 22,521 (4)
abstracting: (p3<=1)
states: 22,521 (4)
abstracting: (p39<=0)
states: 11,737 (4)
abstracting: (p32<=p21)
states: 19,673 (4)
abstracting: (1<=p32)
states: 3,204 (3)
abstracting: (p39<=p4)
states: 13,731 (4)
abstracting: (p0<=1)
states: 22,521 (4)
abstracting: (p3<=1)
states: 22,521 (4)
abstracting: (p39<=0)
states: 11,737 (4)
abstracting: (p32<=p21)
states: 19,673 (4)
abstracting: (p39<=p4)
states: 13,731 (4)
abstracting: (p0<=1)
states: 22,521 (4)
abstracting: (p3<=1)
states: 22,521 (4)
abstracting: (p39<=0)
states: 11,737 (4)
abstracting: (p32<=p21)
states: 19,673 (4)
.
EG iterations: 1
abstracting: (p18<=p12)
states: 19,959 (4)
abstracting: (p12<=0)
states: 19,604 (4)
abstracting: (1<=p4)
states: 4,985 (3)
abstracting: (p21<=0)
states: 19,604 (4)
.abstracting: (p38<=0)
states: 18,158 (4)
abstracting: (1<=p8)
states: 2,917 (3)
abstracting: (p17<=p22)
states: 19,083 (4)
.-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.208sec

totally nodes used: 869678 (8.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1867908 4176284 6044192
used/not used/entry size/cache size: 4822167 62286697 16 1024MB
basic ops cache: hits/miss/sum: 494166 671537 1165703
used/not used/entry size/cache size: 1220409 15556807 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: 8812 19080 27892
used/not used/entry size/cache size: 19064 8369544 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 66273696
1 803322
2 29369
3 2301
4 165
5 11
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.688sec


BK_STOP 1678395360658

--------------------
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:9994 (82), effective:565 (4)

initing FirstDep: 0m 0.000sec


iterations count:11036 (91), effective:373 (3)

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

iterations count:6080 (50), effective:252 (2)

iterations count:2557 (21), effective:90 (0)

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

iterations count:7290 (60), effective:263 (2)

iterations count:5170 (42), effective:194 (1)

iterations count:6841 (56), effective:256 (2)

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

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

iterations count:2648 (21), effective:116 (0)

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

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

iterations count:10079 (83), effective:355 (2)

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

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

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

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

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

iterations count:14300 (118), effective:467 (3)

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

iterations count:964 (7), effective:20 (0)

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

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

iterations count:4715 (38), effective:139 (1)

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

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

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

iterations count:11857 (97), effective:434 (3)

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

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

iterations count:751 (6), effective:25 (0)

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

iterations count:4663 (38), effective:176 (1)

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

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

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

iterations count:9831 (81), effective:309 (2)

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

iterations count:9831 (81), effective:309 (2)

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

iterations count:9831 (81), effective:309 (2)

iterations count:2848 (23), effective:91 (0)

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

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

iterations count:3481 (28), effective:129 (1)

iterations count:8800 (72), effective:273 (2)

iterations count:8800 (72), effective:273 (2)

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

iterations count:8800 (72), effective:273 (2)

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="AutonomousCar-PT-03a"
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 AutonomousCar-PT-03a, 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 r001-oct2-167813588800561"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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