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.r097-tall-167814469900713.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 DLCround-PT-09a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r097-tall-167814469900713
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 968K
-rw-r--r-- 1 mcc users 6.1K Feb 25 19:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 19:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 19:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 19:11 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.7K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 20:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 20:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 20:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 566K 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 DLCround-PT-09a-CTLCardinality-00
FORMULA_NAME DLCround-PT-09a-CTLCardinality-01
FORMULA_NAME DLCround-PT-09a-CTLCardinality-02
FORMULA_NAME DLCround-PT-09a-CTLCardinality-03
FORMULA_NAME DLCround-PT-09a-CTLCardinality-04
FORMULA_NAME DLCround-PT-09a-CTLCardinality-05
FORMULA_NAME DLCround-PT-09a-CTLCardinality-06
FORMULA_NAME DLCround-PT-09a-CTLCardinality-07
FORMULA_NAME DLCround-PT-09a-CTLCardinality-08
FORMULA_NAME DLCround-PT-09a-CTLCardinality-09
FORMULA_NAME DLCround-PT-09a-CTLCardinality-10
FORMULA_NAME DLCround-PT-09a-CTLCardinality-11
FORMULA_NAME DLCround-PT-09a-CTLCardinality-12
FORMULA_NAME DLCround-PT-09a-CTLCardinality-13
FORMULA_NAME DLCround-PT-09a-CTLCardinality-14
FORMULA_NAME DLCround-PT-09a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678277576633

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=DLCround-PT-09a
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: DLCround_PT_09a
(NrP: 299 NrTr: 2243 NrArc: 8689)

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

net check time: 0m 0.001sec

init dd package: 0m 2.872sec


RS generation: 2m20.618sec


-> reachability set: #nodes 611885 (6.1e+05) #states 24,010,000,000,001 (13)



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

checking: EX [p49<=p208]
normalized: EX [p49<=p208]

abstracting: (p49<=p208)
states: 24,010,000,000,001 (13)
.-> the formula is TRUE

FORMULA DLCround-PT-09a-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m33.967sec

checking: ~ [AX [EX [[AX [AG [p50<=1]] & AG [E [p119<=0 U p271<=0]]]]]]
normalized: EX [~ [EX [[~ [EX [E [true U ~ [p50<=1]]]] & ~ [E [true U ~ [E [p119<=0 U p271<=0]]]]]]]]

abstracting: (p271<=0)
states: 1
abstracting: (p119<=0)
states: 21,609,000,000,001 (13)
abstracting: (p50<=1)
states: 24,010,000,000,001 (13)
...-> the formula is TRUE

FORMULA DLCround-PT-09a-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.015sec

checking: ~ [AG [E [AG [1<=p245] U p31<=p22]]]
normalized: E [true U ~ [E [~ [E [true U ~ [1<=p245]]] U p31<=p22]]]

abstracting: (p31<=p22)
states: 21,952,000,000,001 (13)
abstracting: (1<=p245)
states: 24,010,000,000,000 (13)
-> the formula is FALSE

FORMULA DLCround-PT-09a-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.958sec

checking: AF [AX [AF [[AG [p120<=p139] & EX [1<=p39]]]]]
normalized: ~ [EG [EX [EG [~ [[EX [1<=p39] & ~ [E [true U ~ [p120<=p139]]]]]]]]]

abstracting: (p120<=p139)
states: 24,010,000,000,001 (13)
abstracting: (1<=p39)
states: 2,401,000,000,000 (12)
..MC time: 4m11.192sec

checking: AF [~ [EF [AF [[AX [p107<=p0] & [p216<=p269 | p211<=1]]]]]]
normalized: ~ [EG [E [true U ~ [EG [~ [[[p216<=p269 | p211<=1] & ~ [EX [~ [p107<=p0]]]]]]]]]]

abstracting: (p107<=p0)
states: 21,609,000,000,001 (13)
.abstracting: (p211<=1)
states: 24,010,000,000,001 (13)
abstracting: (p216<=p269)
states: 24,010,000,000,001 (13)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA DLCround-PT-09a-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m50.842sec

