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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.8K Feb 26 05:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 05:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 05:46 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.5K Feb 25 17:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 15K Feb 25 17:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 05:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 05:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 05:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 05:52 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 27K 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-02-CTLCardinality-00
FORMULA_NAME SmartHome-PT-02-CTLCardinality-01
FORMULA_NAME SmartHome-PT-02-CTLCardinality-02
FORMULA_NAME SmartHome-PT-02-CTLCardinality-03
FORMULA_NAME SmartHome-PT-02-CTLCardinality-04
FORMULA_NAME SmartHome-PT-02-CTLCardinality-05
FORMULA_NAME SmartHome-PT-02-CTLCardinality-06
FORMULA_NAME SmartHome-PT-02-CTLCardinality-07
FORMULA_NAME SmartHome-PT-02-CTLCardinality-08
FORMULA_NAME SmartHome-PT-02-CTLCardinality-09
FORMULA_NAME SmartHome-PT-02-CTLCardinality-10
FORMULA_NAME SmartHome-PT-02-CTLCardinality-11
FORMULA_NAME SmartHome-PT-02-CTLCardinality-12
FORMULA_NAME SmartHome-PT-02-CTLCardinality-13
FORMULA_NAME SmartHome-PT-02-CTLCardinality-14
FORMULA_NAME SmartHome-PT-02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679188056616

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-02
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_02
(NrP: 41 NrTr: 127 NrArc: 359)

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

net check time: 0m 0.000sec

init dd package: 0m 3.401sec


RS generation: 0m 0.006sec


-> reachability set: #nodes 411 (4.1e+02) #states 86,401 (4)



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

checking: EF [AG [EX [p12<=1]]]
normalized: E [true U ~ [E [true U ~ [EX [p12<=1]]]]]

abstracting: (p12<=1)
states: 86,401 (4)
.-> the formula is TRUE

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

MC time: 0m 0.012sec

checking: EX [EF [p27<=0]]
normalized: EX [E [true U p27<=0]]

abstracting: (p27<=0)
states: 1
.-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AX [EX [EF [AG [p28<=p18]]]]
normalized: ~ [EX [~ [EX [E [true U ~ [E [true U ~ [p28<=p18]]]]]]]]

abstracting: (p28<=p18)
states: 85,825 (4)
..-> the formula is TRUE

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

MC time: 0m 0.009sec

checking: AX [EX [[EX [A [p4<=1 U 1<=p39]] | ~ [AX [AG [p2<=1]]]]]]
normalized: ~ [EX [~ [EX [[EX [E [true U ~ [p2<=1]]] | EX [[~ [EG [~ [1<=p39]]] & ~ [E [~ [1<=p39] U [~ [p4<=1] & ~ [1<=p39]]]]]]]]]]]

abstracting: (1<=p39)
states: 27,648 (4)
abstracting: (p4<=1)
states: 86,401 (4)
abstracting: (1<=p39)
states: 27,648 (4)
abstracting: (1<=p39)
states: 27,648 (4)
.
EG iterations: 1
.abstracting: (p2<=1)
states: 86,401 (4)
...-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: EF [AG [A [1<=p9 U EX [[p29<=0 & 1<=p25]]]]]
normalized: E [true U ~ [E [true U ~ [[~ [EG [~ [EX [[p29<=0 & 1<=p25]]]]] & ~ [E [~ [EX [[p29<=0 & 1<=p25]]] U [~ [1<=p9] & ~ [EX [[p29<=0 & 1<=p25]]]]]]]]]]]

abstracting: (1<=p25)
states: 43,200 (4)
abstracting: (p29<=0)
states: 85,249 (4)
.abstracting: (1<=p9)
states: 43,200 (4)
abstracting: (1<=p25)
states: 43,200 (4)
abstracting: (p29<=0)
states: 85,249 (4)
.abstracting: (1<=p25)
states: 43,200 (4)
abstracting: (p29<=0)
states: 85,249 (4)
...
EG iterations: 2
-> the formula is TRUE

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

MC time: 0m 0.014sec

