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_Raft-PT-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444128000142
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464560708683


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: Raft_PT_02
(NrP: 28 NrTr: 52 NrArc: 159)

net check time: 0m 0.000sec

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

init dd package: 0m 3.924sec


RS generation: 0m 0.016sec


-> reachability set: #nodes 94 (9.4e+01) #states 7,381 (3)



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

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

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

FORMULA Raft-PT-02-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Raft-PT-02-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p22<=p8]
normalized: ~ [E [true U ~ [p22<=p8]]]

abstracting: (p22<=p8) states: 6,149 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AG [p22<=p12]
normalized: ~ [E [true U ~ [p22<=p12]]]

abstracting: (p22<=p12) states: 6,149 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[p3<=p22 & 3<=p21]]
normalized: E [true U [p3<=p22 & 3<=p21]]

abstracting: (3<=p21) states: 0
abstracting: (p3<=p22) states: 6,405 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [3<=p3] | p3<=p22]]
normalized: ~ [E [true U ~ [[p3<=p22 | ~ [3<=p3]]]]]

abstracting: (3<=p3) states: 0
abstracting: (p3<=p22) states: 6,405 (3)
-> the formula is TRUE

FORMULA Raft-PT-02-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[2<=p4 & p27<=p22]]
normalized: E [true U [2<=p4 & p27<=p22]]

abstracting: (p27<=p22) states: 5,905 (3)
abstracting: (2<=p4) states: 0
-> the formula is FALSE

FORMULA Raft-PT-02-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[p18<=p22 & 2<=p25]]
normalized: E [true U [p18<=p22 & 2<=p25]]

abstracting: (2<=p25) states: 0
abstracting: (p18<=p22) states: 6,405 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[p14<=p3 | ~ [~ [p0<=p23]]]]
normalized: ~ [E [true U ~ [[p14<=p3 | p0<=p23]]]]

abstracting: (p0<=p23) states: 7,380 (3)
abstracting: (p14<=p3) states: 6,341 (3)
-> the formula is TRUE

FORMULA Raft-PT-02-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[2<=p6 | [3<=p17 | [2<=p7 | 2<=p26]]]]
normalized: E [true U [2<=p6 | [3<=p17 | [2<=p7 | 2<=p26]]]]

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

FORMULA Raft-PT-02-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[2<=p25 | [p26<=p22 & 2<=p21]]]
normalized: E [true U [2<=p25 | [p26<=p22 & 2<=p21]]]

abstracting: (2<=p21) states: 0
abstracting: (p26<=p22) states: 5,905 (3)
abstracting: (2<=p25) states: 0
-> the formula is FALSE

FORMULA Raft-PT-02-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[3<=p12 & [[1<=p11 | 3<=p17] & p13<=p1]]]
normalized: E [true U [3<=p12 & [p13<=p1 & [1<=p11 | 3<=p17]]]]

abstracting: (3<=p17) states: 0
abstracting: (1<=p11) states: 1,220 (3)
abstracting: (p13<=p1) states: 6,341 (3)
abstracting: (3<=p12) states: 0
-> the formula is FALSE

FORMULA Raft-PT-02-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[~ [2<=p14] & [p4<=p12 | p1<=p13]]]]
normalized: E [true U ~ [[[p4<=p12 | p1<=p13] & ~ [2<=p14]]]]

abstracting: (2<=p14) states: 0
abstracting: (p1<=p13) states: 6,341 (3)
abstracting: (p4<=p12) states: 6,341 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[1<=p19 & ~ [2<=p24]] & [~ [p18<=p2] | ~ [p16<=p20]]]]
normalized: E [true U [[~ [p16<=p20] | ~ [p18<=p2]] & [1<=p19 & ~ [2<=p24]]]]

abstracting: (2<=p24) states: 0
abstracting: (1<=p19) states: 1,220 (3)
abstracting: (p18<=p2) states: 6,341 (3)
abstracting: (p16<=p20) states: 6,161 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[3<=p18 & 2<=p14] | ~ [p4<=p19]] | ~ [[3<=p13 & 3<=p18]]]]
normalized: ~ [E [true U ~ [[~ [[3<=p13 & 3<=p18]] | [~ [p4<=p19] | [3<=p18 & 2<=p14]]]]]]

abstracting: (2<=p14) states: 0
abstracting: (3<=p18) states: 0
abstracting: (p4<=p19) states: 6,341 (3)
abstracting: (3<=p18) states: 0
abstracting: (3<=p13) states: 0
-> the formula is TRUE

FORMULA Raft-PT-02-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [[1<=p13 & 1<=p12]] | [[p0<=p16 & 3<=p13] & [p23<=p22 | 2<=p5]]]]
normalized: ~ [E [true U ~ [[[[p23<=p22 | 2<=p5] & [p0<=p16 & 3<=p13]] | ~ [[1<=p13 & 1<=p12]]]]]]

abstracting: (1<=p12) states: 1,220 (3)
abstracting: (1<=p13) states: 1,220 (3)
abstracting: (3<=p13) states: 0
abstracting: (p0<=p16) states: 7,380 (3)
abstracting: (2<=p5) states: 0
abstracting: (p23<=p22) states: 5,905 (3)
-> the formula is TRUE

FORMULA Raft-PT-02-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec


Total processing time: 0m 5.657sec


BK_STOP 1464560714376

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

check for maximal unmarked siphon
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

85 114 102
iterations count:3486 (67), effective:148 (2)

initing FirstDep: 0m 0.000sec


iterations count:536 (10), effective:33 (0)

iterations count:421 (8), effective:26 (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_Raft-PT-02"
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_Raft-PT-02.tgz
mv S_Raft-PT-02 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_Raft-PT-02, 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 r185kn-smll-146444128000142"
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 ;