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-167813588800545.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-02a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r001-oct2-167813588800545
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 12:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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 23K 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-02a-CTLCardinality-00
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-01
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-02
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-03
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-04
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-05
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-06
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-07
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-08
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-09
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-10
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-11
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-12
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-13
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-14
FORMULA_NAME AutonomousCar-PT-02a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678395328433

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-02a
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_02a
(NrP: 33 NrTr: 69 NrArc: 368)

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

net check time: 0m 0.000sec

init dd package: 0m 2.919sec


RS generation: 0m 0.006sec


-> reachability set: #nodes 457 (4.6e+02) #states 2,314 (3)



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

checking: E [AG [AX [p20<=0]] U AG [p32<=1]]
normalized: E [~ [E [true U EX [~ [p20<=0]]]] U ~ [E [true U ~ [p32<=1]]]]

abstracting: (p32<=1)
states: 2,314 (3)
abstracting: (p20<=0)
states: 2,216 (3)
.-> the formula is TRUE

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

MC time: 0m 0.018sec

checking: EX [AF [~ [p14<=p19]]]
normalized: EX [~ [EG [p14<=p19]]]

abstracting: (p14<=p19)
states: 2,024 (3)
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.006sec

checking: EG [EG [A [A [AG [p30<=p1] U ~ [1<=p12]] U [p28<=1 & E [1<=p12 U p13<=0]]]]]
normalized: EG [EG [[~ [EG [~ [[E [1<=p12 U p13<=0] & p28<=1]]]] & ~ [E [~ [[E [1<=p12 U p13<=0] & p28<=1]] U [~ [[~ [EG [1<=p12]] & ~ [E [1<=p12 U [E [true U ~ [p30<=p1]] & 1<=p12]]]]] & ~ [[E [1<=p12 U p13<=0] & p28<=1]]]]]]]]

abstracting: (p28<=1)
states: 2,314 (3)
abstracting: (p13<=0)
states: 2,024 (3)
abstracting: (1<=p12)
states: 438
abstracting: (1<=p12)
states: 438
abstracting: (p30<=p1)
states: 2,314 (3)
abstracting: (1<=p12)
states: 438
abstracting: (1<=p12)
states: 438
.......
EG iterations: 7
abstracting: (p28<=1)
states: 2,314 (3)
abstracting: (p13<=0)
states: 2,024 (3)
abstracting: (1<=p12)
states: 438
abstracting: (p28<=1)
states: 2,314 (3)
abstracting: (p13<=0)
states: 2,024 (3)
abstracting: (1<=p12)
states: 438
...
EG iterations: 3
.......
EG iterations: 7
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.016sec

checking: AF [AX [[[EX [~ [p31<=p29]] | [AG [p24<=0] & E [p14<=p20 U 1<=p10]]] & 1<=p10]]]
normalized: ~ [EG [EX [~ [[[[E [p14<=p20 U 1<=p10] & ~ [E [true U ~ [p24<=0]]]] | EX [~ [p31<=p29]]] & 1<=p10]]]]]

abstracting: (1<=p10)
states: 290
abstracting: (p31<=p29)
states: 1,144 (3)
.abstracting: (p24<=0)
states: 2,078 (3)
abstracting: (1<=p10)
states: 290
abstracting: (p14<=p20)
states: 2,038 (3)
........................
EG iterations: 23
-> the formula is FALSE

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

MC time: 0m 0.054sec

checking: AF [[~ [[AF [~ [p30<=0]] | [1<=p20 & EF [p32<=p25]]]] & [p19<=p21 | p10<=1]]]
normalized: ~ [EG [~ [[[p19<=p21 | p10<=1] & ~ [[[E [true U p32<=p25] & 1<=p20] | ~ [EG [p30<=0]]]]]]]]

abstracting: (p30<=0)
states: 1,876 (3)
.........................
EG iterations: 25
abstracting: (1<=p20)
states: 98
abstracting: (p32<=p25)
states: 2,181 (3)
abstracting: (p10<=1)
states: 2,314 (3)
abstracting: (p19<=p21)
states: 1,890 (3)
..........................
EG iterations: 26
-> the formula is TRUE

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

MC time: 0m 0.073sec

