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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 948K
-rw-r--r-- 1 mcc users 6.4K Feb 25 19:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 19:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 18:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 18:44 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 27K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 19:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Feb 25 19:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 19:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 19:27 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 479K 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-08a-CTLCardinality-00
FORMULA_NAME DLCround-PT-08a-CTLCardinality-01
FORMULA_NAME DLCround-PT-08a-CTLCardinality-02
FORMULA_NAME DLCround-PT-08a-CTLCardinality-03
FORMULA_NAME DLCround-PT-08a-CTLCardinality-04
FORMULA_NAME DLCround-PT-08a-CTLCardinality-05
FORMULA_NAME DLCround-PT-08a-CTLCardinality-06
FORMULA_NAME DLCround-PT-08a-CTLCardinality-07
FORMULA_NAME DLCround-PT-08a-CTLCardinality-08
FORMULA_NAME DLCround-PT-08a-CTLCardinality-09
FORMULA_NAME DLCround-PT-08a-CTLCardinality-10
FORMULA_NAME DLCround-PT-08a-CTLCardinality-11
FORMULA_NAME DLCround-PT-08a-CTLCardinality-12
FORMULA_NAME DLCround-PT-08a-CTLCardinality-13
FORMULA_NAME DLCround-PT-08a-CTLCardinality-14
FORMULA_NAME DLCround-PT-08a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678276596420

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-08a
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_08a
(NrP: 263 NrTr: 1907 NrArc: 7354)

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

net check time: 0m 0.001sec

init dd package: 0m 2.911sec


RS generation: 0m54.676sec


-> reachability set: #nodes 284699 (2.8e+05) #states 2,401,000,000,001 (12)



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

checking: EF [AG [p78<=p10]]
normalized: E [true U ~ [E [true U ~ [p78<=p10]]]]

abstracting: (p78<=p10)
states: 2,195,200,000,001 (12)
-> the formula is FALSE

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

MC time: 1m 7.633sec

checking: EF [AX [EG [[~ [[1<=p255 | 1<=p88]] & ~ [p138<=p131]]]]]
normalized: E [true U ~ [EX [~ [EG [[~ [p138<=p131] & ~ [[1<=p255 | 1<=p88]]]]]]]]

abstracting: (1<=p88)
states: 240,100,000,000 (11)
abstracting: (1<=p255)
states: 2,401,000,000,000 (12)
abstracting: (p138<=p131)
states: 2,401,000,000,001 (12)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA DLCround-PT-08a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.971sec

checking: ~ [[AG [[1<=p170 & ~ [AG [1<=p258]]]] | EX [~ [AG [A [p10<=0 U p159<=p123]]]]]]
normalized: ~ [[~ [E [true U ~ [[1<=p170 & E [true U ~ [1<=p258]]]]]] | EX [E [true U ~ [[~ [EG [~ [p159<=p123]]] & ~ [E [~ [p159<=p123] U [~ [p159<=p123] & ~ [p10<=0]]]]]]]]]]

abstracting: (p10<=0)
states: 2,058,000,000,001 (12)
abstracting: (p159<=p123)
states: 2,401,000,000,001 (12)
abstracting: (p159<=p123)
states: 2,401,000,000,001 (12)
abstracting: (p159<=p123)
states: 2,401,000,000,001 (12)
.
EG iterations: 1
.abstracting: (1<=p258)
states: 2,401,000,000,000 (12)
abstracting: (1<=p170)
states: 2,401,000,000,000 (12)
-> the formula is TRUE

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

MC time: 0m 0.728sec

checking: EF [[AX [[AX [~ [p65<=1]] & AF [[1<=p257 & 1<=p38]]]] & ~ [EF [EF [p164<=p91]]]]]
normalized: E [true U [~ [E [true U E [true U p164<=p91]]] & ~ [EX [~ [[~ [EG [~ [[1<=p257 & 1<=p38]]]] & ~ [EX [p65<=1]]]]]]]]

abstracting: (p65<=1)
states: 2,401,000,000,001 (12)
.abstracting: (1<=p38)
states: 240,100,000,000 (11)
abstracting: (1<=p257)
states: 2,401,000,000,000 (12)
..
EG iterations: 2
.abstracting: (p164<=p91)
states: 240,100,000,001 (11)
-> the formula is FALSE

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

MC time: 0m56.119sec

checking: EX [~ [[EX [EG [p222<=0]] | [[EF [p118<=0] & AX [1<=p23]] | ~ [AG [p239<=p117]]]]]]
normalized: EX [~ [[[E [true U ~ [p239<=p117]] | [~ [EX [~ [1<=p23]]] & E [true U p118<=0]]] | EX [EG [p222<=0]]]]]

