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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 7.4K Feb 25 19:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 19:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 18:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 18:59 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:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 19:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 19:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 19:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 19:18 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 398K 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-07a-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-07a-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-07a-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-07a-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-07a-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-07a-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-07a-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-07a-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-07a-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-07a-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-07a-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-07a-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-07a-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-07a-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-07a-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-07a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678276085732

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-07a
Not applying reductions.
Model is PT
ReachabilityCardinality 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DLCround_PT_07a
(NrP: 229 NrTr: 1597 NrArc: 6125)

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

net check time: 0m 0.001sec

init dd package: 0m 2.818sec


RS generation: 0m18.439sec


-> reachability set: #nodes 127851 (1.3e+05) #states 240,100,000,001 (11)



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

checking: EF [1<=p64]
normalized: E [true U 1<=p64]

abstracting: (1<=p64)
states: 24,010,000,000 (10)
-> the formula is TRUE

FORMULA DLCround-PT-07a-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.583sec

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

abstracting: (p77<=1)
states: 240,100,000,001 (11)
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

abstracting: (p124<=1)
states: 240,100,000,001 (11)
-> the formula is TRUE

FORMULA DLCround-PT-07a-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

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

abstracting: (p119<=1)
states: 240,100,000,001 (11)
-> the formula is TRUE

FORMULA DLCround-PT-07a-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

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

abstracting: (p24<=1)
states: 240,100,000,001 (11)
-> the formula is TRUE

FORMULA DLCround-PT-07a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [p153<=p207]
normalized: ~ [E [true U ~ [p153<=p207]]]

abstracting: (p153<=p207)
states: 240,100,000,001 (11)
-> the formula is TRUE

FORMULA DLCround-PT-07a-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.057sec

checking: AG [p177<=p144]
normalized: ~ [E [true U ~ [p177<=p144]]]

abstracting: (p177<=p144)
states: 240,100,000,001 (11)
-> the formula is TRUE

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

MC time: 0m 0.032sec

checking: EF [~ [[p211<=0 | p128<=1]]]
normalized: E [true U ~ [[p211<=0 | p128<=1]]]

abstracting: (p128<=1)
states: 240,100,000,001 (11)
abstracting: (p211<=0)
states: 1
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: AG [p169<=p218]
normalized: ~ [E [true U ~ [p169<=p218]]]

abstracting: (p169<=p218)
states: 240,100,000,001 (11)
-> the formula is TRUE

FORMULA DLCround-PT-07a-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.053sec

checking: AG [[1<=p55 | p150<=1]]
normalized: ~ [E [true U ~ [[1<=p55 | p150<=1]]]]

abstracting: (p150<=1)
states: 240,100,000,001 (11)
abstracting: (1<=p55)
states: 24,010,000,000 (10)
-> the formula is TRUE

FORMULA DLCround-PT-07a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: AG [p213<=p192]
normalized: ~ [E [true U ~ [p213<=p192]]]

abstracting: (p213<=p192)
states: 240,100,000,001 (11)
-> the formula is TRUE

FORMULA DLCround-PT-07a-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[~ [[[1<=p148 & p220<=p49] & ~ [[[~ [p222<=p200] | ~ [[p9<=p49 & p90<=1]]] | ~ [[1<=p104 | ~ [1<=p157]]]]]]] | 1<=p217]]
normalized: ~ [E [true U ~ [[1<=p217 | ~ [[~ [[~ [[1<=p104 | ~ [1<=p157]]] | [~ [[p9<=p49 & p90<=1]] | ~ [p222<=p200]]]] & [1<=p148 & p220<=p49]]]]]]]

abstracting: (p220<=p49)
states: 24,010,000,001 (10)
abstracting: (1<=p148)
states: 240,100,000,000 (11)
abstracting: (p222<=p200)
states: 240,100,000,001 (11)
abstracting: (p90<=1)
states: 240,100,000,001 (11)
abstracting: (p9<=p49)
states: 209,230,000,001 (11)
abstracting: (1<=p157)
states: 240,100,000,000 (11)
abstracting: (1<=p104)
states: 24,010,000,000 (10)
abstracting: (1<=p217)
states: 240,100,000,000 (11)
-> the formula is TRUE

