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-2979
Executing tool marcie
Input is S_Eratosthenes-PT-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r149kn-smll-146416259300610
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464438098301


Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: Eratosthenes_PT_100
(NrP: 99 NrTr: 283 NrArc: 849)

net check time: 0m 0.000sec

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

init dd package: 0m 3.821sec


RS generation: 0m 0.042sec


-> reachability set: #nodes 99 (9.9e+01) #states 18,889,465,931,478,580,854,784 (22)



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

checking: EF [2<=p33]
normalized: E [true U 2<=p33]

abstracting: (2<=p33) states: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [p70<=p7]]
normalized: E [true U ~ [p70<=p7]]

abstracting: (p70<=p7) states: 18,889,465,931,478,580,854,784 (22)
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [~ [~ [p6<=p43]]]]
normalized: E [true U ~ [p6<=p43]]

abstracting: (p6<=p43) states: 18,889,465,931,478,580,854,784 (22)
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [~ [[3<=p87 & 3<=p80]]]]
normalized: E [true U [3<=p87 & 3<=p80]]

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

FORMULA Eratosthenes-PT-100-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[1<=p52 & 2<=p73]]
normalized: E [true U [1<=p52 & 2<=p73]]

abstracting: (2<=p73) states: 0
abstracting: (1<=p52) states: 9,444,732,965,739,290,427,392 (21)
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p6) states: 9,444,732,965,739,290,427,392 (21)
abstracting: (p28<=p88) states: 14,167,099,448,608,935,641,088 (22)
abstracting: (2<=p6) states: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [[2<=p70 & p38<=p92]] & 1<=p97]]
normalized: ~ [E [true U ~ [[1<=p97 & ~ [[2<=p70 & p38<=p92]]]]]]

abstracting: (p38<=p92) states: 14,167,099,448,608,935,641,088 (22)
abstracting: (2<=p70) states: 0
abstracting: (1<=p97) states: 18,889,465,931,478,580,854,784 (22)
-> the formula is TRUE

FORMULA Eratosthenes-PT-100-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[p97<=p71 & 2<=p99] & p75<=p69]]
normalized: E [true U [p75<=p69 & [p97<=p71 & 2<=p99]]]

abstracting: (2<=p99) states: 0
abstracting: (p97<=p71) states: 18,889,465,931,478,580,854,784 (22)
abstracting: (p75<=p69) states: 14,167,099,448,608,935,641,088 (22)
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[~ [p75<=p96] | p24<=p54] | 1<=p26]]
normalized: ~ [E [true U ~ [[1<=p26 | [p24<=p54 | ~ [p75<=p96]]]]]]

abstracting: (p75<=p96) states: 14,167,099,448,608,935,641,088 (22)
abstracting: (p24<=p54) states: 14,167,099,448,608,935,641,088 (22)
abstracting: (1<=p26) states: 9,444,732,965,739,290,427,392 (21)
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: AG [[[[2<=p6 | p6<=p5] & 3<=p20] | ~ [[3<=p80 | 3<=p79]]]]
normalized: ~ [E [true U ~ [[~ [[3<=p80 | 3<=p79]] | [3<=p20 & [2<=p6 | p6<=p5]]]]]]

abstracting: (p6<=p5) states: 18,889,465,931,478,580,854,784 (22)
abstracting: (2<=p6) states: 0
abstracting: (3<=p20) states: 0
abstracting: (3<=p79) states: 0
abstracting: (3<=p80) states: 0
-> the formula is TRUE

FORMULA Eratosthenes-PT-100-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[p25<=p49 | [p15<=p42 | p5<=p7]]]]
normalized: E [true U ~ [[p25<=p49 | [p15<=p42 | p5<=p7]]]]

abstracting: (p5<=p7) states: 18,889,465,931,478,580,854,784 (22)
abstracting: (p15<=p42) states: 14,167,099,448,608,935,641,088 (22)
abstracting: (p25<=p49) states: 14,167,099,448,608,935,641,088 (22)
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [[1<=p33 & 2<=p73]] | [[2<=p59 | p17<=p76] | [3<=p71 | 3<=p23]]]]
normalized: ~ [E [true U ~ [[[[3<=p71 | 3<=p23] | [2<=p59 | p17<=p76]] | ~ [[1<=p33 & 2<=p73]]]]]]