abstracting: (p222<=0)
states: 1
..
EG iterations: 2
.abstracting: (p118<=0)
states: 2,160,900,000,001 (12)
abstracting: (1<=p23)
states: 343,000,000,000 (11)
.abstracting: (p239<=p117)
states: 240,100,000,001 (11)
.-> the formula is FALSE

FORMULA DLCround-PT-08a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.624sec

checking: EX [E [AF [[[AF [p122<=0] | A [p186<=1 U 1<=p193]] & 1<=p139]] U ~ [EX [p19<=p261]]]]
normalized: EX [E [~ [EG [~ [[1<=p139 & [[~ [EG [~ [1<=p193]]] & ~ [E [~ [1<=p193] U [~ [p186<=1] & ~ [1<=p193]]]]] | ~ [EG [~ [p122<=0]]]]]]]] U ~ [EX [p19<=p261]]]]

abstracting: (p19<=p261)
states: 2,401,000,000,001 (12)
.abstracting: (p122<=0)
states: 1
.
EG iterations: 1
abstracting: (1<=p193)
states: 2,401,000,000,000 (12)
abstracting: (p186<=1)
states: 2,401,000,000,001 (12)
abstracting: (1<=p193)
states: 2,401,000,000,000 (12)
abstracting: (1<=p193)
states: 2,401,000,000,000 (12)
..
EG iterations: 2
abstracting: (1<=p139)
states: 2,401,000,000,000 (12)
..
EG iterations: 2
.-> the formula is FALSE

FORMULA DLCround-PT-08a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.466sec

checking: ~ [EF [A [~ [[AG [p146<=0] & p4<=1]] U EF [[~ [p4<=p184] & [p88<=0 | p56<=1]]]]]]
normalized: ~ [E [true U [~ [EG [~ [E [true U [[p88<=0 | p56<=1] & ~ [p4<=p184]]]]]] & ~ [E [~ [E [true U [[p88<=0 | p56<=1] & ~ [p4<=p184]]]] U [[p4<=1 & ~ [E [true U ~ [p146<=0]]]] & ~ [E [true U [[p88<=0 | p56<=1] & ~ [p4<=p184]]]]]]]]]]

abstracting: (p4<=p184)
states: 2,401,000,000,001 (12)
abstracting: (p56<=1)
states: 2,401,000,000,001 (12)
abstracting: (p88<=0)
states: 2,160,900,000,001 (12)
abstracting: (p146<=0)
states: 1
abstracting: (p4<=1)
states: 2,401,000,000,001 (12)
abstracting: (p4<=p184)
states: 2,401,000,000,001 (12)
abstracting: (p56<=1)
states: 2,401,000,000,001 (12)
abstracting: (p88<=0)
states: 2,160,900,000,001 (12)
abstracting: (p4<=p184)
states: 2,401,000,000,001 (12)
abstracting: (p56<=1)
states: 2,401,000,000,001 (12)
abstracting: (p88<=0)
states: 2,160,900,000,001 (12)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.606sec

checking: A [[AX [1<=p224] & E [1<=p6 U EX [p207<=p156]]] U AX [~ [AG [p261<=p243]]]]
normalized: [~ [EG [EX [~ [E [true U ~ [p261<=p243]]]]]] & ~ [E [EX [~ [E [true U ~ [p261<=p243]]]] U [~ [[E [1<=p6 U EX [p207<=p156]] & ~ [EX [~ [1<=p224]]]]] & EX [~ [E [true U ~ [p261<=p243]]]]]]]]

abstracting: (p261<=p243)
states: 2,401,000,000,001 (12)
.abstracting: (1<=p224)
states: 2,401,000,000,000 (12)
.abstracting: (p207<=p156)
states: 2,401,000,000,001 (12)
.abstracting: (1<=p6)
states: 343,000,000,000 (11)
abstracting: (p261<=p243)
states: 2,401,000,000,001 (12)
.abstracting: (p261<=p243)
states: 2,401,000,000,001 (12)
.
EG iterations: 0
-> the formula is FALSE

FORMULA DLCround-PT-08a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.582sec

checking: [E [~ [1<=p253] U ~ [[[~ [[p116<=0 & p106<=0]] & 1<=p190] | AG [AX [p34<=p42]]]]] | AG [AF [1<=p50]]]
normalized: [~ [E [true U EG [~ [1<=p50]]]] | E [~ [1<=p253] U ~ [[~ [E [true U EX [~ [p34<=p42]]]] | [1<=p190 & ~ [[p116<=0 & p106<=0]]]]]]]

