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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 6.8K Feb 25 18:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 18:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 18:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 18:37 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 28K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 12K Feb 25 19:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 19:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 18:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 18:56 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 325K 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-06a-CTLCardinality-00
FORMULA_NAME DLCround-PT-06a-CTLCardinality-01
FORMULA_NAME DLCround-PT-06a-CTLCardinality-02
FORMULA_NAME DLCround-PT-06a-CTLCardinality-03
FORMULA_NAME DLCround-PT-06a-CTLCardinality-04
FORMULA_NAME DLCround-PT-06a-CTLCardinality-05
FORMULA_NAME DLCround-PT-06a-CTLCardinality-06
FORMULA_NAME DLCround-PT-06a-CTLCardinality-07
FORMULA_NAME DLCround-PT-06a-CTLCardinality-08
FORMULA_NAME DLCround-PT-06a-CTLCardinality-09
FORMULA_NAME DLCround-PT-06a-CTLCardinality-10
FORMULA_NAME DLCround-PT-06a-CTLCardinality-11
FORMULA_NAME DLCround-PT-06a-CTLCardinality-12
FORMULA_NAME DLCround-PT-06a-CTLCardinality-13
FORMULA_NAME DLCround-PT-06a-CTLCardinality-14
FORMULA_NAME DLCround-PT-06a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678275032178

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-06a
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_06a
(NrP: 197 NrTr: 1313 NrArc: 5002)

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

net check time: 0m 0.000sec

init dd package: 0m 2.828sec


RS generation: 0m 6.555sec


-> reachability set: #nodes 60057 (6.0e+04) #states 24,010,000,001 (10)



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

checking: ~ [AG [p171<=1]]
normalized: E [true U ~ [p171<=1]]

abstracting: (p171<=1)
states: 24,010,000,001 (10)
-> the formula is FALSE

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

MC time: 0m 0.001sec

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

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

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

MC time: 0m 8.795sec

checking: EF [~ [[~ [EX [~ [p63<=p181]]] & p90<=1]]]
normalized: E [true U ~ [[p90<=1 & ~ [EX [~ [p63<=p181]]]]]]

abstracting: (p63<=p181)
states: 24,010,000,001 (10)
.abstracting: (p90<=1)
states: 24,010,000,001 (10)
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: AG [AX [AG [A [1<=p31 U p34<=p82]]]]
normalized: ~ [E [true U EX [E [true U ~ [[~ [EG [~ [p34<=p82]]] & ~ [E [~ [p34<=p82] U [~ [1<=p31] & ~ [p34<=p82]]]]]]]]]]

abstracting: (p34<=p82)
states: 21,849,100,001 (10)
abstracting: (1<=p31)
states: 2,401,000,000 (9)
abstracting: (p34<=p82)
states: 21,849,100,001 (10)
abstracting: (p34<=p82)
states: 21,849,100,001 (10)
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m12.997sec

checking: [AG [AX [1<=p134]] & AF [AX [[~ [p68<=1] | EG [p163<=p177]]]]]
normalized: [~ [EG [EX [~ [[EG [p163<=p177] | ~ [p68<=1]]]]]] & ~ [E [true U EX [~ [1<=p134]]]]]

abstracting: (1<=p134)
states: 24,010,000,000 (10)
.abstracting: (p68<=1)
states: 24,010,000,001 (10)
abstracting: (p163<=p177)
states: 24,010,000,001 (10)

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

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

MC time: 0m 0.053sec

checking: ~ [EX [[~ [p76<=0] | EF [AG [[1<=p65 & p78<=p3]]]]]]
normalized: ~ [EX [[E [true U ~ [E [true U ~ [[1<=p65 & p78<=p3]]]]] | ~ [p76<=0]]]]

abstracting: (p76<=0)
states: 21,609,000,001 (10)
abstracting: (p78<=p3)
states: 21,952,000,001 (10)
abstracting: (1<=p65)
states: 2,401,000,000 (9)
.-> the formula is TRUE

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

MC time: 0m 0.486sec

checking: E [AX [[AG [[p60<=1 | p87<=0]] | EX [~ [[1<=p58 | p40<=p113]]]]] U 1<=p157]
normalized: E [~ [EX [~ [[EX [~ [[1<=p58 | p40<=p113]]] | ~ [E [true U ~ [[p60<=1 | p87<=0]]]]]]]] U 1<=p157]