checking: EF [[~ [AF [EG [[p31<=1 & 1<=p7]]]] & E [EX [p3<=0] U ~ [[[~ [p23<=0] | EF [1<=p21]] & [p29<=1 | [1<=p28 | 1<=p16]]]]]]]
normalized: E [true U [E [EX [p3<=0] U ~ [[[p29<=1 | [1<=p28 | 1<=p16]] & [E [true U 1<=p21] | ~ [p23<=0]]]]] & EG [~ [EG [[p31<=1 & 1<=p7]]]]]]

abstracting: (1<=p7)
states: 290
abstracting: (p31<=1)
states: 2,314 (3)
........
EG iterations: 8
.
EG iterations: 1
abstracting: (p23<=0)
states: 2,078 (3)
abstracting: (1<=p21)
states: 98
abstracting: (1<=p16)
states: 437
abstracting: (1<=p28)
states: 1,875 (3)
abstracting: (p29<=1)
states: 2,314 (3)
abstracting: (p3<=0)
states: 1,775 (3)
.-> the formula is TRUE

FORMULA AutonomousCar-PT-02a-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: AG [AF [[[EF [1<=p31] | ~ [[[p0<=1 & 1<=p8] & [p10<=1 | p18<=p16]]]] | p11<=p12]]]
normalized: ~ [E [true U EG [~ [[[~ [[[p10<=1 | p18<=p16] & [p0<=1 & 1<=p8]]] | E [true U 1<=p31]] | p11<=p12]]]]]

abstracting: (p11<=p12)
states: 2,024 (3)
abstracting: (1<=p31)
states: 1,170 (3)
abstracting: (1<=p8)
states: 278
abstracting: (p0<=1)
states: 2,314 (3)
abstracting: (p18<=p16)
states: 2,024 (3)
abstracting: (p10<=1)
states: 2,314 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA AutonomousCar-PT-02a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: [EX [[AF [[[[1<=p20 & 1<=p13] & AG [1<=p7]] & [[1<=p15 & p3<=p7] & AF [p0<=0]]]] & EX [p12<=1]]] | AF [AG [~ [AX [AF [p5<=0]]]]]]
normalized: [~ [EG [E [true U ~ [EX [EG [~ [p5<=0]]]]]]] | EX [[EX [p12<=1] & ~ [EG [~ [[[~ [EG [~ [p0<=0]]] & [1<=p15 & p3<=p7]] & [~ [E [true U ~ [1<=p7]]] & [1<=p20 & 1<=p13]]]]]]]]]

abstracting: (1<=p13)
states: 290
abstracting: (1<=p20)
states: 98
abstracting: (1<=p7)
states: 290
abstracting: (p3<=p7)
states: 1,852 (3)
abstracting: (1<=p15)
states: 278
abstracting: (p0<=0)
states: 2,313 (3)
..
EG iterations: 2

EG iterations: 0
abstracting: (p12<=1)
states: 2,314 (3)
..abstracting: (p5<=0)
states: 1,721 (3)
.....
EG iterations: 5
..
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.014sec

checking: [[EF [EX [~ [AF [1<=p2]]]] & A [EF [~ [[[p17<=1 & p16<=1] | [p6<=1 & p2<=0]]]] U 1<=p25]] | EF [~ [AG [[p20<=1 | p1<=p22]]]]]
normalized: [E [true U E [true U ~ [[p20<=1 | p1<=p22]]]] | [[~ [EG [~ [1<=p25]]] & ~ [E [~ [1<=p25] U [~ [E [true U ~ [[[p6<=1 & p2<=0] | [p17<=1 & p16<=1]]]]] & ~ [1<=p25]]]]] & E [true U EX [EG [~ [1<=p2]]]]]]

