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.r449-smll-167912641200153.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 SmartHome-PT-01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r449-smll-167912641200153
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.8K Feb 26 05:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 05:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 05:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 05:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 17:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 05:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 05:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 26 05:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 25K 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 SmartHome-PT-01-CTLCardinality-00
FORMULA_NAME SmartHome-PT-01-CTLCardinality-01
FORMULA_NAME SmartHome-PT-01-CTLCardinality-02
FORMULA_NAME SmartHome-PT-01-CTLCardinality-03
FORMULA_NAME SmartHome-PT-01-CTLCardinality-04
FORMULA_NAME SmartHome-PT-01-CTLCardinality-05
FORMULA_NAME SmartHome-PT-01-CTLCardinality-06
FORMULA_NAME SmartHome-PT-01-CTLCardinality-07
FORMULA_NAME SmartHome-PT-01-CTLCardinality-08
FORMULA_NAME SmartHome-PT-01-CTLCardinality-09
FORMULA_NAME SmartHome-PT-01-CTLCardinality-10
FORMULA_NAME SmartHome-PT-01-CTLCardinality-11
FORMULA_NAME SmartHome-PT-01-CTLCardinality-12
FORMULA_NAME SmartHome-PT-01-CTLCardinality-13
FORMULA_NAME SmartHome-PT-01-CTLCardinality-14
FORMULA_NAME SmartHome-PT-01-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679187927550

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=SmartHome-PT-01
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: SmartHome_PT_01
(NrP: 38 NrTr: 113 NrArc: 321)

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

net check time: 0m 0.000sec

init dd package: 0m 3.504sec


RS generation: 0m 0.004sec


-> reachability set: #nodes 310 (3.1e+02) #states 43,201 (4)



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

checking: EF [[EG [1<=p33] & p5<=1]]
normalized: E [true U [EG [1<=p33] & p5<=1]]

abstracting: (p5<=1)
states: 43,201 (4)
abstracting: (1<=p33)
states: 6,912 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmartHome-PT-01-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: ~ [AF [AG [AX [~ [[p27<=0 & 1<=p12]]]]]]
normalized: EG [E [true U EX [[p27<=0 & 1<=p12]]]]

abstracting: (1<=p12)
states: 21,600 (4)
abstracting: (p27<=0)
states: 42,625 (4)
.
EG iterations: 0
-> the formula is TRUE

FORMULA SmartHome-PT-01-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [AX [EF [AG [[EX [1<=p34] & 1<=p34]]]] & EF [EX [AF [AF [p4<=0]]]]]
normalized: [E [true U EX [~ [EG [EG [~ [p4<=0]]]]]] & ~ [EX [~ [E [true U ~ [E [true U ~ [[EX [1<=p34] & 1<=p34]]]]]]]]]

abstracting: (1<=p34)
states: 13,824 (4)
abstracting: (1<=p34)
states: 13,824 (4)
..abstracting: (p4<=0)
states: 21,601 (4)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is FALSE

FORMULA SmartHome-PT-01-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EF [AG [AX [[p37<=0 | [AF [p34<=1] & EG [1<=p11]]]]]]
normalized: E [true U ~ [E [true U EX [~ [[p37<=0 | [EG [1<=p11] & ~ [EG [~ [p34<=1]]]]]]]]]]

abstracting: (p34<=1)
states: 43,201 (4)
.
EG iterations: 1
abstracting: (1<=p11)
states: 43,200 (4)
.
EG iterations: 1
abstracting: (p37<=0)
states: 29,377 (4)
.-> the formula is TRUE

FORMULA SmartHome-PT-01-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [~ [A [AG [p37<=p6] U 1<=p18]]]
normalized: EX [~ [[~ [EG [~ [1<=p18]]] & ~ [E [~ [1<=p18] U [E [true U ~ [p37<=p6]] & ~ [1<=p18]]]]]]]

abstracting: (1<=p18)
states: 14,400 (4)
abstracting: (p37<=p6)
states: 36,289 (4)
abstracting: (1<=p18)
states: 14,400 (4)
abstracting: (1<=p18)
states: 14,400 (4)
..
EG iterations: 2
.-> the formula is FALSE

FORMULA SmartHome-PT-01-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: ~ [E [1<=p34 U [[~ [p26<=0] & p13<=1] & ~ [p5<=0]]]]
normalized: ~ [E [1<=p34 U [~ [p5<=0] & [~ [p26<=0] & p13<=1]]]]