checking: ~ [EF [EG [AG [A [p14<=p31 U p25<=p19]]]]]
normalized: ~ [E [true U EG [~ [E [true U ~ [[~ [EG [~ [p25<=p19]]] & ~ [E [~ [p25<=p19] U [~ [p14<=p31] & ~ [p25<=p19]]]]]]]]]]]

abstracting: (p25<=p19)
states: 57,601 (4)
abstracting: (p14<=p31)
states: 27,649 (4)
abstracting: (p25<=p19)
states: 57,601 (4)
abstracting: (p25<=p19)
states: 57,601 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.012sec

checking: E [A [p38<=p15 U EG [~ [AF [p30<=0]]]] U EG [p38<=p13]]
normalized: E [[~ [EG [~ [EG [EG [~ [p30<=0]]]]]] & ~ [E [~ [EG [EG [~ [p30<=0]]]] U [~ [p38<=p15] & ~ [EG [EG [~ [p30<=0]]]]]]]] U EG [p38<=p13]]

abstracting: (p38<=p13)
states: 72,577 (4)
.
EG iterations: 1
abstracting: (p30<=0)
states: 85,249 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p38<=p15)
states: 72,577 (4)
abstracting: (p30<=0)
states: 85,249 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p30<=0)
states: 85,249 (4)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.008sec

checking: EF [~ [[AX [EX [E [p39<=1 U 1<=p25]]] & [~ [p33<=p23] | AX [EF [p23<=p27]]]]]]
normalized: E [true U ~ [[[~ [EX [~ [E [true U p23<=p27]]]] | ~ [p33<=p23]] & ~ [EX [~ [EX [E [p39<=1 U 1<=p25]]]]]]]]

abstracting: (1<=p25)
states: 43,200 (4)
abstracting: (p39<=1)
states: 86,401 (4)
..abstracting: (p33<=p23)
states: 72,577 (4)
abstracting: (p23<=p27)
states: 86,401 (4)
.-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: A [1<=p2 U EX [E [1<=p13 U [p29<=1 & [EF [1<=p0] & [p0<=p34 & 1<=p14]]]]]]
normalized: [~ [EG [~ [EX [E [1<=p13 U [p29<=1 & [[p0<=p34 & 1<=p14] & E [true U 1<=p0]]]]]]]] & ~ [E [~ [EX [E [1<=p13 U [p29<=1 & [[p0<=p34 & 1<=p14] & E [true U 1<=p0]]]]]] U [~ [1<=p2] & ~ [EX [E [1<=p13 U [p29<=1 & [[p0<=p34 & 1<=p14] & E [true U 1<=p0]]]]]]]]]]