checking: ~ [AG [[[p145<=p200 | EX [1<=p35]] | p187<=p111]]]
normalized: E [true U ~ [[p187<=p111 | [p145<=p200 | EX [1<=p35]]]]]

abstracting: (1<=p35)
states: 2,401,000,000,000 (12)
.abstracting: (p145<=p200)
states: 24,010,000,000,001 (13)
abstracting: (p187<=p111)
states: 2,401,000,000,001 (12)
-> the formula is FALSE

FORMULA DLCround-PT-09a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m47.665sec

checking: EF [A [EG [[EG [p269<=p85] & AG [p138<=p120]]] U AG [1<=p208]]]
normalized: E [true U [~ [EG [E [true U ~ [1<=p208]]]] & ~ [E [E [true U ~ [1<=p208]] U [~ [EG [[~ [E [true U ~ [p138<=p120]]] & EG [p269<=p85]]]] & E [true U ~ [1<=p208]]]]]]]

abstracting: (1<=p208)
states: 24,010,000,000,000 (13)
abstracting: (p269<=p85)
states: 2,401,000,000,001 (12)
..
EG iterations: 2
abstracting: (p138<=p120)
states: 2,401,000,000,001 (12)
.
EG iterations: 1
abstracting: (1<=p208)
states: 24,010,000,000,000 (13)
abstracting: (1<=p208)
states: 24,010,000,000,000 (13)
..
EG iterations: 2
-> the formula is TRUE

FORMULA DLCround-PT-09a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m27.941sec

checking: AX [~ [AG [A [[[p273<=p69 & p184<=p60] | AX [p247<=1]] U EG [p123<=0]]]]]
normalized: ~ [EX [~ [E [true U ~ [[~ [EG [~ [EG [p123<=0]]]] & ~ [E [~ [EG [p123<=0]] U [~ [[~ [EX [~ [p247<=1]]] | [p273<=p69 & p184<=p60]]] & ~ [EG [p123<=0]]]]]]]]]]]

abstracting: (p123<=0)
states: 21,609,000,000,001 (13)
.
EG iterations: 1
abstracting: (p184<=p60)
states: 2,401,000,000,001 (12)
abstracting: (p273<=p69)
states: 2,401,000,000,001 (12)
abstracting: (p247<=1)
states: 24,010,000,000,001 (13)
.abstracting: (p123<=0)
states: 21,609,000,000,001 (13)
.
EG iterations: 1
abstracting: (p123<=0)
states: 21,609,000,000,001 (13)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE

FORMULA DLCround-PT-09a-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.868sec

checking: EX [[[AG [[1<=p224 | 1<=p203]] | 1<=p44] | EG [[p163<=p15 & ~ [AX [p60<=1]]]]]]
normalized: EX [[EG [[p163<=p15 & EX [~ [p60<=1]]]] | [1<=p44 | ~ [E [true U ~ [[1<=p224 | 1<=p203]]]]]]]

abstracting: (1<=p203)
states: 24,010,000,000,000 (13)
abstracting: (1<=p224)
states: 24,010,000,000,000 (13)
abstracting: (1<=p44)
states: 2,401,000,000,000 (12)
abstracting: (p60<=1)
states: 24,010,000,000,001 (13)
.abstracting: (p163<=p15)
states: 3,430,000,000,001 (12)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA DLCround-PT-09a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.851sec

checking: A [[~ [AF [~ [[~ [p66<=0] & p177<=p7]]]] | EF [p97<=p19]] U ~ [[p70<=1 & EX [AG [EF [1<=p296]]]]]]
normalized: [~ [EG [[p70<=1 & EX [~ [E [true U ~ [E [true U 1<=p296]]]]]]]] & ~ [E [[p70<=1 & EX [~ [E [true U ~ [E [true U 1<=p296]]]]]] U [~ [[E [true U p97<=p19] | EG [[p177<=p7 & ~ [p66<=0]]]]] & [p70<=1 & EX [~ [E [true U ~ [E [true U 1<=p296]]]]]]]]]]