abstracting: (p13<=1)
states: 43,201 (4)
abstracting: (p26<=0)
states: 42,625 (4)
abstracting: (p5<=0)
states: 1
abstracting: (1<=p34)
states: 13,824 (4)
-> the formula is TRUE

FORMULA SmartHome-PT-01-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [EG [[~ [[p23<=p24 & E [1<=p12 U p6<=1]]] | p11<=1]] U ~ [AF [1<=p8]]]
normalized: E [EG [[~ [[p23<=p24 & E [1<=p12 U p6<=1]]] | p11<=1]] U EG [~ [1<=p8]]]

abstracting: (1<=p8)
states: 43,200 (4)
..
EG iterations: 2
abstracting: (p11<=1)
states: 43,201 (4)
abstracting: (p6<=1)
states: 43,201 (4)
abstracting: (1<=p12)
states: 21,600 (4)
abstracting: (p23<=p24)
states: 43,201 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA SmartHome-PT-01-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AX [EF [A [~ [[p26<=p23 | ~ [p18<=p29]]] U E [p33<=0 U ~ [p2<=0]]]]]
normalized: ~ [EX [~ [E [true U [~ [EG [~ [E [p33<=0 U ~ [p2<=0]]]]] & ~ [E [~ [E [p33<=0 U ~ [p2<=0]]] U [[~ [p18<=p29] | p26<=p23] & ~ [E [p33<=0 U ~ [p2<=0]]]]]]]]]]]

abstracting: (p2<=0)
states: 1
abstracting: (p33<=0)
states: 36,289 (4)
abstracting: (p26<=p23)
states: 42,913 (4)
abstracting: (p18<=p29)
states: 33,409 (4)
abstracting: (p2<=0)
states: 1
abstracting: (p33<=0)
states: 36,289 (4)
abstracting: (p2<=0)
states: 1
abstracting: (p33<=0)
states: 36,289 (4)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA SmartHome-PT-01-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [A [EG [[~ [1<=p18] & EF [[p33<=p11 & 1<=p2]]]] U ~ [p32<=0]] | AX [1<=p37]]
normalized: [~ [EX [~ [1<=p37]]] | [~ [EG [p32<=0]] & ~ [E [p32<=0 U [~ [EG [[E [true U [p33<=p11 & 1<=p2]] & ~ [1<=p18]]]] & p32<=0]]]]]

abstracting: (p32<=0)
states: 32,833 (4)
abstracting: (1<=p18)
states: 14,400 (4)
abstracting: (1<=p2)
states: 43,200 (4)
abstracting: (p33<=p11)
states: 43,201 (4)
..
EG iterations: 2
abstracting: (p32<=0)
states: 32,833 (4)
abstracting: (p32<=0)
states: 32,833 (4)
.
EG iterations: 1
abstracting: (1<=p37)
states: 13,824 (4)
.-> the formula is FALSE

FORMULA SmartHome-PT-01-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: ~ [AG [~ [[AX [~ [AF [p32<=0]]] & [[A [p8<=p11 U 1<=p24] | p8<=1] | p27<=p28]]]]]
normalized: E [true U [[p27<=p28 | [p8<=1 | [~ [EG [~ [1<=p24]]] & ~ [E [~ [1<=p24] U [~ [p8<=p11] & ~ [1<=p24]]]]]]] & ~ [EX [~ [EG [~ [p32<=0]]]]]]]

abstracting: (p32<=0)
states: 32,833 (4)
.
EG iterations: 1
.abstracting: (1<=p24)
states: 43,200 (4)
abstracting: (p8<=p11)
states: 43,201 (4)
abstracting: (1<=p24)
states: 43,200 (4)
abstracting: (1<=p24)
states: 43,200 (4)
..
EG iterations: 2
abstracting: (p8<=1)
states: 43,201 (4)
abstracting: (p27<=p28)
states: 42,625 (4)
-> the formula is FALSE

FORMULA SmartHome-PT-01-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [[~ [EF [AG [[p34<=p24 | p18<=p31]]]] & EG [[[AX [p2<=p13] & EX [p16<=p14]] | [EF [p30<=0] | [[p20<=1 & 1<=p27] & [p11<=1 | p16<=0]]]]]]]
normalized: ~ [[EG [[[[[p11<=1 | p16<=0] & [p20<=1 & 1<=p27]] | E [true U p30<=0]] | [EX [p16<=p14] & ~ [EX [~ [p2<=p13]]]]]] & ~ [E [true U ~ [E [true U ~ [[p34<=p24 | p18<=p31]]]]]]]]

