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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 8.0K Feb 25 18:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 18:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 18:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 18:28 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.6K Feb 25 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 18:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 25 18:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 18:40 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 259K 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-05a-CTLCardinality-00
FORMULA_NAME DLCround-PT-05a-CTLCardinality-01
FORMULA_NAME DLCround-PT-05a-CTLCardinality-02
FORMULA_NAME DLCround-PT-05a-CTLCardinality-03
FORMULA_NAME DLCround-PT-05a-CTLCardinality-04
FORMULA_NAME DLCround-PT-05a-CTLCardinality-05
FORMULA_NAME DLCround-PT-05a-CTLCardinality-06
FORMULA_NAME DLCround-PT-05a-CTLCardinality-07
FORMULA_NAME DLCround-PT-05a-CTLCardinality-08
FORMULA_NAME DLCround-PT-05a-CTLCardinality-09
FORMULA_NAME DLCround-PT-05a-CTLCardinality-10
FORMULA_NAME DLCround-PT-05a-CTLCardinality-11
FORMULA_NAME DLCround-PT-05a-CTLCardinality-12
FORMULA_NAME DLCround-PT-05a-CTLCardinality-13
FORMULA_NAME DLCround-PT-05a-CTLCardinality-14
FORMULA_NAME DLCround-PT-05a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678273794590

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-05a
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_05a
(NrP: 167 NrTr: 1055 NrArc: 3985)

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

net check time: 0m 0.000sec

init dd package: 0m 2.919sec


RS generation: 0m 2.298sec


-> reachability set: #nodes 25383 (2.5e+04) #states 2,401,000,001 (9)



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

checking: AG [AX [~ [AF [AG [p134<=1]]]]]
normalized: ~ [E [true U EX [~ [EG [E [true U ~ [p134<=1]]]]]]]

abstracting: (p134<=1)
states: 2,401,000,001 (9)
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 2.956sec

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

abstracting: (p95<=1)
states: 2,401,000,001 (9)
.-> the formula is TRUE

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

MC time: 0m 0.010sec

checking: AF [AG [EX [p163<=p116]]]
normalized: ~ [EG [E [true U ~ [EX [p163<=p116]]]]]

abstracting: (p163<=p116)
states: 2,401,000,001 (9)
..
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.006sec

checking: EF [AF [p25<=p69]]
normalized: E [true U ~ [EG [~ [p25<=p69]]]]

abstracting: (p25<=p69)
states: 2,092,300,001 (9)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.168sec

checking: EF [EX [~ [[EF [p53<=0] | EF [p161<=p34]]]]]
normalized: E [true U EX [~ [[E [true U p53<=0] | E [true U p161<=p34]]]]]

abstracting: (p161<=p34)
states: 240,100,001 (8)
abstracting: (p53<=0)
states: 2,160,900,001 (9)
.-> the formula is FALSE

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

MC time: 0m 1.572sec

checking: EX [A [EX [p39<=p1] U EX [[AF [1<=p66] & p88<=0]]]]
normalized: EX [[~ [EG [~ [EX [[p88<=0 & ~ [EG [~ [1<=p66]]]]]]]] & ~ [E [~ [EX [[p88<=0 & ~ [EG [~ [1<=p66]]]]]] U [~ [EX [p39<=p1]] & ~ [EX [[p88<=0 & ~ [EG [~ [1<=p66]]]]]]]]]]]

abstracting: (1<=p66)
states: 240,100,000 (8)
.
EG iterations: 1
abstracting: (p88<=0)
states: 2,160,900,001 (9)
.abstracting: (p39<=p1)
states: 2,195,200,001 (9)
.abstracting: (1<=p66)
states: 240,100,000 (8)
.
EG iterations: 1
abstracting: (p88<=0)
states: 2,160,900,001 (9)
.abstracting: (1<=p66)
states: 240,100,000 (8)
.
EG iterations: 1
abstracting: (p88<=0)
states: 2,160,900,001 (9)
..
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 1.519sec

checking: E [AG [p103<=1] U AF [[[~ [AG [p50<=p134]] & EX [[1<=p8 & p34<=0]]] & 1<=p37]]]
normalized: E [~ [E [true U ~ [p103<=1]]] U ~ [EG [~ [[1<=p37 & [EX [[1<=p8 & p34<=0]] & E [true U ~ [p50<=p134]]]]]]]]

