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 Eratosthenes-PT-050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r053kn-smll-146358767700025
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463598059971


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_050
(NrP: 49 NrTr: 108 NrArc: 324)

net check time: 0m 0.000sec

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

init dd package: 0m 3.996sec


RS generation: 0m 0.005sec


-> reachability set: #nodes 49 (4.9e+01) #states 17,179,869,184 (10)



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

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

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

FORMULA Eratosthenes-PT-050-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: AG [~ [[3<=p6 & 2<=p41]]]
normalized: ~ [E [true U [3<=p6 & 2<=p41]]]

abstracting: (2<=p41) states: 0
abstracting: (3<=p6) states: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

abstracting: (1<=p16) states: 8,589,934,592 (9)
abstracting: (1<=p29) states: 17,179,869,184 (10)
-> the formula is TRUE

FORMULA Eratosthenes-PT-050-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[[3<=p17 & p34<=p15] | ~ [2<=p32]]]]
normalized: E [true U ~ [[[3<=p17 & p34<=p15] | ~ [2<=p32]]]]

abstracting: (2<=p32) states: 0
abstracting: (p34<=p15) states: 12,884,901,888 (10)
abstracting: (3<=p17) states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [[2<=p28 | [p22<=p24 | ~ [3<=p38]]]]
normalized: ~ [E [true U ~ [[2<=p28 | [p22<=p24 | ~ [3<=p38]]]]]]

abstracting: (3<=p38) states: 0
abstracting: (p22<=p24) states: 12,884,901,888 (10)
abstracting: (2<=p28) states: 0
-> the formula is TRUE

FORMULA Eratosthenes-PT-050-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[2<=p24 & 2<=p44] & ~ [2<=p43]] & 3<=p35]]
normalized: E [true U [3<=p35 & [~ [2<=p43] & [2<=p24 & 2<=p44]]]]

abstracting: (2<=p44) states: 0
abstracting: (2<=p24) states: 0
abstracting: (2<=p43) states: 0
abstracting: (3<=p35) states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[1<=p9 & [1<=p37 & [2<=p15 & p29<=p4]]]]
normalized: E [true U [1<=p9 & [1<=p37 & [2<=p15 & p29<=p4]]]]

abstracting: (p29<=p4) states: 8,589,934,592 (9)
abstracting: (2<=p15) states: 0
abstracting: (1<=p37) states: 17,179,869,184 (10)
abstracting: (1<=p9) states: 8,589,934,592 (9)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [[~ [[2<=p20 & p42<=p4]] & p34<=p3]]
normalized: ~ [E [true U ~ [[p34<=p3 & ~ [[2<=p20 & p42<=p4]]]]]]

abstracting: (p42<=p4) states: 12,884,901,888 (10)
abstracting: (2<=p20) states: 0
abstracting: (p34<=p3) states: 17,179,869,184 (10)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [~ [[~ [p2<=p5] | [p44<=p5 | 2<=p26]]]]
normalized: E [true U ~ [[[p44<=p5 | 2<=p26] | ~ [p2<=p5]]]]

abstracting: (p2<=p5) states: 17,179,869,184 (10)
abstracting: (2<=p26) states: 0
abstracting: (p44<=p5) states: 17,179,869,184 (10)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[[[1<=p19 & p39<=p3] & p16<=p11] & 2<=p38]]
normalized: E [true U [2<=p38 & [p16<=p11 & [1<=p19 & p39<=p3]]]]

abstracting: (p39<=p3) states: 17,179,869,184 (10)
abstracting: (1<=p19) states: 17,179,869,184 (10)
abstracting: (p16<=p11) states: 17,179,869,184 (10)
abstracting: (2<=p38) states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [~ [[[p5<=p23 | p40<=p5] & [3<=p8 & 2<=p12]]]]
normalized: ~ [E [true U [[p5<=p23 | p40<=p5] & [3<=p8 & 2<=p12]]]]

abstracting: (2<=p12) states: 0
abstracting: (3<=p8) states: 0
abstracting: (p40<=p5) states: 17,179,869,184 (10)
abstracting: (p5<=p23) states: 17,179,869,184 (10)
-> the formula is TRUE

FORMULA Eratosthenes-PT-050-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [p28<=p30] | [[1<=p8 | 1<=p43] | [p13<=p39 | p39<=p25]]]]
normalized: ~ [E [true U ~ [[[[p13<=p39 | p39<=p25] | [1<=p8 | 1<=p43]] | ~ [p28<=p30]]]]]

abstracting: (p28<=p30) states: 12,884,901,888 (10)
abstracting: (1<=p43) states: 17,179,869,184 (10)
abstracting: (1<=p8) states: 8,589,934,592 (9)
abstracting: (p39<=p25) states: 12,884,901,888 (10)
abstracting: (p13<=p39) states: 8,589,934,592 (9)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [[[[p21<=p43 & p28<=p10] & [1<=p20 & p43<=p28]] & [[p35<=p37 | 3<=p46] & 3<=p38]]]
normalized: E [true U [[[1<=p20 & p43<=p28] & [p21<=p43 & p28<=p10]] & [3<=p38 & [p35<=p37 | 3<=p46]]]]

abstracting: (3<=p46) states: 0
abstracting: (p35<=p37) states: 17,179,869,184 (10)
abstracting: (3<=p38) states: 0
abstracting: (p28<=p10) states: 12,884,901,888 (10)
abstracting: (p21<=p43) states: 17,179,869,184 (10)
abstracting: (p43<=p28) states: 8,589,934,592 (9)
abstracting: (1<=p20) states: 8,589,934,592 (9)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[[[p42<=p22 & p5<=p7] | [1<=p24 | 3<=p39]] & [[2<=p18 & 1<=p41] & [p11<=p38 & 2<=p20]]]]
normalized: E [true U [[[p42<=p22 & p5<=p7] | [1<=p24 | 3<=p39]] & [[2<=p18 & 1<=p41] & [p11<=p38 & 2<=p20]]]]

abstracting: (2<=p20) states: 0
abstracting: (p11<=p38) states: 8,589,934,592 (9)
abstracting: (1<=p41) states: 17,179,869,184 (10)
abstracting: (2<=p18) states: 0
abstracting: (3<=p39) states: 0
abstracting: (1<=p24) states: 8,589,934,592 (9)
abstracting: (p5<=p7) states: 17,179,869,184 (10)
abstracting: (p42<=p22) states: 12,884,901,888 (10)
-> the formula is FALSE

FORMULA Eratosthenes-PT-050-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec


Total processing time: 0m 5.415sec


BK_STOP 1463598065422

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

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p41
p29
p43
p37
p47
p31

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


iterations count:532 (4), effective:34 (0)

initing FirstDep: 0m 0.000sec

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="Eratosthenes-PT-050"
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/Eratosthenes-PT-050.tgz
mv Eratosthenes-PT-050 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 Eratosthenes-PT-050, 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 r053kn-smll-146358767700025"
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 ;