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 FlexibleBarrier-PT-06a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r181-blw3-149581023700025
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495812902341

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: FlexibleBarrier_PT_06a
(NrP: 75 NrTr: 154 NrArc: 599)

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

net check time: 0m 0.000sec

init dd package: 0m 1.006sec


RS generation: 0m 0.060sec


-> reachability set: #nodes 1405 (1.4e+03) #states 2,985,985 (6)



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

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

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

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p5)
states: 248,832 (5)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.149sec

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

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

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[~ [3<=p53] | 2<=p51]]]
normalized: E [true U ~ [[~ [3<=p53] | 2<=p51]]]

abstracting: (2<=p51)
states: 0
abstracting: (3<=p53)
states: 0
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [~ [[1<=p59 & 2<=p6]]]]
normalized: E [true U [1<=p59 & 2<=p6]]

abstracting: (2<=p6)
states: 0
abstracting: (1<=p59)
states: 248,832 (5)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [~ [[1<=p73 | p23<=p29]]]]
normalized: ~ [E [true U ~ [[1<=p73 | p23<=p29]]]]

abstracting: (p23<=p29)
states: 2,757,889 (6)
abstracting: (1<=p73)
states: 2,985,984 (6)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [~ [[3<=p34 & p60<=p14]]]]
normalized: E [true U [3<=p34 & p60<=p14]]

abstracting: (p60<=p14)
states: 2,757,889 (6)
abstracting: (3<=p34)
states: 0
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [p15<=p11] & p49<=p1]]
normalized: E [true U [p49<=p1 & ~ [p15<=p11]]]

abstracting: (p15<=p11)
states: 2,757,889 (6)
abstracting: (p49<=p1)
states: 2,757,889 (6)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.081sec

checking: AG [[[p5<=p13 | ~ [p7<=p6]] & ~ [2<=p10]]]
normalized: ~ [E [true U ~ [[~ [2<=p10] & [p5<=p13 | ~ [p7<=p6]]]]]]

abstracting: (p7<=p6)
states: 2,737,153 (6)
abstracting: (p5<=p13)
states: 2,757,889 (6)
abstracting: (2<=p10)
states: 0
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [~ [[[2<=p31 & 1<=p15] | [p40<=p34 | 1<=p46]]]]
normalized: E [true U ~ [[[2<=p31 & 1<=p15] | [p40<=p34 | 1<=p46]]]]

abstracting: (1<=p46)
states: 248,832 (5)
abstracting: (p40<=p34)
states: 2,757,889 (6)
abstracting: (1<=p15)
states: 248,832 (5)
abstracting: (2<=p31)
states: 0
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.060sec

checking: AG [[~ [[3<=p47 & p11<=p50]] | p72<=p45]]
normalized: ~ [E [true U ~ [[p72<=p45 | ~ [[3<=p47 & p11<=p50]]]]]]

abstracting: (p11<=p50)
states: 2,757,889 (6)
abstracting: (3<=p47)
states: 0
abstracting: (p72<=p45)
states: 2,757,889 (6)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[3<=p8 & p64<=p51] & [2<=p33 & 1<=p67]] | ~ [~ [p63<=p38]]]]
normalized: ~ [E [true U ~ [[p63<=p38 | [[2<=p33 & 1<=p67] & [3<=p8 & p64<=p51]]]]]]

abstracting: (p64<=p51)
states: 2,757,889 (6)
abstracting: (3<=p8)
states: 0
abstracting: (1<=p67)
states: 248,832 (5)
abstracting: (2<=p33)
states: 0
abstracting: (p63<=p38)
states: 2,757,889 (6)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: AG [[[~ [1<=p67] & [p41<=p47 | 3<=p58]] | [p8<=p0 & p22<=p3]]]
normalized: ~ [E [true U ~ [[[~ [1<=p67] & [p41<=p47 | 3<=p58]] | [p8<=p0 & p22<=p3]]]]]

abstracting: (p22<=p3)
states: 2,757,889 (6)
abstracting: (p8<=p0)
states: 2,737,153 (6)
abstracting: (3<=p58)
states: 0
abstracting: (p41<=p47)
states: 2,737,153 (6)
abstracting: (1<=p67)
states: 248,832 (5)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.184sec

checking: AG [[[[3<=p26 & p57<=p47] | [p65<=p35 | p13<=p43]] & ~ [[2<=p67 | 2<=p69]]]]
normalized: ~ [E [true U ~ [[~ [[2<=p67 | 2<=p69]] & [[p65<=p35 | p13<=p43] | [3<=p26 & p57<=p47]]]]]]

abstracting: (p57<=p47)
states: 2,757,889 (6)
abstracting: (3<=p26)
states: 0
abstracting: (p13<=p43)
states: 2,757,889 (6)
abstracting: (p65<=p35)
states: 2,757,889 (6)
abstracting: (2<=p69)
states: 0
abstracting: (2<=p67)
states: 0
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.057sec

checking: AG [[[[2<=p33 | p43<=p69] | [p61<=p41 & p15<=p41]] & p15<=p53]]
normalized: ~ [E [true U ~ [[p15<=p53 & [[2<=p33 | p43<=p69] | [p61<=p41 & p15<=p41]]]]]]

abstracting: (p15<=p41)
states: 2,757,889 (6)
abstracting: (p61<=p41)
states: 2,757,889 (6)
abstracting: (p43<=p69)
states: 2,757,889 (6)
abstracting: (2<=p33)
states: 0
abstracting: (p15<=p53)
states: 2,757,889 (6)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.111sec

totally nodes used: 1069213(1.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1101306 1410204 2511510
used/not used/entry size/cache size: 1310150 65798714 16 1024MB
basic ops cache: hits/miss/sum: 1135542 1539737 2675279
used/not used/entry size/cache size: 3102640 13674576 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: 13089 14144 27233
used/not used/entry size/cache size: 14101 2083051 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 66047973
1 1052611
2 8238
3 42
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 2.309sec


BK_STOP 1495812904675

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


iterations count:2968 (19), effective:122 (0)

initing FirstDep: 0m 0.000sec


iterations count:853 (5), effective:23 (0)

iterations count:890 (5), effective:29 (0)

iterations count:854 (5), effective:24 (0)

iterations count:931 (6), effective:24 (0)

iterations count:584 (3), effective:13 (0)

iterations count:1275 (8), effective:40 (0)

iterations count:1148 (7), effective:36 (0)

iterations count:1185 (7), effective:40 (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="FlexibleBarrier-PT-06a"
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/FlexibleBarrier-PT-06a.tgz
mv FlexibleBarrier-PT-06a 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 FlexibleBarrier-PT-06a, 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 r181-blw3-149581023700025"
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 ;