abstracting: (p18<=p31)
states: 32,257 (4)
abstracting: (p34<=p24)
states: 43,201 (4)
abstracting: (p2<=p13)
states: 21,601 (4)
.abstracting: (p16<=p14)
states: 36,001 (4)
.abstracting: (p30<=0)
states: 32,833 (4)
abstracting: (1<=p27)
states: 576
abstracting: (p20<=1)
states: 43,201 (4)
abstracting: (p16<=0)
states: 28,801 (4)
abstracting: (p11<=1)
states: 43,201 (4)

EG iterations: 0
-> the formula is TRUE

FORMULA SmartHome-PT-01-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: A [~ [[EG [E [~ [1<=p18] U EX [p19<=1]]] | [p31<=p37 | ~ [[[AX [p22<=p24] & [p24<=1 & p2<=p21]] | ~ [AF [1<=p7]]]]]]] U EF [[p12<=1 | AG [AG [p34<=p17]]]]]
normalized: [~ [EG [~ [E [true U [p12<=1 | ~ [E [true U E [true U ~ [p34<=p17]]]]]]]]] & ~ [E [~ [E [true U [p12<=1 | ~ [E [true U E [true U ~ [p34<=p17]]]]]]] U [[[p31<=p37 | ~ [[EG [~ [1<=p7]] | [[p24<=1 & p2<=p21] & ~ [EX [~ [p22<=p24]]]]]]] | EG [E [~ [1<=p18] U EX [p19<=1]]]] & ~ [E [true U [p12<=1 | ~ [E [true U E [true U ~ [p34<=p17]]]]]]]]]]]

abstracting: (p34<=p17)
states: 33,985 (4)
abstracting: (p12<=1)
states: 43,201 (4)
abstracting: (p19<=1)
states: 43,201 (4)
.abstracting: (1<=p18)
states: 14,400 (4)

EG iterations: 0
abstracting: (p22<=p24)
states: 43,201 (4)
.abstracting: (p2<=p21)
states: 14,401 (4)
abstracting: (p24<=1)
states: 43,201 (4)
abstracting: (1<=p7)
states: 21,600 (4)
..
EG iterations: 2
abstracting: (p31<=p37)
states: 36,289 (4)
abstracting: (p34<=p17)
states: 33,985 (4)
abstracting: (p12<=1)
states: 43,201 (4)
abstracting: (p34<=p17)
states: 33,985 (4)
abstracting: (p12<=1)
states: 43,201 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmartHome-PT-01-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: E [A [p3<=0 U [~ [EG [~ [1<=p25]]] | ~ [p22<=p34]]] U [1<=p12 & [[[AG [AF [p36<=1]] & AX [[p32<=1 | p12<=p9]]] & [EF [[p9<=1 | p25<=1]] & [p9<=0 & ~ [p11<=p29]]]] & EF [~ [AG [p16<=p25]]]]]]
normalized: E [[~ [EG [~ [[~ [p22<=p34] | ~ [EG [~ [1<=p25]]]]]]] & ~ [E [~ [[~ [p22<=p34] | ~ [EG [~ [1<=p25]]]]] U [~ [p3<=0] & ~ [[~ [p22<=p34] | ~ [EG [~ [1<=p25]]]]]]]]] U [1<=p12 & [E [true U E [true U ~ [p16<=p25]]] & [[[p9<=0 & ~ [p11<=p29]] & E [true U [p9<=1 | p25<=1]]] & [~ [EX [~ [[p32<=1 | p12<=p9]]]] & ~ [E [true U EG [~ [p36<=1]]]]]]]]]