abstracting: (1<=p0)
states: 1
abstracting: (1<=p14)
states: 86,400 (4)
abstracting: (p0<=p34)
states: 86,400 (4)
abstracting: (p29<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
.abstracting: (1<=p2)
states: 86,400 (4)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p14)
states: 86,400 (4)
abstracting: (p0<=p34)
states: 86,400 (4)
abstracting: (p29<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
.abstracting: (1<=p0)
states: 1
abstracting: (1<=p14)
states: 86,400 (4)
abstracting: (p0<=p34)
states: 86,400 (4)
abstracting: (p29<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
.
EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: A [1<=p29 U A [p12<=1 U A [A [p12<=0 U [p8<=p31 & 1<=p23]] U AG [A [1<=p24 U p32<=1]]]]]
normalized: [~ [EG [~ [[~ [EG [~ [[~ [EG [E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]]]] & ~ [E [E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]] U [~ [[~ [EG [~ [[p8<=p31 & 1<=p23]]]] & ~ [E [~ [[p8<=p31 & 1<=p23]] U [~ [p12<=0] & ~ [[p8<=p31 & 1<=p23]]]]]]] & E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]]]] & ~ [E [E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]] U [~ [[~ [EG [~ [[p8<=p31 & 1<=p23]]]] & ~ [E [~ [[p8<=p31 & 1<=p23]] U [~ [p12<=0] & ~ [[p8<=p31 & 1<=p23]]]]]]] & E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]]]]]]] U [~ [p12<=1] & ~ [[~ [EG [E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]]]] & ~ [E [E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]] U [~ [[~ [EG [~ [[p8<=p31 & 1<=p23]]]] & ~ [E [~ [[p8<=p31 & 1<=p23]] U [~ [p12<=0] & ~ [[p8<=p31 & 1<=p23]]]]]]] & E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[~ [EG [E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]]]] & ~ [E [E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]] U [~ [[~ [EG [~ [[p8<=p31 & 1<=p23]]]] & ~ [E [~ [[p8<=p31 & 1<=p23]] U [~ [p12<=0] & ~ [[p8<=p31 & 1<=p23]]]]]]] & E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]]]] & ~ [E [E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]] U [~ [[~ [EG [~ [[p8<=p31 & 1<=p23]]]] & ~ [E [~ [[p8<=p31 & 1<=p23]] U [~ [p12<=0] & ~ [[p8<=p31 & 1<=p23]]]]]]] & E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]]]]]]] U [~ [p12<=1] & ~ [[~ [EG [E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]]]] & ~ [E [E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]] U [~ [[~ [EG [~ [[p8<=p31 & 1<=p23]]]] & ~ [E [~ [[p8<=p31 & 1<=p23]] U [~ [p12<=0] & ~ [[p8<=p31 & 1<=p23]]]]]]] & E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]]]]]]]]]]]] U [~ [1<=p29] & ~ [[~ [EG [~ [[~ [EG [E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]]]] & ~ [E [E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]] U [~ [[~ [EG [~ [[p8<=p31 & 1<=p23]]]] & ~ [E [~ [[p8<=p31 & 1<=p23]] U [~ [p12<=0] & ~ [[p8<=p31 & 1<=p23]]]]]]] & E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]]]] & ~ [E [E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]] U [~ [[~ [EG [~ [[p8<=p31 & 1<=p23]]]] & ~ [E [~ [[p8<=p31 & 1<=p23]] U [~ [p12<=0] & ~ [[p8<=p31 & 1<=p23]]]]]]] & E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]]]]]]] U [~ [p12<=1] & ~ [[~ [EG [E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]]]] & ~ [E [E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]] U [~ [[~ [EG [~ [[p8<=p31 & 1<=p23]]]] & ~ [E [~ [[p8<=p31 & 1<=p23]] U [~ [p12<=0] & ~ [[p8<=p31 & 1<=p23]]]]]]] & E [true U ~ [[~ [EG [~ [p32<=1]]] & ~ [E [~ [p32<=1] U [~ [1<=p24] & ~ [p32<=1]]]]]]]]]]]]]]]]]]]]]

abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
abstracting: (p12<=0)
states: 43,201 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p12<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
abstracting: (p12<=0)
states: 43,201 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
abstracting: (p12<=0)
states: 43,201 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p29)
states: 1,152 (3)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
abstracting: (p12<=0)
states: 43,201 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p12<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
abstracting: (p12<=0)
states: 43,201 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
abstracting: (p12<=0)
states: 43,201 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
abstracting: (p12<=0)
states: 43,201 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p12<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
abstracting: (p12<=0)
states: 43,201 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
abstracting: (p12<=0)
states: 43,201 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
abstracting: (1<=p23)
states: 28,800 (4)
abstracting: (p8<=p31)
states: 27,649 (4)
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p24)
states: 28,800 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (p32<=1)
states: 86,401 (4)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.015sec

checking: EF [[EG [~ [EX [A [p15<=p0 U p34<=p17]]]] & ~ [[~ [EG [[p28<=p2 | p36<=p8]]] | p31<=0]]]]
normalized: E [true U [~ [[p31<=0 | ~ [EG [[p28<=p2 | p36<=p8]]]]] & EG [~ [EX [[~ [EG [~ [p34<=p17]]] & ~ [E [~ [p34<=p17] U [~ [p15<=p0] & ~ [p34<=p17]]]]]]]]]]