abstracting: (p106<=0)
states: 2,160,900,000,001 (12)
abstracting: (p116<=0)
states: 2,160,900,000,001 (12)
abstracting: (1<=p190)
states: 2,401,000,000,000 (12)
abstracting: (p34<=p42)
states: 2,184,910,000,001 (12)
.abstracting: (1<=p253)
states: 2,401,000,000,000 (12)
abstracting: (1<=p50)
states: 240,100,000,000 (11)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 2m31.294sec

checking: EF [EF [~ [[p26<=p95 | [[~ [p50<=p7] | [p160<=p214 & p63<=0]] | ~ [p219<=0]]]]]]
normalized: E [true U E [true U ~ [[p26<=p95 | [~ [p219<=0] | [[p160<=p214 & p63<=0] | ~ [p50<=p7]]]]]]]

abstracting: (p50<=p7)
states: 2,195,200,000,001 (12)
abstracting: (p63<=0)
states: 2,160,900,000,001 (12)
abstracting: (p160<=p214)
states: 2,401,000,000,001 (12)
abstracting: (p219<=0)
states: 1
abstracting: (p26<=p95)
states: 2,092,300,000,001 (12)
-> the formula is FALSE

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

MC time: 0m 1.204sec

checking: EF [[AG [A [[p236<=p0 | A [p26<=p30 U p234<=p91]] U 1<=p29]] & AX [EX [~ [[1<=p215 & 1<=p145]]]]]]
normalized: E [true U [~ [EX [~ [EX [~ [[1<=p215 & 1<=p145]]]]]] & ~ [E [true U ~ [[~ [EG [~ [1<=p29]]] & ~ [E [~ [1<=p29] U [~ [[p236<=p0 | [~ [EG [~ [p234<=p91]]] & ~ [E [~ [p234<=p91] U [~ [p26<=p30] & ~ [p234<=p91]]]]]]] & ~ [1<=p29]]]]]]]]]]

abstracting: (1<=p29)
states: 240,100,000,000 (11)
abstracting: (p234<=p91)
states: 240,100,000,001 (11)
abstracting: (p26<=p30)
states: 2,092,300,000,001 (12)
abstracting: (p234<=p91)
states: 240,100,000,001 (11)
abstracting: (p234<=p91)
states: 240,100,000,001 (11)
.
EG iterations: 1
abstracting: (p236<=p0)
states: 1
abstracting: (1<=p29)
states: 240,100,000,000 (11)
abstracting: (1<=p29)
states: 240,100,000,000 (11)
.
EG iterations: 1
abstracting: (1<=p145)
states: 2,401,000,000,000 (12)
abstracting: (1<=p215)
states: 2,401,000,000,000 (12)
..-> the formula is FALSE

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

MC time: 1m27.722sec

checking: [[AX [p220<=0] & [AX [[AG [~ [1<=p63]] & [AG [p132<=1] & ~ [1<=p84]]]] & EG [~ [EF [[1<=p178 & p211<=p184]]]]]] | ~ [EF [E [AF [[p152<=1 & 1<=p33]] U AG [~ [p112<=p53]]]]]]
normalized: [~ [E [true U E [~ [EG [~ [[p152<=1 & 1<=p33]]]] U ~ [E [true U p112<=p53]]]]] | [[EG [~ [E [true U [1<=p178 & p211<=p184]]]] & ~ [EX [~ [[[~ [1<=p84] & ~ [E [true U ~ [p132<=1]]]] & ~ [E [true U 1<=p63]]]]]]] & ~ [EX [~ [p220<=0]]]]]

abstracting: (p220<=0)
states: 1
.abstracting: (1<=p63)
states: 240,100,000,000 (11)
abstracting: (p132<=1)
states: 2,401,000,000,001 (12)
abstracting: (1<=p84)
states: 240,100,000,000 (11)
.abstracting: (p211<=p184)
states: 2,401,000,000,001 (12)
abstracting: (1<=p178)
states: 2,401,000,000,000 (12)
.
EG iterations: 1
abstracting: (p112<=p53)
states: 2,184,910,000,001 (12)
abstracting: (1<=p33)
states: 240,100,000,000 (11)
abstracting: (p152<=1)
states: 2,401,000,000,001 (12)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 1m35.738sec

