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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 18:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 18:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 25 18:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:52 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 148K 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-03a-CTLCardinality-00
FORMULA_NAME DLCround-PT-03a-CTLCardinality-01
FORMULA_NAME DLCround-PT-03a-CTLCardinality-02
FORMULA_NAME DLCround-PT-03a-CTLCardinality-03
FORMULA_NAME DLCround-PT-03a-CTLCardinality-04
FORMULA_NAME DLCround-PT-03a-CTLCardinality-05
FORMULA_NAME DLCround-PT-03a-CTLCardinality-06
FORMULA_NAME DLCround-PT-03a-CTLCardinality-07
FORMULA_NAME DLCround-PT-03a-CTLCardinality-08
FORMULA_NAME DLCround-PT-03a-CTLCardinality-09
FORMULA_NAME DLCround-PT-03a-CTLCardinality-10
FORMULA_NAME DLCround-PT-03a-CTLCardinality-11
FORMULA_NAME DLCround-PT-03a-CTLCardinality-12
FORMULA_NAME DLCround-PT-03a-CTLCardinality-13
FORMULA_NAME DLCround-PT-03a-CTLCardinality-14
FORMULA_NAME DLCround-PT-03a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678272154233

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-03a
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_03a
(NrP: 113 NrTr: 617 NrArc: 2269)

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

net check time: 0m 0.000sec

init dd package: 0m 2.838sec


RS generation: 0m 0.233sec


-> reachability set: #nodes 3795 (3.8e+03) #states 24,010,001 (7)



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

checking: EF [AG [AG [p82<=0]]]
normalized: E [true U ~ [E [true U E [true U ~ [p82<=0]]]]]

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

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

MC time: 0m 0.181sec

checking: EG [EG [~ [AG [EG [p50<=p77]]]]]
normalized: EG [EG [E [true U ~ [EG [p50<=p77]]]]]

abstracting: (p50<=p77)
states: 24,010,001 (7)

EG iterations: 0
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA DLCround-PT-03a-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: AG [~ [AF [AG [A [p36<=p21 U 1<=p0]]]]]
normalized: ~ [E [true U ~ [EG [E [true U ~ [[~ [E [~ [1<=p0] U [~ [p36<=p21] & ~ [1<=p0]]]] & ~ [EG [~ [1<=p0]]]]]]]]]]

abstracting: (1<=p0)
states: 1
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p36<=p21)
states: 21,952,001 (7)
abstracting: (1<=p0)
states: 1

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.173sec

checking: EX [AG [AG [AX [[p36<=p88 & p103<=1]]]]]
normalized: EX [~ [E [true U E [true U EX [~ [[p36<=p88 & p103<=1]]]]]]]

abstracting: (p103<=1)
states: 24,010,001 (7)
abstracting: (p36<=p88)
states: 24,010,001 (7)
..-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: EF [~ [E [AX [AG [1<=p37]] U AG [[p4<=p112 | 1<=p85]]]]]
normalized: E [true U ~ [E [~ [EX [E [true U ~ [1<=p37]]]] U ~ [E [true U ~ [[p4<=p112 | 1<=p85]]]]]]]

abstracting: (1<=p85)
states: 24,010,000 (7)
abstracting: (p4<=p112)
states: 24,010,001 (7)
abstracting: (1<=p37)
states: 2,401,000 (6)
.-> the formula is FALSE

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

MC time: 0m 0.037sec

checking: EX [EF [EX [A [~ [p59<=p55] U ~ [p50<=p102]]]]]
normalized: EX [E [true U EX [[~ [EG [p50<=p102]] & ~ [E [p50<=p102 U [p59<=p55 & p50<=p102]]]]]]]

abstracting: (p50<=p102)
states: 24,010,001 (7)
abstracting: (p59<=p55)
states: 21,849,101 (7)
abstracting: (p50<=p102)
states: 24,010,001 (7)
abstracting: (p50<=p102)
states: 24,010,001 (7)

EG iterations: 0
..-> the formula is FALSE

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

MC time: 0m 0.009sec

checking: E [AF [1<=p6] U AG [E [EF [p76<=0] U [~ [E [p38<=1 U p95<=1]] & p21<=0]]]]
normalized: E [~ [EG [~ [1<=p6]]] U ~ [E [true U ~ [E [E [true U p76<=0] U [~ [E [p38<=1 U p95<=1]] & p21<=0]]]]]]