abstracting: (p36<=1)
states: 43,201 (4)
.
EG iterations: 1
abstracting: (p12<=p9)
states: 32,401 (4)
abstracting: (p32<=1)
states: 43,201 (4)
.abstracting: (p25<=1)
states: 43,201 (4)
abstracting: (p9<=1)
states: 43,201 (4)
abstracting: (p11<=p29)
states: 13,825 (4)
abstracting: (p9<=0)
states: 21,601 (4)
abstracting: (p16<=p25)
states: 28,993 (4)
abstracting: (1<=p12)
states: 21,600 (4)
abstracting: (1<=p25)
states: 576
..
EG iterations: 2
abstracting: (p22<=p34)
states: 28,513 (4)
abstracting: (p3<=0)
states: 21,601 (4)
abstracting: (1<=p25)
states: 576
..
EG iterations: 2
abstracting: (p22<=p34)
states: 28,513 (4)
abstracting: (1<=p25)
states: 576
..
EG iterations: 2
abstracting: (p22<=p34)
states: 28,513 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmartHome-PT-01-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: E [A [[[~ [[~ [p34<=0] & [p15<=p18 | p2<=0]]] & ~ [EG [p11<=1]]] & [p29<=p31 | [[p18<=1 | [p21<=p9 | 1<=p0]] | ~ [AG [p16<=p23]]]]] U AX [[[AF [p35<=0] & EX [1<=p13]] & ~ [p6<=1]]]] U AF [[~ [[p33<=1 & [EF [p20<=p15] & [p26<=0 & p34<=0]]]] & [[EX [p9<=p18] | AF [p8<=1]] & ~ [EX [p0<=0]]]]]]
normalized: E [[~ [EG [EX [~ [[~ [p6<=1] & [EX [1<=p13] & ~ [EG [~ [p35<=0]]]]]]]]] & ~ [E [EX [~ [[~ [p6<=1] & [EX [1<=p13] & ~ [EG [~ [p35<=0]]]]]]] U [~ [[[p29<=p31 | [E [true U ~ [p16<=p23]] | [p18<=1 | [p21<=p9 | 1<=p0]]]] & [~ [EG [p11<=1]] & ~ [[[p15<=p18 | p2<=0] & ~ [p34<=0]]]]]] & EX [~ [[~ [p6<=1] & [EX [1<=p13] & ~ [EG [~ [p35<=0]]]]]]]]]]] U ~ [EG [~ [[[~ [EX [p0<=0]] & [~ [EG [~ [p8<=1]]] | EX [p9<=p18]]] & ~ [[p33<=1 & [[p26<=0 & p34<=0] & E [true U p20<=p15]]]]]]]]]

abstracting: (p20<=p15)
states: 36,001 (4)
abstracting: (p34<=0)
states: 29,377 (4)
abstracting: (p26<=0)
states: 42,625 (4)
abstracting: (p33<=1)
states: 43,201 (4)
abstracting: (p9<=p18)
states: 28,801 (4)
.abstracting: (p8<=1)
states: 43,201 (4)
.
EG iterations: 1
abstracting: (p0<=0)
states: 43,200 (4)
.
EG iterations: 0
abstracting: (p35<=0)
states: 29,377 (4)
.
EG iterations: 1
abstracting: (1<=p13)
states: 21,600 (4)
.abstracting: (p6<=1)
states: 43,201 (4)
.abstracting: (p34<=0)
states: 29,377 (4)
abstracting: (p2<=0)
states: 1
abstracting: (p15<=p18)
states: 28,801 (4)
abstracting: (p11<=1)
states: 43,201 (4)

EG iterations: 0
abstracting: (1<=p0)
states: 1
abstracting: (p21<=p9)
states: 36,001 (4)
abstracting: (p18<=1)
states: 43,201 (4)
abstracting: (p16<=p23)
states: 36,001 (4)
abstracting: (p29<=p31)
states: 32,833 (4)
abstracting: (p35<=0)
states: 29,377 (4)
.
EG iterations: 1
abstracting: (1<=p13)
states: 21,600 (4)
.abstracting: (p6<=1)
states: 43,201 (4)
.abstracting: (p35<=0)
states: 29,377 (4)
.
EG iterations: 1
abstracting: (1<=p13)
states: 21,600 (4)
.abstracting: (p6<=1)
states: 43,201 (4)
.
EG iterations: 0
-> the formula is FALSE