abstracting: (1<=p2)
states: 576
.........
EG iterations: 9
.abstracting: (1<=p25)
states: 918
abstracting: (p16<=1)
states: 2,314 (3)
abstracting: (p17<=1)
states: 2,314 (3)
abstracting: (p2<=0)
states: 1,738 (3)
abstracting: (p6<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (1<=p25)
states: 918
.....
EG iterations: 5
abstracting: (p1<=p22)
states: 99
abstracting: (p20<=1)
states: 2,314 (3)
-> the formula is FALSE

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

MC time: 0m 0.022sec

checking: EX [E [p8<=0 U [[E [~ [p9<=0] U EG [p1<=p11]] & [AF [p20<=p6] & p32<=0]] & EF [~ [p13<=p23]]]]]
normalized: EX [E [p8<=0 U [E [true U ~ [p13<=p23]] & [[p32<=0 & ~ [EG [~ [p20<=p6]]]] & E [~ [p9<=0] U EG [p1<=p11]]]]]]

abstracting: (p1<=p11)
states: 291
........
EG iterations: 8
abstracting: (p9<=0)
states: 1,877 (3)
abstracting: (p20<=p6)
states: 2,230 (3)
.......
EG iterations: 7
abstracting: (p32<=0)
states: 2,047 (3)
abstracting: (p13<=p23)
states: 2,044 (3)
abstracting: (p8<=0)
states: 2,036 (3)
.-> the formula is TRUE

FORMULA AutonomousCar-PT-02a-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: EF [[~ [[A [EX [p23<=p31] U p26<=1] | ~ [[p26<=p17 | EX [1<=p25]]]]] & [[EX [[[1<=p3 & 1<=p7] & ~ [p1<=0]]] | AX [p20<=1]] | ~ [EG [AX [p1<=1]]]]]]
normalized: E [true U [[~ [EG [~ [EX [~ [p1<=1]]]]] | [~ [EX [~ [p20<=1]]] | EX [[~ [p1<=0] & [1<=p3 & 1<=p7]]]]] & ~ [[~ [[p26<=p17 | EX [1<=p25]]] | [~ [EG [~ [p26<=1]]] & ~ [E [~ [p26<=1] U [~ [EX [p23<=p31]] & ~ [p26<=1]]]]]]]]]

abstracting: (p26<=1)
states: 2,314 (3)
abstracting: (p23<=p31)
states: 2,174 (3)
.abstracting: (p26<=1)
states: 2,314 (3)
abstracting: (p26<=1)
states: 2,314 (3)
.
EG iterations: 1
abstracting: (1<=p25)
states: 918
.abstracting: (p26<=p17)
states: 1,761 (3)
abstracting: (1<=p7)
states: 290
abstracting: (1<=p3)
states: 539
abstracting: (p1<=0)
states: 1
.abstracting: (p20<=1)
states: 2,314 (3)
.abstracting: (p1<=1)
states: 2,314 (3)
.
EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: AG [E [AX [E [A [1<=p31 U p10<=1] U [p8<=p18 & p15<=1]]] U AF [[~ [p5<=p30] & [[1<=p32 & 1<=p9] & [p29<=p15 | p24<=1]]]]]]
normalized: ~ [E [true U ~ [E [~ [EX [~ [E [[~ [EG [~ [p10<=1]]] & ~ [E [~ [p10<=1] U [~ [1<=p31] & ~ [p10<=1]]]]] U [p8<=p18 & p15<=1]]]]] U ~ [EG [~ [[[[p29<=p15 | p24<=1] & [1<=p32 & 1<=p9]] & ~ [p5<=p30]]]]]]]]]

abstracting: (p5<=p30)
states: 1,842 (3)
abstracting: (1<=p9)
states: 437
abstracting: (1<=p32)
states: 267
abstracting: (p24<=1)
states: 2,314 (3)
abstracting: (p29<=p15)
states: 1,930 (3)
......
EG iterations: 6
abstracting: (p15<=1)
states: 2,314 (3)
abstracting: (p8<=p18)
states: 2,068 (3)
abstracting: (p10<=1)
states: 2,314 (3)
abstracting: (1<=p31)
states: 1,170 (3)
abstracting: (p10<=1)
states: 2,314 (3)
abstracting: (p10<=1)
states: 2,314 (3)
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.014sec

checking: AG [A [[AF [E [p27<=p28 U p15<=0]] & [~ [E [p12<=1 U p16<=p32]] | [EG [1<=p4] & A [1<=p29 U p32<=0]]]] U A [~ [[p29<=0 | ~ [p1<=p14]]] U AF [[p26<=p31 & p18<=p21]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[~ [EG [EG [~ [[p26<=p31 & p18<=p21]]]]] & ~ [E [EG [~ [[p26<=p31 & p18<=p21]]] U [[p29<=0 | ~ [p1<=p14]] & EG [~ [[p26<=p31 & p18<=p21]]]]]]]]]] & ~ [E [~ [[~ [EG [EG [~ [[p26<=p31 & p18<=p21]]]]] & ~ [E [EG [~ [[p26<=p31 & p18<=p21]]] U [[p29<=0 | ~ [p1<=p14]] & EG [~ [[p26<=p31 & p18<=p21]]]]]]]] U [~ [[[[[~ [EG [~ [p32<=0]]] & ~ [E [~ [p32<=0] U [~ [1<=p29] & ~ [p32<=0]]]]] & EG [1<=p4]] | ~ [E [p12<=1 U p16<=p32]]] & ~ [EG [~ [E [p27<=p28 U p15<=0]]]]]] & ~ [[~ [EG [EG [~ [[p26<=p31 & p18<=p21]]]]] & ~ [E [EG [~ [[p26<=p31 & p18<=p21]]] U [[p29<=0 | ~ [p1<=p14]] & EG [~ [[p26<=p31 & p18<=p21]]]]]]]]]]]]]]]