abstracting: (p50<=p134)
states: 2,401,000,001 (9)
abstracting: (p34<=0)
states: 2,160,900,001 (9)
abstracting: (1<=p8)
states: 343,000,000 (8)
.abstracting: (1<=p37)
states: 240,100,000 (8)

EG iterations: 0
abstracting: (p103<=1)
states: 2,401,000,001 (9)
-> the formula is FALSE

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

MC time: 0m 0.873sec

checking: ~ [[~ [AG [[[[EF [p160<=p38] | [1<=p97 | 1<=p76]] & ~ [p80<=0]] | ~ [AG [p90<=1]]]]] & ~ [[[AG [EF [1<=p9]] | [AG [[p71<=0 | 1<=p158]] & EG [1<=p46]]] & E [p98<=p28 U EF [1<=p51]]]]]]
normalized: ~ [[E [true U ~ [[E [true U ~ [p90<=1]] | [~ [p80<=0] & [[1<=p97 | 1<=p76] | E [true U p160<=p38]]]]]] & ~ [[E [p98<=p28 U E [true U 1<=p51]] & [[EG [1<=p46] & ~ [E [true U ~ [[p71<=0 | 1<=p158]]]]] | ~ [E [true U ~ [E [true U 1<=p9]]]]]]]]]

abstracting: (1<=p9)
states: 343,000,000 (8)
abstracting: (1<=p158)
states: 2,401,000,000 (9)
abstracting: (p71<=0)
states: 2,160,900,001 (9)
abstracting: (1<=p46)
states: 240,100,000 (8)
.
EG iterations: 1
abstracting: (1<=p51)
states: 240,100,000 (8)
abstracting: (p98<=p28)
states: 343,000,001 (8)
abstracting: (p160<=p38)
states: 240,100,001 (8)
abstracting: (1<=p76)
states: 240,100,000 (8)
abstracting: (1<=p97)
states: 2,401,000,000 (9)
abstracting: (p80<=0)
states: 2,160,900,001 (9)
abstracting: (p90<=1)
states: 2,401,000,001 (9)
-> the formula is TRUE

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

MC time: 0m 3.153sec

checking: A [~ [AF [EF [p121<=0]]] U [EX [~ [[[AX [1<=p124] | [p128<=p71 | 1<=p141]] & [[p138<=0 & p35<=p4] & [p62<=1 | 1<=p60]]]]] & E [p138<=p34 U ~ [EX [p30<=1]]]]]
normalized: [~ [EG [~ [[E [p138<=p34 U ~ [EX [p30<=1]]] & EX [~ [[[[p62<=1 | 1<=p60] & [p138<=0 & p35<=p4]] & [[p128<=p71 | 1<=p141] | ~ [EX [~ [1<=p124]]]]]]]]]]] & ~ [E [~ [[E [p138<=p34 U ~ [EX [p30<=1]]] & EX [~ [[[[p62<=1 | 1<=p60] & [p138<=0 & p35<=p4]] & [[p128<=p71 | 1<=p141] | ~ [EX [~ [1<=p124]]]]]]]]] U [~ [EG [~ [E [true U p121<=0]]]] & ~ [[E [p138<=p34 U ~ [EX [p30<=1]]] & EX [~ [[[[p62<=1 | 1<=p60] & [p138<=0 & p35<=p4]] & [[p128<=p71 | 1<=p141] | ~ [EX [~ [1<=p124]]]]]]]]]]]]]