FORMULA DLCround-PT-07a-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: AG [[p190<=1 | [~ [[[~ [p201<=p225] | 1<=p80] | p89<=p61]] & [[[p182<=p73 | ~ [[p227<=0 & [[p189<=1 | 1<=p169] | 1<=p108]]]] & [1<=p161 | 1<=p16]] & [p228<=p28 & 1<=p166]]]]]
normalized: ~ [E [true U ~ [[p190<=1 | [[[p228<=p28 & 1<=p166] & [[1<=p161 | 1<=p16] & [p182<=p73 | ~ [[p227<=0 & [1<=p108 | [p189<=1 | 1<=p169]]]]]]] & ~ [[p89<=p61 | [1<=p80 | ~ [p201<=p225]]]]]]]]]

abstracting: (p201<=p225)
states: 240,100,000,001 (11)
abstracting: (1<=p80)
states: 24,010,000,000 (10)
abstracting: (p89<=p61)
states: 218,491,000,001 (11)
abstracting: (1<=p169)
states: 240,100,000,000 (11)
abstracting: (p189<=1)
states: 240,100,000,001 (11)
abstracting: (1<=p108)
states: 24,010,000,000 (10)
abstracting: (p227<=0)
states: 1
abstracting: (p182<=p73)
states: 24,010,000,001 (10)
abstracting: (1<=p16)
states: 34,300,000,000 (10)
abstracting: (1<=p161)
states: 240,100,000,000 (11)
abstracting: (1<=p166)
states: 240,100,000,000 (11)
abstracting: (p228<=p28)
states: 34,300,000,001 (10)
abstracting: (p190<=1)
states: 240,100,000,001 (11)
-> the formula is TRUE

FORMULA DLCround-PT-07a-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.416sec

checking: AG [~ [[[~ [[[p19<=0 | [~ [p149<=p226] & p33<=p17]] & [[[p67<=p79 & 1<=p188] & [p174<=p133 | p125<=0]] | [[1<=p172 | p178<=p84] | [1<=p67 & 1<=p20]]]]] | p85<=0] & ~ [p213<=1]]]]
normalized: ~ [E [true U [~ [p213<=1] & [p85<=0 | ~ [[[[[1<=p67 & 1<=p20] | [1<=p172 | p178<=p84]] | [[p174<=p133 | p125<=0] & [p67<=p79 & 1<=p188]]] & [p19<=0 | [p33<=p17 & ~ [p149<=p226]]]]]]]]]

abstracting: (p149<=p226)
states: 240,100,000,001 (11)
abstracting: (p33<=p17)
states: 219,520,000,001 (11)
abstracting: (p19<=0)
states: 205,800,000,001 (11)
abstracting: (1<=p188)
states: 240,100,000,000 (11)
abstracting: (p67<=p79)
states: 218,491,000,001 (11)
abstracting: (p125<=0)
states: 1
abstracting: (p174<=p133)
states: 240,100,000,001 (11)
abstracting: (p178<=p84)
states: 24,010,000,001 (10)
abstracting: (1<=p172)
states: 240,100,000,000 (11)
abstracting: (1<=p20)
states: 34,300,000,000 (10)
abstracting: (1<=p67)
states: 24,010,000,000 (10)
abstracting: (p85<=0)
states: 216,090,000,001 (11)
abstracting: (p213<=1)
states: 240,100,000,001 (11)
-> the formula is TRUE

FORMULA DLCround-PT-07a-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.621sec

checking: EF [[[~ [[[1<=p168 | ~ [1<=p7]] | p7<=p16]] | ~ [[~ [1<=p166] | [~ [[p25<=p125 | p85<=p166]] | 1<=p89]]]] & [[~ [[p34<=1 | 1<=p113]] | ~ [p93<=p201]] & [~ [p106<=p17] & [[[[[~ [p78<=0] | [p218<=0 | p171<=p186]] & ~ [[p211<=0 & p3<=p195]]] & [p124<=1 & p78<=1]] | [[~ [p14<=1] & ~ [1<=p167]] & p44<=p224]] | ~ [[~ [[p8<=1 & ~ [p36<=0]]] | [p9<=p45 & [p206<=1 & ~ [p196<=1]]]]]]]]]]
normalized: E [true U [[[[~ [[[p9<=p45 & [p206<=1 & ~ [p196<=1]]] | ~ [[p8<=1 & ~ [p36<=0]]]]] | [[p44<=p224 & [~ [1<=p167] & ~ [p14<=1]]] | [[p124<=1 & p78<=1] & [~ [[p211<=0 & p3<=p195]] & [[p218<=0 | p171<=p186] | ~ [p78<=0]]]]]] & ~ [p106<=p17]] & [~ [p93<=p201] | ~ [[p34<=1 | 1<=p113]]]] & [~ [[[1<=p89 | ~ [[p25<=p125 | p85<=p166]]] | ~ [1<=p166]]] | ~ [[p7<=p16 | [1<=p168 | ~ [1<=p7]]]]]]]