FORMULA SmartHome-PT-01-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: [[EG [E [[[p10<=p21 | AG [1<=p0]] | [[p29<=p19 | 1<=p33] | ~ [p33<=1]]] U p35<=1]] | EG [[E [~ [AF [1<=p32]] U AX [p19<=0]] | 1<=p16]]] | A [1<=p10 U ~ [[~ [[[p16<=0 | E [p20<=p24 U p11<=0]] | ~ [AG [1<=p31]]]] | [[p17<=p7 | AF [p13<=1]] | [A [p9<=p20 U p7<=1] & [AG [p4<=p24] | 1<=p25]]]]]]]
normalized: [[~ [EG [[[[[1<=p25 | ~ [E [true U ~ [p4<=p24]]]] & [~ [EG [~ [p7<=1]]] & ~ [E [~ [p7<=1] U [~ [p9<=p20] & ~ [p7<=1]]]]]] | [p17<=p7 | ~ [EG [~ [p13<=1]]]]] | ~ [[E [true U ~ [1<=p31]] | [p16<=0 | E [p20<=p24 U p11<=0]]]]]]] & ~ [E [[[[[1<=p25 | ~ [E [true U ~ [p4<=p24]]]] & [~ [EG [~ [p7<=1]]] & ~ [E [~ [p7<=1] U [~ [p9<=p20] & ~ [p7<=1]]]]]] | [p17<=p7 | ~ [EG [~ [p13<=1]]]]] | ~ [[E [true U ~ [1<=p31]] | [p16<=0 | E [p20<=p24 U p11<=0]]]]] U [~ [1<=p10] & [[[[1<=p25 | ~ [E [true U ~ [p4<=p24]]]] & [~ [EG [~ [p7<=1]]] & ~ [E [~ [p7<=1] U [~ [p9<=p20] & ~ [p7<=1]]]]]] | [p17<=p7 | ~ [EG [~ [p13<=1]]]]] | ~ [[E [true U ~ [1<=p31]] | [p16<=0 | E [p20<=p24 U p11<=0]]]]]]]]] | [EG [[1<=p16 | E [EG [~ [1<=p32]] U ~ [EX [~ [p19<=0]]]]]] | EG [E [[[~ [p33<=1] | [p29<=p19 | 1<=p33]] | [p10<=p21 | ~ [E [true U ~ [1<=p0]]]]] U p35<=1]]]]

abstracting: (p35<=1)
states: 43,201 (4)
abstracting: (1<=p0)
states: 1
abstracting: (p10<=p21)
states: 28,801 (4)
abstracting: (1<=p33)
states: 6,912 (3)
abstracting: (p29<=p19)
states: 33,985 (4)
abstracting: (p33<=1)
states: 43,201 (4)

EG iterations: 0
abstracting: (p19<=0)
states: 28,801 (4)
.abstracting: (1<=p32)
states: 10,368 (4)
.
EG iterations: 1
abstracting: (1<=p16)
states: 14,400 (4)
.
EG iterations: 1
abstracting: (p11<=0)
states: 1
abstracting: (p20<=p24)
states: 43,201 (4)
abstracting: (p16<=0)
states: 28,801 (4)
abstracting: (1<=p31)
states: 10,368 (4)
abstracting: (p13<=1)
states: 43,201 (4)
.
EG iterations: 1
abstracting: (p17<=p7)
states: 36,001 (4)
abstracting: (p7<=1)
states: 43,201 (4)
abstracting: (p9<=p20)
states: 28,801 (4)
abstracting: (p7<=1)
states: 43,201 (4)
abstracting: (p7<=1)
states: 43,201 (4)
.
EG iterations: 1
abstracting: (p4<=p24)
states: 43,201 (4)
abstracting: (1<=p25)
states: 576
abstracting: (1<=p10)
states: 21,600 (4)
abstracting: (p11<=0)
states: 1
abstracting: (p20<=p24)
states: 43,201 (4)
abstracting: (p16<=0)
states: 28,801 (4)
abstracting: (1<=p31)
states: 10,368 (4)
abstracting: (p13<=1)
states: 43,201 (4)
.
EG iterations: 1
abstracting: (p17<=p7)
states: 36,001 (4)
abstracting: (p7<=1)
states: 43,201 (4)
abstracting: (p9<=p20)
states: 28,801 (4)
abstracting: (p7<=1)
states: 43,201 (4)
abstracting: (p7<=1)
states: 43,201 (4)
.
EG iterations: 1
abstracting: (p4<=p24)
states: 43,201 (4)
abstracting: (1<=p25)
states: 576
abstracting: (p11<=0)
states: 1
abstracting: (p20<=p24)
states: 43,201 (4)
abstracting: (p16<=0)
states: 28,801 (4)
abstracting: (1<=p31)
states: 10,368 (4)
abstracting: (p13<=1)
states: 43,201 (4)
.
EG iterations: 1
abstracting: (p17<=p7)
states: 36,001 (4)
abstracting: (p7<=1)
states: 43,201 (4)
abstracting: (p9<=p20)
states: 28,801 (4)
abstracting: (p7<=1)
states: 43,201 (4)
abstracting: (p7<=1)
states: 43,201 (4)
.
EG iterations: 1
abstracting: (p4<=p24)
states: 43,201 (4)
abstracting: (1<=p25)
states: 576