abstracting: (1<=p124)
states: 2,401,000,000 (9)
.abstracting: (1<=p141)
states: 2,401,000,000 (9)
abstracting: (p128<=p71)
states: 240,100,001 (8)
abstracting: (p35<=p4)
states: 2,195,200,001 (9)
abstracting: (p138<=0)
states: 1
abstracting: (1<=p60)
states: 240,100,000 (8)
abstracting: (p62<=1)
states: 2,401,000,001 (9)
.abstracting: (p30<=1)
states: 2,401,000,001 (9)
.abstracting: (p138<=p34)
states: 240,100,001 (8)
abstracting: (p121<=0)
states: 1
.
EG iterations: 1
abstracting: (1<=p124)
states: 2,401,000,000 (9)
.abstracting: (1<=p141)
states: 2,401,000,000 (9)
abstracting: (p128<=p71)
states: 240,100,001 (8)
abstracting: (p35<=p4)
states: 2,195,200,001 (9)
abstracting: (p138<=0)
states: 1
abstracting: (1<=p60)
states: 240,100,000 (8)
abstracting: (p62<=1)
states: 2,401,000,001 (9)
.abstracting: (p30<=1)
states: 2,401,000,001 (9)
.abstracting: (p138<=p34)
states: 240,100,001 (8)
abstracting: (1<=p124)
states: 2,401,000,000 (9)
.abstracting: (1<=p141)
states: 2,401,000,000 (9)
abstracting: (p128<=p71)
states: 240,100,001 (8)
abstracting: (p35<=p4)
states: 2,195,200,001 (9)
abstracting: (p138<=0)
states: 1
abstracting: (1<=p60)
states: 240,100,000 (8)
abstracting: (p62<=1)
states: 2,401,000,001 (9)
.abstracting: (p30<=1)
states: 2,401,000,001 (9)
.abstracting: (p138<=p34)
states: 240,100,001 (8)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.075sec

checking: A [[AF [EX [~ [p77<=p75]]] & p162<=0] U [~ [E [[[[1<=p135 & p17<=0] | p15<=1] & [[p23<=1 & p81<=0] & EG [p58<=0]]] U AX [p156<=p82]]] | [AG [AF [[1<=p147 & p146<=p105]]] | ~ [AF [AG [p117<=p19]]]]]]
normalized: [~ [EG [~ [[[EG [E [true U ~ [p117<=p19]]] | ~ [E [true U EG [~ [[1<=p147 & p146<=p105]]]]]] | ~ [E [[[EG [p58<=0] & [p23<=1 & p81<=0]] & [p15<=1 | [1<=p135 & p17<=0]]] U ~ [EX [~ [p156<=p82]]]]]]]]] & ~ [E [~ [[[EG [E [true U ~ [p117<=p19]]] | ~ [E [true U EG [~ [[1<=p147 & p146<=p105]]]]]] | ~ [E [[[EG [p58<=0] & [p23<=1 & p81<=0]] & [p15<=1 | [1<=p135 & p17<=0]]] U ~ [EX [~ [p156<=p82]]]]]]] U [~ [[p162<=0 & ~ [EG [~ [EX [~ [p77<=p75]]]]]]] & ~ [[[EG [E [true U ~ [p117<=p19]]] | ~ [E [true U EG [~ [[1<=p147 & p146<=p105]]]]]] | ~ [E [[[EG [p58<=0] & [p23<=1 & p81<=0]] & [p15<=1 | [1<=p135 & p17<=0]]] U ~ [EX [~ [p156<=p82]]]]]]]]]]]

abstracting: (p156<=p82)
states: 240,100,001 (8)
.abstracting: (p17<=0)
states: 2,058,000,001 (9)
abstracting: (1<=p135)
states: 2,401,000,000 (9)
abstracting: (p15<=1)
states: 2,401,000,001 (9)
abstracting: (p81<=0)
states: 2,160,900,001 (9)
abstracting: (p23<=1)
states: 2,401,000,001 (9)
abstracting: (p58<=0)
states: 2,160,900,001 (9)
..
EG iterations: 2
abstracting: (p146<=p105)
states: 2,401,000,001 (9)
abstracting: (1<=p147)
states: 2,401,000,000 (9)
..
EG iterations: 2
abstracting: (p117<=p19)
states: 343,000,001 (8)

EG iterations: 0
abstracting: (p77<=p75)
states: 2,160,900,001 (9)
...
EG iterations: 2
abstracting: (p162<=0)
states: 1
abstracting: (p156<=p82)
states: 240,100,001 (8)
.abstracting: (p17<=0)
states: 2,058,000,001 (9)
abstracting: (1<=p135)
states: 2,401,000,000 (9)
abstracting: (p15<=1)
states: 2,401,000,001 (9)
abstracting: (p81<=0)
states: 2,160,900,001 (9)
abstracting: (p23<=1)
states: 2,401,000,001 (9)
abstracting: (p58<=0)
states: 2,160,900,001 (9)
..
EG iterations: 2
abstracting: (p146<=p105)
states: 2,401,000,001 (9)
abstracting: (1<=p147)
states: 2,401,000,000 (9)
..
EG iterations: 2
abstracting: (p117<=p19)
states: 343,000,001 (8)