abstracting: (2<=p73) states: 0
abstracting: (1<=p33) states: 9,444,732,965,739,290,427,392 (21)
abstracting: (p17<=p76) states: 9,444,732,965,739,290,427,392 (21)
abstracting: (2<=p59) states: 0
abstracting: (3<=p23) states: 0
abstracting: (3<=p71) states: 0
-> the formula is TRUE

FORMULA Eratosthenes-PT-100-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[p99<=p77 | p76<=p54]] & [p61<=p12 | ~ [p52<=p33]]]]
normalized: E [true U [[p61<=p12 | ~ [p52<=p33]] & ~ [[p99<=p77 | p76<=p54]]]]

abstracting: (p76<=p54) states: 14,167,099,448,608,935,641,088 (22)
abstracting: (p99<=p77) states: 14,167,099,448,608,935,641,088 (22)
abstracting: (p52<=p33) states: 14,167,099,448,608,935,641,088 (22)
abstracting: (p61<=p12) states: 9,444,732,965,739,290,427,392 (21)
-> the formula is TRUE

FORMULA Eratosthenes-PT-100-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: EF [[[p35<=p55 | [p56<=p94 | 3<=p6]] & ~ [[p35<=p18 | p97<=p30]]]]
normalized: E [true U [~ [[p35<=p18 | p97<=p30]] & [p35<=p55 | [p56<=p94 | 3<=p6]]]]

abstracting: (3<=p6) states: 0
abstracting: (p56<=p94) states: 14,167,099,448,608,935,641,088 (22)
abstracting: (p35<=p55) states: 14,167,099,448,608,935,641,088 (22)
abstracting: (p97<=p30) states: 9,444,732,965,739,290,427,392 (21)
abstracting: (p35<=p18) states: 14,167,099,448,608,935,641,088 (22)
-> the formula is TRUE

FORMULA Eratosthenes-PT-100-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: EF [[[[p26<=p90 & p95<=p2] & [1<=p7 & 2<=p45]] & [~ [p59<=p52] & [2<=p11 & 2<=p47]]]]
normalized: E [true U [[[2<=p11 & 2<=p47] & ~ [p59<=p52]] & [[1<=p7 & 2<=p45] & [p26<=p90 & p95<=p2]]]]

abstracting: (p95<=p2) states: 18,889,465,931,478,580,854,784 (22)
abstracting: (p26<=p90) states: 14,167,099,448,608,935,641,088 (22)
abstracting: (2<=p45) states: 0
abstracting: (1<=p7) states: 18,889,465,931,478,580,854,784 (22)
abstracting: (p59<=p52) states: 9,444,732,965,739,290,427,392 (21)
abstracting: (2<=p47) states: 0
abstracting: (2<=p11) states: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[[p84<=p10 | p67<=p87] & [p100<=p20 & p8<=p8]] & ~ [p64<=p73]]]
normalized: E [true U [[[p84<=p10 | p67<=p87] & [p100<=p20 & p8<=p8]] & ~ [p64<=p73]]]

abstracting: (p64<=p73) states: 18,889,465,931,478,580,854,784 (22)
abstracting: (p8<=p8) states: 18,889,465,931,478,580,854,784 (22)
abstracting: (p100<=p20) states: 14,167,099,448,608,935,641,088 (22)
abstracting: (p67<=p87) states: 9,444,732,965,739,290,427,392 (21)
abstracting: (p84<=p10) states: 14,167,099,448,608,935,641,088 (22)
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec


Total processing time: 0m 5.518sec


BK_STOP 1464438103855

--------------------
content from stderr:

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p89
p97
p73
p83
p53
p61
p67
p71
p59
p79

The net has transition(s) that can never fire:


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

99 99
iterations count:2280 (8), effective:74 (0)

initing FirstDep: 0m 0.000sec


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

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

iterations count:370 (1), effective:6 (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="S_Eratosthenes-PT-100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/S_Eratosthenes-PT-100.tgz
mv S_Eratosthenes-PT-100 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is S_Eratosthenes-PT-100, 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 r149kn-smll-146416259300610"
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 ;