abstracting: (1<=p157)
states: 24,010,000,000 (10)
abstracting: (p87<=0)
states: 21,609,000,001 (10)
abstracting: (p60<=1)
states: 24,010,000,001 (10)
abstracting: (p40<=p113)
states: 24,010,000,001 (10)
abstracting: (1<=p58)
states: 2,401,000,000 (9)
..-> the formula is TRUE

FORMULA DLCround-PT-06a-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.065sec

checking: EF [E [[p91<=p166 & ~ [[p124<=p2 & [~ [p87<=0] | 1<=p62]]]] U ~ [[1<=p21 | EG [EF [1<=p132]]]]]]
normalized: E [true U E [[p91<=p166 & ~ [[p124<=p2 & [1<=p62 | ~ [p87<=0]]]]] U ~ [[1<=p21 | EG [E [true U 1<=p132]]]]]]

abstracting: (1<=p132)
states: 24,010,000,000 (10)

EG iterations: 0
abstracting: (1<=p21)
states: 3,430,000,000 (9)
abstracting: (p87<=0)
states: 21,609,000,001 (10)
abstracting: (1<=p62)
states: 2,401,000,000 (9)
abstracting: (p124<=p2)
states: 3,430,000,001 (9)
abstracting: (p91<=p166)
states: 24,010,000,001 (10)
-> the formula is FALSE

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

MC time: 0m 0.142sec

checking: [EG [AF [p167<=p24]] | [AF [~ [p115<=0]] & ~ [[[AG [p6<=1] & ~ [[AG [p159<=1] & EX [1<=p56]]]] & AG [AF [[p173<=1 | 1<=p13]]]]]]]
normalized: [[~ [[~ [E [true U EG [~ [[p173<=1 | 1<=p13]]]]] & [~ [[EX [1<=p56] & ~ [E [true U ~ [p159<=1]]]]] & ~ [E [true U ~ [p6<=1]]]]]] & ~ [EG [p115<=0]]] | EG [~ [EG [~ [p167<=p24]]]]]

abstracting: (p167<=p24)
states: 3,430,000,001 (9)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (p115<=0)
states: 1
..
EG iterations: 2
abstracting: (p6<=1)
states: 24,010,000,001 (10)
abstracting: (p159<=1)
states: 24,010,000,001 (10)
abstracting: (1<=p56)
states: 2,401,000,000 (9)
.abstracting: (1<=p13)
states: 3,430,000,000 (9)
abstracting: (p173<=1)
states: 24,010,000,001 (10)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.812sec

checking: ~ [A [[p121<=p30 | EF [EF [p67<=1]]] U [~ [EG [[AG [p196<=1] | ~ [p180<=p187]]]] | EX [A [[1<=p67 & p22<=0] U AG [p96<=1]]]]]]
normalized: ~ [[~ [EG [~ [[EX [[~ [EG [E [true U ~ [p96<=1]]]] & ~ [E [E [true U ~ [p96<=1]] U [~ [[1<=p67 & p22<=0]] & E [true U ~ [p96<=1]]]]]]] | ~ [EG [[~ [p180<=p187] | ~ [E [true U ~ [p196<=1]]]]]]]]]] & ~ [E [~ [[EX [[~ [EG [E [true U ~ [p96<=1]]]] & ~ [E [E [true U ~ [p96<=1]] U [~ [[1<=p67 & p22<=0]] & E [true U ~ [p96<=1]]]]]]] | ~ [EG [[~ [p180<=p187] | ~ [E [true U ~ [p196<=1]]]]]]]] U [~ [[p121<=p30 | E [true U E [true U p67<=1]]]] & ~ [[EX [[~ [EG [E [true U ~ [p96<=1]]]] & ~ [E [E [true U ~ [p96<=1]] U [~ [[1<=p67 & p22<=0]] & E [true U ~ [p96<=1]]]]]]] | ~ [EG [[~ [p180<=p187] | ~ [E [true U ~ [p196<=1]]]]]]]]]]]]]

abstracting: (p196<=1)
states: 24,010,000,001 (10)
abstracting: (p180<=p187)
states: 24,010,000,001 (10)

EG iterations: 0
abstracting: (p96<=1)
states: 24,010,000,001 (10)
abstracting: (p22<=0)
states: 20,580,000,001 (10)
abstracting: (1<=p67)
states: 2,401,000,000 (9)
abstracting: (p96<=1)
states: 24,010,000,001 (10)
abstracting: (p96<=1)
states: 24,010,000,001 (10)
.
EG iterations: 1
.abstracting: (p67<=1)
states: 24,010,000,001 (10)
abstracting: (p121<=p30)
states: 2,401,000,001 (9)
abstracting: (p196<=1)
states: 24,010,000,001 (10)
abstracting: (p180<=p187)
states: 24,010,000,001 (10)