abstracting: (1<=p7)
states: 34,300,000,000 (10)
abstracting: (1<=p168)
states: 240,100,000,000 (11)
abstracting: (p7<=p16)
states: 210,700,000,001 (11)
abstracting: (1<=p166)
states: 240,100,000,000 (11)
abstracting: (p85<=p166)
states: 240,100,000,001 (11)
abstracting: (p25<=p125)
states: 240,100,000,001 (11)
abstracting: (1<=p89)
states: 24,010,000,000 (10)
abstracting: (1<=p113)
states: 240,100,000,000 (11)
abstracting: (p34<=1)
states: 240,100,000,001 (11)
abstracting: (p93<=p201)
states: 240,100,000,001 (11)
abstracting: (p106<=p17)
states: 219,520,000,001 (11)
abstracting: (p78<=0)
states: 216,090,000,001 (11)
abstracting: (p171<=p186)
states: 240,100,000,001 (11)
abstracting: (p218<=0)
states: 1
abstracting: (p3<=p195)
states: 240,100,000,001 (11)
abstracting: (p211<=0)
states: 1
abstracting: (p78<=1)
states: 240,100,000,001 (11)
abstracting: (p124<=1)
states: 240,100,000,001 (11)
abstracting: (p14<=1)
states: 240,100,000,001 (11)
abstracting: (1<=p167)
states: 240,100,000,000 (11)
abstracting: (p44<=p224)
states: 240,100,000,001 (11)
abstracting: (p36<=0)
states: 216,090,000,001 (11)
abstracting: (p8<=1)
states: 240,100,000,001 (11)
abstracting: (p196<=1)
states: 240,100,000,001 (11)
abstracting: (p206<=1)
states: 240,100,000,001 (11)
abstracting: (p9<=p45)
states: 209,230,000,001 (11)
-> the formula is FALSE

FORMULA DLCround-PT-07a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.952sec

checking: AG [[[[p0<=1 | ~ [[[[1<=p9 | p179<=p151] | p54<=p68] & [~ [[p168<=1 & p200<=0]] | [~ [1<=p32] | ~ [p32<=1]]]]]] | [[~ [[~ [p223<=p74] & [~ [p85<=1] & [1<=p123 & p198<=p88]]]] | [~ [[~ [1<=p39] & ~ [[1<=p41 | 1<=p203]]]] & p55<=0]] & 1<=p99]] & [~ [[[1<=p103 & [[[[p53<=0 | p187<=1] & p148<=1] & [[p109<=0 | p97<=0] | 1<=p180]] & [~ [1<=p133] & ~ [[1<=p223 | p142<=p37]]]]] & ~ [[1<=p187 & [p81<=p224 & 1<=p113]]]]] | [[p164<=0 | [[~ [1<=p210] & [~ [[p182<=p73 | 1<=p130]] | [[1<=p201 | 1<=p129] & ~ [p23<=p121]]]] | ~ [[~ [1<=p162] & [~ [p195<=1] | ~ [p100<=1]]]]]] & ~ [1<=p96]]]]]
normalized: ~ [E [true U ~ [[[[~ [1<=p96] & [p164<=0 | [~ [[[~ [p100<=1] | ~ [p195<=1]] & ~ [1<=p162]]] | [[[~ [p23<=p121] & [1<=p201 | 1<=p129]] | ~ [[p182<=p73 | 1<=p130]]] & ~ [1<=p210]]]]] | ~ [[~ [[1<=p187 & [p81<=p224 & 1<=p113]]] & [1<=p103 & [[~ [[1<=p223 | p142<=p37]] & ~ [1<=p133]] & [[1<=p180 | [p109<=0 | p97<=0]] & [p148<=1 & [p53<=0 | p187<=1]]]]]]]] & [[1<=p99 & [[p55<=0 & ~ [[~ [[1<=p41 | 1<=p203]] & ~ [1<=p39]]]] | ~ [[[[1<=p123 & p198<=p88] & ~ [p85<=1]] & ~ [p223<=p74]]]]] | [p0<=1 | ~ [[[[~ [p32<=1] | ~ [1<=p32]] | ~ [[p168<=1 & p200<=0]]] & [p54<=p68 | [1<=p9 | p179<=p151]]]]]]]]]]