abstracting: (p21<=0)
states: 20,580,001 (7)
abstracting: (p95<=1)
states: 24,010,001 (7)
abstracting: (p38<=1)
states: 24,010,001 (7)
abstracting: (p76<=0)
states: 1
abstracting: (1<=p6)
states: 3,430,000 (6)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.218sec

checking: E [p90<=1 U AG [EG [[EX [p72<=0] | [E [p88<=1 U p31<=p5] & EG [1<=p95]]]]]]
normalized: E [p90<=1 U ~ [E [true U ~ [EG [[[EG [1<=p95] & E [p88<=1 U p31<=p5]] | EX [p72<=0]]]]]]]

abstracting: (p72<=0)
states: 1
.abstracting: (p31<=p5)
states: 21,952,001 (7)
abstracting: (p88<=1)
states: 24,010,001 (7)
abstracting: (1<=p95)
states: 24,010,000 (7)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p90<=1)
states: 24,010,001 (7)
-> the formula is TRUE

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

MC time: 0m 0.070sec

checking: AG [EF [[~ [AX [p1<=p4]] | E [[[p77<=p24 & 1<=p9] & ~ [p47<=p30]] U p96<=0]]]]
normalized: ~ [E [true U ~ [E [true U [E [[~ [p47<=p30] & [p77<=p24 & 1<=p9]] U p96<=0] | EX [~ [p1<=p4]]]]]]]

abstracting: (p1<=p4)
states: 20,580,001 (7)
.abstracting: (p96<=0)
states: 1
abstracting: (1<=p9)
states: 3,430,000 (6)
abstracting: (p77<=p24)
states: 3,430,001 (6)
abstracting: (p47<=p30)
states: 21,849,101 (7)
-> the formula is TRUE

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

MC time: 0m 0.253sec

checking: AG [[[[[[p75<=1 & ~ [AG [p94<=p70]]] | [EF [p23<=0] | EG [1<=p78]]] | p70<=p92] & EX [1<=p71]] & EF [p75<=p31]]]
normalized: ~ [E [true U ~ [[E [true U p75<=p31] & [EX [1<=p71] & [p70<=p92 | [[EG [1<=p78] | E [true U p23<=0]] | [p75<=1 & E [true U ~ [p94<=p70]]]]]]]]]]

abstracting: (p94<=p70)
states: 24,010,001 (7)
abstracting: (p75<=1)
states: 24,010,001 (7)
abstracting: (p23<=0)
states: 20,580,001 (7)
abstracting: (1<=p78)
states: 24,010,000 (7)
.
EG iterations: 1
abstracting: (p70<=p92)
states: 24,010,001 (7)
abstracting: (1<=p71)
states: 24,010,000 (7)
.abstracting: (p75<=p31)
states: 2,401,001 (6)
-> the formula is TRUE

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

MC time: 0m 0.150sec

checking: [AG [AG [EG [A [p40<=1 U p32<=p2]]]] | EF [[~ [[[EF [p58<=p88] & [p109<=0 | [p81<=0 | 1<=p71]]] | AX [AG [p38<=0]]]] & p66<=0]]]
normalized: [E [true U [p66<=0 & ~ [[~ [EX [E [true U ~ [p38<=0]]]] | [[p109<=0 | [p81<=0 | 1<=p71]] & E [true U p58<=p88]]]]]] | ~ [E [true U E [true U ~ [EG [[~ [EG [~ [p32<=p2]]] & ~ [E [~ [p32<=p2] U [~ [p40<=1] & ~ [p32<=p2]]]]]]]]]]]

abstracting: (p32<=p2)
states: 21,952,001 (7)
abstracting: (p40<=1)
states: 24,010,001 (7)
abstracting: (p32<=p2)
states: 21,952,001 (7)
abstracting: (p32<=p2)
states: 21,952,001 (7)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p58<=p88)
states: 24,010,001 (7)
abstracting: (1<=p71)
states: 24,010,000 (7)
abstracting: (p81<=0)
states: 1
abstracting: (p109<=0)
states: 1
abstracting: (p38<=0)
states: 21,609,001 (7)
.abstracting: (p66<=0)
states: 21,609,001 (7)
-> the formula is FALSE

FORMULA DLCround-PT-03a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.455sec

checking: AG [AG [[[[EX [p12<=p35] & E [p24<=0 U 1<=p97]] | [AF [1<=p85] | A [1<=p4 U p57<=p71]]] | A [~ [1<=p107] U ~ [p60<=p46]]]]]
normalized: ~ [E [true U E [true U ~ [[[~ [EG [p60<=p46]] & ~ [E [p60<=p46 U [1<=p107 & p60<=p46]]]] | [[[~ [EG [~ [p57<=p71]]] & ~ [E [~ [p57<=p71] U [~ [1<=p4] & ~ [p57<=p71]]]]] | ~ [EG [~ [1<=p85]]]] | [E [p24<=0 U 1<=p97] & EX [p12<=p35]]]]]]]]