abstracting: (p34<=p17)
states: 76,033 (4)
abstracting: (p15<=p0)
states: 43,201 (4)
abstracting: (p34<=p17)
states: 76,033 (4)
abstracting: (p34<=p17)
states: 76,033 (4)
.
EG iterations: 1
..
EG iterations: 1
abstracting: (p36<=p8)
states: 86,401 (4)
abstracting: (p28<=p2)
states: 86,401 (4)

EG iterations: 0
abstracting: (p31<=0)
states: 58,753 (4)
-> the formula is FALSE

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

MC time: 0m 0.004sec

checking: ~ [AG [[[[~ [p24<=p26] & p31<=1] | [~ [[1<=p34 & p8<=p27]] & AF [p23<=p29]]] | p28<=p27]]]
normalized: E [true U ~ [[p28<=p27 | [[~ [EG [~ [p23<=p29]]] & ~ [[1<=p34 & p8<=p27]]] | [p31<=1 & ~ [p24<=p26]]]]]]

abstracting: (p24<=p26)
states: 72,001 (4)
abstracting: (p31<=1)
states: 86,401 (4)
abstracting: (p8<=p27)
states: 86,401 (4)
abstracting: (1<=p34)
states: 20,736 (4)
abstracting: (p23<=p29)
states: 57,985 (4)
.
EG iterations: 1
abstracting: (p28<=p27)
states: 86,401 (4)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: ~ [[EF [A [[A [1<=p34 U p31<=0] & [1<=p39 & p15<=p6]] U ~ [[p0<=p40 & p13<=p9]]]] | EG [AF [~ [AF [1<=p29]]]]]]
normalized: ~ [[EG [~ [EG [~ [EG [~ [1<=p29]]]]]] | E [true U [~ [EG [[p0<=p40 & p13<=p9]]] & ~ [E [[p0<=p40 & p13<=p9] U [~ [[[1<=p39 & p15<=p6] & [~ [EG [~ [p31<=0]]] & ~ [E [~ [p31<=0] U [~ [1<=p34] & ~ [p31<=0]]]]]]] & [p0<=p40 & p13<=p9]]]]]]]]

abstracting: (p13<=p9)
states: 64,801 (4)
abstracting: (p0<=p40)
states: 86,400 (4)
abstracting: (p31<=0)
states: 58,753 (4)
abstracting: (1<=p34)
states: 20,736 (4)
abstracting: (p31<=0)
states: 58,753 (4)
abstracting: (p31<=0)
states: 58,753 (4)
.
EG iterations: 1
abstracting: (p15<=p6)
states: 64,801 (4)
abstracting: (1<=p39)
states: 27,648 (4)
abstracting: (p13<=p9)
states: 64,801 (4)
abstracting: (p0<=p40)
states: 86,400 (4)
abstracting: (p13<=p9)
states: 64,801 (4)
abstracting: (p0<=p40)
states: 86,400 (4)
.
EG iterations: 1
abstracting: (1<=p29)
states: 1,152 (3)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.017sec

checking: [EF [[EG [[~ [p17<=p37] & ~ [EF [1<=p23]]]] & [~ [[~ [AF [p27<=p34]] & AF [p34<=1]]] & ~ [[[EG [1<=p37] | [p5<=0 & 1<=p16]] & ~ [p8<=1]]]]]] & AF [~ [EX [A [E [p1<=p26 U p36<=0] U ~ [p22<=0]]]]]]
normalized: [~ [EG [EX [[~ [EG [p22<=0]] & ~ [E [p22<=0 U [p22<=0 & ~ [E [p1<=p26 U p36<=0]]]]]]]]] & E [true U [[~ [[~ [p8<=1] & [[p5<=0 & 1<=p16] | EG [1<=p37]]]] & ~ [[~ [EG [~ [p34<=1]]] & EG [~ [p27<=p34]]]]] & EG [[~ [E [true U 1<=p23]] & ~ [p17<=p37]]]]]]