abstracting: (1<=p296)
states: 24,010,000,000,000 (13)
.abstracting: (p70<=1)
states: 24,010,000,000,001 (13)
abstracting: (p66<=0)
states: 21,609,000,000,001 (13)
abstracting: (p177<=p7)
states: 3,430,000,000,001 (12)
.
EG iterations: 1
abstracting: (p97<=p19)
states: 21,952,000,000,001 (13)
abstracting: (1<=p296)
states: 24,010,000,000,000 (13)
.abstracting: (p70<=1)
states: 24,010,000,000,001 (13)
abstracting: (1<=p296)
states: 24,010,000,000,000 (13)
.abstracting: (p70<=1)
states: 24,010,000,000,001 (13)

EG iterations: 0
-> the formula is FALSE

FORMULA DLCround-PT-09a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m55.235sec

checking: [[~ [EG [EX [p20<=1]]] | AG [[AX [AG [p243<=p146]] | ~ [[EF [1<=p14] & EX [p182<=1]]]]]] | ~ [EF [EG [[[~ [1<=p58] & 1<=p123] | AG [p100<=p191]]]]]]
normalized: [~ [E [true U EG [[~ [E [true U ~ [p100<=p191]]] | [1<=p123 & ~ [1<=p58]]]]]] | [~ [E [true U ~ [[~ [[EX [p182<=1] & E [true U 1<=p14]]] | ~ [EX [E [true U ~ [p243<=p146]]]]]]]] | ~ [EG [EX [p20<=1]]]]]

abstracting: (p20<=1)
states: 24,010,000,000,001 (13)
.
EG iterations: 0
abstracting: (p243<=p146)
states: 24,010,000,000,001 (13)
.abstracting: (1<=p14)
states: 3,430,000,000,000 (12)
abstracting: (p182<=1)
states: 24,010,000,000,001 (13)
.abstracting: (1<=p58)
states: 2,401,000,000,000 (12)
abstracting: (1<=p123)
states: 2,401,000,000,000 (12)
abstracting: (p100<=p191)
states: 24,010,000,000,001 (13)

EG iterations: 0
-> the formula is TRUE

FORMULA DLCround-PT-09a-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m51.414sec

checking: E [[~ [E [AG [p272<=p219] U p203<=p71]] & EF [[EX [EF [1<=p0]] | p37<=1]]] U AG [AX [[[p129<=p259 & ~ [1<=p257]] | ~ [[1<=p61 & 1<=p11]]]]]]
normalized: E [[E [true U [p37<=1 | EX [E [true U 1<=p0]]]] & ~ [E [~ [E [true U ~ [p272<=p219]]] U p203<=p71]]] U ~ [E [true U EX [~ [[~ [[1<=p61 & 1<=p11]] | [p129<=p259 & ~ [1<=p257]]]]]]]]

abstracting: (1<=p257)
states: 24,010,000,000,000 (13)
abstracting: (p129<=p259)
states: 24,010,000,000,001 (13)
abstracting: (1<=p11)
states: 3,430,000,000,000 (12)
abstracting: (1<=p61)
states: 2,401,000,000,000 (12)
.abstracting: (p203<=p71)
states: 2,401,000,000,001 (12)
abstracting: (p272<=p219)
states: 24,010,000,000,001 (13)
abstracting: (1<=p0)
states: 1
.abstracting: (p37<=1)
states: 24,010,000,000,001 (13)
-> the formula is FALSE

FORMULA DLCround-PT-09a-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m10.204sec

checking: EX [[A [AX [~ [[p70<=p143 | p238<=p84]]] U ~ [[[1<=p39 & p271<=1] & [p261<=0 | 1<=p218]]]] & AG [AG [A [p45<=1 U p239<=p211]]]]]
normalized: EX [[~ [E [true U E [true U ~ [[~ [EG [~ [p239<=p211]]] & ~ [E [~ [p239<=p211] U [~ [p45<=1] & ~ [p239<=p211]]]]]]]]] & [~ [EG [[[p261<=0 | 1<=p218] & [1<=p39 & p271<=1]]]] & ~ [E [[[p261<=0 | 1<=p218] & [1<=p39 & p271<=1]] U [EX [[p70<=p143 | p238<=p84]] & [[p261<=0 | 1<=p218] & [1<=p39 & p271<=1]]]]]]]]