checking: ~ [[AG [[EG [EG [p195<=0]] & ~ [[[AG [p53<=p55] & 1<=p79] | [AG [1<=p215] & ~ [p23<=p241]]]]]] | E [AG [EX [[p50<=0 & p250<=0]]] U ~ [[E [~ [p44<=0] U AG [p220<=1]] | AX [p260<=0]]]]]]
normalized: ~ [[E [~ [E [true U ~ [EX [[p50<=0 & p250<=0]]]]] U ~ [[~ [EX [~ [p260<=0]]] | E [~ [p44<=0] U ~ [E [true U ~ [p220<=1]]]]]]] | ~ [E [true U ~ [[~ [[[~ [p23<=p241] & ~ [E [true U ~ [1<=p215]]]] | [1<=p79 & ~ [E [true U ~ [p53<=p55]]]]]] & EG [EG [p195<=0]]]]]]]]

abstracting: (p195<=0)
states: 1
..
EG iterations: 2
.
EG iterations: 1
abstracting: (p53<=p55)
states: 2,160,900,000,001 (12)
abstracting: (1<=p79)
states: 240,100,000,000 (11)
abstracting: (1<=p215)
states: 2,401,000,000,000 (12)
abstracting: (p23<=p241)
states: 2,401,000,000,001 (12)
abstracting: (p220<=1)
states: 2,401,000,000,001 (12)
abstracting: (p44<=0)
states: 2,160,900,000,001 (12)
abstracting: (p260<=0)
states: 1
.abstracting: (p250<=0)
states: 1
abstracting: (p50<=0)
states: 2,160,900,000,001 (12)
.-> the formula is TRUE

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

MC time: 0m28.255sec

checking: E [EG [EG [E [[p198<=0 | p99<=1] U p203<=p46]]] U ~ [[EX [[E [p246<=1 U 1<=p90] | AX [p130<=1]]] | [[~ [AX [p174<=1]] | [p37<=1 & p143<=0]] & [EX [AX [p160<=0]] | [p250<=p129 & p22<=p208]]]]]]
normalized: E [EG [EG [E [[p198<=0 | p99<=1] U p203<=p46]]] U ~ [[[[[p250<=p129 & p22<=p208] | EX [~ [EX [~ [p160<=0]]]]] & [[p37<=1 & p143<=0] | EX [~ [p174<=1]]]] | EX [[~ [EX [~ [p130<=1]]] | E [p246<=1 U 1<=p90]]]]]]

abstracting: (1<=p90)
states: 240,100,000,000 (11)
abstracting: (p246<=1)
states: 2,401,000,000,001 (12)
abstracting: (p130<=1)
states: 2,401,000,000,001 (12)
..abstracting: (p174<=1)
states: 2,401,000,000,001 (12)
.abstracting: (p143<=0)
states: 1
abstracting: (p37<=1)
states: 2,401,000,000,001 (12)
abstracting: (p160<=0)
states: 1
..abstracting: (p22<=p208)
states: 2,401,000,000,001 (12)
abstracting: (p250<=p129)
states: 2,401,000,000,001 (12)
abstracting: (p203<=p46)
states: 240,100,000,001 (11)
abstracting: (p99<=1)
states: 2,401,000,000,001 (12)
abstracting: (p198<=0)
states: 1

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m52.265sec

checking: [E [E [p71<=p73 U ~ [A [1<=p191 U ~ [p189<=1]]]] U AG [[~ [p172<=0] & [[p164<=0 & EF [p4<=0]] & 1<=p25]]]] & ~ [EG [[[AF [~ [p128<=1]] & [[E [p61<=1 U p227<=1] | [1<=p173 | p228<=1]] | p173<=p242]] | 1<=p242]]]]
normalized: [~ [EG [[1<=p242 | [[p173<=p242 | [[1<=p173 | p228<=1] | E [p61<=1 U p227<=1]]] & ~ [EG [p128<=1]]]]]] & E [E [p71<=p73 U ~ [[~ [EG [p189<=1]] & ~ [E [p189<=1 U [p189<=1 & ~ [1<=p191]]]]]]] U ~ [E [true U ~ [[[1<=p25 & [p164<=0 & E [true U p4<=0]]] & ~ [p172<=0]]]]]]]

abstracting: (p172<=0)
states: 1
abstracting: (p4<=0)
states: 2,058,000,000,001 (12)
abstracting: (p164<=0)
states: 1
abstracting: (1<=p25)
states: 343,000,000,000 (11)
abstracting: (1<=p191)
states: 2,401,000,000,000 (12)
abstracting: (p189<=1)
states: 2,401,000,000,001 (12)
abstracting: (p189<=1)
states: 2,401,000,000,001 (12)
abstracting: (p189<=1)
states: 2,401,000,000,001 (12)