EG iterations: 0
abstracting: (p96<=1)
states: 24,010,000,001 (10)
abstracting: (p22<=0)
states: 20,580,000,001 (10)
abstracting: (1<=p67)
states: 2,401,000,000 (9)
abstracting: (p96<=1)
states: 24,010,000,001 (10)
abstracting: (p96<=1)
states: 24,010,000,001 (10)
.
EG iterations: 1
.abstracting: (p196<=1)
states: 24,010,000,001 (10)
abstracting: (p180<=p187)
states: 24,010,000,001 (10)

EG iterations: 0
abstracting: (p96<=1)
states: 24,010,000,001 (10)
abstracting: (p22<=0)
states: 20,580,000,001 (10)
abstracting: (1<=p67)
states: 2,401,000,000 (9)
abstracting: (p96<=1)
states: 24,010,000,001 (10)
abstracting: (p96<=1)
states: 24,010,000,001 (10)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.071sec

checking: A [EG [~ [[[~ [p163<=0] | EX [p176<=p91]] | EF [A [p52<=1 U p86<=0]]]]] U AF [[EX [[p112<=0 | [p193<=p181 & p143<=p133]]] & ~ [AX [p134<=p170]]]]]
normalized: [~ [EG [EG [~ [[EX [~ [p134<=p170]] & EX [[p112<=0 | [p193<=p181 & p143<=p133]]]]]]]] & ~ [E [EG [~ [[EX [~ [p134<=p170]] & EX [[p112<=0 | [p193<=p181 & p143<=p133]]]]]] U [~ [EG [~ [[E [true U [~ [EG [~ [p86<=0]]] & ~ [E [~ [p86<=0] U [~ [p52<=1] & ~ [p86<=0]]]]]] | [EX [p176<=p91] | ~ [p163<=0]]]]]] & EG [~ [[EX [~ [p134<=p170]] & EX [[p112<=0 | [p193<=p181 & p143<=p133]]]]]]]]]]

abstracting: (p143<=p133)
states: 24,010,000,001 (10)
abstracting: (p193<=p181)
states: 24,010,000,001 (10)
abstracting: (p112<=0)
states: 1
.abstracting: (p134<=p170)
states: 24,010,000,001 (10)
.
EG iterations: 0
abstracting: (p163<=0)
states: 1
abstracting: (p176<=p91)
states: 2,401,000,001 (9)
.abstracting: (p86<=0)
states: 21,609,000,001 (10)
abstracting: (p52<=1)
states: 24,010,000,001 (10)
abstracting: (p86<=0)
states: 21,609,000,001 (10)
abstracting: (p86<=0)
states: 21,609,000,001 (10)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p143<=p133)
states: 24,010,000,001 (10)
abstracting: (p193<=p181)
states: 24,010,000,001 (10)
abstracting: (p112<=0)
states: 1
.abstracting: (p134<=p170)
states: 24,010,000,001 (10)
.
EG iterations: 0
abstracting: (p143<=p133)
states: 24,010,000,001 (10)
abstracting: (p193<=p181)
states: 24,010,000,001 (10)
abstracting: (p112<=0)
states: 1
.abstracting: (p134<=p170)
states: 24,010,000,001 (10)
.
EG iterations: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.182sec

checking: AG [[~ [[EX [~ [[p9<=p48 | p33<=p51]]] | ~ [AX [EG [p173<=p135]]]]] & E [~ [[[AF [p31<=p95] & EF [1<=p111]] | [[p108<=0 | p150<=0] & [p136<=1 | p10<=1]]]] U EX [A [p97<=1 U 1<=p7]]]]]
normalized: ~ [E [true U ~ [[E [~ [[[[p136<=1 | p10<=1] & [p108<=0 | p150<=0]] | [E [true U 1<=p111] & ~ [EG [~ [p31<=p95]]]]]] U EX [[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [p97<=1] & ~ [1<=p7]]]]]]] & ~ [[EX [~ [EG [p173<=p135]]] | EX [~ [[p9<=p48 | p33<=p51]]]]]]]]]