EG iterations: 0
abstracting: (p156<=p82)
states: 240,100,001 (8)
.abstracting: (p17<=0)
states: 2,058,000,001 (9)
abstracting: (1<=p135)
states: 2,401,000,000 (9)
abstracting: (p15<=1)
states: 2,401,000,001 (9)
abstracting: (p81<=0)
states: 2,160,900,001 (9)
abstracting: (p23<=1)
states: 2,401,000,001 (9)
abstracting: (p58<=0)
states: 2,160,900,001 (9)
..
EG iterations: 2
abstracting: (p146<=p105)
states: 2,401,000,001 (9)
abstracting: (1<=p147)
states: 2,401,000,000 (9)
..
EG iterations: 2
abstracting: (p117<=p19)
states: 343,000,001 (8)

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

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

MC time: 0m 1.095sec

checking: AF [[A [~ [p23<=p88] U [[[1<=p86 & A [p143<=p53 U p141<=p80]] & 1<=p62] | p88<=p144]] | AF [[[[[p120<=1 & 1<=p23] | ~ [p89<=1]] | A [p100<=p38 U p91<=0]] & 1<=p55]]]]
normalized: ~ [EG [~ [[~ [EG [~ [[1<=p55 & [[~ [EG [~ [p91<=0]]] & ~ [E [~ [p91<=0] U [~ [p100<=p38] & ~ [p91<=0]]]]] | [~ [p89<=1] | [p120<=1 & 1<=p23]]]]]]] | [~ [EG [~ [[p88<=p144 | [1<=p62 & [1<=p86 & [~ [EG [~ [p141<=p80]]] & ~ [E [~ [p141<=p80] U [~ [p143<=p53] & ~ [p141<=p80]]]]]]]]]]] & ~ [E [~ [[p88<=p144 | [1<=p62 & [1<=p86 & [~ [EG [~ [p141<=p80]]] & ~ [E [~ [p141<=p80] U [~ [p143<=p53] & ~ [p141<=p80]]]]]]]]] U [p23<=p88 & ~ [[p88<=p144 | [1<=p62 & [1<=p86 & [~ [EG [~ [p141<=p80]]] & ~ [E [~ [p141<=p80] U [~ [p143<=p53] & ~ [p141<=p80]]]]]]]]]]]]]]]]]

abstracting: (p141<=p80)
states: 240,100,001 (8)
abstracting: (p143<=p53)
states: 240,100,001 (8)
abstracting: (p141<=p80)
states: 240,100,001 (8)
abstracting: (p141<=p80)
states: 240,100,001 (8)
.
EG iterations: 1
abstracting: (1<=p86)
states: 240,100,000 (8)
abstracting: (1<=p62)
states: 240,100,000 (8)
abstracting: (p88<=p144)
states: 2,401,000,001 (9)
abstracting: (p23<=p88)
states: 2,092,300,001 (9)
abstracting: (p141<=p80)
states: 240,100,001 (8)
abstracting: (p143<=p53)
states: 240,100,001 (8)
abstracting: (p141<=p80)
states: 240,100,001 (8)
abstracting: (p141<=p80)
states: 240,100,001 (8)
.
EG iterations: 1
abstracting: (1<=p86)
states: 240,100,000 (8)
abstracting: (1<=p62)
states: 240,100,000 (8)
abstracting: (p88<=p144)
states: 2,401,000,001 (9)
abstracting: (p141<=p80)
states: 240,100,001 (8)
abstracting: (p143<=p53)
states: 240,100,001 (8)
abstracting: (p141<=p80)
states: 240,100,001 (8)
abstracting: (p141<=p80)
states: 240,100,001 (8)
.
EG iterations: 1
abstracting: (1<=p86)
states: 240,100,000 (8)
abstracting: (1<=p62)
states: 240,100,000 (8)
abstracting: (p88<=p144)
states: 2,401,000,001 (9)
.
EG iterations: 1
abstracting: (1<=p23)
states: 343,000,000 (8)
abstracting: (p120<=1)
states: 2,401,000,001 (9)
abstracting: (p89<=1)
states: 2,401,000,001 (9)
abstracting: (p91<=0)
states: 1
abstracting: (p100<=p38)
states: 240,100,001 (8)
abstracting: (p91<=0)
states: 1
abstracting: (p91<=0)
states: 1
.
EG iterations: 1
abstracting: (1<=p55)
states: 240,100,000 (8)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.531sec