EG iterations: 0
abstracting: (p71<=p73)
states: 2,160,900,000,001 (12)
abstracting: (p128<=1)
states: 2,401,000,000,001 (12)

EG iterations: 0
abstracting: (p227<=1)
states: 2,401,000,000,001 (12)
abstracting: (p61<=1)
states: 2,401,000,000,001 (12)
abstracting: (p228<=1)
states: 2,401,000,000,001 (12)
abstracting: (1<=p173)
states: 2,401,000,000,000 (12)
abstracting: (p173<=p242)
states: 2,401,000,000,001 (12)
abstracting: (1<=p242)
states: 2,401,000,000,000 (12)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 7.755sec

checking: AG [[[1<=p154 & [A [p144<=1 U [[p219<=0 & p94<=p214] | E [p220<=1 U p26<=p134]]] | p199<=0]] | [AF [~ [[~ [p41<=p56] & ~ [p57<=p126]]]] | [AG [p21<=0] | [EX [E [p32<=p85 U p150<=p164]] | E [~ [p150<=p189] U AX [p261<=p164]]]]]]]
normalized: ~ [E [true U ~ [[[[[E [~ [p150<=p189] U ~ [EX [~ [p261<=p164]]]] | EX [E [p32<=p85 U p150<=p164]]] | ~ [E [true U ~ [p21<=0]]]] | ~ [EG [[~ [p57<=p126] & ~ [p41<=p56]]]]] | [1<=p154 & [p199<=0 | [~ [EG [~ [[E [p220<=1 U p26<=p134] | [p219<=0 & p94<=p214]]]]] & ~ [E [~ [[E [p220<=1 U p26<=p134] | [p219<=0 & p94<=p214]]] U [~ [p144<=1] & ~ [[E [p220<=1 U p26<=p134] | [p219<=0 & p94<=p214]]]]]]]]]]]]]

abstracting: (p94<=p214)
states: 2,401,000,000,001 (12)
abstracting: (p219<=0)
states: 1
abstracting: (p26<=p134)
states: 2,401,000,000,001 (12)
abstracting: (p220<=1)
states: 2,401,000,000,001 (12)
abstracting: (p144<=1)
states: 2,401,000,000,001 (12)
abstracting: (p94<=p214)
states: 2,401,000,000,001 (12)
abstracting: (p219<=0)
states: 1
abstracting: (p26<=p134)
states: 2,401,000,000,001 (12)
abstracting: (p220<=1)
states: 2,401,000,000,001 (12)
abstracting: (p94<=p214)
states: 2,401,000,000,001 (12)
abstracting: (p219<=0)
states: 1
abstracting: (p26<=p134)
states: 2,401,000,000,001 (12)
abstracting: (p220<=1)
states: 2,401,000,000,001 (12)
.
EG iterations: 1
abstracting: (p199<=0)
states: 1
abstracting: (1<=p154)
states: 2,401,000,000,000 (12)
abstracting: (p41<=p56)
states: 2,184,910,000,001 (12)
abstracting: (p57<=p126)
states: 2,401,000,000,001 (12)
.
EG iterations: 1
abstracting: (p21<=0)
states: 2,058,000,000,001 (12)
abstracting: (p150<=p164)
states: 2,401,000,000,001 (12)
abstracting: (p32<=p85)
states: 2,184,910,000,001 (12)
.abstracting: (p261<=p164)
states: 2,401,000,000,001 (12)
.abstracting: (p150<=p189)
states: 2,401,000,000,001 (12)
-> the formula is TRUE

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

MC time: 0m17.230sec

totally nodes used: 9677330 (9.7e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 206981711 1186357606 1393339317
used/not used/entry size/cache size: 67108725 139 16 1024MB
basic ops cache: hits/miss/sum: 4596774 16220716 20817490
used/not used/entry size/cache size: 11981859 4795357 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: 370796 2087908 2458704
used/not used/entry size/cache size: 1852707 6535901 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 58176676
1 8234445
2 653148
3 41943
4 2507
5 138
6 7
7 0
8 0
9 0
>= 10 0

Total processing time: 10m37.016sec


BK_STOP 1678277233489

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


iterations count:69574 (36), effective:106 (0)

initing FirstDep: 0m 0.015sec


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

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

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

iterations count:10215 (5), effective:9 (0)

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

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

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

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

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

iterations count:4629 (2), effective:17 (0)

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

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

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

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

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

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

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

iterations count:4175 (2), effective:9 (0)

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

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

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

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

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

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

iterations count:3154 (1), effective:9 (0)

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

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

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

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

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

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

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

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

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

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

iterations count:1907 (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-08a"
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-08a, 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-167814469900697"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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