abstracting: (p33<=p51)
states: 21,849,100,001 (10)
abstracting: (p9<=p48)
states: 20,923,000,001 (10)
.abstracting: (p173<=p135)
states: 24,010,000,001 (10)

EG iterations: 0
.abstracting: (1<=p7)
states: 3,430,000,000 (9)
abstracting: (p97<=1)
states: 24,010,000,001 (10)
abstracting: (1<=p7)
states: 3,430,000,000 (9)
abstracting: (1<=p7)
states: 3,430,000,000 (9)
..
EG iterations: 2
.abstracting: (p31<=p95)
states: 21,849,100,001 (10)
.
EG iterations: 1
abstracting: (1<=p111)
states: 24,010,000,000 (10)
abstracting: (p150<=0)
states: 1
abstracting: (p108<=0)
states: 1
abstracting: (p10<=1)
states: 24,010,000,001 (10)
abstracting: (p136<=1)
states: 24,010,000,001 (10)
-> the formula is FALSE

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

MC time: 0m42.021sec

checking: [E [p133<=1 U p186<=1] | [EX [[[[[[p158<=1 | p102<=p46] & AG [p44<=p95]] | [[p108<=p49 & p31<=p14] | A [p142<=p96 U p50<=1]]] & AG [[1<=p149 & p102<=p61]]] & ~ [E [p29<=0 U 1<=p9]]]] & EF [p61<=1]]]
normalized: [[EX [[~ [E [p29<=0 U 1<=p9]] & [~ [E [true U ~ [[1<=p149 & p102<=p61]]]] & [[[~ [EG [~ [p50<=1]]] & ~ [E [~ [p50<=1] U [~ [p142<=p96] & ~ [p50<=1]]]]] | [p108<=p49 & p31<=p14]] | [~ [E [true U ~ [p44<=p95]]] & [p158<=1 | p102<=p46]]]]]] & E [true U p61<=1]] | E [p133<=1 U p186<=1]]

abstracting: (p186<=1)
states: 24,010,000,001 (10)
abstracting: (p133<=1)
states: 24,010,000,001 (10)
abstracting: (p61<=1)
states: 24,010,000,001 (10)
abstracting: (p102<=p46)
states: 2,401,000,001 (9)
abstracting: (p158<=1)
states: 24,010,000,001 (10)
abstracting: (p44<=p95)
states: 21,849,100,001 (10)
abstracting: (p31<=p14)
states: 21,952,000,001 (10)
abstracting: (p108<=p49)
states: 2,401,000,001 (9)
abstracting: (p50<=1)
states: 24,010,000,001 (10)
abstracting: (p142<=p96)
states: 2,401,000,001 (9)
abstracting: (p50<=1)
states: 24,010,000,001 (10)
abstracting: (p50<=1)
states: 24,010,000,001 (10)
.
EG iterations: 1
abstracting: (p102<=p61)
states: 2,401,000,001 (9)
abstracting: (1<=p149)
states: 24,010,000,000 (10)
abstracting: (1<=p9)
states: 3,430,000,000 (9)
abstracting: (p29<=0)
states: 21,609,000,001 (10)
.-> the formula is TRUE

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

MC time: 0m 9.146sec

checking: A [[[~ [[AF [[p163<=1 | p28<=1]] & ~ [[p9<=p19 | 1<=p28]]]] & p140<=p31] & [[EX [E [p70<=p181 U p172<=p111]] | p51<=p51] & EF [~ [AF [1<=p139]]]]] U [p133<=p192 & ~ [[EF [~ [A [p187<=p195 U p194<=1]]] | p78<=p30]]]]
normalized: [~ [EG [~ [[p133<=p192 & ~ [[p78<=p30 | E [true U ~ [[~ [EG [~ [p194<=1]]] & ~ [E [~ [p194<=1] U [~ [p187<=p195] & ~ [p194<=1]]]]]]]]]]]]] & ~ [E [~ [[p133<=p192 & ~ [[p78<=p30 | E [true U ~ [[~ [EG [~ [p194<=1]]] & ~ [E [~ [p194<=1] U [~ [p187<=p195] & ~ [p194<=1]]]]]]]]]]] U [~ [[[E [true U EG [~ [1<=p139]]] & [p51<=p51 | EX [E [p70<=p181 U p172<=p111]]]] & [p140<=p31 & ~ [[~ [[p9<=p19 | 1<=p28]] & ~ [EG [~ [[p163<=1 | p28<=1]]]]]]]]] & ~ [[p133<=p192 & ~ [[p78<=p30 | E [true U ~ [[~ [EG [~ [p194<=1]]] & ~ [E [~ [p194<=1] U [~ [p187<=p195] & ~ [p194<=1]]]]]]]]]]]]]]]

