About the Execution of Marcie for ShieldPPPt-PT-001A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5449.771 | 4786.00 | 4070.00 | 10.00 | TFFFTTFTTFFFFFFT | 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.r385-oct2-167903710200529.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 ShieldPPPt-PT-001A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r385-oct2-167903710200529
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.8K Feb 25 20:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 20:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 20:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 20:53 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.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 20:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Feb 25 20:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 20:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 20:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 7.4K 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 ShieldPPPt-PT-001A-CTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679049000686
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=ShieldPPPt-PT-001A
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: ShieldPPPt_PT_001A
(NrP: 28 NrTr: 21 NrArc: 78)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.917sec
RS generation: 0m 0.001sec
-> reachability set: #nodes 76 (7.6e+01) #states 8,001 (3)
starting MCC model checker
--------------------------
checking: AG [EX [AG [EX [~ [1<=p22]]]]]
normalized: ~ [E [true U ~ [EX [~ [E [true U ~ [EX [~ [1<=p22]]]]]]]]]
abstracting: (1<=p22)
states: 4,000 (3)
..-> the formula is TRUE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EX [EF [~ [AX [p16<=1]]]]
normalized: EX [E [true U EX [~ [p16<=1]]]]
abstracting: (p16<=1)
states: 8,001 (3)
..-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AF [AG [[p25<=1 & EG [EF [p19<=1]]]]]
normalized: ~ [EG [E [true U ~ [[EG [E [true U p19<=1]] & p25<=1]]]]]
abstracting: (p25<=1)
states: 8,001 (3)
abstracting: (p19<=1)
states: 8,001 (3)
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [A [p5<=p25 U p16<=1]]]
normalized: E [true U ~ [[~ [EG [~ [p16<=1]]] & ~ [E [~ [p16<=1] U [~ [p16<=1] & ~ [p5<=p25]]]]]]]
abstracting: (p5<=p25)
states: 7,201 (3)
abstracting: (p16<=1)
states: 8,001 (3)
abstracting: (p16<=1)
states: 8,001 (3)
abstracting: (p16<=1)
states: 8,001 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: ~ [AF [EX [A [[EX [p27<=0] & [1<=p8 & 1<=p24]] U AG [p19<=1]]]]]
normalized: EG [~ [EX [[~ [EG [E [true U ~ [p19<=1]]]] & ~ [E [E [true U ~ [p19<=1]] U [E [true U ~ [p19<=1]] & ~ [[[1<=p8 & 1<=p24] & EX [p27<=0]]]]]]]]]]
abstracting: (p27<=0)
states: 4,001 (3)
.abstracting: (1<=p24)
states: 4,000 (3)
abstracting: (1<=p8)
states: 3,200 (3)
abstracting: (p19<=1)
states: 8,001 (3)
abstracting: (p19<=1)
states: 8,001 (3)
abstracting: (p19<=1)
states: 8,001 (3)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [AG [A [E [[p15<=p8 | 1<=p14] U EG [1<=p27]] U AF [EF [1<=p27]]]]]
normalized: ~ [E [true U E [true U ~ [[~ [EG [EG [~ [E [true U 1<=p27]]]]] & ~ [E [EG [~ [E [true U 1<=p27]]] U [~ [E [[p15<=p8 | 1<=p14] U EG [1<=p27]]] & EG [~ [E [true U 1<=p27]]]]]]]]]]]
abstracting: (1<=p27)
states: 4,000 (3)
.
EG iterations: 1
abstracting: (1<=p27)
states: 4,000 (3)
..................................
EG iterations: 34
abstracting: (1<=p14)
states: 3,200 (3)
abstracting: (p15<=p8)
states: 7,041 (3)
abstracting: (1<=p27)
states: 4,000 (3)
.
EG iterations: 1
abstracting: (1<=p27)
states: 4,000 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: EX [~ [EX [E [~ [p21<=p22] U [p15<=p22 & 1<=p9]]]]]
normalized: EX [~ [EX [E [~ [p21<=p22] U [p15<=p22 & 1<=p9]]]]]
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p15<=p22)
states: 7,201 (3)
abstracting: (p21<=p22)
states: 6,001 (3)
..-> the formula is TRUE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: ~ [EF [[EX [AG [p8<=1]] & [EX [[p25<=p14 | p22<=p1]] | [~ [[p7<=1 | 1<=p26]] & [p13<=1 | EF [1<=p7]]]]]]]
normalized: ~ [E [true U [[[~ [[p7<=1 | 1<=p26]] & [E [true U 1<=p7] | p13<=1]] | EX [[p25<=p14 | p22<=p1]]] & EX [~ [E [true U ~ [p8<=1]]]]]]]
abstracting: (p8<=1)
states: 8,001 (3)
.abstracting: (p22<=p1)
states: 6,001 (3)
abstracting: (p25<=p14)
states: 5,601 (3)
.abstracting: (p13<=1)
states: 8,001 (3)
abstracting: (1<=p7)
states: 3,200 (3)
abstracting: (1<=p26)
states: 4,000 (3)
abstracting: (p7<=1)
states: 8,001 (3)
-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: ~ [[AG [[E [[EG [p23<=p9] | ~ [1<=p14]] U [AG [p3<=1] & [p21<=1 | 1<=p24]]] | p3<=1]] | [~ [AG [p9<=p13]] | AX [1<=p6]]]]
normalized: ~ [[~ [E [true U ~ [[E [[~ [1<=p14] | EG [p23<=p9]] U [[p21<=1 | 1<=p24] & ~ [E [true U ~ [p3<=1]]]]] | p3<=1]]]] | [~ [EX [~ [1<=p6]]] | E [true U ~ [p9<=p13]]]]]
abstracting: (p9<=p13)
states: 6,081 (3)
abstracting: (1<=p6)
states: 3,200 (3)
.abstracting: (p3<=1)
states: 8,001 (3)
abstracting: (p3<=1)
states: 8,001 (3)
abstracting: (1<=p24)
states: 4,000 (3)
abstracting: (p21<=1)
states: 8,001 (3)
abstracting: (p23<=p9)
states: 5,601 (3)
..
EG iterations: 2
abstracting: (1<=p14)
states: 3,200 (3)
-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[EG [AX [~ [AF [p15<=0]]]] & [~ [EX [~ [[p22<=0 | p7<=0]]]] & E [[[p14<=0 | p26<=p4] | [EF [p11<=0] | [1<=p23 | p22<=p11]]] U p13<=1]]]]
normalized: E [true U [[E [[[[1<=p23 | p22<=p11] | E [true U p11<=0]] | [p14<=0 | p26<=p4]] U p13<=1] & ~ [EX [~ [[p22<=0 | p7<=0]]]]] & EG [~ [EX [~ [EG [~ [p15<=0]]]]]]]]
abstracting: (p15<=0)
states: 6,401 (3)
.........
EG iterations: 9
..
EG iterations: 1
abstracting: (p7<=0)
states: 4,801 (3)
abstracting: (p22<=0)
states: 4,001 (3)
.abstracting: (p13<=1)
states: 8,001 (3)
abstracting: (p26<=p4)
states: 6,001 (3)
abstracting: (p14<=0)
states: 4,801 (3)
abstracting: (p11<=0)
states: 4,801 (3)
abstracting: (p22<=p11)
states: 5,601 (3)
abstracting: (1<=p23)
states: 4,000 (3)
-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AF [[AG [p10<=1] & [E [[~ [E [p24<=1 U p24<=1]] & E [1<=p17 U 1<=p22]] U A [A [1<=p21 U p16<=p19] U ~ [1<=p19]]] | [[~ [EX [1<=p8]] & ~ [[p22<=p1 & 1<=p24]]] | 1<=p6]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [p10<=1]]] & [[[~ [[p22<=p1 & 1<=p24]] & ~ [EX [1<=p8]]] | 1<=p6] | E [[E [1<=p17 U 1<=p22] & ~ [E [p24<=1 U p24<=1]]] U [~ [EG [1<=p19]] & ~ [E [1<=p19 U [~ [[~ [EG [~ [p16<=p19]]] & ~ [E [~ [p16<=p19] U [~ [1<=p21] & ~ [p16<=p19]]]]]] & 1<=p19]]]]]]]]]]
abstracting: (1<=p19)
states: 3,200 (3)
abstracting: (p16<=p19)
states: 6,401 (3)
abstracting: (1<=p21)
states: 4,000 (3)
abstracting: (p16<=p19)
states: 6,401 (3)
abstracting: (p16<=p19)
states: 6,401 (3)
.........
EG iterations: 9
abstracting: (1<=p19)
states: 3,200 (3)
abstracting: (1<=p19)
states: 3,200 (3)
.........
EG iterations: 9
abstracting: (p24<=1)
states: 8,001 (3)
abstracting: (p24<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (1<=p17)
states: 3,200 (3)
abstracting: (1<=p6)
states: 3,200 (3)
abstracting: (1<=p8)
states: 3,200 (3)
.abstracting: (1<=p24)
states: 4,000 (3)
abstracting: (p22<=p1)
states: 6,001 (3)
abstracting: (p10<=1)
states: 8,001 (3)
.............................................
EG iterations: 45
-> the formula is TRUE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: ~ [[AX [AX [A [~ [p22<=0] U EF [1<=p15]]]] | [~ [[AX [[p0<=0 & [p1<=p22 | 1<=p23]]] & A [AG [p7<=p0] U AF [1<=p9]]]] | [AF [AX [p23<=p20]] & ~ [[AG [p22<=1] | [AG [p23<=1] & AG [1<=p13]]]]]]]]
normalized: ~ [[~ [EX [EX [~ [[~ [EG [~ [E [true U 1<=p15]]]] & ~ [E [~ [E [true U 1<=p15]] U [~ [E [true U 1<=p15]] & p22<=0]]]]]]]] | [[~ [[[~ [E [true U ~ [p23<=1]]] & ~ [E [true U ~ [1<=p13]]]] | ~ [E [true U ~ [p22<=1]]]]] & ~ [EG [EX [~ [p23<=p20]]]]] | ~ [[[~ [EG [EG [~ [1<=p9]]]] & ~ [E [EG [~ [1<=p9]] U [E [true U ~ [p7<=p0]] & EG [~ [1<=p9]]]]]] & ~ [EX [~ [[[p1<=p22 | 1<=p23] & p0<=0]]]]]]]]]
abstracting: (p0<=0)
states: 8,000 (3)
abstracting: (1<=p23)
states: 4,000 (3)
abstracting: (p1<=p22)
states: 6,001 (3)
.abstracting: (1<=p9)
states: 3,200 (3)
.
EG iterations: 1
abstracting: (p7<=p0)
states: 4,801 (3)
abstracting: (1<=p9)
states: 3,200 (3)
.
EG iterations: 1
abstracting: (1<=p9)
states: 3,200 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p23<=p20)
states: 6,001 (3)
..
EG iterations: 1
abstracting: (p22<=1)
states: 8,001 (3)
abstracting: (1<=p13)
states: 3,200 (3)
abstracting: (p23<=1)
states: 8,001 (3)
abstracting: (p22<=0)
states: 4,001 (3)
abstracting: (1<=p15)
states: 1,600 (3)
abstracting: (1<=p15)
states: 1,600 (3)
abstracting: (1<=p15)
states: 1,600 (3)
.
EG iterations: 1
..-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EF [[[~ [[[EF [p21<=p17] | AF [1<=p1]] & AX [1<=p14]]] & ~ [[[AG [1<=p22] & 1<=p13] | AF [E [p17<=1 U p20<=p16]]]]] | A [~ [E [E [1<=p16 U p26<=1] U E [1<=p22 U p4<=0]]] U AG [p18<=p9]]]]
normalized: E [true U [[~ [EG [E [true U ~ [p18<=p9]]]] & ~ [E [E [true U ~ [p18<=p9]] U [E [E [1<=p16 U p26<=1] U E [1<=p22 U p4<=0]] & E [true U ~ [p18<=p9]]]]]] | [~ [[~ [EG [~ [E [p17<=1 U p20<=p16]]]] | [~ [E [true U ~ [1<=p22]]] & 1<=p13]]] & ~ [[~ [EX [~ [1<=p14]]] & [~ [EG [~ [1<=p1]]] | E [true U p21<=p17]]]]]]]
abstracting: (p21<=p17)
states: 5,601 (3)
abstracting: (1<=p1)
states: 4,000 (3)
..
EG iterations: 2
abstracting: (1<=p14)
states: 3,200 (3)
.abstracting: (1<=p13)
states: 3,200 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p20<=p16)
states: 5,601 (3)
abstracting: (p17<=1)
states: 8,001 (3)
.
EG iterations: 1
abstracting: (p18<=p9)
states: 6,081 (3)
abstracting: (p4<=0)
states: 4,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p26<=1)
states: 8,001 (3)
abstracting: (1<=p16)
states: 3,200 (3)
abstracting: (p18<=p9)
states: 6,081 (3)
abstracting: (p18<=p9)
states: 6,081 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AG [[A [[[[[p25<=1 & p21<=p8] | AF [p11<=p26]] | [EG [p15<=p24] | p12<=p18]] & AF [[p10<=p10 | p27<=0]]] U ~ [[AX [p7<=1] & ~ [E [1<=p2 U p16<=0]]]]] & ~ [EF [p4<=0]]]]
normalized: ~ [E [true U ~ [[~ [E [true U p4<=0]] & [~ [EG [[~ [E [1<=p2 U p16<=0]] & ~ [EX [~ [p7<=1]]]]]] & ~ [E [[~ [E [1<=p2 U p16<=0]] & ~ [EX [~ [p7<=1]]]] U [~ [[~ [EG [~ [[p10<=p10 | p27<=0]]]] & [[EG [p15<=p24] | p12<=p18] | [~ [EG [~ [p11<=p26]]] | [p25<=1 & p21<=p8]]]]] & [~ [E [1<=p2 U p16<=0]] & ~ [EX [~ [p7<=1]]]]]]]]]]]]
abstracting: (p7<=1)
states: 8,001 (3)
.abstracting: (p16<=0)
states: 4,801 (3)
abstracting: (1<=p2)
states: 4,000 (3)
abstracting: (p21<=p8)
states: 5,601 (3)
abstracting: (p25<=1)
states: 8,001 (3)
abstracting: (p11<=p26)
states: 6,401 (3)
............................
EG iterations: 28
abstracting: (p12<=p18)
states: 6,081 (3)
abstracting: (p15<=p24)
states: 7,201 (3)
.........
EG iterations: 9
abstracting: (p27<=0)
states: 4,001 (3)
abstracting: (p10<=p10)
states: 8,001 (3)
.
EG iterations: 1
abstracting: (p7<=1)
states: 8,001 (3)
.abstracting: (p16<=0)
states: 4,801 (3)
abstracting: (1<=p2)
states: 4,000 (3)
abstracting: (p7<=1)
states: 8,001 (3)
.abstracting: (p16<=0)
states: 4,801 (3)
abstracting: (1<=p2)
states: 4,000 (3)
............................................
EG iterations: 44
abstracting: (p4<=0)
states: 4,001 (3)
-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: A [EG [[~ [[[[p27<=p23 & p25<=p26] | [p24<=p22 | p13<=p7]] & [[p24<=p18 | 1<=p24] | [p22<=p13 | p3<=0]]]] & [[~ [p25<=1] & [1<=p26 & ~ [p25<=0]]] & ~ [[EX [p9<=p1] | p12<=p13]]]]] U p24<=p2]
normalized: [~ [EG [~ [p24<=p2]]] & ~ [E [~ [p24<=p2] U [~ [EG [[[~ [[EX [p9<=p1] | p12<=p13]] & [[~ [p25<=0] & 1<=p26] & ~ [p25<=1]]] & ~ [[[[p22<=p13 | p3<=0] | [p24<=p18 | 1<=p24]] & [[p24<=p22 | p13<=p7] | [p27<=p23 & p25<=p26]]]]]]] & ~ [p24<=p2]]]]]
abstracting: (p24<=p2)
states: 6,001 (3)
abstracting: (p25<=p26)
states: 6,001 (3)
abstracting: (p27<=p23)
states: 6,001 (3)
abstracting: (p13<=p7)
states: 6,081 (3)
abstracting: (p24<=p22)
states: 6,001 (3)
abstracting: (1<=p24)
states: 4,000 (3)
abstracting: (p24<=p18)
states: 5,601 (3)
abstracting: (p3<=0)
states: 4,001 (3)
abstracting: (p22<=p13)
states: 5,601 (3)
abstracting: (p25<=1)
states: 8,001 (3)
abstracting: (1<=p26)
states: 4,000 (3)
abstracting: (p25<=0)
states: 4,001 (3)
abstracting: (p12<=p13)
states: 6,401 (3)
abstracting: (p9<=p1)
states: 6,401 (3)
..
EG iterations: 1
abstracting: (p24<=p2)
states: 6,001 (3)
abstracting: (p24<=p2)
states: 6,001 (3)
...............................
EG iterations: 31
-> the formula is TRUE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: A [[[AF [[A [p26<=0 U p24<=0] | p0<=0]] & p5<=1] & [p19<=p16 | E [p12<=0 U EG [[p27<=p15 & 1<=p15]]]]] U [EG [[[~ [EX [p12<=1]] & [[p12<=p2 | p14<=1] | ~ [p5<=p17]]] | ~ [[1<=p17 & AG [1<=p12]]]]] & AG [[p10<=p15 | [[[p5<=p2 | p2<=0] & [p19<=1 & p10<=p11]] | ~ [p9<=p16]]]]]]
normalized: [~ [EG [~ [[~ [E [true U ~ [[[~ [p9<=p16] | [[p19<=1 & p10<=p11] & [p5<=p2 | p2<=0]]] | p10<=p15]]]] & EG [[~ [[~ [E [true U ~ [1<=p12]]] & 1<=p17]] | [[~ [p5<=p17] | [p12<=p2 | p14<=1]] & ~ [EX [p12<=1]]]]]]]]] & ~ [E [~ [[~ [E [true U ~ [[[~ [p9<=p16] | [[p19<=1 & p10<=p11] & [p5<=p2 | p2<=0]]] | p10<=p15]]]] & EG [[~ [[~ [E [true U ~ [1<=p12]]] & 1<=p17]] | [[~ [p5<=p17] | [p12<=p2 | p14<=1]] & ~ [EX [p12<=1]]]]]]] U [~ [[[E [p12<=0 U EG [[p27<=p15 & 1<=p15]]] | p19<=p16] & [~ [EG [~ [[[~ [EG [~ [p24<=0]]] & ~ [E [~ [p24<=0] U [~ [p26<=0] & ~ [p24<=0]]]]] | p0<=0]]]] & p5<=1]]] & ~ [[~ [E [true U ~ [[[~ [p9<=p16] | [[p19<=1 & p10<=p11] & [p5<=p2 | p2<=0]]] | p10<=p15]]]] & EG [[~ [[~ [E [true U ~ [1<=p12]]] & 1<=p17]] | [[~ [p5<=p17] | [p12<=p2 | p14<=1]] & ~ [EX [p12<=1]]]]]]]]]]]
abstracting: (p12<=1)
states: 8,001 (3)
.abstracting: (p14<=1)
states: 8,001 (3)
abstracting: (p12<=p2)
states: 6,401 (3)
abstracting: (p5<=p17)
states: 7,041 (3)
abstracting: (1<=p17)
states: 3,200 (3)
abstracting: (1<=p12)
states: 3,200 (3)
EG iterations: 0
abstracting: (p10<=p15)
states: 6,721 (3)
abstracting: (p2<=0)
states: 4,001 (3)
abstracting: (p5<=p2)
states: 7,201 (3)
abstracting: (p10<=p11)
states: 6,401 (3)
abstracting: (p19<=1)
states: 8,001 (3)
abstracting: (p9<=p16)
states: 6,081 (3)
abstracting: (p5<=1)
states: 8,001 (3)
abstracting: (p0<=0)
states: 8,000 (3)
abstracting: (p24<=0)
states: 4,001 (3)
abstracting: (p26<=0)
states: 4,001 (3)
abstracting: (p24<=0)
states: 4,001 (3)
abstracting: (p24<=0)
states: 4,001 (3)
.......................................
EG iterations: 39
.
EG iterations: 1
abstracting: (p19<=p16)
states: 6,401 (3)
abstracting: (1<=p15)
states: 1,600 (3)
abstracting: (p27<=p15)
states: 4,801 (3)
.........
EG iterations: 9
abstracting: (p12<=0)
states: 4,801 (3)
abstracting: (p12<=1)
states: 8,001 (3)
.abstracting: (p14<=1)
states: 8,001 (3)
abstracting: (p12<=p2)
states: 6,401 (3)
abstracting: (p5<=p17)
states: 7,041 (3)
abstracting: (1<=p17)
states: 3,200 (3)
abstracting: (1<=p12)
states: 3,200 (3)
EG iterations: 0
abstracting: (p10<=p15)
states: 6,721 (3)
abstracting: (p2<=0)
states: 4,001 (3)
abstracting: (p5<=p2)
states: 7,201 (3)
abstracting: (p10<=p11)
states: 6,401 (3)
abstracting: (p19<=1)
states: 8,001 (3)
abstracting: (p9<=p16)
states: 6,081 (3)
abstracting: (p12<=1)
states: 8,001 (3)
.abstracting: (p14<=1)
states: 8,001 (3)
abstracting: (p12<=p2)
states: 6,401 (3)
abstracting: (p5<=p17)
states: 7,041 (3)
abstracting: (1<=p17)
states: 3,200 (3)
abstracting: (1<=p12)
states: 3,200 (3)
EG iterations: 0
abstracting: (p10<=p15)
states: 6,721 (3)
abstracting: (p2<=0)
states: 4,001 (3)
abstracting: (p5<=p2)
states: 7,201 (3)
abstracting: (p10<=p11)
states: 6,401 (3)
abstracting: (p19<=1)
states: 8,001 (3)
abstracting: (p9<=p16)
states: 6,081 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
totally nodes used: 55014 (5.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 33620 106604 140224
used/not used/entry size/cache size: 153094 66955770 16 1024MB
basic ops cache: hits/miss/sum: 13424 32685 46109
used/not used/entry size/cache size: 67791 16709425 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: 671 1347 2018
used/not used/entry size/cache size: 1347 8387261 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 67055160
1 52437
2 1224
3 43
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.733sec
BK_STOP 1679049005472
--------------------
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:318 (15), effective:75 (3)
initing FirstDep: 0m 0.000sec
iterations count:21 (1), effective:0 (0)
iterations count:40 (1), effective:2 (0)
iterations count:40 (1), effective:2 (0)
iterations count:40 (1), effective:2 (0)
iterations count:46 (2), effective:8 (0)
iterations count:92 (4), effective:15 (0)
iterations count:21 (1), effective:0 (0)
iterations count:112 (5), effective:22 (1)
iterations count:21 (1), effective:0 (0)
iterations count:37 (1), effective:2 (0)
iterations count:21 (1), effective:0 (0)
iterations count:80 (3), effective:13 (0)
iterations count:21 (1), effective:0 (0)
iterations count:75 (3), effective:10 (0)
iterations count:21 (1), effective:0 (0)
iterations count:92 (4), effective:15 (0)
iterations count:21 (1), effective:0 (0)
iterations count:27 (1), effective:2 (0)
iterations count:70 (3), effective:11 (0)
iterations count:70 (3), effective:11 (0)
iterations count:70 (3), effective:11 (0)
iterations count:28 (1), effective:3 (0)
iterations count:23 (1), effective:1 (0)
iterations count:50 (2), effective:9 (0)
iterations count:58 (2), effective:8 (0)
iterations count:21 (1), effective:0 (0)
iterations count:21 (1), effective:0 (0)
iterations count:31 (1), effective:2 (0)
iterations count:58 (2), effective:8 (0)
iterations count:21 (1), effective:0 (0)
iterations count:58 (2), effective:8 (0)
iterations count:26 (1), effective:2 (0)
iterations count:26 (1), effective:2 (0)
iterations count:26 (1), effective:2 (0)
iterations count:31 (1), effective:2 (0)
iterations count:21 (1), effective:0 (0)
iterations count:21 (1), effective:0 (0)
iterations count:29 (1), effective:3 (0)
iterations count:80 (3), effective:11 (0)
iterations count:52 (2), effective:8 (0)
iterations count:65 (3), effective:10 (0)
iterations count:29 (1), effective:3 (0)
iterations count:80 (3), effective:11 (0)
iterations count:99 (4), effective:16 (0)
iterations count:29 (1), effective:3 (0)
iterations count:80 (3), effective:11 (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="ShieldPPPt-PT-001A"
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 ShieldPPPt-PT-001A, 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 r385-oct2-167903710200529"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-001A.tgz
mv ShieldPPPt-PT-001A 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 ;