Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool marcie
Input is DLCround-PT-10a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r171-csrt-149580951700331
=====================================================================

--------------------
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-10a-ReachabilityCardinality-0
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-1
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-15
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-2
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-3
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-4
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-5
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-6
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-7
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-8
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1495824521592

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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: marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6

parse successfull
net created successfully

Net: DLCround_PT_10a
(NrP: 337 NrTr: 2605 NrArc: 10130)

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

net check time: 0m 0.001sec

init dd package: 0m 1.347sec


after gc: zbdd nodes used:770286, unused:17979714
RS generation: 3m17.541sec


-> reachability set: #nodes 772529 (7.7e+05) #states 240,100,000,000,001 (14)



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

checking: AG [~ [2<=p71]]
normalized: ~ [E [true U 2<=p71]]

abstracting: (2<=p71)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.269sec

checking: EF [3<=p331]
normalized: E [true U 3<=p331]

abstracting: (3<=p331)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-10a-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [p89<=p243]]
normalized: E [true U ~ [p89<=p243]]

abstracting: (p89<=p243)
states: 240,100,000,000,001 (14)
-> the formula is FALSE

FORMULA DLCround-PT-10a-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: EF [[2<=p78 & 1<=p264]]
normalized: E [true U [2<=p78 & 1<=p264]]

abstracting: (1<=p264)
states: 240,100,000,000,000 (14)
abstracting: (2<=p78)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-10a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[~ [p324<=p244] & 3<=p318]]
normalized: E [true U [3<=p318 & ~ [p324<=p244]]]

abstracting: (p324<=p244)
states: 240,100,000,000,001 (14)
abstracting: (3<=p318)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-10a-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.055sec

checking: EF [[~ [~ [p60<=p169]] & ~ [~ [3<=p300]]]]
normalized: E [true U [p60<=p169 & 3<=p300]]

abstracting: (3<=p300)
states: 0
abstracting: (p60<=p169)
states: 240,100,000,000,001 (14)
-> the formula is FALSE

FORMULA DLCround-PT-10a-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[1<=p52 | ~ [~ [p41<=p325]]]]
normalized: ~ [E [true U ~ [[1<=p52 | p41<=p325]]]]

abstracting: (p41<=p325)
states: 240,100,000,000,001 (14)
abstracting: (1<=p52)
states: 24,010,000,000,000 (13)
-> the formula is TRUE

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

MC time: 0m 0.041sec

checking: AG [[p271<=p310 | [3<=p200 & ~ [p173<=p143]]]]
normalized: ~ [E [true U ~ [[p271<=p310 | [3<=p200 & ~ [p173<=p143]]]]]]

abstracting: (p173<=p143)
states: 240,100,000,000,001 (14)
abstracting: (3<=p200)
states: 0
abstracting: (p271<=p310)
states: 240,100,000,000,001 (14)
-> the formula is TRUE

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

MC time: 0m 0.249sec

checking: EF [[p108<=p22 & [1<=p8 & ~ [p116<=p61]]]]
normalized: E [true U [p108<=p22 & [1<=p8 & ~ [p116<=p61]]]]

abstracting: (p116<=p61)
states: 218,491,000,000,001 (14)
abstracting: (1<=p8)
states: 34,300,000,000,000 (13)
abstracting: (p108<=p22)
states: 219,520,000,000,001 (14)

after gc: zbdd nodes used:859118, unused:36640882
after gc: zbdd nodes used:860237, unused:74139763-> the formula is TRUE

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

MC time: 4m 7.891sec

checking: EF [~ [[[p133<=p225 | p259<=p284] | p210<=p336]]]
normalized: E [true U ~ [[p210<=p336 | [p133<=p225 | p259<=p284]]]]

abstracting: (p259<=p284)
states: 240,100,000,000,001 (14)
abstracting: (p133<=p225)
states: 240,100,000,000,001 (14)
abstracting: (p210<=p336)
states: 240,100,000,000,001 (14)
-> the formula is FALSE

FORMULA DLCround-PT-10a-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.590sec

checking: AG [[[[2<=p40 & p13<=p84] & p163<=p96] | ~ [~ [p33<=p213]]]]
normalized: ~ [E [true U ~ [[p33<=p213 | [p163<=p96 & [2<=p40 & p13<=p84]]]]]]

abstracting: (p13<=p84)
states: 209,230,000,000,001 (14)
abstracting: (2<=p40)
states: 0
abstracting: (p163<=p96)
states: 24,010,000,000,001 (13)
abstracting: (p33<=p213)
states: 240,100,000,000,001 (14)
-> the formula is TRUE

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

MC time: 0m 0.605sec