abstracting: (p17<=p37)
states: 57,025 (4)
abstracting: (1<=p23)
states: 28,800 (4)
.
EG iterations: 1
abstracting: (p27<=p34)
states: 20,737 (4)
.
EG iterations: 1
abstracting: (p34<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (1<=p37)
states: 27,648 (4)
.
EG iterations: 1
abstracting: (1<=p16)
states: 43,200 (4)
abstracting: (p5<=0)
states: 1
abstracting: (p8<=1)
states: 86,401 (4)
abstracting: (p36<=0)
states: 72,577 (4)
abstracting: (p1<=p26)
states: 43,201 (4)
abstracting: (p22<=0)
states: 57,601 (4)
abstracting: (p22<=0)
states: 57,601 (4)
abstracting: (p22<=0)
states: 57,601 (4)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.008sec

checking: A [[~ [AG [[[EX [p38<=p15] | [p8<=1 | p35<=p15]] & AF [1<=p5]]]] & p37<=p32] U [[~ [[~ [EG [p7<=0]] | p5<=1]] | AF [~ [AG [p28<=p14]]]] & [AF [p17<=0] & [~ [[A [1<=p35 U 1<=p12] & ~ [[p40<=p29 & p31<=0]]]] | A [[[p38<=1 & p10<=0] | 1<=p34] U AX [p20<=0]]]]]]
normalized: [~ [EG [~ [[[[[~ [EG [EX [~ [p20<=0]]]] & ~ [E [EX [~ [p20<=0]] U [~ [[1<=p34 | [p38<=1 & p10<=0]]] & EX [~ [p20<=0]]]]]] | ~ [[~ [[p40<=p29 & p31<=0]] & [~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [1<=p35] & ~ [1<=p12]]]]]]]] & ~ [EG [~ [p17<=0]]]] & [~ [EG [~ [E [true U ~ [p28<=p14]]]]] | ~ [[p5<=1 | ~ [EG [p7<=0]]]]]]]]] & ~ [E [~ [[[[[~ [EG [EX [~ [p20<=0]]]] & ~ [E [EX [~ [p20<=0]] U [~ [[1<=p34 | [p38<=1 & p10<=0]]] & EX [~ [p20<=0]]]]]] | ~ [[~ [[p40<=p29 & p31<=0]] & [~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [1<=p35] & ~ [1<=p12]]]]]]]] & ~ [EG [~ [p17<=0]]]] & [~ [EG [~ [E [true U ~ [p28<=p14]]]]] | ~ [[p5<=1 | ~ [EG [p7<=0]]]]]]] U [~ [[p37<=p32 & E [true U ~ [[~ [EG [~ [1<=p5]]] & [[p8<=1 | p35<=p15] | EX [p38<=p15]]]]]]] & ~ [[[[[~ [EG [EX [~ [p20<=0]]]] & ~ [E [EX [~ [p20<=0]] U [~ [[1<=p34 | [p38<=1 & p10<=0]]] & EX [~ [p20<=0]]]]]] | ~ [[~ [[p40<=p29 & p31<=0]] & [~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [1<=p35] & ~ [1<=p12]]]]]]]] & ~ [EG [~ [p17<=0]]]] & [~ [EG [~ [E [true U ~ [p28<=p14]]]]] | ~ [[p5<=1 | ~ [EG [p7<=0]]]]]]]]]]]

abstracting: (p7<=0)
states: 43,201 (4)
..
EG iterations: 2
abstracting: (p5<=1)
states: 86,401 (4)
abstracting: (p28<=p14)
states: 86,401 (4)