abstracting: (p271<=1)
states: 24,010,000,000,001 (13)
abstracting: (1<=p39)
states: 2,401,000,000,000 (12)
abstracting: (1<=p218)
states: 24,010,000,000,000 (13)
abstracting: (p261<=0)
states: 1
abstracting: (p238<=p84)
states: 2,401,000,000,001 (12)
abstracting: (p70<=p143)
states: 24,010,000,000,001 (13)
.abstracting: (p271<=1)
states: 24,010,000,000,001 (13)
abstracting: (1<=p39)
states: 2,401,000,000,000 (12)
abstracting: (1<=p218)
states: 24,010,000,000,000 (13)
abstracting: (p261<=0)
states: 1
abstracting: (p271<=1)
states: 24,010,000,000,001 (13)
abstracting: (1<=p39)
states: 2,401,000,000,000 (12)
abstracting: (1<=p218)
states: 24,010,000,000,000 (13)
abstracting: (p261<=0)
states: 1
.
EG iterations: 1
abstracting: (p239<=p211)
states: 24,010,000,000,001 (13)
abstracting: (p45<=1)
states: 24,010,000,000,001 (13)
abstracting: (p239<=p211)
states: 24,010,000,000,001 (13)
abstracting: (p239<=p211)
states: 24,010,000,000,001 (13)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA DLCround-PT-09a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m16.544sec

checking: ~ [E [[[1<=p243 & 1<=p285] | p204<=p269] U A [[~ [AF [p84<=p116]] & E [AG [p140<=0] U EX [p205<=p272]]] U ~ [[p106<=p21 & p75<=p191]]]]]
normalized: ~ [E [[p204<=p269 | [1<=p243 & 1<=p285]] U [~ [E [[p106<=p21 & p75<=p191] U [[p106<=p21 & p75<=p191] & ~ [[EG [~ [p84<=p116]] & E [~ [E [true U ~ [p140<=0]]] U EX [p205<=p272]]]]]]] & ~ [EG [[p106<=p21 & p75<=p191]]]]]]

abstracting: (p75<=p191)
states: 24,010,000,000,001 (13)
abstracting: (p106<=p21)
states: 21,952,000,000,001 (13)
.
EG iterations: 1
abstracting: (p205<=p272)
states: 24,010,000,000,001 (13)
.abstracting: (p140<=0)
states: 1
abstracting: (p84<=p116)
states: 21,849,100,000,001 (13)
.
EG iterations: 1
abstracting: (p75<=p191)
states: 24,010,000,000,001 (13)
abstracting: (p106<=p21)
states: 21,952,000,000,001 (13)
abstracting: (p75<=p191)
states: 24,010,000,000,001 (13)
abstracting: (p106<=p21)
states: 21,952,000,000,001 (13)
abstracting: (1<=p285)
states: 24,010,000,000,000 (13)
abstracting: (1<=p243)
states: 24,010,000,000,000 (13)
abstracting: (p204<=p269)
states: 24,010,000,000,001 (13)
-> the formula is FALSE

FORMULA DLCround-PT-09a-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 6m20.916sec

checking: [EG [AG [~ [[[A [p253<=p298 U 1<=p36] & E [1<=p53 U 1<=p195]] & [~ [p113<=1] & A [p237<=0 U p18<=0]]]]]] & [EF [[p279<=1 | ~ [AX [1<=p10]]]] & E [[AF [EF [1<=p210]] | A [[[p194<=p119 & p1<=p38] | ~ [p28<=p288]] U [[p88<=p30 & 1<=p203] & [1<=p151 & p229<=0]]]] U AF [AG [p297<=0]]]]]
normalized: [[E [[[~ [EG [~ [[[1<=p151 & p229<=0] & [p88<=p30 & 1<=p203]]]]] & ~ [E [~ [[[1<=p151 & p229<=0] & [p88<=p30 & 1<=p203]]] U [~ [[~ [p28<=p288] | [p194<=p119 & p1<=p38]]] & ~ [[[1<=p151 & p229<=0] & [p88<=p30 & 1<=p203]]]]]]] | ~ [EG [~ [E [true U 1<=p210]]]]] U ~ [EG [E [true U ~ [p297<=0]]]]] & E [true U [p279<=1 | EX [~ [1<=p10]]]]] & EG [~ [E [true U [[[~ [EG [~ [p18<=0]]] & ~ [E [~ [p18<=0] U [~ [p237<=0] & ~ [p18<=0]]]]] & ~ [p113<=1]] & [E [1<=p53 U 1<=p195] & [~ [EG [~ [1<=p36]]] & ~ [E [~ [1<=p36] U [~ [p253<=p298] & ~ [1<=p36]]]]]]]]]]]

