About the Execution of Marcie for RefineWMG-PT-005006
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5482.115 | 5748.00 | 4999.00 | 70.10 | FFFTTTTTFTFTTFFF | 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.r321-tall-167889192300553.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 RefineWMG-PT-005006, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r321-tall-167889192300553
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 6.2K Feb 26 16:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 16:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 15:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 15:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 16:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 16:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14K 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 RefineWMG-PT-005006-CTLCardinality-00
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-01
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-02
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-03
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-04
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-05
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-06
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-07
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-08
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-09
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-10
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-11
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-12
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-13
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-14
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678938916720
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=RefineWMG-PT-005006
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: RefineWMG_PT_005006
(NrP: 29 NrTr: 23 NrArc: 68)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.842sec
RS generation: 0m 0.020sec
-> reachability set: #nodes 584 (5.8e+02) #states 2,908,365,163,704 (12)
starting MCC model checker
--------------------------
checking: ~ [EF [6<=pterce]]
normalized: ~ [E [true U 6<=pterce]]
abstracting: (6<=pterce)
states: 0
-> the formula is TRUE
FORMULA RefineWMG-PT-005006-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: EF [AF [3<=p17]]
normalized: E [true U ~ [EG [~ [3<=p17]]]]
abstracting: (3<=p17)
states: 1,661,922,950,688 (12)
.
EG iterations: 1
-> the formula is TRUE
FORMULA RefineWMG-PT-005006-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.026sec
checking: AG [AF [2<=p3]]
normalized: ~ [E [true U EG [~ [2<=p3]]]]
abstracting: (2<=p3)
states: 2,077,403,688,360 (12)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-005006-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.045sec
checking: EX [[~ [EF [6<=p1]] & EG [AX [[A [p5<=5 U psecond<=3] & p20<=1]]]]]
normalized: EX [[EG [~ [EX [~ [[[~ [E [~ [psecond<=3] U [~ [p5<=5] & ~ [psecond<=3]]]] & ~ [EG [~ [psecond<=3]]]] & p20<=1]]]]] & ~ [E [true U 6<=p1]]]]
abstracting: (6<=p1)
states: 11,863,960,458 (10)
abstracting: (p20<=1)
states: 830,961,475,344 (11)
abstracting: (psecond<=3)
states: 1,938,910,109,136 (12)
.
EG iterations: 1
abstracting: (psecond<=3)
states: 1,938,910,109,136 (12)
abstracting: (p5<=5)
states: 2,492,884,426,032 (12)
abstracting: (psecond<=3)
states: 1,938,910,109,136 (12)
..
EG iterations: 1
.-> the formula is FALSE
FORMULA RefineWMG-PT-005006-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: ~ [AG [AX [[EX [[p2<=p23 | 7<=p9]] | 7<=p14]]]]
normalized: E [true U EX [~ [[EX [[p2<=p23 | 7<=p9]] | 7<=p14]]]]
abstracting: (7<=p14)
states: 0
abstracting: (7<=p9)
states: 0
abstracting: (p2<=p23)
states: 1,661,922,950,688 (12)
..-> the formula is TRUE
FORMULA RefineWMG-PT-005006-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.107sec
checking: EX [~ [AG [[EF [~ [7<=psecond]] & [AG [7<=p23] | EX [p7<=p12]]]]]]
normalized: EX [E [true U ~ [[[EX [p7<=p12] | ~ [E [true U ~ [7<=p23]]]] & E [true U ~ [7<=psecond]]]]]]
abstracting: (7<=psecond)
states: 0
abstracting: (7<=p23)
states: 0
abstracting: (p7<=p12)
states: 1,661,922,950,688 (12)
..-> the formula is TRUE
FORMULA RefineWMG-PT-005006-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.027sec
checking: EF [[AX [EX [[p25<=0 & ~ [p19<=6]]]] & AG [[EF [[3<=p9 | pprime<=p8]] | ~ [EG [psecond<=p24]]]]]]
normalized: E [true U [~ [E [true U ~ [[~ [EG [psecond<=p24]] | E [true U [3<=p9 | pprime<=p8]]]]]] & ~ [EX [~ [EX [[p25<=0 & ~ [p19<=6]]]]]]]]
abstracting: (p19<=6)
states: 2,908,365,163,704 (12)
abstracting: (p25<=0)
states: 415,480,737,672 (11)
..abstracting: (pprime<=p8)
states: 2,492,884,426,032 (12)
abstracting: (3<=p9)
states: 1,661,922,950,688 (12)
abstracting: (psecond<=p24)
states: 1,869,663,319,524 (12)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-005006-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: EF [[[p6<=1 | [[6<=p17 | [AX [5<=p13] | [~ [3<=p15] & [2<=p & p12<=1]]]] & ~ [A [6<=p15 U p18<=7]]]] & EG [~ [EF [~ [1<=p16]]]]]]
normalized: E [true U [EG [~ [E [true U ~ [1<=p16]]]] & [p6<=1 | [~ [[~ [EG [~ [p18<=7]]] & ~ [E [~ [p18<=7] U [~ [6<=p15] & ~ [p18<=7]]]]]] & [6<=p17 | [[[2<=p & p12<=1] & ~ [3<=p15]] | ~ [EX [~ [5<=p13]]]]]]]]]
abstracting: (5<=p13)
states: 830,961,475,344 (11)
.abstracting: (3<=p15)
states: 1,661,922,950,688 (12)
abstracting: (p12<=1)
states: 830,961,475,344 (11)
abstracting: (2<=p)
states: 783,021,390,228 (11)
abstracting: (6<=p17)
states: 415,480,737,672 (11)
abstracting: (p18<=7)
states: 2,908,365,163,704 (12)
abstracting: (6<=p15)
states: 415,480,737,672 (11)
abstracting: (p18<=7)
states: 2,908,365,163,704 (12)
abstracting: (p18<=7)
states: 2,908,365,163,704 (12)
.
EG iterations: 1
abstracting: (p6<=1)
states: 2,125,343,773,476 (12)
abstracting: (1<=p16)
states: 1,566,042,780,456 (12)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-005006-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: AF [[~ [3<=pterce] & EF [E [~ [E [p13<=2 U p15<=p8]] U [E [p17<=p22 U 7<=p20] | [6<=p17 & 5<=p23]]]]]]
normalized: ~ [EG [~ [[E [true U E [~ [E [p13<=2 U p15<=p8]] U [[6<=p17 & 5<=p23] | E [p17<=p22 U 7<=p20]]]] & ~ [3<=pterce]]]]]
abstracting: (3<=pterce)
states: 1,454,182,581,852 (12)
abstracting: (7<=p20)
states: 0
abstracting: (p17<=p22)
states: 1,661,922,950,688 (12)
abstracting: (5<=p23)
states: 830,961,475,344 (11)
abstracting: (6<=p17)
states: 415,480,737,672 (11)
abstracting: (p15<=p8)
states: 1,661,922,950,688 (12)
abstracting: (p13<=2)
states: 1,246,442,213,016 (12)
.
EG iterations: 1
-> the formula is TRUE
FORMULA RefineWMG-PT-005006-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.158sec
checking: E [EG [EG [[[[p1<=1 | p18<=p8] | ~ [7<=p15]] & AF [p20<=2]]]] U [[~ [AX [AF [4<=p10]]] & p19<=p19] & ~ [5<=p3]]]
normalized: E [EG [EG [[~ [EG [~ [p20<=2]]] & [~ [7<=p15] | [p1<=1 | p18<=p8]]]]] U [~ [5<=p3] & [p19<=p19 & EX [EG [~ [4<=p10]]]]]]
abstracting: (4<=p10)
states: 1,246,442,213,016 (12)
.
EG iterations: 1
.abstracting: (p19<=p19)
states: 2,908,365,163,704 (12)
abstracting: (5<=p3)
states: 830,961,475,344 (11)
abstracting: (p18<=p8)
states: 1,661,922,950,688 (12)
abstracting: (p1<=1)
states: 2,125,343,773,476 (12)
abstracting: (7<=p15)
states: 0
abstracting: (p20<=2)
states: 1,246,442,213,016 (12)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA RefineWMG-PT-005006-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: AG [[p9<=4 | A [AX [[1<=p18 | [7<=p18 | p12<=2]]] U [[EF [p16<=p1] & ~ [[p23<=1 | 3<=p15]]] | ~ [AX [p23<=p6]]]]]]
normalized: ~ [E [true U ~ [[p9<=4 | [~ [EG [~ [[EX [~ [p23<=p6]] | [~ [[p23<=1 | 3<=p15]] & E [true U p16<=p1]]]]]] & ~ [E [~ [[EX [~ [p23<=p6]] | [~ [[p23<=1 | 3<=p15]] & E [true U p16<=p1]]]] U [EX [~ [[1<=p18 | [7<=p18 | p12<=2]]]] & ~ [[EX [~ [p23<=p6]] | [~ [[p23<=1 | 3<=p15]] & E [true U p16<=p1]]]]]]]]]]]]
abstracting: (p16<=p1)
states: 1,874,505,752,364 (12)
abstracting: (3<=p15)
states: 1,661,922,950,688 (12)
abstracting: (p23<=1)
states: 830,961,475,344 (11)
abstracting: (p23<=p6)
states: 830,719,353,702 (11)
.abstracting: (p12<=2)
states: 1,246,442,213,016 (12)
abstracting: (7<=p18)
states: 0
abstracting: (1<=p18)
states: 2,492,884,426,032 (12)
.abstracting: (p16<=p1)
states: 1,874,505,752,364 (12)
abstracting: (3<=p15)
states: 1,661,922,950,688 (12)
abstracting: (p23<=1)
states: 830,961,475,344 (11)
abstracting: (p23<=p6)
states: 830,719,353,702 (11)
.abstracting: (p16<=p1)
states: 1,874,505,752,364 (12)
abstracting: (3<=p15)
states: 1,661,922,950,688 (12)
abstracting: (p23<=1)
states: 830,961,475,344 (11)
abstracting: (p23<=p6)
states: 830,719,353,702 (11)
..
EG iterations: 1
abstracting: (p9<=4)
states: 2,077,403,688,360 (12)
-> the formula is FALSE
FORMULA RefineWMG-PT-005006-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.193sec
checking: AG [[AF [AF [~ [[p7<=1 & 4<=p9]]]] | ~ [[AX [A [p12<=pprime U 4<=p7]] & [[AX [p4<=p5] | [p4<=3 & p1<=7]] | ~ [[p20<=p18 | 3<=p13]]]]]]]
normalized: ~ [E [true U ~ [[~ [[[~ [[p20<=p18 | 3<=p13]] | [[p4<=3 & p1<=7] | ~ [EX [~ [p4<=p5]]]]] & ~ [EX [~ [[~ [EG [~ [4<=p7]]] & ~ [E [~ [4<=p7] U [~ [p12<=pprime] & ~ [4<=p7]]]]]]]]]] | ~ [EG [EG [[p7<=1 & 4<=p9]]]]]]]]
abstracting: (4<=p9)
states: 1,246,442,213,016 (12)
abstracting: (p7<=1)
states: 830,961,475,344 (11)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (4<=p7)
states: 1,246,442,213,016 (12)
abstracting: (p12<=pprime)
states: 830,719,353,702 (11)
abstracting: (4<=p7)
states: 1,246,442,213,016 (12)
abstracting: (4<=p7)
states: 1,246,442,213,016 (12)
.
EG iterations: 1
.abstracting: (p4<=p5)
states: 1,661,922,950,688 (12)
.abstracting: (p1<=7)
states: 2,908,365,163,704 (12)
abstracting: (p4<=3)
states: 1,661,922,950,688 (12)
abstracting: (3<=p13)
states: 1,661,922,950,688 (12)
abstracting: (p20<=p18)
states: 1,661,922,950,688 (12)
-> the formula is TRUE
FORMULA RefineWMG-PT-005006-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.054sec
checking: A [[p6<=4 & [A [p7<=6 U E [[pterce<=0 | p5<=3] U ~ [p23<=p17]]] | AF [AF [AG [5<=pterce]]]]] U AX [AG [[A [p23<=p21 U p24<=p2] | ~ [AG [6<=p23]]]]]]
normalized: [~ [EG [EX [E [true U ~ [[E [true U ~ [6<=p23]] | [~ [EG [~ [p24<=p2]]] & ~ [E [~ [p24<=p2] U [~ [p23<=p21] & ~ [p24<=p2]]]]]]]]]]] & ~ [E [EX [E [true U ~ [[E [true U ~ [6<=p23]] | [~ [EG [~ [p24<=p2]]] & ~ [E [~ [p24<=p2] U [~ [p23<=p21] & ~ [p24<=p2]]]]]]]]] U [~ [[p6<=4 & [~ [EG [EG [E [true U ~ [5<=pterce]]]]] | [~ [EG [~ [E [[pterce<=0 | p5<=3] U ~ [p23<=p17]]]]] & ~ [E [~ [E [[pterce<=0 | p5<=3] U ~ [p23<=p17]]] U [~ [p7<=6] & ~ [E [[pterce<=0 | p5<=3] U ~ [p23<=p17]]]]]]]]]] & EX [E [true U ~ [[E [true U ~ [6<=p23]] | [~ [EG [~ [p24<=p2]]] & ~ [E [~ [p24<=p2] U [~ [p23<=p21] & ~ [p24<=p2]]]]]]]]]]]]]
abstracting: (p24<=p2)
states: 1,661,922,950,688 (12)
abstracting: (p23<=p21)
states: 830,719,353,702 (11)
abstracting: (p24<=p2)
states: 1,661,922,950,688 (12)
abstracting: (p24<=p2)
states: 1,661,922,950,688 (12)
.
EG iterations: 1
abstracting: (6<=p23)
states: 415,480,737,672 (11)
.abstracting: (p23<=p17)
states: 1,661,922,950,688 (12)
abstracting: (p5<=3)
states: 1,661,922,950,688 (12)
abstracting: (pterce<=0)
states: 484,727,527,284 (11)
abstracting: (p7<=6)
states: 2,908,365,163,704 (12)
abstracting: (p23<=p17)
states: 1,661,922,950,688 (12)
abstracting: (p5<=3)
states: 1,661,922,950,688 (12)
abstracting: (pterce<=0)
states: 484,727,527,284 (11)
abstracting: (p23<=p17)
states: 1,661,922,950,688 (12)
abstracting: (p5<=3)
states: 1,661,922,950,688 (12)
abstracting: (pterce<=0)
states: 484,727,527,284 (11)
.
EG iterations: 1
abstracting: (5<=pterce)
states: 484,727,527,284 (11)
EG iterations: 0
EG iterations: 0
abstracting: (p6<=4)
states: 2,860,909,321,872 (12)
abstracting: (p24<=p2)
states: 1,661,922,950,688 (12)
abstracting: (p23<=p21)
states: 830,719,353,702 (11)
abstracting: (p24<=p2)
states: 1,661,922,950,688 (12)
abstracting: (p24<=p2)
states: 1,661,922,950,688 (12)
.
EG iterations: 1
abstracting: (6<=p23)
states: 415,480,737,672 (11)
.abstracting: (p24<=p2)
states: 1,661,922,950,688 (12)
abstracting: (p23<=p21)
states: 830,719,353,702 (11)
abstracting: (p24<=p2)
states: 1,661,922,950,688 (12)
abstracting: (p24<=p2)
states: 1,661,922,950,688 (12)
.
EG iterations: 1
abstracting: (6<=p23)
states: 415,480,737,672 (11)
..
EG iterations: 1
-> the formula is TRUE
FORMULA RefineWMG-PT-005006-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.071sec
checking: [~ [E [p8<=p U [[AG [~ [5<=p2]] & AF [E [4<=p15 U p3<=0]]] | EF [AG [p20<=p24]]]]] & A [AG [EF [~ [EG [psecond<=p12]]]] U E [psecond<=p14 U ~ [p15<=6]]]]
normalized: [[~ [EG [~ [E [psecond<=p14 U ~ [p15<=6]]]]] & ~ [E [~ [E [psecond<=p14 U ~ [p15<=6]]] U [E [true U ~ [E [true U ~ [EG [psecond<=p12]]]]] & ~ [E [psecond<=p14 U ~ [p15<=6]]]]]]] & ~ [E [p8<=p U [E [true U ~ [E [true U ~ [p20<=p24]]]] | [~ [EG [~ [E [4<=p15 U p3<=0]]]] & ~ [E [true U 5<=p2]]]]]]]
abstracting: (5<=p2)
states: 830,961,475,344 (11)
abstracting: (p3<=0)
states: 415,480,737,672 (11)
abstracting: (4<=p15)
states: 1,246,442,213,016 (12)
.
EG iterations: 1
abstracting: (p20<=p24)
states: 1,661,922,950,688 (12)
abstracting: (p8<=p)
states: 830,719,353,702 (11)
abstracting: (p15<=6)
states: 2,908,365,163,704 (12)
abstracting: (psecond<=p14)
states: 1,869,663,319,524 (12)
abstracting: (psecond<=p12)
states: 1,869,663,319,524 (12)
.
EG iterations: 1
abstracting: (p15<=6)
states: 2,908,365,163,704 (12)
abstracting: (psecond<=p14)
states: 1,869,663,319,524 (12)
abstracting: (p15<=6)
states: 2,908,365,163,704 (12)
abstracting: (psecond<=p14)
states: 1,869,663,319,524 (12)
EG iterations: 0
-> the formula is FALSE
FORMULA RefineWMG-PT-005006-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.092sec
checking: AF [EX [[[[[EX [p17<=2] | AX [4<=p24]] & [AF [1<=p2] & [1<=p23 | 2<=p23]]] | A [A [2<=pprime U psecond<=3] U AX [p10<=p6]]] | [[AG [p21<=4] & A [p25<=7 U p10<=p16]] & ~ [[AG [1<=p22] & A [pterce<=p12 U p14<=p20]]]]]]]
normalized: ~ [EG [~ [EX [[[~ [[[~ [EG [~ [p14<=p20]]] & ~ [E [~ [p14<=p20] U [~ [pterce<=p12] & ~ [p14<=p20]]]]] & ~ [E [true U ~ [1<=p22]]]]] & [[~ [EG [~ [p10<=p16]]] & ~ [E [~ [p10<=p16] U [~ [p25<=7] & ~ [p10<=p16]]]]] & ~ [E [true U ~ [p21<=4]]]]] | [[~ [EG [EX [~ [p10<=p6]]]] & ~ [E [EX [~ [p10<=p6]] U [~ [[~ [EG [~ [psecond<=3]]] & ~ [E [~ [psecond<=3] U [~ [2<=pprime] & ~ [psecond<=3]]]]]] & EX [~ [p10<=p6]]]]]] | [[[1<=p23 | 2<=p23] & ~ [EG [~ [1<=p2]]]] & [~ [EX [~ [4<=p24]]] | EX [p17<=2]]]]]]]]]
abstracting: (p17<=2)
states: 1,246,442,213,016 (12)
.abstracting: (4<=p24)
states: 1,246,442,213,016 (12)
.abstracting: (1<=p2)
states: 2,492,884,426,032 (12)
.
EG iterations: 1
abstracting: (2<=p23)
states: 2,077,403,688,360 (12)
abstracting: (1<=p23)
states: 2,492,884,426,032 (12)
abstracting: (p10<=p6)
states: 830,719,353,702 (11)
.abstracting: (psecond<=3)
states: 1,938,910,109,136 (12)
abstracting: (2<=pprime)
states: 783,021,390,228 (11)
abstracting: (psecond<=3)
states: 1,938,910,109,136 (12)
abstracting: (psecond<=3)
states: 1,938,910,109,136 (12)
.
EG iterations: 1
abstracting: (p10<=p6)
states: 830,719,353,702 (11)
.abstracting: (p10<=p6)
states: 830,719,353,702 (11)
..
EG iterations: 1
abstracting: (p21<=4)
states: 2,860,909,321,872 (12)
abstracting: (p10<=p16)
states: 830,719,353,702 (11)
abstracting: (p25<=7)
states: 2,908,365,163,704 (12)
abstracting: (p10<=p16)
states: 830,719,353,702 (11)
abstracting: (p10<=p16)
states: 830,719,353,702 (11)
.
EG iterations: 1
abstracting: (1<=p22)
states: 2,492,884,426,032 (12)
abstracting: (p14<=p20)
states: 1,661,922,950,688 (12)
abstracting: (pterce<=p12)
states: 1,869,663,319,524 (12)
abstracting: (p14<=p20)
states: 1,661,922,950,688 (12)
abstracting: (p14<=p20)
states: 1,661,922,950,688 (12)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-005006-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.115sec
checking: [[AG [[1<=p3 | [~ [EX [p25<=3]] | AG [[1<=p18 & 2<=p15]]]]] & ~ [AG [[AX [EF [p22<=p4]] & ~ [[E [pterce<=p18 U p1<=p17] & [p<=p10 | 3<=p10]]]]]]] & EF [[p21<=4 | [[E [[p21<=1 | p2<=p6] U 7<=p9] & AG [p21<=pprime]] | EX [EX [p1<=p17]]]]]]
normalized: [E [true U [p21<=4 | [EX [EX [p1<=p17]] | [~ [E [true U ~ [p21<=pprime]]] & E [[p21<=1 | p2<=p6] U 7<=p9]]]]] & [E [true U ~ [[~ [[[p<=p10 | 3<=p10] & E [pterce<=p18 U p1<=p17]]] & ~ [EX [~ [E [true U p22<=p4]]]]]]] & ~ [E [true U ~ [[1<=p3 | [~ [E [true U ~ [[1<=p18 & 2<=p15]]]] | ~ [EX [p25<=3]]]]]]]]]
abstracting: (p25<=3)
states: 1,661,922,950,688 (12)
.abstracting: (2<=p15)
states: 2,077,403,688,360 (12)
abstracting: (1<=p18)
states: 2,492,884,426,032 (12)
abstracting: (1<=p3)
states: 2,492,884,426,032 (12)
abstracting: (p22<=p4)
states: 1,661,922,950,688 (12)
.abstracting: (p1<=p17)
states: 2,492,884,426,032 (12)
abstracting: (pterce<=p18)
states: 1,869,663,319,524 (12)
abstracting: (3<=p10)
states: 1,661,922,950,688 (12)
abstracting: (p<=p10)
states: 2,492,884,426,032 (12)
abstracting: (7<=p9)
states: 0
abstracting: (p2<=p6)
states: 830,719,353,702 (11)
abstracting: (p21<=1)
states: 2,125,343,773,476 (12)
abstracting: (p21<=pprime)
states: 1,874,505,752,364 (12)
abstracting: (p1<=p17)
states: 2,492,884,426,032 (12)
..abstracting: (p21<=4)
states: 2,860,909,321,872 (12)
-> the formula is FALSE
FORMULA RefineWMG-PT-005006-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.115sec
totally nodes used: 680427 (6.8e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2152172 1992093 4144265
used/not used/entry size/cache size: 2533658 64575206 16 1024MB
basic ops cache: hits/miss/sum: 858878 801046 1659924
used/not used/entry size/cache size: 1348751 15428465 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: 34703 35396 70099
used/not used/entry size/cache size: 35357 8353251 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 66457898
1 640097
2 7520
3 1485
4 389
5 445
6 176
7 216
8 71
9 170
>= 10 397
Total processing time: 0m 5.700sec
BK_STOP 1678938922468
--------------------
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.001sec
iterations count:1830 (79), effective:681 (29)
initing FirstDep: 0m 0.000sec
iterations count:454 (19), effective:163 (7)
iterations count:471 (20), effective:150 (6)
iterations count:261 (11), effective:96 (4)
iterations count:35 (1), effective:6 (0)
iterations count:552 (24), effective:194 (8)
iterations count:23 (1), effective:0 (0)
iterations count:23 (1), effective:0 (0)
iterations count:162 (7), effective:54 (2)
iterations count:35 (1), effective:9 (0)
iterations count:79 (3), effective:21 (0)
iterations count:29 (1), effective:6 (0)
iterations count:928 (40), effective:333 (14)
iterations count:193 (8), effective:65 (2)
iterations count:122 (5), effective:33 (1)
iterations count:91 (3), effective:30 (1)
iterations count:91 (3), effective:30 (1)
iterations count:692 (30), effective:243 (10)
iterations count:91 (3), effective:30 (1)
iterations count:610 (26), effective:221 (9)
iterations count:288 (12), effective:99 (4)
iterations count:80 (3), effective:22 (0)
iterations count:194 (8), effective:65 (2)
iterations count:30 (1), effective:7 (0)
iterations count:30 (1), effective:7 (0)
iterations count:30 (1), effective:7 (0)
iterations count:25 (1), effective:1 (0)
iterations count:80 (3), effective:22 (0)
iterations count:194 (8), effective:65 (2)
iterations count:80 (3), effective:22 (0)
iterations count:194 (8), effective:65 (2)
iterations count:471 (20), effective:150 (6)
iterations count:615 (26), effective:206 (8)
iterations count:79 (3), effective:19 (0)
iterations count:31 (1), effective:7 (0)
iterations count:23 (1), effective:0 (0)
iterations count:233 (10), effective:79 (3)
iterations count:663 (28), effective:243 (10)
iterations count:29 (1), effective:6 (0)
iterations count:271 (11), effective:97 (4)
iterations count:33 (1), effective:5 (0)
iterations count:617 (26), effective:208 (9)
iterations count:29 (1), effective:6 (0)
iterations count:228 (9), effective:69 (3)
iterations count:49 (2), effective:14 (0)
iterations count:308 (13), effective:109 (4)
iterations count:30 (1), effective:2 (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="RefineWMG-PT-005006"
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 RefineWMG-PT-005006, 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 r321-tall-167889192300553"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-005006.tgz
mv RefineWMG-PT-005006 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 ;