abstracting: (p12<=p35)
states: 20,923,001 (7)
.abstracting: (1<=p97)
states: 24,010,000 (7)
abstracting: (p24<=0)
states: 20,580,001 (7)
abstracting: (1<=p85)
states: 24,010,000 (7)
..
EG iterations: 2
abstracting: (p57<=p71)
states: 24,010,001 (7)
abstracting: (1<=p4)
states: 3,430,000 (6)
abstracting: (p57<=p71)
states: 24,010,001 (7)
abstracting: (p57<=p71)
states: 24,010,001 (7)
.
EG iterations: 1
abstracting: (p60<=p46)
states: 21,849,101 (7)
abstracting: (1<=p107)
states: 24,010,000 (7)
abstracting: (p60<=p46)
states: 21,849,101 (7)
abstracting: (p60<=p46)
states: 21,849,101 (7)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.180sec

checking: EG [E [[EF [1<=p86] | 1<=p47] U ~ [[A [[p84<=p48 | p59<=p29] U AG [p16<=p102]] & [[[1<=p87 | 1<=p107] & ~ [p36<=1]] | [AG [p2<=p88] & EX [p32<=0]]]]]]]
normalized: EG [E [[1<=p47 | E [true U 1<=p86]] U ~ [[[[EX [p32<=0] & ~ [E [true U ~ [p2<=p88]]]] | [~ [p36<=1] & [1<=p87 | 1<=p107]]] & [~ [EG [E [true U ~ [p16<=p102]]]] & ~ [E [E [true U ~ [p16<=p102]] U [~ [[p84<=p48 | p59<=p29]] & E [true U ~ [p16<=p102]]]]]]]]]]

abstracting: (p16<=p102)
states: 24,010,001 (7)
abstracting: (p59<=p29)
states: 21,849,101 (7)
abstracting: (p84<=p48)
states: 2,401,001 (6)
abstracting: (p16<=p102)
states: 24,010,001 (7)
abstracting: (p16<=p102)
states: 24,010,001 (7)
.
EG iterations: 1
abstracting: (1<=p107)
states: 24,010,000 (7)
abstracting: (1<=p87)
states: 24,010,000 (7)
abstracting: (p36<=1)
states: 24,010,001 (7)
abstracting: (p2<=p88)
states: 24,010,001 (7)
abstracting: (p32<=0)
states: 21,609,001 (7)
.abstracting: (1<=p86)
states: 24,010,000 (7)
abstracting: (1<=p47)
states: 2,401,000 (6)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.156sec