abstracting: (p18<=p21)
states: 2,038 (3)
abstracting: (p26<=p31)
states: 1,977 (3)
........
EG iterations: 8
abstracting: (p1<=p14)
states: 291
abstracting: (p29<=0)
states: 1,876 (3)
abstracting: (p18<=p21)
states: 2,038 (3)
abstracting: (p26<=p31)
states: 1,977 (3)
........
EG iterations: 8
abstracting: (p18<=p21)
states: 2,038 (3)
abstracting: (p26<=p31)
states: 1,977 (3)
........
EG iterations: 8
.
EG iterations: 1
abstracting: (p15<=0)
states: 2,036 (3)
abstracting: (p27<=p28)
states: 1,876 (3)
........
EG iterations: 8
abstracting: (p16<=p32)
states: 1,936 (3)
abstracting: (p12<=1)
states: 2,314 (3)
abstracting: (1<=p4)
states: 605
.........
EG iterations: 9
abstracting: (p32<=0)
states: 2,047 (3)
abstracting: (1<=p29)
states: 438
abstracting: (p32<=0)
states: 2,047 (3)
abstracting: (p32<=0)
states: 2,047 (3)
...........
EG iterations: 11
abstracting: (p18<=p21)
states: 2,038 (3)
abstracting: (p26<=p31)
states: 1,977 (3)
........
EG iterations: 8
abstracting: (p1<=p14)
states: 291
abstracting: (p29<=0)
states: 1,876 (3)
abstracting: (p18<=p21)
states: 2,038 (3)
abstracting: (p26<=p31)
states: 1,977 (3)
........
EG iterations: 8
abstracting: (p18<=p21)
states: 2,038 (3)
abstracting: (p26<=p31)
states: 1,977 (3)
........
EG iterations: 8
.
EG iterations: 1
abstracting: (p18<=p21)
states: 2,038 (3)
abstracting: (p26<=p31)
states: 1,977 (3)
........
EG iterations: 8
abstracting: (p1<=p14)
states: 291
abstracting: (p29<=0)
states: 1,876 (3)
abstracting: (p18<=p21)
states: 2,038 (3)
abstracting: (p26<=p31)
states: 1,977 (3)
........
EG iterations: 8
abstracting: (p18<=p21)
states: 2,038 (3)
abstracting: (p26<=p31)
states: 1,977 (3)
........
EG iterations: 8
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.061sec

checking: [~ [EX [~ [[E [EG [p17<=p15] U EG [p26<=0]] | 1<=p0]]]] & A [[p0<=1 | [p0<=1 & [[[EF [p10<=p0] & EX [1<=p18]] & p4<=p4] & ~ [[E [p25<=p23 U p16<=p23] & [1<=p31 & p10<=1]]]]]] U ~ [[~ [1<=p8] & AG [~ [1<=p4]]]]]]
normalized: [[~ [EG [[~ [E [true U 1<=p4]] & ~ [1<=p8]]]] & ~ [E [[~ [E [true U 1<=p4]] & ~ [1<=p8]] U [~ [[p0<=1 | [p0<=1 & [~ [[[1<=p31 & p10<=1] & E [p25<=p23 U p16<=p23]]] & [p4<=p4 & [EX [1<=p18] & E [true U p10<=p0]]]]]]] & [~ [E [true U 1<=p4]] & ~ [1<=p8]]]]]] & ~ [EX [~ [[1<=p0 | E [EG [p17<=p15] U EG [p26<=0]]]]]]]