abstracting: (1<=p36)
states: 2,401,000,000,000 (12)
abstracting: (p253<=p298)
states: 24,010,000,000,001 (13)
abstracting: (1<=p36)
states: 2,401,000,000,000 (12)
abstracting: (1<=p36)
states: 2,401,000,000,000 (12)
.
EG iterations: 1
abstracting: (1<=p195)
states: 24,010,000,000,000 (13)
abstracting: (1<=p53)
states: 2,401,000,000,000 (12)
abstracting: (p113<=1)
states: 24,010,000,000,001 (13)
abstracting: (p18<=0)
states: 20,580,000,000,001 (13)
abstracting: (p237<=0)
states: 1
abstracting: (p18<=0)
states: 20,580,000,000,001 (13)
abstracting: (p18<=0)
states: 20,580,000,000,001 (13)
MC time: 9m42.036sec

checking: AF [[[[p138<=0 & EF [[[p27<=0 & 1<=p240] & ~ [p188<=p245]]]] | [[E [~ [p180<=p193] U [p230<=p145 & p168<=0]] & EG [[1<=p200 | p22<=p60]]] & AX [A [1<=p183 U p6<=p251]]]] | ~ [[~ [EF [[p46<=p101 & 1<=p107]]] & EX [[[p234<=p144 | p189<=p247] & [1<=p6 & p21<=0]]]]]]]
normalized: ~ [EG [~ [[~ [[EX [[[1<=p6 & p21<=0] & [p234<=p144 | p189<=p247]]] & ~ [E [true U [p46<=p101 & 1<=p107]]]]] | [[~ [EX [~ [[~ [EG [~ [p6<=p251]]] & ~ [E [~ [p6<=p251] U [~ [1<=p183] & ~ [p6<=p251]]]]]]]] & [EG [[1<=p200 | p22<=p60]] & E [~ [p180<=p193] U [p230<=p145 & p168<=0]]]] | [p138<=0 & E [true U [~ [p188<=p245] & [p27<=0 & 1<=p240]]]]]]]]]

abstracting: (1<=p240)
states: 24,010,000,000,000 (13)
abstracting: (p27<=0)
states: 20,580,000,000,001 (13)
abstracting: (p188<=p245)
states: 24,010,000,000,001 (13)
abstracting: (p138<=0)
states: 1
abstracting: (p168<=0)
states: 1
abstracting: (p230<=p145)
states: 24,010,000,000,001 (13)
abstracting: (p180<=p193)
states: 24,010,000,000,001 (13)
abstracting: (p22<=p60)
states: 20,923,000,000,001 (13)
abstracting: (1<=p200)
states: 24,010,000,000,000 (13)

EG iterations: 0
abstracting: (p6<=p251)
states: 24,010,000,000,001 (13)
abstracting: (1<=p183)
states: 24,010,000,000,000 (13)
abstracting: (p6<=p251)
states: 24,010,000,000,001 (13)
abstracting: (p6<=p251)
states: 24,010,000,000,001 (13)
.
EG iterations: 1
.abstracting: (1<=p107)
states: 2,401,000,000,000 (12)
abstracting: (p46<=p101)
states: 21,849,100,000,001 (13)
abstracting: (p189<=p247)
states: 24,010,000,000,001 (13)
abstracting: (p234<=p144)
states: 24,010,000,000,001 (13)
abstracting: (p21<=0)
states: 20,580,000,000,001 (13)
abstracting: (1<=p6)
states: 3,430,000,000,000 (12)
..
EG iterations: 1
-> the formula is TRUE