checking: EF [[[~ [E [~ [[p45<=p61 & 1<=p65]] U [~ [p147<=1] | [1<=p132 | p86<=p152]]]] | [1<=p140 & ~ [EF [[p73<=p128 & p128<=p55]]]]] & AF [[~ [EX [1<=p118]] & [p50<=p66 & [AG [p145<=p70] | EG [p81<=p75]]]]]]]
normalized: E [true U [~ [EG [~ [[[p50<=p66 & [EG [p81<=p75] | ~ [E [true U ~ [p145<=p70]]]]] & ~ [EX [1<=p118]]]]]] & [[1<=p140 & ~ [E [true U [p73<=p128 & p128<=p55]]]] | ~ [E [~ [[p45<=p61 & 1<=p65]] U [[1<=p132 | p86<=p152] | ~ [p147<=1]]]]]]]

abstracting: (p147<=1)
states: 2,401,000,001 (9)
abstracting: (p86<=p152)
states: 2,401,000,001 (9)
abstracting: (1<=p132)
states: 2,401,000,000 (9)
abstracting: (1<=p65)
states: 240,100,000 (8)
abstracting: (p45<=p61)
states: 2,184,910,001 (9)
abstracting: (p128<=p55)
states: 240,100,001 (8)
abstracting: (p73<=p128)
states: 2,401,000,001 (9)
abstracting: (1<=p140)
states: 2,401,000,000 (9)
abstracting: (1<=p118)
states: 2,401,000,000 (9)
.abstracting: (p145<=p70)
states: 240,100,001 (8)
abstracting: (p81<=p75)
states: 2,184,910,001 (9)
.
EG iterations: 1
abstracting: (p50<=p66)
states: 2,184,910,001 (9)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.325sec

checking: AX [~ [[~ [[[[p75<=p55 & p103<=p38] | [1<=p39 | p136<=0]] & [[1<=p88 | p26<=0] & AF [p166<=0]]]] | A [[[1<=p41 & 1<=p121] | [1<=p152 | 1<=p43]] U [[p65<=1 | 1<=p81] | [p45<=p46 & p69<=p78]]]]]]
normalized: ~ [EX [[[~ [EG [~ [[[p45<=p46 & p69<=p78] | [p65<=1 | 1<=p81]]]]] & ~ [E [~ [[[p45<=p46 & p69<=p78] | [p65<=1 | 1<=p81]]] U [~ [[[1<=p152 | 1<=p43] | [1<=p41 & 1<=p121]]] & ~ [[[p45<=p46 & p69<=p78] | [p65<=1 | 1<=p81]]]]]]] | ~ [[[~ [EG [~ [p166<=0]]] & [1<=p88 | p26<=0]] & [[1<=p39 | p136<=0] | [p75<=p55 & p103<=p38]]]]]]]