EG iterations: 0
abstracting: (p17<=0)
states: 43,201 (4)
.
EG iterations: 1
abstracting: (1<=p12)
states: 43,200 (4)
abstracting: (1<=p35)
states: 20,736 (4)
abstracting: (1<=p12)
states: 43,200 (4)
abstracting: (1<=p12)
states: 43,200 (4)
.
EG iterations: 1
abstracting: (p31<=0)
states: 58,753 (4)
abstracting: (p40<=p29)
states: 58,753 (4)
abstracting: (p20<=0)
states: 57,601 (4)
.abstracting: (p10<=0)
states: 43,201 (4)
abstracting: (p38<=1)
states: 86,401 (4)
abstracting: (1<=p34)
states: 20,736 (4)
abstracting: (p20<=0)
states: 57,601 (4)
.abstracting: (p20<=0)
states: 57,601 (4)
..
EG iterations: 1
abstracting: (p38<=p15)
states: 72,577 (4)
.abstracting: (p35<=p15)
states: 76,033 (4)
abstracting: (p8<=1)
states: 86,401 (4)
abstracting: (1<=p5)
states: 86,400 (4)
..
EG iterations: 2
abstracting: (p37<=p32)
states: 67,969 (4)
abstracting: (p7<=0)
states: 43,201 (4)
..
EG iterations: 2
abstracting: (p5<=1)
states: 86,401 (4)
abstracting: (p28<=p14)
states: 86,401 (4)

EG iterations: 0
abstracting: (p17<=0)
states: 43,201 (4)
.
EG iterations: 1
abstracting: (1<=p12)
states: 43,200 (4)
abstracting: (1<=p35)
states: 20,736 (4)
abstracting: (1<=p12)
states: 43,200 (4)
abstracting: (1<=p12)
states: 43,200 (4)
.
EG iterations: 1
abstracting: (p31<=0)
states: 58,753 (4)
abstracting: (p40<=p29)
states: 58,753 (4)
abstracting: (p20<=0)
states: 57,601 (4)
.abstracting: (p10<=0)
states: 43,201 (4)
abstracting: (p38<=1)
states: 86,401 (4)
abstracting: (1<=p34)
states: 20,736 (4)
abstracting: (p20<=0)
states: 57,601 (4)
.abstracting: (p20<=0)
states: 57,601 (4)
..
EG iterations: 1
abstracting: (p7<=0)
states: 43,201 (4)
..
EG iterations: 2
abstracting: (p5<=1)
states: 86,401 (4)
abstracting: (p28<=p14)
states: 86,401 (4)

EG iterations: 0
abstracting: (p17<=0)
states: 43,201 (4)
.
EG iterations: 1
abstracting: (1<=p12)
states: 43,200 (4)
abstracting: (1<=p35)
states: 20,736 (4)
abstracting: (1<=p12)
states: 43,200 (4)
abstracting: (1<=p12)
states: 43,200 (4)
.
EG iterations: 1
abstracting: (p31<=0)
states: 58,753 (4)
abstracting: (p40<=p29)
states: 58,753 (4)
abstracting: (p20<=0)
states: 57,601 (4)
.abstracting: (p10<=0)
states: 43,201 (4)
abstracting: (p38<=1)
states: 86,401 (4)
abstracting: (1<=p34)
states: 20,736 (4)
abstracting: (p20<=0)
states: 57,601 (4)
.abstracting: (p20<=0)
states: 57,601 (4)
..
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.032sec

checking: [[AX [p2<=p18] & [EX [~ [AX [p30<=0]]] | E [~ [AX [p3<=1]] U EF [[AG [1<=p32] & [p21<=p32 & p34<=p40]]]]]] & [A [A [A [p38<=p26 U [1<=p17 | p15<=p19]] U A [AX [p13<=1] U p27<=1]] U AF [p5<=p28]] & [AG [[AX [AF [1<=p4]] & A [~ [1<=p17] U p32<=0]]] | AG [p13<=1]]]]
normalized: [[[~ [E [true U ~ [p13<=1]]] | ~ [E [true U ~ [[[~ [EG [~ [p32<=0]]] & ~ [E [~ [p32<=0] U [1<=p17 & ~ [p32<=0]]]]] & ~ [EX [EG [~ [1<=p4]]]]]]]]] & [~ [EG [EG [~ [p5<=p28]]]] & ~ [E [EG [~ [p5<=p28]] U [~ [[~ [EG [~ [[~ [EG [~ [p27<=1]]] & ~ [E [~ [p27<=1] U [EX [~ [p13<=1]] & ~ [p27<=1]]]]]]]] & ~ [E [~ [[~ [EG [~ [p27<=1]]] & ~ [E [~ [p27<=1] U [EX [~ [p13<=1]] & ~ [p27<=1]]]]]] U [~ [[~ [EG [~ [[1<=p17 | p15<=p19]]]] & ~ [E [~ [[1<=p17 | p15<=p19]] U [~ [p38<=p26] & ~ [[1<=p17 | p15<=p19]]]]]]] & ~ [[~ [EG [~ [p27<=1]]] & ~ [E [~ [p27<=1] U [EX [~ [p13<=1]] & ~ [p27<=1]]]]]]]]]]] & EG [~ [p5<=p28]]]]]]] & [[E [EX [~ [p3<=1]] U E [true U [[p21<=p32 & p34<=p40] & ~ [E [true U ~ [1<=p32]]]]]] | EX [EX [~ [p30<=0]]]] & ~ [EX [~ [p2<=p18]]]]]