abstracting: (p26<=0)
states: 1,685 (3)
........
EG iterations: 8
abstracting: (p17<=p15)
states: 2,024 (3)
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
.abstracting: (1<=p8)
states: 278
abstracting: (1<=p4)
states: 605
abstracting: (p10<=p0)
states: 2,024 (3)
abstracting: (1<=p18)
states: 290
.abstracting: (p4<=p4)
states: 2,314 (3)
abstracting: (p16<=p23)
states: 1,946 (3)
abstracting: (p25<=p23)
states: 1,396 (3)
abstracting: (p10<=1)
states: 2,314 (3)
abstracting: (1<=p31)
states: 1,170 (3)
abstracting: (p0<=1)
states: 2,314 (3)
abstracting: (p0<=1)
states: 2,314 (3)
abstracting: (1<=p8)
states: 278
abstracting: (1<=p4)
states: 605
abstracting: (1<=p8)
states: 278
abstracting: (1<=p4)
states: 605
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.042sec

checking: ~ [[E [AF [A [[p16<=1 | p12<=p20] U ~ [1<=p19]]] U [[[p9<=p3 | p25<=p31] | [[AF [1<=p20] & p12<=1] | [~ [p13<=p26] & 1<=p26]]] & [[AG [p6<=p17] & [~ [1<=p13] | E [p25<=0 U p20<=1]]] & ~ [[EF [p29<=p25] & E [p18<=p30 U p21<=p27]]]]]] & ~ [AG [EF [1<=p27]]]]]
normalized: ~ [[E [true U ~ [E [true U 1<=p27]]] & E [~ [EG [~ [[~ [EG [1<=p19]] & ~ [E [1<=p19 U [1<=p19 & ~ [[p16<=1 | p12<=p20]]]]]]]]] U [[~ [[E [p18<=p30 U p21<=p27] & E [true U p29<=p25]]] & [[E [p25<=0 U p20<=1] | ~ [1<=p13]] & ~ [E [true U ~ [p6<=p17]]]]] & [[[1<=p26 & ~ [p13<=p26]] | [p12<=1 & ~ [EG [~ [1<=p20]]]]] | [p9<=p3 | p25<=p31]]]]]]

abstracting: (p25<=p31)
states: 1,788 (3)
abstracting: (p9<=p3)
states: 1,954 (3)
abstracting: (1<=p20)
states: 98
.
EG iterations: 1
abstracting: (p12<=1)
states: 2,314 (3)
abstracting: (p13<=p26)
states: 2,100 (3)
abstracting: (1<=p26)
states: 629
abstracting: (p6<=p17)
states: 2,057 (3)
abstracting: (1<=p13)
states: 290
abstracting: (p20<=1)
states: 2,314 (3)
abstracting: (p25<=0)
states: 1,396 (3)
abstracting: (p29<=p25)
states: 2,072 (3)
abstracting: (p21<=p27)
states: 2,216 (3)
abstracting: (p18<=p30)
states: 2,078 (3)
abstracting: (p12<=p20)
states: 1,890 (3)
abstracting: (p16<=1)
states: 2,314 (3)
abstracting: (1<=p19)
states: 438
abstracting: (1<=p19)
states: 438
abstracting: (1<=p19)
states: 438
.......
EG iterations: 7
.
EG iterations: 1
abstracting: (1<=p27)
states: 438
-> the formula is FALSE

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

MC time: 0m 0.053sec

checking: [AF [[AX [EX [E [p15<=1 U p5<=1]]] & [[[E [1<=p11 U 1<=p7] | p11<=p25] | ~ [p15<=1]] & [[E [1<=p5 U p5<=p10] & AF [1<=p9]] | [[[p18<=0 & 1<=p12] & [p23<=p2 & 1<=p32]] & ~ [[1<=p8 & p4<=p2]]]]]]] & A [AF [[[EF [1<=p24] & A [p1<=0 U p28<=p7]] & [p31<=p30 | ~ [1<=p20]]]] U EG [~ [EG [~ [p22<=p20]]]]]]
normalized: [[~ [EG [~ [EG [~ [EG [~ [p22<=p20]]]]]]] & ~ [E [~ [EG [~ [EG [~ [p22<=p20]]]]] U [EG [~ [[[p31<=p30 | ~ [1<=p20]] & [[~ [EG [~ [p28<=p7]]] & ~ [E [~ [p28<=p7] U [~ [p1<=0] & ~ [p28<=p7]]]]] & E [true U 1<=p24]]]]] & ~ [EG [~ [EG [~ [p22<=p20]]]]]]]]] & ~ [EG [~ [[[[[~ [[1<=p8 & p4<=p2]] & [[p23<=p2 & 1<=p32] & [p18<=0 & 1<=p12]]] | [~ [EG [~ [1<=p9]]] & E [1<=p5 U p5<=p10]]] & [~ [p15<=1] | [p11<=p25 | E [1<=p11 U 1<=p7]]]] & ~ [EX [~ [EX [E [p15<=1 U p5<=1]]]]]]]]]]

abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (p15<=1)
states: 2,314 (3)
..abstracting: (1<=p7)
states: 290
abstracting: (1<=p11)
states: 290
abstracting: (p11<=p25)
states: 2,156 (3)
abstracting: (p15<=1)
states: 2,314 (3)
abstracting: (p5<=p10)
states: 1,786 (3)
abstracting: (1<=p5)
states: 593
abstracting: (1<=p9)
states: 437
........
EG iterations: 8
abstracting: (1<=p12)
states: 438
abstracting: (p18<=0)
states: 2,024 (3)
abstracting: (1<=p32)
states: 267
abstracting: (p23<=p2)
states: 2,078 (3)
abstracting: (p4<=p2)
states: 1,709 (3)
abstracting: (1<=p8)
states: 278
.....
EG iterations: 5
abstracting: (p22<=p20)
states: 2,216 (3)
.......
EG iterations: 7

EG iterations: 0
abstracting: (1<=p24)
states: 236
abstracting: (p28<=p7)
states: 675
abstracting: (p1<=0)
states: 1
abstracting: (p28<=p7)
states: 675
abstracting: (p28<=p7)
states: 675
.......
EG iterations: 7
abstracting: (1<=p20)
states: 98
abstracting: (p31<=p30)
states: 1,144 (3)
.....
EG iterations: 5
abstracting: (p22<=p20)
states: 2,216 (3)
.......
EG iterations: 7

EG iterations: 0
abstracting: (p22<=p20)
states: 2,216 (3)
.......
EG iterations: 7

EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA AutonomousCar-PT-02a-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.040sec

totally nodes used: 284936 (2.8e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 422848 989161 1412009
used/not used/entry size/cache size: 1224972 65883892 16 1024MB
basic ops cache: hits/miss/sum: 128853 219756 348609
used/not used/entry size/cache size: 422877 16354339 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: 3777 8411 12188
used/not used/entry size/cache size: 8411 8380197 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 66832103
1 269111
2 7150
3 475
4 25
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.157sec


BK_STOP 1678395333643

--------------------
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:1974 (28), effective:167 (2)

initing FirstDep: 0m 0.000sec


iterations count:1862 (26), effective:113 (1)

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

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

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

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

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

iterations count:1381 (20), effective:90 (1)

iterations count:806 (11), effective:43 (0)

iterations count:351 (5), effective:22 (0)

iterations count:1865 (27), effective:114 (1)

iterations count:1066 (15), effective:65 (0)

iterations count:111 (1), effective:6 (0)

iterations count:1337 (19), effective:76 (1)

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

iterations count:884 (12), effective:54 (0)

iterations count:382 (5), effective:26 (0)

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

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

iterations count:595 (8), effective:37 (0)

iterations count:501 (7), effective:36 (0)

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

iterations count:557 (8), effective:25 (0)

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

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

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

iterations count:551 (7), effective:31 (0)

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

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

iterations count:206 (2), effective:13 (0)

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

iterations count:1226 (17), effective:62 (0)

iterations count:653 (9), effective:46 (0)

iterations count:1404 (20), effective:83 (1)

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

iterations count:223 (3), effective:10 (0)

iterations count:1404 (20), effective:83 (1)

iterations count:1404 (20), effective:83 (1)

iterations count:655 (9), effective:36 (0)

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

iterations count:351 (5), effective:22 (0)

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

iterations count:1834 (26), effective:106 (1)

iterations count:1835 (26), effective:110 (1)

iterations count:1066 (15), effective:64 (0)

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

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

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

iterations count:1381 (20), effective:90 (1)

iterations count:69 (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="AutonomousCar-PT-02a"
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-02a, 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-167813588800545"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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