About the Execution of Marcie for AutonomousCar-PT-04a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5648.987 | 10803.00 | 10060.00 | 0.00 | TTFFTFFFTFTFFFFT | normal |
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-167813588900577.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-04a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r001-oct2-167813588900577
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.0K Feb 25 12:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:52 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.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:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:53 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 72K 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-04a-CTLCardinality-00
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-01
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-02
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-03
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-04
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-05
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-06
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-07
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-08
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-09
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-10
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-11
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-12
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-13
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-14
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678395372751
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-04a
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_04a
(NrP: 49 NrTr: 193 NrArc: 1306)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 2.911sec
RS generation: 0m 0.131sec
-> reachability set: #nodes 2756 (2.8e+03) #states 206,492 (5)
starting MCC model checker
--------------------------
checking: AF [EG [1<=p21]]
normalized: ~ [EG [~ [EG [1<=p21]]]]
abstracting: (1<=p21)
states: 34,822 (4)
.......
EG iterations: 7
.
EG iterations: 1
-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.128sec
checking: ~ [EF [[EG [AX [1<=p9]] & AF [AF [1<=p26]]]]]
normalized: ~ [E [true U [~ [EG [EG [~ [1<=p26]]]] & EG [~ [EX [~ [1<=p9]]]]]]]
abstracting: (1<=p9)
states: 27,504 (4)
..
EG iterations: 1
abstracting: (1<=p26)
states: 27,504 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA AutonomousCar-PT-04a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.045sec
checking: AF [AG [AF [p27<=p22]]]
normalized: ~ [EG [E [true U EG [~ [p27<=p22]]]]]
abstracting: (p27<=p22)
states: 178,988 (5)
............
EG iterations: 12
.
EG iterations: 1
-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.285sec
checking: EG [[EF [EF [p4<=1]] & [AX [EG [~ [p29<=1]]] | EF [AX [AF [p2<=p6]]]]]]
normalized: EG [[[E [true U ~ [EX [EG [~ [p2<=p6]]]]] | ~ [EX [~ [EG [~ [p29<=1]]]]]] & E [true U E [true U p4<=1]]]]
abstracting: (p4<=1)
states: 206,492 (5)
abstracting: (p29<=1)
states: 206,492 (5)
.
EG iterations: 1
.abstracting: (p2<=p6)
states: 178,784 (5)
.........
EG iterations: 9
..
EG iterations: 1
-> the formula is TRUE
FORMULA AutonomousCar-PT-04a-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.207sec
checking: EG [[[AG [EG [1<=p8]] | ~ [1<=p0]] | p42<=p25]]
normalized: EG [[p42<=p25 | [~ [1<=p0] | ~ [E [true U ~ [EG [1<=p8]]]]]]]
abstracting: (1<=p8)
states: 27,504 (4)
...
EG iterations: 3
abstracting: (1<=p0)
states: 1
abstracting: (p42<=p25)
states: 161,976 (5)
EG iterations: 0
-> the formula is TRUE
FORMULA AutonomousCar-PT-04a-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.066sec
checking: AG [EF [[EF [[AX [p47<=1] | 1<=p45]] | EX [[~ [1<=p17] & [1<=p5 | 1<=p9]]]]]]
normalized: ~ [E [true U ~ [E [true U [EX [[[1<=p5 | 1<=p9] & ~ [1<=p17]]] | E [true U [1<=p45 | ~ [EX [~ [p47<=1]]]]]]]]]]
abstracting: (p47<=1)
states: 206,492 (5)
.abstracting: (1<=p45)
states: 40,520 (4)
abstracting: (1<=p17)
states: 26,832 (4)
abstracting: (1<=p9)
states: 27,504 (4)
abstracting: (1<=p5)
states: 38,645 (4)
.-> the formula is TRUE
FORMULA AutonomousCar-PT-04a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.029sec
checking: [~ [AG [~ [EG [AG [1<=p27]]]]] & AF [[[AG [p6<=0] & AF [~ [1<=p39]]] & p38<=p13]]]
normalized: [~ [EG [~ [[p38<=p13 & [~ [EG [1<=p39]] & ~ [E [true U ~ [p6<=0]]]]]]]] & E [true U EG [~ [E [true U ~ [1<=p27]]]]]]
abstracting: (1<=p27)
states: 27,504 (4)
.
EG iterations: 1
abstracting: (p6<=0)
states: 167,847 (5)
abstracting: (1<=p39)
states: 34,784 (4)
........
EG iterations: 8
abstracting: (p38<=p13)
states: 202,376 (5)
..........
EG iterations: 10
-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.435sec
checking: ~ [EX [~ [[~ [[~ [p28<=p13] & ~ [EG [1<=p4]]]] | ~ [[AF [1<=p4] | EG [p10<=p16]]]]]]]
normalized: ~ [EX [~ [[~ [[EG [p10<=p16] | ~ [EG [~ [1<=p4]]]]] | ~ [[~ [EG [1<=p4]] & ~ [p28<=p13]]]]]]]
abstracting: (p28<=p13)
states: 176,665 (5)
abstracting: (1<=p4)
states: 38,645 (4)
.............
EG iterations: 13
abstracting: (1<=p4)
states: 38,645 (4)
.........
EG iterations: 9
abstracting: (p10<=p16)
states: 183,086 (5)
.......
EG iterations: 7
.-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.204sec
checking: E [AX [~ [p34<=1]] U [AX [[EF [EG [p16<=0]] | p43<=p24]] & AF [EG [[[p12<=0 | p4<=1] & ~ [1<=p24]]]]]]
normalized: E [~ [EX [p34<=1]] U [~ [EG [~ [EG [[~ [1<=p24] & [p12<=0 | p4<=1]]]]]] & ~ [EX [~ [[p43<=p24 | E [true U EG [p16<=0]]]]]]]]
abstracting: (p16<=0)
states: 178,988 (5)
.
EG iterations: 1
abstracting: (p43<=p24)
states: 171,332 (5)
.abstracting: (p4<=1)
states: 206,492 (5)
abstracting: (p12<=0)
states: 178,988 (5)
abstracting: (1<=p24)
states: 26,832 (4)
.......
EG iterations: 7
..................................................
EG iterations: 50
abstracting: (p34<=1)
states: 206,492 (5)
.-> the formula is TRUE
FORMULA AutonomousCar-PT-04a-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.559sec
checking: E [EF [p43<=p18] U AG [[[~ [AF [p36<=0]] & [p30<=0 & ~ [EF [1<=p12]]]] & [EX [[1<=p30 & p46<=1]] & [AF [p9<=0] & E [1<=p6 U p42<=1]]]]]]
normalized: E [E [true U p43<=p18] U ~ [E [true U ~ [[[[E [1<=p6 U p42<=1] & ~ [EG [~ [p9<=0]]]] & EX [[1<=p30 & p46<=1]]] & [[p30<=0 & ~ [E [true U 1<=p12]]] & EG [~ [p36<=0]]]]]]]]
abstracting: (p36<=0)
states: 201,690 (5)
...........
EG iterations: 11
abstracting: (1<=p12)
states: 27,504 (4)
abstracting: (p30<=0)
states: 178,988 (5)
abstracting: (p46<=1)
states: 206,492 (5)
abstracting: (1<=p30)
states: 27,504 (4)
.abstracting: (p9<=0)
states: 178,988 (5)
............
EG iterations: 12
abstracting: (p42<=1)
states: 206,492 (5)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p43<=p18)
states: 172,832 (5)
-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.277sec
checking: ~ [EG [[[1<=p37 | [EX [AG [p41<=p1]] | [[AG [p42<=p41] & EX [p43<=p40]] | AG [p29<=p33]]]] | p8<=p37]]]
normalized: ~ [EG [[p8<=p37 | [1<=p37 | [[~ [E [true U ~ [p29<=p33]]] | [EX [p43<=p40] & ~ [E [true U ~ [p42<=p41]]]]] | EX [~ [E [true U ~ [p41<=p1]]]]]]]]]
abstracting: (p41<=p1)
states: 206,492 (5)
.abstracting: (p42<=p41)
states: 152,499 (5)
abstracting: (p43<=p40)
states: 173,076 (5)
.abstracting: (p29<=p33)
states: 178,988 (5)
abstracting: (1<=p37)
states: 4,802 (3)
abstracting: (p8<=p37)
states: 179,674 (5)
........
EG iterations: 8
-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.298sec
checking: EG [[AG [A [1<=p33 U [AG [p21<=p30] & p35<=p39]]] | A [~ [[p39<=1 & [[p2<=p42 & p7<=1] & A [p9<=p1 U p46<=p23]]]] U ~ [AG [p38<=1]]]]]
normalized: EG [[[~ [EG [~ [E [true U ~ [p38<=1]]]]] & ~ [E [~ [E [true U ~ [p38<=1]]] U [[p39<=1 & [[~ [EG [~ [p46<=p23]]] & ~ [E [~ [p46<=p23] U [~ [p9<=p1] & ~ [p46<=p23]]]]] & [p2<=p42 & p7<=1]]] & ~ [E [true U ~ [p38<=1]]]]]]] | ~ [E [true U ~ [[~ [EG [~ [[p35<=p39 & ~ [E [true U ~ [p21<=p30]]]]]]] & ~ [E [~ [[p35<=p39 & ~ [E [true U ~ [p21<=p30]]]]] U [~ [1<=p33] & ~ [[p35<=p39 & ~ [E [true U ~ [p21<=p30]]]]]]]]]]]]]]
abstracting: (p21<=p30)
states: 176,665 (5)
abstracting: (p35<=p39)
states: 178,403 (5)
abstracting: (1<=p33)
states: 27,504 (4)
abstracting: (p21<=p30)
states: 176,665 (5)
abstracting: (p35<=p39)
states: 178,403 (5)
abstracting: (p21<=p30)
states: 176,665 (5)
abstracting: (p35<=p39)
states: 178,403 (5)
........
EG iterations: 8
abstracting: (p38<=1)
states: 206,492 (5)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (p2<=p42)
states: 188,389 (5)
abstracting: (p46<=p23)
states: 171,332 (5)
abstracting: (p9<=p1)
states: 206,492 (5)
abstracting: (p46<=p23)
states: 171,332 (5)
abstracting: (p46<=p23)
states: 171,332 (5)
....................................................
EG iterations: 52
abstracting: (p39<=1)
states: 206,492 (5)
abstracting: (p38<=1)
states: 206,492 (5)
abstracting: (p38<=1)
states: 206,492 (5)
EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.582sec
checking: ~ [[EF [A [AX [EG [1<=p46]] U [~ [p13<=1] | [p20<=p21 | [1<=p38 | 1<=p23]]]]] & [~ [EF [~ [[EF [p21<=p4] | [p16<=p36 | p15<=0]]]]] & ~ [EX [~ [[[p32<=p30 | p38<=1] & E [p2<=p19 U p17<=p26]]]]]]]]
normalized: ~ [[[~ [EX [~ [[E [p2<=p19 U p17<=p26] & [p32<=p30 | p38<=1]]]]] & ~ [E [true U ~ [[[p16<=p36 | p15<=0] | E [true U p21<=p4]]]]]] & E [true U [~ [EG [~ [[[p20<=p21 | [1<=p38 | 1<=p23]] | ~ [p13<=1]]]]] & ~ [E [~ [[[p20<=p21 | [1<=p38 | 1<=p23]] | ~ [p13<=1]]] U [EX [~ [EG [1<=p46]]] & ~ [[[p20<=p21 | [1<=p38 | 1<=p23]] | ~ [p13<=1]]]]]]]]]]
abstracting: (p13<=1)
states: 206,492 (5)
abstracting: (1<=p23)
states: 27,504 (4)
abstracting: (1<=p38)
states: 4,802 (3)
abstracting: (p20<=p21)
states: 178,988 (5)
abstracting: (1<=p46)
states: 40,520 (4)
....................................................
EG iterations: 52
.abstracting: (p13<=1)
states: 206,492 (5)
abstracting: (1<=p23)
states: 27,504 (4)
abstracting: (1<=p38)
states: 4,802 (3)
abstracting: (p20<=p21)
states: 178,988 (5)
abstracting: (p13<=1)
states: 206,492 (5)
abstracting: (1<=p23)
states: 27,504 (4)
abstracting: (1<=p38)
states: 4,802 (3)
abstracting: (p20<=p21)
states: 178,988 (5)
............
EG iterations: 12
abstracting: (p21<=p4)
states: 178,530 (5)
abstracting: (p15<=0)
states: 178,988 (5)
abstracting: (p16<=p36)
states: 179,674 (5)
abstracting: (p38<=1)
states: 206,492 (5)
abstracting: (p32<=p30)
states: 171,671 (5)
abstracting: (p17<=p26)
states: 183,086 (5)
abstracting: (p2<=p19)
states: 182,773 (5)
.-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.516sec
checking: A [~ [p27<=p18] U [A [[~ [[~ [p25<=1] & p9<=1]] & [[p12<=p37 & 1<=p21] & [EF [1<=p22] | AF [p25<=1]]]] U EX [[[1<=p47 | p12<=p37] & ~ [p38<=1]]]] | AF [[[AG [p16<=1] & EG [p14<=p42]] & [[~ [p16<=1] | AX [1<=p30]] | p0<=p39]]]]]
normalized: [~ [EG [~ [[~ [EG [~ [[[p0<=p39 | [~ [EX [~ [1<=p30]]] | ~ [p16<=1]]] & [EG [p14<=p42] & ~ [E [true U ~ [p16<=1]]]]]]]] | [~ [EG [~ [EX [[~ [p38<=1] & [1<=p47 | p12<=p37]]]]]] & ~ [E [~ [EX [[~ [p38<=1] & [1<=p47 | p12<=p37]]]] U [~ [[[[~ [EG [~ [p25<=1]]] | E [true U 1<=p22]] & [p12<=p37 & 1<=p21]] & ~ [[p9<=1 & ~ [p25<=1]]]]] & ~ [EX [[~ [p38<=1] & [1<=p47 | p12<=p37]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[p0<=p39 | [~ [EX [~ [1<=p30]]] | ~ [p16<=1]]] & [EG [p14<=p42] & ~ [E [true U ~ [p16<=1]]]]]]]] | [~ [EG [~ [EX [[~ [p38<=1] & [1<=p47 | p12<=p37]]]]]] & ~ [E [~ [EX [[~ [p38<=1] & [1<=p47 | p12<=p37]]]] U [~ [[[[~ [EG [~ [p25<=1]]] | E [true U 1<=p22]] & [p12<=p37 & 1<=p21]] & ~ [[p9<=1 & ~ [p25<=1]]]]] & ~ [EX [[~ [p38<=1] & [1<=p47 | p12<=p37]]]]]]]]]] U [p27<=p18 & ~ [[~ [EG [~ [[[p0<=p39 | [~ [EX [~ [1<=p30]]] | ~ [p16<=1]]] & [EG [p14<=p42] & ~ [E [true U ~ [p16<=1]]]]]]]] | [~ [EG [~ [EX [[~ [p38<=1] & [1<=p47 | p12<=p37]]]]]] & ~ [E [~ [EX [[~ [p38<=1] & [1<=p47 | p12<=p37]]]] U [~ [[[[~ [EG [~ [p25<=1]]] | E [true U 1<=p22]] & [p12<=p37 & 1<=p21]] & ~ [[p9<=1 & ~ [p25<=1]]]]] & ~ [EX [[~ [p38<=1] & [1<=p47 | p12<=p37]]]]]]]]]]]]]]
abstracting: (p12<=p37)
states: 179,674 (5)
abstracting: (1<=p47)
states: 95,446 (4)
abstracting: (p38<=1)
states: 206,492 (5)
.abstracting: (p25<=1)
states: 206,492 (5)
abstracting: (p9<=1)
states: 206,492 (5)
abstracting: (1<=p21)
states: 34,822 (4)
abstracting: (p12<=p37)
states: 179,674 (5)
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p25<=1)
states: 206,492 (5)
.
EG iterations: 1
abstracting: (p12<=p37)
states: 179,674 (5)
abstracting: (1<=p47)
states: 95,446 (4)
abstracting: (p38<=1)
states: 206,492 (5)
.abstracting: (p12<=p37)
states: 179,674 (5)
abstracting: (1<=p47)
states: 95,446 (4)
abstracting: (p38<=1)
states: 206,492 (5)
.
EG iterations: 0
abstracting: (p16<=1)
states: 206,492 (5)
abstracting: (p14<=p42)
states: 181,148 (5)
....
EG iterations: 4
abstracting: (p16<=1)
states: 206,492 (5)
abstracting: (1<=p30)
states: 27,504 (4)
.abstracting: (p0<=p39)
states: 206,491 (5)
..........
EG iterations: 10
abstracting: (p27<=p18)
states: 183,983 (5)
abstracting: (p12<=p37)
states: 179,674 (5)
abstracting: (1<=p47)
states: 95,446 (4)
abstracting: (p38<=1)
states: 206,492 (5)
.abstracting: (p25<=1)
states: 206,492 (5)
abstracting: (p9<=1)
states: 206,492 (5)
abstracting: (1<=p21)
states: 34,822 (4)
abstracting: (p12<=p37)
states: 179,674 (5)
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p25<=1)
states: 206,492 (5)
.
EG iterations: 1
abstracting: (p12<=p37)
states: 179,674 (5)
abstracting: (1<=p47)
states: 95,446 (4)
abstracting: (p38<=1)
states: 206,492 (5)
.abstracting: (p12<=p37)
states: 179,674 (5)
abstracting: (1<=p47)
states: 95,446 (4)
abstracting: (p38<=1)
states: 206,492 (5)
.
EG iterations: 0
abstracting: (p16<=1)
states: 206,492 (5)
abstracting: (p14<=p42)
states: 181,148 (5)
....
EG iterations: 4
abstracting: (p16<=1)
states: 206,492 (5)
abstracting: (1<=p30)
states: 27,504 (4)
.abstracting: (p0<=p39)
states: 206,491 (5)
..........
EG iterations: 10
abstracting: (p12<=p37)
states: 179,674 (5)
abstracting: (1<=p47)
states: 95,446 (4)
abstracting: (p38<=1)
states: 206,492 (5)
.abstracting: (p25<=1)
states: 206,492 (5)
abstracting: (p9<=1)
states: 206,492 (5)
abstracting: (1<=p21)
states: 34,822 (4)
abstracting: (p12<=p37)
states: 179,674 (5)
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p25<=1)
states: 206,492 (5)
.
EG iterations: 1
abstracting: (p12<=p37)
states: 179,674 (5)
abstracting: (1<=p47)
states: 95,446 (4)
abstracting: (p38<=1)
states: 206,492 (5)
.abstracting: (p12<=p37)
states: 179,674 (5)
abstracting: (1<=p47)
states: 95,446 (4)
abstracting: (p38<=1)
states: 206,492 (5)
.
EG iterations: 0
abstracting: (p16<=1)
states: 206,492 (5)
abstracting: (p14<=p42)
states: 181,148 (5)
....
EG iterations: 4
abstracting: (p16<=1)
states: 206,492 (5)
abstracting: (1<=p30)
states: 27,504 (4)
.abstracting: (p0<=p39)
states: 206,491 (5)
..........
EG iterations: 10
.
EG iterations: 1
-> the formula is TRUE
FORMULA AutonomousCar-PT-04a-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.384sec
checking: [[EG [[[AG [~ [p19<=p21]] | p3<=p43] | [AX [p9<=p15] & [EF [p47<=1] & A [p12<=p8 U p27<=p20]]]]] & [E [AF [[AG [1<=p21] | AX [1<=p25]]] U [[E [p44<=p16 U 1<=p22] | AX [p38<=1]] & ~ [EX [p5<=1]]]] | EX [1<=p22]]] & AF [1<=p3]]
normalized: [~ [EG [~ [1<=p3]]] & [[EX [1<=p22] | E [~ [EG [~ [[~ [EX [~ [1<=p25]]] | ~ [E [true U ~ [1<=p21]]]]]]] U [~ [EX [p5<=1]] & [~ [EX [~ [p38<=1]]] | E [p44<=p16 U 1<=p22]]]]] & EG [[[[[~ [EG [~ [p27<=p20]]] & ~ [E [~ [p27<=p20] U [~ [p12<=p8] & ~ [p27<=p20]]]]] & E [true U p47<=1]] & ~ [EX [~ [p9<=p15]]]] | [p3<=p43 | ~ [E [true U p19<=p21]]]]]]]
abstracting: (p19<=p21)
states: 178,988 (5)
abstracting: (p3<=p43)
states: 184,883 (5)
abstracting: (p9<=p15)
states: 182,510 (5)
.abstracting: (p47<=1)
states: 206,492 (5)
abstracting: (p27<=p20)
states: 182,510 (5)
abstracting: (p12<=p8)
states: 178,988 (5)
abstracting: (p27<=p20)
states: 182,510 (5)
abstracting: (p27<=p20)
states: 182,510 (5)
...........
EG iterations: 11
.
EG iterations: 1
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p44<=p16)
states: 62,665 (4)
abstracting: (p38<=1)
states: 206,492 (5)
.abstracting: (p5<=1)
states: 206,492 (5)
.abstracting: (1<=p21)
states: 34,822 (4)
abstracting: (1<=p25)
states: 34,821 (4)
....................................................
EG iterations: 51
abstracting: (1<=p22)
states: 27,504 (4)
.abstracting: (1<=p3)
states: 26,411 (4)
...............
EG iterations: 15
-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.111sec
checking: ~ [[[A [[[[AG [1<=p7] & AG [p44<=p12]] & ~ [[p42<=p30 | 1<=p22]]] | EF [[p10<=p30 | 1<=p7]]] U [E [[p3<=p24 | p48<=1] U [1<=p11 & p46<=0]] & [p27<=0 & 1<=p13]]] & [~ [E [AG [1<=p34] U AX [p10<=1]]] & ~ [E [~ [[p34<=1 | p47<=p34]] U [EX [p29<=1] & p37<=p14]]]]] | EF [[[[[~ [1<=p46] & EX [p44<=p18]] | [EG [p5<=1] & AX [p15<=p33]]] & 1<=p9] & [1<=p42 & p12<=0]]]]]
normalized: ~ [[E [true U [[1<=p42 & p12<=0] & [1<=p9 & [[~ [EX [~ [p15<=p33]]] & EG [p5<=1]] | [EX [p44<=p18] & ~ [1<=p46]]]]]] | [[~ [E [~ [[p34<=1 | p47<=p34]] U [p37<=p14 & EX [p29<=1]]]] & ~ [E [~ [E [true U ~ [1<=p34]]] U ~ [EX [~ [p10<=1]]]]]] & [~ [EG [~ [[[p27<=0 & 1<=p13] & E [[p3<=p24 | p48<=1] U [1<=p11 & p46<=0]]]]]] & ~ [E [~ [[[p27<=0 & 1<=p13] & E [[p3<=p24 | p48<=1] U [1<=p11 & p46<=0]]]] U [~ [[E [true U [p10<=p30 | 1<=p7]] | [~ [[p42<=p30 | 1<=p22]] & [~ [E [true U ~ [p44<=p12]]] & ~ [E [true U ~ [1<=p7]]]]]]] & ~ [[[p27<=0 & 1<=p13] & E [[p3<=p24 | p48<=1] U [1<=p11 & p46<=0]]]]]]]]]]]
abstracting: (p46<=0)
states: 165,972 (5)
abstracting: (1<=p11)
states: 34,821 (4)
abstracting: (p48<=1)
states: 206,492 (5)
abstracting: (p3<=p24)
states: 183,854 (5)
abstracting: (1<=p13)
states: 27,504 (4)
abstracting: (p27<=0)
states: 178,988 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p44<=p12)
states: 62,665 (4)
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p42<=p30)
states: 159,537 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p10<=p30)
states: 183,086 (5)
abstracting: (p46<=0)
states: 165,972 (5)
abstracting: (1<=p11)
states: 34,821 (4)
abstracting: (p48<=1)
states: 206,492 (5)
abstracting: (p3<=p24)
states: 183,854 (5)
abstracting: (1<=p13)
states: 27,504 (4)
abstracting: (p27<=0)
states: 178,988 (5)
abstracting: (p46<=0)
states: 165,972 (5)
abstracting: (1<=p11)
states: 34,821 (4)
abstracting: (p48<=1)
states: 206,492 (5)
abstracting: (p3<=p24)
states: 183,854 (5)
abstracting: (1<=p13)
states: 27,504 (4)
abstracting: (p27<=0)
states: 178,988 (5)
.......
EG iterations: 7
abstracting: (p10<=1)
states: 206,492 (5)
.abstracting: (1<=p34)
states: 27,504 (4)
abstracting: (p29<=1)
states: 206,492 (5)
.abstracting: (p37<=p14)
states: 202,376 (5)
abstracting: (p47<=p34)
states: 123,824 (5)
abstracting: (p34<=1)
states: 206,492 (5)
abstracting: (1<=p46)
states: 40,520 (4)
abstracting: (p44<=p18)
states: 68,482 (4)
.abstracting: (p5<=1)
states: 206,492 (5)
EG iterations: 0
abstracting: (p15<=p33)
states: 182,510 (5)
.abstracting: (1<=p9)
states: 27,504 (4)
abstracting: (p12<=0)
states: 178,988 (5)
abstracting: (1<=p42)
states: 53,993 (4)
-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.434sec
totally nodes used: 2803413 (2.8e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5529651 13010527 18540178
used/not used/entry size/cache size: 13817034 53291830 16 1024MB
basic ops cache: hits/miss/sum: 1099228 1809587 2908815
used/not used/entry size/cache size: 3162581 13614635 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: 28513 58447 86960
used/not used/entry size/cache size: 58277 8330331 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 64490721
1 2451009
2 150497
3 15241
4 1299
5 91
6 6
7 0
8 0
9 0
>= 10 0
Total processing time: 0m10.749sec
BK_STOP 1678395383554
--------------------
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:29402 (152), effective:1474 (7)
initing FirstDep: 0m 0.000sec
iterations count:9891 (51), effective:308 (1)
iterations count:193 (1), effective:0 (0)
iterations count:193 (1), effective:0 (0)
iterations count:6406 (33), effective:274 (1)
iterations count:682 (3), effective:14 (0)
iterations count:193 (1), effective:0 (0)
iterations count:193 (1), effective:0 (0)
iterations count:194 (1), effective:1 (0)
iterations count:14867 (77), effective:701 (3)
iterations count:197 (1), effective:1 (0)
iterations count:193 (1), effective:0 (0)
iterations count:7695 (39), effective:145 (0)
iterations count:193 (1), effective:0 (0)
iterations count:193 (1), effective:0 (0)
iterations count:194 (1), effective:1 (0)
iterations count:8230 (42), effective:104 (0)
iterations count:6813 (35), effective:141 (0)
iterations count:813 (4), effective:12 (0)
iterations count:813 (4), effective:12 (0)
iterations count:1032 (5), effective:6 (0)
iterations count:813 (4), effective:12 (0)
iterations count:671 (3), effective:11 (0)
iterations count:2385 (12), effective:22 (0)
iterations count:193 (1), effective:0 (0)
iterations count:194 (1), effective:1 (0)
iterations count:6638 (34), effective:135 (0)
iterations count:210 (1), effective:2 (0)
iterations count:7202 (37), effective:137 (0)
iterations count:5816 (30), effective:121 (0)
iterations count:7202 (37), effective:137 (0)
iterations count:5816 (30), effective:121 (0)
iterations count:199 (1), effective:2 (0)
iterations count:7202 (37), effective:137 (0)
iterations count:5816 (30), effective:121 (0)
iterations count:987 (5), effective:6 (0)
iterations count:193 (1), effective:0 (0)
iterations count:221 (1), effective:1 (0)
iterations count:6844 (35), effective:117 (0)
iterations count:6756 (35), effective:138 (0)
iterations count:7581 (39), effective:183 (0)
iterations count:7701 (39), effective:148 (0)
iterations count:3432 (17), effective:134 (0)
iterations count:341 (1), effective:3 (0)
iterations count:195 (1), effective:2 (0)
iterations count:7701 (39), effective:148 (0)
iterations count:7701 (39), effective:148 (0)
iterations count:194 (1), effective:1 (0)
iterations count:193 (1), effective:0 (0)
iterations count:193 (1), effective:0 (0)
iterations count:11417 (59), effective:401 (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-04a"
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-04a, 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-167813588900577"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-04a.tgz
mv AutonomousCar-PT-04a 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 '
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 ;