abstracting: (p194<=1)
states: 24,010,000,001 (10)
abstracting: (p187<=p195)
states: 24,010,000,001 (10)
abstracting: (p194<=1)
states: 24,010,000,001 (10)
abstracting: (p194<=1)
states: 24,010,000,001 (10)
.
EG iterations: 1
abstracting: (p78<=p30)
states: 21,849,100,001 (10)
abstracting: (p133<=p192)
states: 24,010,000,001 (10)
abstracting: (p28<=1)
states: 24,010,000,001 (10)
abstracting: (p163<=1)
states: 24,010,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p28)
states: 3,430,000,000 (9)
abstracting: (p9<=p19)
states: 21,070,000,001 (10)
abstracting: (p140<=p31)
states: 2,401,000,001 (9)
abstracting: (p172<=p111)
states: 24,010,000,001 (10)
abstracting: (p70<=p181)
states: 24,010,000,001 (10)
.abstracting: (p51<=p51)
states: 24,010,000,001 (10)
abstracting: (1<=p139)
states: 24,010,000,000 (10)
..
EG iterations: 2
abstracting: (p194<=1)
states: 24,010,000,001 (10)
abstracting: (p187<=p195)
states: 24,010,000,001 (10)
abstracting: (p194<=1)
states: 24,010,000,001 (10)
abstracting: (p194<=1)
states: 24,010,000,001 (10)
.
EG iterations: 1
abstracting: (p78<=p30)
states: 21,849,100,001 (10)
abstracting: (p133<=p192)
states: 24,010,000,001 (10)
abstracting: (p194<=1)
states: 24,010,000,001 (10)
abstracting: (p187<=p195)
states: 24,010,000,001 (10)
abstracting: (p194<=1)
states: 24,010,000,001 (10)
abstracting: (p194<=1)
states: 24,010,000,001 (10)
.
EG iterations: 1
abstracting: (p78<=p30)
states: 21,849,100,001 (10)
abstracting: (p133<=p192)
states: 24,010,000,001 (10)
..
EG iterations: 2
-> the formula is FALSE

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

MC time: 0m 4.297sec

checking: [[~ [AF [p181<=1]] & AX [~ [[[[[1<=p130 | p117<=0] | 1<=p75] & [~ [p60<=0] & p18<=p91]] & ~ [AF [1<=p37]]]]]] & E [AG [E [[[1<=p84 & p69<=0] | [p23<=p166 | 1<=p74]] U 1<=p93]] U [p175<=1 | [~ [p76<=p38] | ~ [[p158<=p126 | ~ [EX [p8<=p126]]]]]]]]
normalized: [E [~ [E [true U ~ [E [[[p23<=p166 | 1<=p74] | [1<=p84 & p69<=0]] U 1<=p93]]]] U [p175<=1 | [~ [[p158<=p126 | ~ [EX [p8<=p126]]]] | ~ [p76<=p38]]]] & [~ [EX [[EG [~ [1<=p37]] & [[p18<=p91 & ~ [p60<=0]] & [1<=p75 | [1<=p130 | p117<=0]]]]]] & EG [~ [p181<=1]]]]

abstracting: (p181<=1)
states: 24,010,000,001 (10)
.
EG iterations: 1
abstracting: (p117<=0)
states: 1
abstracting: (1<=p130)
states: 24,010,000,000 (10)
abstracting: (1<=p75)
states: 2,401,000,000 (9)
abstracting: (p60<=0)
states: 21,609,000,001 (10)
abstracting: (p18<=p91)
states: 20,923,000,001 (10)
abstracting: (1<=p37)
states: 2,401,000,000 (9)
.
EG iterations: 1
.abstracting: (p76<=p38)
states: 21,849,100,001 (10)
abstracting: (p8<=p126)
states: 24,010,000,001 (10)
.abstracting: (p158<=p126)
states: 24,010,000,001 (10)
abstracting: (p175<=1)
states: 24,010,000,001 (10)
abstracting: (1<=p93)
states: 2,401,000,000 (9)
abstracting: (p69<=0)
states: 21,609,000,001 (10)
abstracting: (1<=p84)
states: 2,401,000,000 (9)
abstracting: (1<=p74)
states: 2,401,000,000 (9)
abstracting: (p23<=p166)
states: 24,010,000,001 (10)
-> the formula is FALSE

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