abstracting: (p103<=p38)
states: 240,100,001 (8)
abstracting: (p75<=p55)
states: 2,184,910,001 (9)
abstracting: (p136<=0)
states: 1
abstracting: (1<=p39)
states: 240,100,000 (8)
abstracting: (p26<=0)
states: 2,058,000,001 (9)
abstracting: (1<=p88)
states: 240,100,000 (8)
abstracting: (p166<=0)
states: 1
.
EG iterations: 1
abstracting: (1<=p81)
states: 240,100,000 (8)
abstracting: (p65<=1)
states: 2,401,000,001 (9)
abstracting: (p69<=p78)
states: 2,160,900,001 (9)
abstracting: (p45<=p46)
states: 2,160,900,001 (9)
abstracting: (1<=p121)
states: 2,401,000,000 (9)
abstracting: (1<=p41)
states: 240,100,000 (8)
abstracting: (1<=p43)
states: 240,100,000 (8)
abstracting: (1<=p152)
states: 2,401,000,000 (9)
abstracting: (1<=p81)
states: 240,100,000 (8)
abstracting: (p65<=1)
states: 2,401,000,001 (9)
abstracting: (p69<=p78)
states: 2,160,900,001 (9)
abstracting: (p45<=p46)
states: 2,160,900,001 (9)
abstracting: (1<=p81)
states: 240,100,000 (8)
abstracting: (p65<=1)
states: 2,401,000,001 (9)
abstracting: (p69<=p78)
states: 2,160,900,001 (9)
abstracting: (p45<=p46)
states: 2,160,900,001 (9)
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.092sec

checking: E [EG [p157<=0] U ~ [E [[[[p28<=p131 | EG [1<=p51]] & [p135<=p161 & [p156<=0 & 1<=p164]]] | p53<=p10] U [~ [[[p92<=p122 & p86<=p91] | p74<=1]] & [AG [p130<=1] & [EX [p164<=p29] & [1<=p39 | 1<=p34]]]]]]]
normalized: E [EG [p157<=0] U ~ [E [[p53<=p10 | [[p135<=p161 & [p156<=0 & 1<=p164]] & [p28<=p131 | EG [1<=p51]]]] U [[[[1<=p39 | 1<=p34] & EX [p164<=p29]] & ~ [E [true U ~ [p130<=1]]]] & ~ [[p74<=1 | [p92<=p122 & p86<=p91]]]]]]]

abstracting: (p86<=p91)
states: 2,401,000,001 (9)
abstracting: (p92<=p122)
states: 2,401,000,001 (9)
abstracting: (p74<=1)
states: 2,401,000,001 (9)
abstracting: (p130<=1)
states: 2,401,000,001 (9)
abstracting: (p164<=p29)
states: 240,100,001 (8)
.abstracting: (1<=p34)
states: 240,100,000 (8)
abstracting: (1<=p39)
states: 240,100,000 (8)
abstracting: (1<=p51)
states: 240,100,000 (8)
.
EG iterations: 1
abstracting: (p28<=p131)
states: 2,401,000,001 (9)
abstracting: (1<=p164)
states: 2,401,000,000 (9)
abstracting: (p156<=0)
states: 1
abstracting: (p135<=p161)
states: 2,401,000,001 (9)
abstracting: (p53<=p10)
states: 2,195,200,001 (9)
abstracting: (p157<=0)
states: 1
..
EG iterations: 2
-> the formula is TRUE

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

MC time: 0m 1.131sec

checking: A [[[AG [~ [p115<=1]] | ~ [[E [1<=p136 U 1<=p153] | AX [EG [p131<=p33]]]]] | [~ [[EX [AG [p48<=p117]] & [[[p149<=1 | p166<=0] & [1<=p66 | 1<=p58]] | ~ [[1<=p5 | p72<=p124]]]]] & EF [[EX [1<=p138] & ~ [[p140<=p106 | p33<=1]]]]]] U [EF [[AG [EF [1<=p85]] & EX [~ [p16<=1]]]] & EX [A [E [p161<=1 U p160<=1] U AX [p40<=1]]]]]
normalized: [~ [EG [~ [[EX [[~ [EG [EX [~ [p40<=1]]]] & ~ [E [EX [~ [p40<=1]] U [~ [E [p161<=1 U p160<=1]] & EX [~ [p40<=1]]]]]]] & E [true U [EX [~ [p16<=1]] & ~ [E [true U ~ [E [true U 1<=p85]]]]]]]]]] & ~ [E [~ [[EX [[~ [EG [EX [~ [p40<=1]]]] & ~ [E [EX [~ [p40<=1]] U [~ [E [p161<=1 U p160<=1]] & EX [~ [p40<=1]]]]]]] & E [true U [EX [~ [p16<=1]] & ~ [E [true U ~ [E [true U 1<=p85]]]]]]]] U [~ [[[E [true U [~ [[p140<=p106 | p33<=1]] & EX [1<=p138]]] & ~ [[[~ [[1<=p5 | p72<=p124]] | [[1<=p66 | 1<=p58] & [p149<=1 | p166<=0]]] & EX [~ [E [true U ~ [p48<=p117]]]]]]] | [~ [[~ [EX [~ [EG [p131<=p33]]]] | E [1<=p136 U 1<=p153]]] | ~ [E [true U p115<=1]]]]] & ~ [[EX [[~ [EG [EX [~ [p40<=1]]]] & ~ [E [EX [~ [p40<=1]] U [~ [E [p161<=1 U p160<=1]] & EX [~ [p40<=1]]]]]]] & E [true U [EX [~ [p16<=1]] & ~ [E [true U ~ [E [true U 1<=p85]]]]]]]]]]]]