FORMULA DLCround-PT-09a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m37.621sec

checking: AF [AX [AF [[AG [p120<=p139] & EX [1<=p39]]]]]
normalized: ~ [EG [EX [EG [~ [[EX [1<=p39] & ~ [E [true U ~ [p120<=p139]]]]]]]]]

abstracting: (p120<=p139)
states: 24,010,000,000,001 (13)
abstracting: (1<=p39)
states: 2,401,000,000,000 (12)
...
EG iterations: 2
..
EG iterations: 1
-> the formula is TRUE

FORMULA DLCround-PT-09a-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m55.713sec

checking: [EG [AG [~ [[[A [p253<=p298 U 1<=p36] & E [1<=p53 U 1<=p195]] & [~ [p113<=1] & A [p237<=0 U p18<=0]]]]]] & [EF [[p279<=1 | ~ [AX [1<=p10]]]] & E [[AF [EF [1<=p210]] | A [[[p194<=p119 & p1<=p38] | ~ [p28<=p288]] U [[p88<=p30 & 1<=p203] & [1<=p151 & p229<=0]]]] U AF [AG [p297<=0]]]]]
normalized: [[E [[[~ [EG [~ [[[1<=p151 & p229<=0] & [p88<=p30 & 1<=p203]]]]] & ~ [E [~ [[[1<=p151 & p229<=0] & [p88<=p30 & 1<=p203]]] U [~ [[~ [p28<=p288] | [p194<=p119 & p1<=p38]]] & ~ [[[1<=p151 & p229<=0] & [p88<=p30 & 1<=p203]]]]]]] | ~ [EG [~ [E [true U 1<=p210]]]]] U ~ [EG [E [true U ~ [p297<=0]]]]] & E [true U [p279<=1 | EX [~ [1<=p10]]]]] & EG [~ [E [true U [[[~ [EG [~ [p18<=0]]] & ~ [E [~ [p18<=0] U [~ [p237<=0] & ~ [p18<=0]]]]] & ~ [p113<=1]] & [E [1<=p53 U 1<=p195] & [~ [EG [~ [1<=p36]]] & ~ [E [~ [1<=p36] U [~ [p253<=p298] & ~ [1<=p36]]]]]]]]]]]

abstracting: (1<=p36)
states: 2,401,000,000,000 (12)
abstracting: (p253<=p298)
states: 24,010,000,000,001 (13)
abstracting: (1<=p36)
states: 2,401,000,000,000 (12)
abstracting: (1<=p36)
states: 2,401,000,000,000 (12)
.
EG iterations: 1
abstracting: (1<=p195)
states: 24,010,000,000,000 (13)
abstracting: (1<=p53)
states: 2,401,000,000,000 (12)
abstracting: (p113<=1)
states: 24,010,000,000,001 (13)
abstracting: (p18<=0)
states: 20,580,000,000,001 (13)
abstracting: (p237<=0)
states: 1
abstracting: (p18<=0)
states: 20,580,000,000,001 (13)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393916 kB
MemFree: 8947660 kB
After kill :
MemTotal: 16393916 kB
MemFree: 16180144 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.021sec


iterations count:89402 (39), effective:115 (0)

initing FirstDep: 0m 0.020sec


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

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

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

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

net_ddint.h:442: Timeout: after 250 sec


iterations count:7517 (3), effective:6 (0)

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

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

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

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

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

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

iterations count:13644 (6), effective:10 (0)

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

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

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

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

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

iterations count:6095 (2), effective:7 (0)

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

iterations count:11053 (4), effective:20 (0)

iterations count:7845 (3), effective:9 (0)

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

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

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

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

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

iterations count:7986 (3), effective:9 (0)

iterations count:11793 (5), effective:11 (0)

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

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

net_ddint.h:600: Timeout: after 581 sec


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

iterations count:13384 (5), effective:11 (0)

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

iterations count:2243 (1), effective:0 (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="DLCround-PT-09a"
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 DLCround-PT-09a, 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 r097-tall-167814469900713"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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