abstracting: (p179<=p151)
states: 240,100,000,001 (11)
abstracting: (1<=p9)
states: 34,300,000,000 (10)
abstracting: (p54<=p68)
states: 218,491,000,001 (11)
abstracting: (p200<=0)
states: 1
abstracting: (p168<=1)
states: 240,100,000,001 (11)
abstracting: (1<=p32)
states: 24,010,000,000 (10)
abstracting: (p32<=1)
states: 240,100,000,001 (11)
abstracting: (p0<=1)
states: 240,100,000,001 (11)
abstracting: (p223<=p74)
states: 24,010,000,001 (10)
abstracting: (p85<=1)
states: 240,100,000,001 (11)
abstracting: (p198<=p88)
states: 24,010,000,001 (10)
abstracting: (1<=p123)
states: 240,100,000,000 (11)
abstracting: (1<=p39)
states: 24,010,000,000 (10)
abstracting: (1<=p203)
states: 240,100,000,000 (11)
abstracting: (1<=p41)
states: 24,010,000,000 (10)
abstracting: (p55<=0)
states: 216,090,000,001 (11)
abstracting: (1<=p99)
states: 24,010,000,000 (10)
abstracting: (p187<=1)
states: 240,100,000,001 (11)
abstracting: (p53<=0)
states: 216,090,000,001 (11)
abstracting: (p148<=1)
states: 240,100,000,001 (11)
abstracting: (p97<=0)
states: 216,090,000,001 (11)
abstracting: (p109<=0)
states: 1
abstracting: (1<=p180)
states: 240,100,000,000 (11)
abstracting: (1<=p133)
states: 240,100,000,000 (11)
abstracting: (p142<=p37)
states: 24,010,000,001 (10)
abstracting: (1<=p223)
states: 240,100,000,000 (11)
abstracting: (1<=p103)
states: 24,010,000,000 (10)
abstracting: (1<=p113)
states: 240,100,000,000 (11)
abstracting: (p81<=p224)
states: 240,100,000,001 (11)
abstracting: (1<=p187)
states: 240,100,000,000 (11)
abstracting: (1<=p210)
states: 240,100,000,000 (11)
abstracting: (1<=p130)
states: 240,100,000,000 (11)
abstracting: (p182<=p73)
states: 24,010,000,001 (10)
abstracting: (1<=p129)
states: 240,100,000,000 (11)
abstracting: (1<=p201)
states: 240,100,000,000 (11)
abstracting: (p23<=p121)
states: 240,100,000,001 (11)
abstracting: (1<=p162)
states: 240,100,000,000 (11)
abstracting: (p195<=1)
states: 240,100,000,001 (11)
abstracting: (p100<=1)
states: 240,100,000,001 (11)
abstracting: (p164<=0)
states: 1
abstracting: (1<=p96)
states: 24,010,000,000 (10)
-> the formula is TRUE

FORMULA DLCround-PT-07a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.091sec

totally nodes used: 1274912 (1.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 16264463 95578245 111842708
used/not used/entry size/cache size: 50201505 16907359 16 1024MB
basic ops cache: hits/miss/sum: 873205 5158745 6031950
used/not used/entry size/cache size: 5871423 10905793 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: 169385 895158 1064543
used/not used/entry size/cache size: 851551 7537057 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 65857363
1 1228993
2 21642
3 831
4 33
5 2
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m49.376sec


BK_STOP 1678276135155

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


iterations count:52246 (32), effective:97 (0)

initing FirstDep: 0m 0.009sec


iterations count:5739 (3), effective:10 (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-07a"
export BK_EXAMINATION="ReachabilityCardinality"
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-07a, examination is ReachabilityCardinality"
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-167814469900686"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-07a.tgz
mv DLCround-PT-07a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;