checking: EF [[A [[E [EX [1<=p97] U [p50<=0 | 1<=p111]] | ~ [p49<=1]] U A [AG [p24<=p47] U [[1<=p45 | p20<=1] | p32<=1]]] & ~ [E [[[~ [p101<=0] | ~ [1<=p1]] & A [p45<=0 U p15<=p112]] U EG [~ [1<=p12]]]]]]
normalized: E [true U [~ [E [[[~ [EG [~ [p15<=p112]]] & ~ [E [~ [p15<=p112] U [~ [p45<=0] & ~ [p15<=p112]]]]] & [~ [1<=p1] | ~ [p101<=0]]] U EG [~ [1<=p12]]]] & [~ [EG [~ [[~ [EG [~ [[p32<=1 | [1<=p45 | p20<=1]]]]] & ~ [E [~ [[p32<=1 | [1<=p45 | p20<=1]]] U [E [true U ~ [p24<=p47]] & ~ [[p32<=1 | [1<=p45 | p20<=1]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[p32<=1 | [1<=p45 | p20<=1]]]]] & ~ [E [~ [[p32<=1 | [1<=p45 | p20<=1]]] U [E [true U ~ [p24<=p47]] & ~ [[p32<=1 | [1<=p45 | p20<=1]]]]]]]] U [~ [[~ [p49<=1] | E [EX [1<=p97] U [p50<=0 | 1<=p111]]]] & ~ [[~ [EG [~ [[p32<=1 | [1<=p45 | p20<=1]]]]] & ~ [E [~ [[p32<=1 | [1<=p45 | p20<=1]]] U [E [true U ~ [p24<=p47]] & ~ [[p32<=1 | [1<=p45 | p20<=1]]]]]]]]]]]]]]

abstracting: (p20<=1)
states: 24,010,001 (7)
abstracting: (1<=p45)
states: 2,401,000 (6)
abstracting: (p32<=1)
states: 24,010,001 (7)
abstracting: (p24<=p47)
states: 20,923,001 (7)
abstracting: (p20<=1)
states: 24,010,001 (7)
abstracting: (1<=p45)
states: 2,401,000 (6)
abstracting: (p32<=1)
states: 24,010,001 (7)
abstracting: (p20<=1)
states: 24,010,001 (7)
abstracting: (1<=p45)
states: 2,401,000 (6)
abstracting: (p32<=1)
states: 24,010,001 (7)
.
EG iterations: 1
abstracting: (1<=p111)
states: 24,010,000 (7)
abstracting: (p50<=0)
states: 21,609,001 (7)
abstracting: (1<=p97)
states: 24,010,000 (7)
.abstracting: (p49<=1)
states: 24,010,001 (7)
abstracting: (p20<=1)
states: 24,010,001 (7)
abstracting: (1<=p45)
states: 2,401,000 (6)
abstracting: (p32<=1)
states: 24,010,001 (7)
abstracting: (p24<=p47)
states: 20,923,001 (7)
abstracting: (p20<=1)
states: 24,010,001 (7)
abstracting: (1<=p45)
states: 2,401,000 (6)
abstracting: (p32<=1)
states: 24,010,001 (7)
abstracting: (p20<=1)
states: 24,010,001 (7)
abstracting: (1<=p45)
states: 2,401,000 (6)
abstracting: (p32<=1)
states: 24,010,001 (7)
.
EG iterations: 1
abstracting: (p20<=1)
states: 24,010,001 (7)
abstracting: (1<=p45)
states: 2,401,000 (6)
abstracting: (p32<=1)
states: 24,010,001 (7)
abstracting: (p24<=p47)
states: 20,923,001 (7)
abstracting: (p20<=1)
states: 24,010,001 (7)
abstracting: (1<=p45)
states: 2,401,000 (6)
abstracting: (p32<=1)
states: 24,010,001 (7)
abstracting: (p20<=1)
states: 24,010,001 (7)
abstracting: (1<=p45)
states: 2,401,000 (6)
abstracting: (p32<=1)
states: 24,010,001 (7)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p12)
states: 3,430,000 (6)
.
EG iterations: 1
abstracting: (p101<=0)
states: 1
abstracting: (1<=p1)
states: 3,430,000 (6)
abstracting: (p15<=p112)
states: 24,010,001 (7)
abstracting: (p45<=0)
states: 21,609,001 (7)
abstracting: (p15<=p112)
states: 24,010,001 (7)
abstracting: (p15<=p112)
states: 24,010,001 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DLCround-PT-03a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.155sec

checking: ~ [[AG [[[[[p83<=0 | 1<=p2] | ~ [[p38<=p99 | 1<=p55]]] & AG [[1<=p92 | p72<=0]]] & [[p30<=0 & [p3<=p10 & [p95<=p19 & p4<=p7]]] | E [AG [p21<=p87] U [1<=p111 | 1<=p41]]]]] | AF [AG [EX [AG [1<=p72]]]]]]
normalized: ~ [[~ [EG [E [true U ~ [EX [~ [E [true U ~ [1<=p72]]]]]]]] | ~ [E [true U ~ [[[E [~ [E [true U ~ [p21<=p87]]] U [1<=p111 | 1<=p41]] | [p30<=0 & [p3<=p10 & [p95<=p19 & p4<=p7]]]] & [~ [E [true U ~ [[1<=p92 | p72<=0]]]] & [~ [[p38<=p99 | 1<=p55]] | [p83<=0 | 1<=p2]]]]]]]]]

abstracting: (1<=p2)
states: 3,430,000 (6)
abstracting: (p83<=0)
states: 1
abstracting: (1<=p55)
states: 2,401,000 (6)
abstracting: (p38<=p99)
states: 24,010,001 (7)
abstracting: (p72<=0)
states: 1
abstracting: (1<=p92)
states: 24,010,000 (7)
abstracting: (p4<=p7)
states: 20,580,001 (7)
abstracting: (p95<=p19)
states: 3,430,001 (6)
abstracting: (p3<=p10)
states: 21,070,001 (7)
abstracting: (p30<=0)
states: 21,609,001 (7)
abstracting: (1<=p41)
states: 2,401,000 (6)
abstracting: (1<=p111)
states: 24,010,000 (7)
abstracting: (p21<=p87)
states: 24,010,001 (7)
abstracting: (1<=p72)
states: 24,010,000 (7)
..
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.057sec

checking: E [E [EG [[EF [p10<=0] | [[p26<=1 & p44<=p61] & [p96<=p47 | p82<=1]]]] U [[p103<=p52 | p49<=0] | E [AF [p50<=1] U [EG [1<=p68] & p39<=p13]]]] U [[[p39<=p94 | A [A [1<=p49 U p88<=1] U [1<=p9 & AX [p35<=1]]]] & EX [~ [[~ [p47<=1] | p21<=1]]]] & [1<=p71 & AX [AG [AF [p81<=1]]]]]]
normalized: E [E [EG [[[[p96<=p47 | p82<=1] & [p26<=1 & p44<=p61]] | E [true U p10<=0]]] U [E [~ [EG [~ [p50<=1]]] U [p39<=p13 & EG [1<=p68]]] | [p103<=p52 | p49<=0]]] U [[1<=p71 & ~ [EX [E [true U EG [~ [p81<=1]]]]]] & [EX [~ [[p21<=1 | ~ [p47<=1]]]] & [p39<=p94 | [~ [EG [~ [[1<=p9 & ~ [EX [~ [p35<=1]]]]]]] & ~ [E [~ [[1<=p9 & ~ [EX [~ [p35<=1]]]]] U [~ [[~ [EG [~ [p88<=1]]] & ~ [E [~ [p88<=1] U [~ [1<=p49] & ~ [p88<=1]]]]]] & ~ [[1<=p9 & ~ [EX [~ [p35<=1]]]]]]]]]]]]]

abstracting: (p35<=1)
states: 24,010,001 (7)
.abstracting: (1<=p9)
states: 3,430,000 (6)
abstracting: (p88<=1)
states: 24,010,001 (7)
abstracting: (1<=p49)
states: 2,401,000 (6)
abstracting: (p88<=1)
states: 24,010,001 (7)
abstracting: (p88<=1)
states: 24,010,001 (7)
.
EG iterations: 1
abstracting: (p35<=1)
states: 24,010,001 (7)
.abstracting: (1<=p9)
states: 3,430,000 (6)
abstracting: (p35<=1)
states: 24,010,001 (7)
.abstracting: (1<=p9)
states: 3,430,000 (6)
.
EG iterations: 1
abstracting: (p39<=p94)
states: 24,010,001 (7)
abstracting: (p47<=1)
states: 24,010,001 (7)
abstracting: (p21<=1)
states: 24,010,001 (7)
.abstracting: (p81<=1)
states: 24,010,001 (7)
.
EG iterations: 1
.abstracting: (1<=p71)
states: 24,010,000 (7)
abstracting: (p49<=0)
states: 21,609,001 (7)
abstracting: (p103<=p52)
states: 2,401,001 (6)
abstracting: (1<=p68)
states: 2,401,000 (6)
.
EG iterations: 1
abstracting: (p39<=p13)
states: 21,952,001 (7)
abstracting: (p50<=1)
states: 24,010,001 (7)
.
EG iterations: 1
abstracting: (p10<=0)
states: 20,580,001 (7)
abstracting: (p44<=p61)
states: 21,849,101 (7)
abstracting: (p26<=1)
states: 24,010,001 (7)
abstracting: (p82<=1)
states: 24,010,001 (7)
abstracting: (p96<=p47)
states: 2,401,001 (6)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.173sec

totally nodes used: 278833 (2.8e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2203354 8674125 10877479
used/not used/entry size/cache size: 8229322 58879542 16 1024MB
basic ops cache: hits/miss/sum: 144274 374953 519227
used/not used/entry size/cache size: 595953 16181263 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: 16727 57663 74390
used/not used/entry size/cache size: 57533 8331075 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 66834639
1 269812
2 4222
3 187
4 4
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 7.194sec


BK_STOP 1678272161475

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


iterations count:10958 (17), effective:61 (0)

initing FirstDep: 0m 0.001sec


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

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

iterations count:1140 (1), effective:10 (0)

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

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

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

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

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

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

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

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

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

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

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

iterations count:694 (1), effective:5 (0)

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

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

iterations count:1679 (2), effective:11 (0)

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

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

iterations count:1569 (2), effective:10 (0)

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

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

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

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

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

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

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

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

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

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

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

iterations count:3105 (5), effective:16 (0)

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

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

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