checking: AG [[[~ [2<=p78] | [1<=p59 | 3<=p181]] | [p272<=p300 & ~ [p240<=p203]]]]
normalized: ~ [E [true U ~ [[[p272<=p300 & ~ [p240<=p203]] | [[1<=p59 | 3<=p181] | ~ [2<=p78]]]]]]

abstracting: (2<=p78)
states: 0
abstracting: (3<=p181)
states: 0
abstracting: (1<=p59)
states: 24,010,000,000,000 (13)
abstracting: (p240<=p203)
states: 240,100,000,000,001 (14)
abstracting: (p272<=p300)
states: 240,100,000,000,001 (14)
-> the formula is TRUE

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

MC time: 0m 0.348sec

checking: AG [~ [[[p295<=p160 & 2<=p55] & [p19<=p184 & p65<=p165]]]]
normalized: ~ [E [true U [[p19<=p184 & p65<=p165] & [p295<=p160 & 2<=p55]]]]

abstracting: (2<=p55)
states: 0
abstracting: (p295<=p160)
states: 240,100,000,000,001 (14)
abstracting: (p65<=p165)
states: 240,100,000,000,001 (14)
abstracting: (p19<=p184)
states: 240,100,000,000,001 (14)
-> the formula is TRUE

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

MC time: 0m 0.135sec

checking: AG [[~ [2<=p35] | [[p270<=p64 & p297<=p150] | [p128<=p93 | p166<=p274]]]]
normalized: ~ [E [true U ~ [[[[p128<=p93 | p166<=p274] | [p270<=p64 & p297<=p150]] | ~ [2<=p35]]]]]

abstracting: (2<=p35)
states: 0
abstracting: (p297<=p150)
states: 240,100,000,000,001 (14)
abstracting: (p270<=p64)
states: 24,010,000,000,001 (13)
abstracting: (p166<=p274)
states: 240,100,000,000,001 (14)
abstracting: (p128<=p93)
states: 218,491,000,000,001 (14)
-> the formula is TRUE

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

MC time: 0m 0.397sec

checking: AG [[~ [[2<=p198 & 1<=p18]] | [[3<=p122 & p301<=p73] | [p85<=p201 | p16<=p198]]]]
normalized: ~ [E [true U ~ [[[[3<=p122 & p301<=p73] | [p85<=p201 | p16<=p198]] | ~ [[2<=p198 & 1<=p18]]]]]]

abstracting: (1<=p18)
states: 34,300,000,000,000 (13)
abstracting: (2<=p198)
states: 0
abstracting: (p16<=p198)
states: 240,100,000,000,001 (14)
abstracting: (p85<=p201)
states: 240,100,000,000,001 (14)
abstracting: (p301<=p73)
states: 24,010,000,000,001 (13)
abstracting: (3<=p122)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.105sec

checking: AG [[[~ [2<=p253] | [p296<=p165 | p336<=p0]] & [[p259<=p92 | p51<=p303] | [p277<=p270 & 2<=p135]]]]
normalized: ~ [E [true U ~ [[[[p277<=p270 & 2<=p135] | [p259<=p92 | p51<=p303]] & [[p296<=p165 | p336<=p0] | ~ [2<=p253]]]]]]

abstracting: (2<=p253)
states: 0
abstracting: (p336<=p0)
states: 1
abstracting: (p296<=p165)
states: 240,100,000,000,001 (14)
abstracting: (p51<=p303)
states: 240,100,000,000,001 (14)
abstracting: (p259<=p92)
states: 24,010,000,000,001 (13)
abstracting: (2<=p135)
states: 0
abstracting: (p277<=p270)
states: 240,100,000,000,001 (14)
-> the formula is TRUE

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

MC time: 0m 0.123sec

totally nodes used: 119378668(1.2e+08)
number of garbage collections: 3
fire ops cache: hits/miss/sum: 284816694 1659429391 1944246085
used/not used/entry size/cache size: 67033794 75070 16 1024MB
basic ops cache: hits/miss/sum: 28780742 172613790 201394532
used/not used/entry size/cache size: 16764122 13094 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 417372 2073554 2490926
used/not used/entry size/cache size: 926262 1170890 32 64MB
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 28907887
1 24464179
2 10235612
3 2818324
4 576704
5 92514
6 12098
7 1416
8 122
9 8
>= 10 0

Total processing time: 7m32.300sec


BK_STOP 1495824973925

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

771574
iterations count:112088 (43), effective:124 (0)

initing FirstDep: 0m 0.034sec


iterations count:18335 (7), effective:23 (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-10a"
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"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-10a.tgz
mv DLCround-PT-10a execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is DLCround-PT-10a, 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 r171-csrt-149580951700331"
echo "====================================================================="
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
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 ;