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-2270
Executing tool marcie
Input is Raft-PT-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r246su-smll-143368767200139
=====================================================================

--------------------
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 1433892024304

Model: Raft-PT-02
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 28 NrTr: 52 NrArc: 159)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m3sec


RS generation: 0m0sec


-> reachability set: #nodes 151 (1.5e+02) #states 7,381 (3)



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

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

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

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

MC time: 0m0sec

checking: EF [[[[2<=p4 & 1<=p26] | [p2<=p3 | p7<=p18]] & 2<=p21]]
normalized: E [true U [2<=p21 & [[p2<=p3 | p7<=p18] | [2<=p4 & 1<=p26]]]]

abstracting: (1<=p26) states: 1,845 (3)
abstracting: (2<=p4) states: 0
abstracting: (p7<=p18) states: 6,341 (3)
abstracting: (p2<=p3) states: 6,161 (3)
abstracting: (2<=p21) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: AG [[~ [[2<=p21 & 2<=p1]] | [[1<=p19 & p16<=p8] & [p23<=p7 & 2<=p5]]]]
normalized: ~ [E [true U ~ [[~ [[2<=p21 & 2<=p1]] | [[1<=p19 & p16<=p8] & [p23<=p7 & 2<=p5]]]]]]

abstracting: (2<=p5) states: 0
abstracting: (p23<=p7) states: 6,149 (3)
abstracting: (p16<=p8) states: 6,341 (3)
abstracting: (1<=p19) states: 1,220 (3)
abstracting: (2<=p1) states: 0
abstracting: (2<=p21) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (p7<=p15) states: 6,661 (3)
abstracting: (3<=p4) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[[[p26<=p20 & 1<=p25] & 3<=p21] | ~ [[3<=p18 & p22<=p23]]]]
normalized: ~ [E [true U ~ [[[3<=p21 & [p26<=p20 & 1<=p25]] | ~ [[3<=p18 & p22<=p23]]]]]]

abstracting: (p22<=p23) states: 5,905 (3)
abstracting: (3<=p18) states: 0
abstracting: (1<=p25) states: 1,845 (3)
abstracting: (p26<=p20) states: 6,161 (3)
abstracting: (3<=p21) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: AG [[~ [~ [p26<=p8]] | [p3<=p13 | ~ [1<=p8]]]]
normalized: ~ [E [true U ~ [[p26<=p8 | [p3<=p13 | ~ [1<=p8]]]]]]

abstracting: (1<=p8) states: 1,220 (3)
abstracting: (p3<=p13) states: 6,341 (3)
abstracting: (p26<=p8) states: 5,841 (3)
-> the formula is TRUE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: AG [~ [[[3<=p22 & p0<=p2] & [2<=p5 | p26<=p27]]]]
normalized: ~ [E [true U [[2<=p5 | p26<=p27] & [3<=p22 & p0<=p2]]]]

abstracting: (p0<=p2) states: 7,380 (3)
abstracting: (3<=p22) states: 0
abstracting: (p26<=p27) states: 5,536 (3)
abstracting: (2<=p5) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [[~ [3<=p23] | 2<=p16]]
normalized: ~ [E [true U ~ [[2<=p16 | ~ [3<=p23]]]]]

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

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

MC time: 0m0sec

checking: AG [[~ [~ [p22<=p12]] | [[2<=p12 & 2<=p19] & [p1<=p0 | p14<=p22]]]]
normalized: ~ [E [true U ~ [[p22<=p12 | [[p1<=p0 | p14<=p22] & [2<=p12 & 2<=p19]]]]]]

abstracting: (2<=p19) states: 0
abstracting: (2<=p12) states: 0
abstracting: (p14<=p22) states: 6,405 (3)
abstracting: (p1<=p0) states: 6,161 (3)
abstracting: (p22<=p12) states: 6,149 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[[[2<=p6 & 2<=p4] & [1<=p8 | p17<=p9]] | [[p11<=p6 | p0<=p18] & 3<=p26]]]
normalized: E [true U [[3<=p26 & [p11<=p6 | p0<=p18]] | [[1<=p8 | p17<=p9] & [2<=p6 & 2<=p4]]]]

abstracting: (2<=p4) states: 0
abstracting: (2<=p6) states: 0
abstracting: (p17<=p9) states: 6,341 (3)
abstracting: (1<=p8) states: 1,220 (3)
abstracting: (p0<=p18) states: 7,380 (3)
abstracting: (p11<=p6) states: 6,341 (3)
abstracting: (3<=p26) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: AG [[[~ [1<=p0] & [p5<=p0 & 2<=p23]] | ~ [[p27<=p10 & 3<=p26]]]]
normalized: ~ [E [true U ~ [[[[p5<=p0 & 2<=p23] & ~ [1<=p0]] | ~ [[p27<=p10 & 3<=p26]]]]]]

abstracting: (3<=p26) states: 0
abstracting: (p27<=p10) states: 6,161 (3)
abstracting: (1<=p0) states: 1
abstracting: (2<=p23) states: 0
abstracting: (p5<=p0) states: 4,881 (3)
-> the formula is TRUE

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

MC time: 0m0sec


Total processing time: 0m4sec


BK_STOP 1433892029048

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

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: 0m0sec

159 151
iterations count:2006 (38), effective:128 (2)

initing FirstDep: 0m0sec


iterations count:508 (9), effective:33 (0)

iterations count:508 (9), effective:33 (0)

iterations count:453 (8), effective:31 (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="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/Raft-PT-02.tgz
mv Raft-PT-02 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is 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 r246su-smll-143368767200139"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; 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 ;