About the Execution of Marcie for HouseConstruction-PT-00002
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5449.104 | 5386.00 | 5049.00 | 20.40 | FFFTFFTTTFTTTFFF | 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.r193-smll-167840340800513.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 HouseConstruction-PT-00002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r193-smll-167840340800513
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 6.5K Feb 25 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 13:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 25 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 13K 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 HouseConstruction-PT-00002-CTLCardinality-00
FORMULA_NAME HouseConstruction-PT-00002-CTLCardinality-01
FORMULA_NAME HouseConstruction-PT-00002-CTLCardinality-02
FORMULA_NAME HouseConstruction-PT-00002-CTLCardinality-03
FORMULA_NAME HouseConstruction-PT-00002-CTLCardinality-04
FORMULA_NAME HouseConstruction-PT-00002-CTLCardinality-05
FORMULA_NAME HouseConstruction-PT-00002-CTLCardinality-06
FORMULA_NAME HouseConstruction-PT-00002-CTLCardinality-07
FORMULA_NAME HouseConstruction-PT-00002-CTLCardinality-08
FORMULA_NAME HouseConstruction-PT-00002-CTLCardinality-09
FORMULA_NAME HouseConstruction-PT-00002-CTLCardinality-10
FORMULA_NAME HouseConstruction-PT-00002-CTLCardinality-11
FORMULA_NAME HouseConstruction-PT-00002-CTLCardinality-12
FORMULA_NAME HouseConstruction-PT-00002-CTLCardinality-13
FORMULA_NAME HouseConstruction-PT-00002-CTLCardinality-14
FORMULA_NAME HouseConstruction-PT-00002-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679943702218
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=HouseConstruction-PT-00002
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: HouseConstruction_PT_00002
(NrP: 26 NrTr: 18 NrArc: 51)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.466sec
RS generation: 0m 0.002sec
-> reachability set: #nodes 549 (5.5e+02) #states 1,501 (3)
starting MCC model checker
--------------------------
checking: AF [EG [p16<=p11]]
normalized: ~ [EG [~ [EG [p16<=p11]]]]
abstracting: (p16<=p11)
states: 1,130 (3)
...................................
EG iterations: 35
....................................
EG iterations: 36
-> the formula is TRUE
FORMULA HouseConstruction-PT-00002-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.038sec
checking: ~ [EG [p18<=p25]]
normalized: ~ [EG [p18<=p25]]
abstracting: (p18<=p25)
states: 1,105 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA HouseConstruction-PT-00002-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: E [2<=p22 U p2<=2]
normalized: E [2<=p22 U p2<=2]
abstracting: (p2<=2)
states: 1,501 (3)
abstracting: (2<=p22)
states: 45
-> the formula is TRUE
FORMULA HouseConstruction-PT-00002-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AX [[AG [p13<=1] | 2<=p22]]
normalized: ~ [EX [~ [[~ [E [true U ~ [p13<=1]]] | 2<=p22]]]]
abstracting: (2<=p22)
states: 45
abstracting: (p13<=1)
states: 1,445 (3)
.-> the formula is FALSE
FORMULA HouseConstruction-PT-00002-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: A [[AX [p19<=p20] | AG [[EG [~ [p11<=p25]] & AX [EG [1<=p20]]]]] U ~ [p17<=1]]
normalized: [~ [EG [p17<=1]] & ~ [E [p17<=1 U [~ [[~ [E [true U ~ [[~ [EX [~ [EG [1<=p20]]]] & EG [~ [p11<=p25]]]]]] | ~ [EX [~ [p19<=p20]]]]] & p17<=1]]]]
abstracting: (p17<=1)
states: 1,486 (3)
abstracting: (p19<=p20)
states: 1,501 (3)
.abstracting: (p11<=p25)
states: 1,130 (3)
...........................
EG iterations: 27
abstracting: (1<=p20)
states: 375
.........................
EG iterations: 25
.abstracting: (p17<=1)
states: 1,486 (3)
abstracting: (p17<=1)
states: 1,486 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA HouseConstruction-PT-00002-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: AX [[AF [A [[AX [p9<=p23] & AX [1<=p13]] U 2<=p17]] | ~ [[p5<=p10 | p20<=0]]]]
normalized: ~ [EX [~ [[~ [[p5<=p10 | p20<=0]] | ~ [EG [~ [[~ [EG [~ [2<=p17]]] & ~ [E [~ [2<=p17] U [~ [[~ [EX [~ [1<=p13]]] & ~ [EX [~ [p9<=p23]]]]] & ~ [2<=p17]]]]]]]]]]]]
abstracting: (2<=p17)
states: 15
abstracting: (p9<=p23)
states: 1,275 (3)
.abstracting: (1<=p13)
states: 456
.abstracting: (2<=p17)
states: 15
abstracting: (2<=p17)
states: 15
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p20<=0)
states: 1,126 (3)
abstracting: (p5<=p10)
states: 1,255 (3)
.-> the formula is FALSE
FORMULA HouseConstruction-PT-00002-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: ~ [EX [[E [[[~ [p23<=p26] | [p22<=0 | 1<=p17]] & 1<=p23] U [EF [1<=p23] | 2<=p23]] & 1<=p5]]]
normalized: ~ [EX [[E [[[[p22<=0 | 1<=p17] | ~ [p23<=p26]] & 1<=p23] U [E [true U 1<=p23] | 2<=p23]] & 1<=p5]]]
abstracting: (1<=p5)
states: 266
abstracting: (2<=p23)
states: 45
abstracting: (1<=p23)
states: 375
abstracting: (1<=p23)
states: 375
abstracting: (p23<=p26)
states: 1,156 (3)
abstracting: (1<=p17)
states: 210
abstracting: (p22<=0)
states: 1,126 (3)
.-> the formula is TRUE
FORMULA HouseConstruction-PT-00002-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: EX [EX [[~ [[[AX [p5<=0] & [p14<=p11 & p21<=2]] & AG [p4<=p10]]] & [AX [p10<=1] & 2<=p7]]]]
normalized: EX [EX [[[~ [EX [~ [p10<=1]]] & 2<=p7] & ~ [[~ [E [true U ~ [p4<=p10]]] & [[p14<=p11 & p21<=2] & ~ [EX [~ [p5<=0]]]]]]]]]
abstracting: (p5<=0)
states: 1,235 (3)
.abstracting: (p21<=2)
states: 1,501 (3)
abstracting: (p14<=p11)
states: 1,353 (3)
abstracting: (p4<=p10)
states: 425
abstracting: (2<=p7)
states: 75
abstracting: (p10<=1)
states: 1,486 (3)
...-> the formula is FALSE
FORMULA HouseConstruction-PT-00002-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: [[AF [AG [p1<=p15]] & AX [EX [EG [1<=p16]]]] | EG [AF [[~ [p14<=p3] & [[EF [p19<=1] & A [p16<=2 U 2<=p11]] | E [p11<=2 U p26<=1]]]]]]
normalized: [EG [~ [EG [~ [[[E [p11<=2 U p26<=1] | [[~ [EG [~ [2<=p11]]] & ~ [E [~ [2<=p11] U [~ [p16<=2] & ~ [2<=p11]]]]] & E [true U p19<=1]]] & ~ [p14<=p3]]]]]] | [~ [EX [~ [EX [EG [1<=p16]]]]] & ~ [EG [E [true U ~ [p1<=p15]]]]]]
abstracting: (p1<=p15)
states: 1,447 (3)
....................
EG iterations: 20
abstracting: (1<=p16)
states: 446
.............................
EG iterations: 29
..abstracting: (p14<=p3)
states: 1,296 (3)
abstracting: (p19<=1)
states: 1,456 (3)
abstracting: (2<=p11)
states: 75
abstracting: (p16<=2)
states: 1,501 (3)
abstracting: (2<=p11)
states: 75
abstracting: (2<=p11)
states: 75
.
EG iterations: 1
abstracting: (p26<=1)
states: 1,486 (3)
abstracting: (p11<=2)
states: 1,501 (3)
..............................
EG iterations: 30
...............................
EG iterations: 31
-> the formula is FALSE
FORMULA HouseConstruction-PT-00002-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.040sec
checking: EG [[AX [EX [[[p15<=p27 & p9<=p27] | ~ [p22<=p16]]]] | [~ [EX [[p13<=p21 & EG [p25<=p3]]]] | p14<=p3]]]
normalized: EG [[[~ [EX [[EG [p25<=p3] & p13<=p21]]] | p14<=p3] | ~ [EX [~ [EX [[~ [p22<=p16] | [p15<=p27 & p9<=p27]]]]]]]]
abstracting: (p9<=p27)
states: 1,295 (3)
abstracting: (p15<=p27)
states: 1,203 (3)
abstracting: (p22<=p16)
states: 1,231 (3)
..abstracting: (p14<=p3)
states: 1,296 (3)
abstracting: (p13<=p21)
states: 1,150 (3)
abstracting: (p25<=p3)
states: 1,067 (3)
....................................
EG iterations: 36
.
EG iterations: 0
-> the formula is TRUE
FORMULA HouseConstruction-PT-00002-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: [AF [[AF [A [[p15<=p11 & p11<=p16] U A [p12<=1 U p13<=p8]]] & A [~ [AG [1<=p1]] U [[AF [2<=p26] & EG [p27<=1]] | A [p20<=2 U p10<=2]]]]] & ~ [EG [E [p5<=1 U p26<=0]]]]
normalized: [~ [EG [E [p5<=1 U p26<=0]]] & ~ [EG [~ [[[~ [EG [~ [[[~ [EG [~ [p10<=2]]] & ~ [E [~ [p10<=2] U [~ [p20<=2] & ~ [p10<=2]]]]] | [EG [p27<=1] & ~ [EG [~ [2<=p26]]]]]]]] & ~ [E [~ [[[~ [EG [~ [p10<=2]]] & ~ [E [~ [p10<=2] U [~ [p20<=2] & ~ [p10<=2]]]]] | [EG [p27<=1] & ~ [EG [~ [2<=p26]]]]]] U [~ [E [true U ~ [1<=p1]]] & ~ [[[~ [EG [~ [p10<=2]]] & ~ [E [~ [p10<=2] U [~ [p20<=2] & ~ [p10<=2]]]]] | [EG [p27<=1] & ~ [EG [~ [2<=p26]]]]]]]]]] & ~ [EG [~ [[~ [EG [~ [[~ [EG [~ [p13<=p8]]] & ~ [E [~ [p13<=p8] U [~ [p12<=1] & ~ [p13<=p8]]]]]]]] & ~ [E [~ [[~ [EG [~ [p13<=p8]]] & ~ [E [~ [p13<=p8] U [~ [p12<=1] & ~ [p13<=p8]]]]]] U [~ [[p15<=p11 & p11<=p16]] & ~ [[~ [EG [~ [p13<=p8]]] & ~ [E [~ [p13<=p8] U [~ [p12<=1] & ~ [p13<=p8]]]]]]]]]]]]]]]]]]
abstracting: (p13<=p8)
states: 1,250 (3)
abstracting: (p12<=1)
states: 1,411 (3)
abstracting: (p13<=p8)
states: 1,250 (3)
abstracting: (p13<=p8)
states: 1,250 (3)
..........................
EG iterations: 26
abstracting: (p11<=p16)
states: 1,130 (3)
abstracting: (p15<=p11)
states: 1,130 (3)
abstracting: (p13<=p8)
states: 1,250 (3)
abstracting: (p12<=1)
states: 1,411 (3)
abstracting: (p13<=p8)
states: 1,250 (3)
abstracting: (p13<=p8)
states: 1,250 (3)
..........................
EG iterations: 26
abstracting: (p13<=p8)
states: 1,250 (3)
abstracting: (p12<=1)
states: 1,411 (3)
abstracting: (p13<=p8)
states: 1,250 (3)
abstracting: (p13<=p8)
states: 1,250 (3)
..........................
EG iterations: 26
..................
EG iterations: 18
................
EG iterations: 16
abstracting: (2<=p26)
states: 15
.
EG iterations: 1
abstracting: (p27<=1)
states: 1,411 (3)
.
EG iterations: 1
abstracting: (p10<=2)
states: 1,501 (3)
abstracting: (p20<=2)
states: 1,501 (3)
abstracting: (p10<=2)
states: 1,501 (3)
abstracting: (p10<=2)
states: 1,501 (3)
.
EG iterations: 1
abstracting: (1<=p1)
states: 66
abstracting: (2<=p26)
states: 15
.
EG iterations: 1
abstracting: (p27<=1)
states: 1,411 (3)
.
EG iterations: 1
abstracting: (p10<=2)
states: 1,501 (3)
abstracting: (p20<=2)
states: 1,501 (3)
abstracting: (p10<=2)
states: 1,501 (3)
abstracting: (p10<=2)
states: 1,501 (3)
.
EG iterations: 1
abstracting: (2<=p26)
states: 15
.
EG iterations: 1
abstracting: (p27<=1)
states: 1,411 (3)
.
EG iterations: 1
abstracting: (p10<=2)
states: 1,501 (3)
abstracting: (p20<=2)
states: 1,501 (3)
abstracting: (p10<=2)
states: 1,501 (3)
abstracting: (p10<=2)
states: 1,501 (3)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p26<=0)
states: 1,291 (3)
abstracting: (p5<=1)
states: 1,480 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA HouseConstruction-PT-00002-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: E [[[AX [[p25<=0 & ~ [p19<=p5]]] & [AG [[E [p5<=p4 U 2<=p1] | [1<=p25 | 1<=p5]]] & [1<=p8 & EF [p5<=p20]]]] | 2<=p25] U AX [p18<=p21]]
normalized: E [[2<=p25 | [[[1<=p8 & E [true U p5<=p20]] & ~ [E [true U ~ [[[1<=p25 | 1<=p5] | E [p5<=p4 U 2<=p1]]]]]] & ~ [EX [~ [[p25<=0 & ~ [p19<=p5]]]]]]] U ~ [EX [~ [p18<=p21]]]]
abstracting: (p18<=p21)
states: 1,051 (3)
.abstracting: (p19<=p5)
states: 1,166 (3)
abstracting: (p25<=0)
states: 1,055 (3)
.abstracting: (2<=p1)
states: 1
abstracting: (p5<=p4)
states: 1,449 (3)
abstracting: (1<=p5)
states: 266
abstracting: (1<=p25)
states: 446
abstracting: (p5<=p20)
states: 1,275 (3)
abstracting: (1<=p8)
states: 400
abstracting: (2<=p25)
states: 75
-> the formula is TRUE
FORMULA HouseConstruction-PT-00002-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: A [[p21<=p16 | EG [~ [1<=p4]]] U [EG [p23<=p23] & E [EF [~ [E [1<=p7 U p21<=p5]]] U ~ [[[[1<=p12 & 1<=p1] & [2<=p22 & p25<=p3]] & EG [p2<=p13]]]]]]
normalized: [~ [EG [~ [[E [E [true U ~ [E [1<=p7 U p21<=p5]]] U ~ [[EG [p2<=p13] & [[2<=p22 & p25<=p3] & [1<=p12 & 1<=p1]]]]] & EG [p23<=p23]]]]] & ~ [E [~ [[E [E [true U ~ [E [1<=p7 U p21<=p5]]] U ~ [[EG [p2<=p13] & [[2<=p22 & p25<=p3] & [1<=p12 & 1<=p1]]]]] & EG [p23<=p23]]] U [~ [[p21<=p16 | EG [~ [1<=p4]]]] & ~ [[E [E [true U ~ [E [1<=p7 U p21<=p5]]] U ~ [[EG [p2<=p13] & [[2<=p22 & p25<=p3] & [1<=p12 & 1<=p1]]]]] & EG [p23<=p23]]]]]]]
abstracting: (p23<=p23)
states: 1,501 (3)
EG iterations: 0
abstracting: (1<=p1)
states: 66
abstracting: (1<=p12)
states: 580
abstracting: (p25<=p3)
states: 1,067 (3)
abstracting: (2<=p22)
states: 45
abstracting: (p2<=p13)
states: 1,446 (3)
.............
EG iterations: 13
abstracting: (p21<=p5)
states: 1,021 (3)
abstracting: (1<=p7)
states: 446
abstracting: (1<=p4)
states: 1,170 (3)
...............
EG iterations: 15
abstracting: (p21<=p16)
states: 1,105 (3)
abstracting: (p23<=p23)
states: 1,501 (3)
EG iterations: 0
abstracting: (1<=p1)
states: 66
abstracting: (1<=p12)
states: 580
abstracting: (p25<=p3)
states: 1,067 (3)
abstracting: (2<=p22)
states: 45
abstracting: (p2<=p13)
states: 1,446 (3)
.............
EG iterations: 13
abstracting: (p21<=p5)
states: 1,021 (3)
abstracting: (1<=p7)
states: 446
abstracting: (p23<=p23)
states: 1,501 (3)
EG iterations: 0
abstracting: (1<=p1)
states: 66
abstracting: (1<=p12)
states: 580
abstracting: (p25<=p3)
states: 1,067 (3)
abstracting: (2<=p22)
states: 45
abstracting: (p2<=p13)
states: 1,446 (3)
.............
EG iterations: 13
abstracting: (p21<=p5)
states: 1,021 (3)
abstracting: (1<=p7)
states: 446
.
EG iterations: 1
-> the formula is TRUE
FORMULA HouseConstruction-PT-00002-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: ~ [EF [[[A [A [p25<=p27 U p7<=2] U p12<=2] | [[[[1<=p6 & p23<=1] | [p16<=p14 | 2<=p26]] | EF [p1<=0]] | ~ [E [p20<=2 U p9<=0]]]] & ~ [[AF [1<=p12] & ~ [p13<=p19]]]]]]
normalized: ~ [E [true U [[[~ [EG [~ [p12<=2]]] & ~ [E [~ [p12<=2] U [~ [[~ [EG [~ [p7<=2]]] & ~ [E [~ [p7<=2] U [~ [p25<=p27] & ~ [p7<=2]]]]]] & ~ [p12<=2]]]]] | [~ [E [p20<=2 U p9<=0]] | [E [true U p1<=0] | [[1<=p6 & p23<=1] | [p16<=p14 | 2<=p26]]]]] & ~ [[~ [p13<=p19] & ~ [EG [~ [1<=p12]]]]]]]]
abstracting: (1<=p12)
states: 580
.................
EG iterations: 17
abstracting: (p13<=p19)
states: 1,115 (3)
abstracting: (2<=p26)
states: 15
abstracting: (p16<=p14)
states: 1,110 (3)
abstracting: (p23<=1)
states: 1,456 (3)
abstracting: (1<=p6)
states: 126
abstracting: (p1<=0)
states: 1,435 (3)
abstracting: (p9<=0)
states: 1,235 (3)
abstracting: (p20<=2)
states: 1,501 (3)
abstracting: (p12<=2)
states: 1,501 (3)
abstracting: (p7<=2)
states: 1,501 (3)
abstracting: (p25<=p27)
states: 1,203 (3)
abstracting: (p7<=2)
states: 1,501 (3)
abstracting: (p7<=2)
states: 1,501 (3)
.
EG iterations: 1
abstracting: (p12<=2)
states: 1,501 (3)
abstracting: (p12<=2)
states: 1,501 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA HouseConstruction-PT-00002-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: EG [[AG [EG [AG [p7<=2]]] | [[A [EX [1<=p4] U [p27<=2 | ~ [1<=p17]]] | [[EF [1<=p26] & ~ [[1<=p12 | 1<=p5]]] | [p19<=p16 & [p15<=p15 | [2<=p1 | p5<=p21]]]]] | [1<=p9 & ~ [1<=p12]]]]]
normalized: EG [[[[1<=p9 & ~ [1<=p12]] | [[[p19<=p16 & [p15<=p15 | [2<=p1 | p5<=p21]]] | [~ [[1<=p12 | 1<=p5]] & E [true U 1<=p26]]] | [~ [EG [~ [[p27<=2 | ~ [1<=p17]]]]] & ~ [E [~ [[p27<=2 | ~ [1<=p17]]] U [~ [EX [1<=p4]] & ~ [[p27<=2 | ~ [1<=p17]]]]]]]]] | ~ [E [true U ~ [EG [~ [E [true U ~ [p7<=2]]]]]]]]]
abstracting: (p7<=2)
states: 1,501 (3)
EG iterations: 0
abstracting: (1<=p17)
states: 210
abstracting: (p27<=2)
states: 1,501 (3)
abstracting: (1<=p4)
states: 1,170 (3)
.abstracting: (1<=p17)
states: 210
abstracting: (p27<=2)
states: 1,501 (3)
abstracting: (1<=p17)
states: 210
abstracting: (p27<=2)
states: 1,501 (3)
.
EG iterations: 1
abstracting: (1<=p26)
states: 210
abstracting: (1<=p5)
states: 266
abstracting: (1<=p12)
states: 580
abstracting: (p5<=p21)
states: 1,295 (3)
abstracting: (2<=p1)
states: 1
abstracting: (p15<=p15)
states: 1,501 (3)
abstracting: (p19<=p16)
states: 1,231 (3)
abstracting: (1<=p12)
states: 580
abstracting: (1<=p9)
states: 266
EG iterations: 0
-> the formula is TRUE
FORMULA HouseConstruction-PT-00002-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: [~ [AF [A [A [[p27<=p12 & p16<=p12] U ~ [p22<=p2]] U [AG [p6<=p15] & EG [p4<=1]]]]] | E [1<=p26 U [AX [AG [[p15<=0 | p13<=0]]] & AG [[~ [[p18<=p10 | 2<=p1]] | ~ [p12<=p26]]]]]]
normalized: [E [1<=p26 U [~ [E [true U ~ [[~ [p12<=p26] | ~ [[p18<=p10 | 2<=p1]]]]]] & ~ [EX [E [true U ~ [[p15<=0 | p13<=0]]]]]]] | EG [~ [[~ [EG [~ [[EG [p4<=1] & ~ [E [true U ~ [p6<=p15]]]]]]] & ~ [E [~ [[EG [p4<=1] & ~ [E [true U ~ [p6<=p15]]]]] U [~ [[~ [EG [p22<=p2]] & ~ [E [p22<=p2 U [p22<=p2 & ~ [[p27<=p12 & p16<=p12]]]]]]] & ~ [[EG [p4<=1] & ~ [E [true U ~ [p6<=p15]]]]]]]]]]]]
abstracting: (p6<=p15)
states: 1,398 (3)
abstracting: (p4<=1)
states: 979
.
EG iterations: 1
abstracting: (p16<=p12)
states: 1,210 (3)
abstracting: (p27<=p12)
states: 1,081 (3)
abstracting: (p22<=p2)
states: 1,136 (3)
abstracting: (p22<=p2)
states: 1,136 (3)
abstracting: (p22<=p2)
states: 1,136 (3)
..................................
EG iterations: 34
abstracting: (p6<=p15)
states: 1,398 (3)
abstracting: (p4<=1)
states: 979
.
EG iterations: 1
abstracting: (p6<=p15)
states: 1,398 (3)
abstracting: (p4<=1)
states: 979
.
EG iterations: 1
................................
EG iterations: 32
................................
EG iterations: 32
abstracting: (p13<=0)
states: 1,045 (3)
abstracting: (p15<=0)
states: 1,055 (3)
.abstracting: (2<=p1)
states: 1
abstracting: (p18<=p10)
states: 1,006 (3)
abstracting: (p12<=p26)
states: 966
abstracting: (1<=p26)
states: 210
-> the formula is FALSE
FORMULA HouseConstruction-PT-00002-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.034sec
totally nodes used: 98080 (9.8e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 144993 262504 407497
used/not used/entry size/cache size: 362994 66745870 16 1024MB
basic ops cache: hits/miss/sum: 42386 103262 145648
used/not used/entry size/cache size: 180513 16596703 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: 4042 5917 9959
used/not used/entry size/cache size: 5916 8382692 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 67014747
1 90404
2 3515
3 171
4 15
5 7
6 2
7 0
8 2
9 0
>= 10 1
Total processing time: 0m 5.315sec
BK_STOP 1679943707604
--------------------
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:148 (8), effective:36 (2)
initing FirstDep: 0m 0.000sec
iterations count:18 (1), effective:0 (0)
iterations count:40 (2), effective:8 (0)
iterations count:18 (1), effective:0 (0)
iterations count:33 (1), effective:3 (0)
iterations count:53 (2), effective:11 (0)
iterations count:18 (1), effective:0 (0)
iterations count:37 (2), effective:5 (0)
iterations count:23 (1), effective:1 (0)
iterations count:20 (1), effective:1 (0)
iterations count:42 (2), effective:5 (0)
iterations count:50 (2), effective:11 (0)
iterations count:50 (2), effective:11 (0)
iterations count:45 (2), effective:10 (0)
iterations count:50 (2), effective:11 (0)
iterations count:20 (1), effective:2 (0)
iterations count:66 (3), effective:10 (0)
iterations count:18 (1), effective:0 (0)
iterations count:107 (5), effective:23 (1)
iterations count:30 (1), effective:2 (0)
iterations count:26 (1), effective:3 (0)
iterations count:39 (2), effective:9 (0)
iterations count:61 (3), effective:13 (0)
iterations count:18 (1), effective:0 (0)
iterations count:39 (2), effective:9 (0)
iterations count:61 (3), effective:13 (0)
iterations count:18 (1), effective:0 (0)
iterations count:39 (2), effective:9 (0)
iterations count:61 (3), effective:13 (0)
iterations count:18 (1), effective:0 (0)
iterations count:20 (1), effective:2 (0)
iterations count:34 (1), effective:4 (0)
iterations count:48 (2), effective:6 (0)
iterations count:59 (3), effective:13 (0)
iterations count:28 (1), effective:4 (0)
iterations count:84 (4), effective:17 (0)
iterations count:28 (1), effective:4 (0)
iterations count:25 (1), effective:3 (0)
iterations count:28 (1), effective:4 (0)
iterations count:40 (2), effective:10 (0)
iterations count:62 (3), effective:8 (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="HouseConstruction-PT-00002"
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 HouseConstruction-PT-00002, 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 r193-smll-167840340800513"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-00002.tgz
mv HouseConstruction-PT-00002 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 ;