abstracting: (p2<=p18)
states: 43,201 (4)
.abstracting: (p30<=0)
states: 85,249 (4)
..abstracting: (1<=p32)
states: 27,648 (4)
abstracting: (p34<=p40)
states: 72,577 (4)
abstracting: (p21<=p32)
states: 66,817 (4)
abstracting: (p3<=1)
states: 86,401 (4)
.abstracting: (p5<=p28)
states: 1,153 (3)
.
EG iterations: 1
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (p13<=1)
states: 86,401 (4)
.abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (p27<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (p15<=p19)
states: 57,601 (4)
abstracting: (1<=p17)
states: 43,200 (4)
abstracting: (p38<=p26)
states: 72,577 (4)
abstracting: (p15<=p19)
states: 57,601 (4)
abstracting: (1<=p17)
states: 43,200 (4)
abstracting: (p15<=p19)
states: 57,601 (4)
abstracting: (1<=p17)
states: 43,200 (4)
.
EG iterations: 1
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (p13<=1)
states: 86,401 (4)
.abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (p27<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (p13<=1)
states: 86,401 (4)
.abstracting: (p27<=1)
states: 86,401 (4)
abstracting: (p27<=1)
states: 86,401 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p5<=p28)
states: 1,153 (3)
.
EG iterations: 1
abstracting: (p5<=p28)
states: 1,153 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p4)
states: 43,200 (4)
..
EG iterations: 2
.abstracting: (p32<=0)
states: 58,753 (4)
abstracting: (1<=p17)
states: 43,200 (4)
abstracting: (p32<=0)
states: 58,753 (4)
abstracting: (p32<=0)
states: 58,753 (4)
.
EG iterations: 1
abstracting: (p13<=1)
states: 86,401 (4)
-> the formula is TRUE

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

MC time: 0m 0.023sec

totally nodes used: 18874 (1.9e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 96312 281059 377371
used/not used/entry size/cache size: 289346 66819518 16 1024MB
basic ops cache: hits/miss/sum: 23315 49939 73254
used/not used/entry size/cache size: 80102 16697114 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: 2240 5170 7410
used/not used/entry size/cache size: 5170 8383438 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 67090460
1 17958
2 422
3 24
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.142sec


BK_STOP 1679188061825

--------------------
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:1135 (8), effective:31 (0)

initing FirstDep: 0m 0.005sec


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

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

iterations count:291 (2), effective:2 (0)

iterations count:254 (2), effective:3 (0)

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

iterations count:258 (2), effective:6 (0)

iterations count:386 (3), effective:7 (0)

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

iterations count:300 (2), effective:3 (0)

iterations count:182 (1), effective:6 (0)

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

iterations count:290 (2), effective:2 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:267 (2), effective:3 (0)

iterations count:158 (1), effective:3 (0)

iterations count:465 (3), effective:11 (0)

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

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

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

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

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

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

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

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

iterations count:321 (2), effective:8 (0)

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

iterations count:247 (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-02"
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-02, 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-167912641200161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-02.tgz
mv SmartHome-PT-02 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 ;