abstracting: (1<=p85)
states: 240,100,000 (8)
abstracting: (p16<=1)
states: 2,401,000,001 (9)
.abstracting: (p40<=1)
states: 2,401,000,001 (9)
.abstracting: (p160<=1)
states: 2,401,000,001 (9)
abstracting: (p161<=1)
states: 2,401,000,001 (9)
abstracting: (p40<=1)
states: 2,401,000,001 (9)
.abstracting: (p40<=1)
states: 2,401,000,001 (9)
..
EG iterations: 1
.abstracting: (p115<=1)
states: 2,401,000,001 (9)
abstracting: (1<=p153)
states: 2,401,000,000 (9)
abstracting: (1<=p136)
states: 2,401,000,000 (9)
abstracting: (p131<=p33)
states: 240,100,001 (8)
..
EG iterations: 2
.abstracting: (p48<=p117)
states: 2,401,000,001 (9)
.abstracting: (p166<=0)
states: 1
abstracting: (p149<=1)
states: 2,401,000,001 (9)
abstracting: (1<=p58)
states: 240,100,000 (8)
abstracting: (1<=p66)
states: 240,100,000 (8)
abstracting: (p72<=p124)
states: 2,401,000,001 (9)
abstracting: (1<=p5)
states: 343,000,000 (8)
abstracting: (1<=p138)
states: 2,401,000,000 (9)
.abstracting: (p33<=1)
states: 2,401,000,001 (9)
abstracting: (p140<=p106)
states: 2,401,000,001 (9)
abstracting: (1<=p85)
states: 240,100,000 (8)
abstracting: (p16<=1)
states: 2,401,000,001 (9)
.abstracting: (p40<=1)
states: 2,401,000,001 (9)
.abstracting: (p160<=1)
states: 2,401,000,001 (9)
abstracting: (p161<=1)
states: 2,401,000,001 (9)
abstracting: (p40<=1)
states: 2,401,000,001 (9)
.abstracting: (p40<=1)
states: 2,401,000,001 (9)
..
EG iterations: 1
.abstracting: (1<=p85)
states: 240,100,000 (8)
abstracting: (p16<=1)
states: 2,401,000,001 (9)
.abstracting: (p40<=1)
states: 2,401,000,001 (9)
.abstracting: (p160<=1)
states: 2,401,000,001 (9)
abstracting: (p161<=1)
states: 2,401,000,001 (9)
abstracting: (p40<=1)
states: 2,401,000,001 (9)
.abstracting: (p40<=1)
states: 2,401,000,001 (9)
..
EG iterations: 1
.
EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 3.093sec