EG iterations: 0
-> the formula is TRUE

FORMULA SmartHome-PT-01-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EG [[AF [[~ [[[p17<=1 | p15<=p34] | EF [p1<=p33]]] | [[[p36<=p29 & p10<=p30] & [p10<=p36 | 1<=p30]] | 1<=p27]]] | AG [[[[AX [p13<=p16] & [p16<=p8 & p6<=1]] & EX [p18<=1]] | [[[p25<=1 & p31<=p34] | [p20<=p11 | p20<=1]] | A [p12<=0 U p14<=0]]]]]]
normalized: EG [[~ [E [true U ~ [[[[~ [EG [~ [p14<=0]]] & ~ [E [~ [p14<=0] U [~ [p12<=0] & ~ [p14<=0]]]]] | [[p20<=p11 | p20<=1] | [p25<=1 & p31<=p34]]] | [EX [p18<=1] & [[p16<=p8 & p6<=1] & ~ [EX [~ [p13<=p16]]]]]]]]] | ~ [EG [~ [[[1<=p27 | [[p10<=p36 | 1<=p30] & [p36<=p29 & p10<=p30]]] | ~ [[E [true U p1<=p33] | [p17<=1 | p15<=p34]]]]]]]]]

abstracting: (p15<=p34)
states: 28,513 (4)
abstracting: (p17<=1)
states: 43,201 (4)
abstracting: (p1<=p33)
states: 6,913 (3)
abstracting: (p10<=p30)
states: 26,785 (4)
abstracting: (p36<=p29)
states: 33,985 (4)
abstracting: (1<=p30)
states: 10,368 (4)
abstracting: (p10<=p36)
states: 28,513 (4)
abstracting: (1<=p27)
states: 576
.
EG iterations: 1
abstracting: (p13<=p16)
states: 28,801 (4)
.abstracting: (p6<=1)
states: 43,201 (4)
abstracting: (p16<=p8)
states: 43,201 (4)
abstracting: (p18<=1)
states: 43,201 (4)
.abstracting: (p31<=p34)
states: 36,289 (4)
abstracting: (p25<=1)
states: 43,201 (4)
abstracting: (p20<=1)
states: 43,201 (4)
abstracting: (p20<=p11)
states: 43,201 (4)
abstracting: (p14<=0)
states: 21,601 (4)
abstracting: (p12<=0)
states: 21,601 (4)
abstracting: (p14<=0)
states: 21,601 (4)
abstracting: (p14<=0)
states: 21,601 (4)
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA SmartHome-PT-01-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

totally nodes used: 16247 (1.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 72431 202993 275424
used/not used/entry size/cache size: 211070 66897794 16 1024MB
basic ops cache: hits/miss/sum: 20092 42862 62954
used/not used/entry size/cache size: 69726 16707490 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: 2170 5256 7426
used/not used/entry size/cache size: 5256 8383352 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 67093010
1 15472
2 371
3 11
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.197sec


BK_STOP 1679187932814

--------------------
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:972 (8), effective:30 (0)

initing FirstDep: 0m 0.000sec


iterations count:398 (3), effective:13 (0)

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

iterations count:129 (1), effective:2 (0)

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

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

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

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

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

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

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

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

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

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

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

iterations count:128 (1), effective:2 (0)

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

iterations count:137 (1), effective:2 (0)

iterations count:349 (3), effective:8 (0)

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

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

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

iterations count:349 (3), effective:8 (0)

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

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

iterations count:349 (3), effective:8 (0)

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

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

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

iterations count:253 (2), effective:5 (0)

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

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

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

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

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

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

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

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

iterations count:133 (1), effective:2 (0)

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

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

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

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

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

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

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

iterations count:292 (2), effective:12 (0)

iterations count:139 (1), effective:1 (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="SmartHome-PT-01"
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 SmartHome-PT-01, 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 r449-smll-167912641200153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-01.tgz
mv SmartHome-PT-01 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;