MC time: 0m 8.859sec

checking: EF [[E [AF [p65<=1] U [A [~ [p68<=1] U [p195<=p91 | p97<=1]] | A [A [p125<=p36 U 1<=p128] U [p149<=0 & 1<=p74]]]] & [~ [[[~ [p104<=0] & [p23<=p21 | p45<=0]] | [E [p70<=p159 U p109<=p191] & EG [p161<=1]]]] & EX [[[[1<=p176 | 1<=p134] & AG [p0<=1]] & AF [p86<=p64]]]]]]
normalized: E [true U [[EX [[~ [EG [~ [p86<=p64]]] & [~ [E [true U ~ [p0<=1]]] & [1<=p176 | 1<=p134]]]] & ~ [[[EG [p161<=1] & E [p70<=p159 U p109<=p191]] | [[p23<=p21 | p45<=0] & ~ [p104<=0]]]]] & E [~ [EG [~ [p65<=1]]] U [[~ [EG [~ [[p149<=0 & 1<=p74]]]] & ~ [E [~ [[p149<=0 & 1<=p74]] U [~ [[~ [EG [~ [1<=p128]]] & ~ [E [~ [1<=p128] U [~ [p125<=p36] & ~ [1<=p128]]]]]] & ~ [[p149<=0 & 1<=p74]]]]]] | [~ [EG [~ [[p195<=p91 | p97<=1]]]] & ~ [E [~ [[p195<=p91 | p97<=1]] U [p68<=1 & ~ [[p195<=p91 | p97<=1]]]]]]]]]]

abstracting: (p97<=1)
states: 24,010,000,001 (10)
abstracting: (p195<=p91)
states: 2,401,000,001 (9)
abstracting: (p68<=1)
states: 24,010,000,001 (10)
abstracting: (p97<=1)
states: 24,010,000,001 (10)
abstracting: (p195<=p91)
states: 2,401,000,001 (9)
abstracting: (p97<=1)
states: 24,010,000,001 (10)
abstracting: (p195<=p91)
states: 2,401,000,001 (9)
.
EG iterations: 1
abstracting: (1<=p74)
states: 2,401,000,000 (9)
abstracting: (p149<=0)
states: 1
abstracting: (1<=p128)
states: 24,010,000,000 (10)
abstracting: (p125<=p36)
states: 2,401,000,001 (9)
abstracting: (1<=p128)
states: 24,010,000,000 (10)
abstracting: (1<=p128)
states: 24,010,000,000 (10)
..
EG iterations: 2
abstracting: (1<=p74)
states: 2,401,000,000 (9)
abstracting: (p149<=0)
states: 1
abstracting: (1<=p74)
states: 2,401,000,000 (9)
abstracting: (p149<=0)
states: 1

EG iterations: 0
abstracting: (p65<=1)
states: 24,010,000,001 (10)
.
EG iterations: 1
abstracting: (p104<=0)
states: 1
abstracting: (p45<=0)
states: 21,609,000,001 (10)
abstracting: (p23<=p21)
states: 21,070,000,001 (10)
abstracting: (p109<=p191)
states: 24,010,000,001 (10)
abstracting: (p70<=p159)
states: 24,010,000,001 (10)
abstracting: (p161<=1)
states: 24,010,000,001 (10)

EG iterations: 0
abstracting: (1<=p134)
states: 24,010,000,000 (10)
abstracting: (1<=p176)
states: 24,010,000,000 (10)
abstracting: (p0<=1)
states: 24,010,000,001 (10)
abstracting: (p86<=p64)
states: 21,849,100,001 (10)
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.320sec

totally nodes used: 3500037 (3.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 39625156 218423767 258048923
used/not used/entry size/cache size: 64106564 3002300 16 1024MB
basic ops cache: hits/miss/sum: 1497135 4772831 6269966
used/not used/entry size/cache size: 5567594 11209622 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: 99252 535704 634956
used/not used/entry size/cache size: 520042 7868566 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 63740386
1 3243598
2 118607
3 5887
4 367
5 18
6 1
7 0
8 0
9 0
>= 10 0

Total processing time: 1m39.754sec


BK_STOP 1678275131980

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


iterations count:37778 (28), effective:88 (0)

initing FirstDep: 0m 0.007sec


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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