checking: [[[AG [[EF [~ [p133<=p83]] | [1<=p83 & EF [p76<=p146]]]] & AF [p62<=1]] | [AG [~ [p17<=1]] & E [[[p105<=p39 & [[p24<=p108 & 1<=p52] & [p84<=1 & 1<=p16]]] & EX [E [1<=p12 U p16<=0]]] U AF [p102<=p157]]]] | ~ [[AG [[[[[1<=p65 | p71<=p18] & A [p119<=p52 U 1<=p35]] | EX [p135<=1]] | ~ [1<=p130]]] | [[EX [~ [1<=p104]] | [E [[1<=p62 | p141<=p36] U p81<=p3] | [AG [p110<=p48] & EF [p73<=p29]]]] & EX [EX [[1<=p3 | p28<=p36]]]]]]]
normalized: [~ [[[EX [EX [[1<=p3 | p28<=p36]]] & [[[E [true U p73<=p29] & ~ [E [true U ~ [p110<=p48]]]] | E [[1<=p62 | p141<=p36] U p81<=p3]] | EX [~ [1<=p104]]]] | ~ [E [true U ~ [[~ [1<=p130] | [EX [p135<=1] | [[~ [EG [~ [1<=p35]]] & ~ [E [~ [1<=p35] U [~ [p119<=p52] & ~ [1<=p35]]]]] & [1<=p65 | p71<=p18]]]]]]]]] | [[E [[EX [E [1<=p12 U p16<=0]] & [p105<=p39 & [[p84<=1 & 1<=p16] & [p24<=p108 & 1<=p52]]]] U ~ [EG [~ [p102<=p157]]]] & ~ [E [true U p17<=1]]] | [~ [EG [~ [p62<=1]]] & ~ [E [true U ~ [[[1<=p83 & E [true U p76<=p146]] | E [true U ~ [p133<=p83]]]]]]]]]

abstracting: (p133<=p83)
states: 240,100,001 (8)
abstracting: (p76<=p146)
states: 2,401,000,001 (9)
abstracting: (1<=p83)
states: 240,100,000 (8)
abstracting: (p62<=1)
states: 2,401,000,001 (9)
.
EG iterations: 1
abstracting: (p17<=1)
states: 2,401,000,001 (9)
abstracting: (p102<=p157)
states: 2,401,000,001 (9)
.
EG iterations: 1
abstracting: (1<=p52)
states: 240,100,000 (8)
abstracting: (p24<=p108)
states: 2,401,000,001 (9)
abstracting: (1<=p16)
states: 343,000,000 (8)
abstracting: (p84<=1)
states: 2,401,000,001 (9)
abstracting: (p105<=p39)
states: 240,100,001 (8)
abstracting: (p16<=0)
states: 2,058,000,001 (9)
abstracting: (1<=p12)
states: 343,000,000 (8)
.abstracting: (p71<=p18)
states: 2,195,200,001 (9)
abstracting: (1<=p65)
states: 240,100,000 (8)
abstracting: (1<=p35)
states: 240,100,000 (8)
abstracting: (p119<=p52)
states: 240,100,001 (8)
abstracting: (1<=p35)
states: 240,100,000 (8)
abstracting: (1<=p35)
states: 240,100,000 (8)
.
EG iterations: 1
abstracting: (p135<=1)
states: 2,401,000,001 (9)
.abstracting: (1<=p130)
states: 2,401,000,000 (9)
abstracting: (1<=p104)
states: 2,401,000,000 (9)
.abstracting: (p81<=p3)
states: 2,195,200,001 (9)
abstracting: (p141<=p36)
states: 240,100,001 (8)
abstracting: (1<=p62)
states: 240,100,000 (8)
abstracting: (p110<=p48)
states: 240,100,001 (8)
abstracting: (p73<=p29)
states: 2,184,910,001 (9)
abstracting: (p28<=p36)
states: 2,092,300,001 (9)
abstracting: (1<=p3)
states: 343,000,000 (8)
..-> the formula is TRUE

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

MC time: 0m 6.575sec

totally nodes used: 1300472 (1.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 15045233 71826081 86871314
used/not used/entry size/cache size: 43904539 23204325 16 1024MB
basic ops cache: hits/miss/sum: 621359 1930921 2552280
used/not used/entry size/cache size: 2621444 14155772 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: 50528 253898 304426
used/not used/entry size/cache size: 250452 8138156 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 65840344
1 1238321
2 28541
3 1568
4 85
5 5
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m30.457sec


BK_STOP 1678273825095

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


iterations count:26337 (24), effective:79 (0)

initing FirstDep: 0m 0.004sec


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

iterations count:4487 (4), effective:9 (0)

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

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

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

iterations count:4424 (4), effective:10 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:5135 (4), effective:10 (0)

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

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

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

iterations count:5135 (4), effective:10 (0)

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

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

iterations count:5135 (4), effective:10 (0)

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

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

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

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

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

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

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

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

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

iterations count:1570 (1), effective:9 (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-05a"
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-05a, 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-167814469800649"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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