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 ERK-PT-000001, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r041kn-smll-146351484500088
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463532284595


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: ERK_PT_000001
(NrP: 11 NrTr: 11 NrArc: 34)

net check time: 0m 0.000sec

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

init dd package: 0m 4.374sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 21 (2.1e+01) #states 13



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

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

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

FORMULA ERK-PT-000001-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA ERK-PT-000001-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=RKIPP) states: 3
-> the formula is FALSE

FORMULA ERK-PT-000001-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=RP) states: 10
-> the formula is FALSE

FORMULA ERK-PT-000001-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [1<=RP]
normalized: E [true U 1<=RP]

abstracting: (1<=RP) states: 10
-> the formula is TRUE

FORMULA ERK-PT-000001-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA ERK-PT-000001-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[2<=ERKPP | ~ [[2<=ERKPP & 2<=RKIPP_RP]]]]
normalized: ~ [E [true U ~ [[2<=ERKPP | ~ [[2<=ERKPP & 2<=RKIPP_RP]]]]]]

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

FORMULA ERK-PT-000001-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[[3<=RKIP & 3<=RKIPP_RP] | 1<=Raf1Star_RKIP]]]
normalized: ~ [E [true U [1<=Raf1Star_RKIP | [3<=RKIP & 3<=RKIPP_RP]]]]

abstracting: (3<=RKIPP_RP) states: 0
abstracting: (3<=RKIP) states: 0
abstracting: (1<=Raf1Star_RKIP) states: 3
-> the formula is FALSE

FORMULA ERK-PT-000001-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[[3<=ERK | ERK<=RP] | 3<=Raf1Star_RKIP_ERKPP]]]
normalized: E [true U ~ [[3<=Raf1Star_RKIP_ERKPP | [3<=ERK | ERK<=RP]]]]

abstracting: (ERK<=RP) states: 12
abstracting: (3<=ERK) states: 0
abstracting: (3<=Raf1Star_RKIP_ERKPP) states: 0
-> the formula is TRUE

FORMULA ERK-PT-000001-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[3<=RKIP & [3<=Raf1Star_RKIP & 3<=RKIPP_RP]] | ~ [[2<=MEKPP_ERK & 2<=Raf1Star_RKIP_ERKPP]]]]
normalized: E [true U [[3<=RKIP & [3<=Raf1Star_RKIP & 3<=RKIPP_RP]] | ~ [[2<=MEKPP_ERK & 2<=Raf1Star_RKIP_ERKPP]]]]

abstracting: (2<=Raf1Star_RKIP_ERKPP) states: 0
abstracting: (2<=MEKPP_ERK) states: 0
abstracting: (3<=RKIPP_RP) states: 0
abstracting: (3<=Raf1Star_RKIP) states: 0
abstracting: (3<=RKIP) states: 0
-> the formula is TRUE

FORMULA ERK-PT-000001-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[[MEKPP<=RP | ERK<=ERKPP] | ~ [RKIPP_RP<=Raf1Star_RKIP]]]]
normalized: ~ [E [true U [~ [RKIPP_RP<=Raf1Star_RKIP] | [MEKPP<=RP | ERK<=ERKPP]]]]

abstracting: (ERK<=ERKPP) states: 9
abstracting: (MEKPP<=RP) states: 11
abstracting: (RKIPP_RP<=Raf1Star_RKIP) states: 10
-> the formula is FALSE

FORMULA ERK-PT-000001-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[ERKPP<=MEKPP_ERK & Raf1Star_RKIP_ERKPP<=RKIPP_RP] & ~ [[Raf1Star_RKIP_ERKPP<=ERKPP | 2<=RKIPP_RP]]]]
normalized: ~ [E [true U ~ [[[ERKPP<=MEKPP_ERK & Raf1Star_RKIP_ERKPP<=RKIPP_RP] & ~ [[Raf1Star_RKIP_ERKPP<=ERKPP | 2<=RKIPP_RP]]]]]]

abstracting: (2<=RKIPP_RP) states: 0
abstracting: (Raf1Star_RKIP_ERKPP<=ERKPP) states: 12
abstracting: (Raf1Star_RKIP_ERKPP<=RKIPP_RP) states: 12
abstracting: (ERKPP<=MEKPP_ERK) states: 9
-> the formula is FALSE

FORMULA ERK-PT-000001-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[3<=RP | ERK<=RKIP]] & [Raf1Star_RKIP_ERKPP<=ERK | [1<=Raf1Star_RKIP_ERKPP & MEKPP_ERK<=RP]]]]
normalized: E [true U [[Raf1Star_RKIP_ERKPP<=ERK | [1<=Raf1Star_RKIP_ERKPP & MEKPP_ERK<=RP]] & ~ [[3<=RP | ERK<=RKIP]]]]

abstracting: (ERK<=RKIP) states: 10
abstracting: (3<=RP) states: 0
abstracting: (MEKPP_ERK<=RP) states: 12
abstracting: (1<=Raf1Star_RKIP_ERKPP) states: 1
abstracting: (Raf1Star_RKIP_ERKPP<=ERK) states: 12
-> the formula is TRUE

FORMULA ERK-PT-000001-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[[~ [1<=RKIPP] | ~ [ERK<=Raf1Star_RKIP]] & [[RP<=RKIPP & RKIP<=MEKPP] | [3<=ERKPP | 3<=MEKPP]]]]
normalized: ~ [E [true U ~ [[[[RP<=RKIPP & RKIP<=MEKPP] | [3<=ERKPP | 3<=MEKPP]] & [~ [1<=RKIPP] | ~ [ERK<=Raf1Star_RKIP]]]]]]

abstracting: (ERK<=Raf1Star_RKIP) states: 10
abstracting: (1<=RKIPP) states: 3
abstracting: (3<=MEKPP) states: 0
abstracting: (3<=ERKPP) states: 0
abstracting: (RKIP<=MEKPP) states: 12
abstracting: (RP<=RKIPP) states: 6
-> the formula is FALSE

FORMULA ERK-PT-000001-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[1<=Raf1Star_RKIP_ERKPP | RKIPP_RP<=MEKPP_ERK] & [1<=RP & Raf1Star_RKIP_ERKPP<=RKIP]] | ~ [[RKIPP_RP<=MEKPP & 1<=MEKPP_ERK]]]]
normalized: ~ [E [true U ~ [[~ [[RKIPP_RP<=MEKPP & 1<=MEKPP_ERK]] | [[1<=Raf1Star_RKIP_ERKPP | RKIPP_RP<=MEKPP_ERK] & [1<=RP & Raf1Star_RKIP_ERKPP<=RKIP]]]]]]

abstracting: (Raf1Star_RKIP_ERKPP<=RKIP) states: 12
abstracting: (1<=RP) states: 10
abstracting: (RKIPP_RP<=MEKPP_ERK) states: 11
abstracting: (1<=Raf1Star_RKIP_ERKPP) states: 1
abstracting: (1<=MEKPP_ERK) states: 4
abstracting: (RKIPP_RP<=MEKPP) states: 12
-> the formula is TRUE

FORMULA ERK-PT-000001-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[ERKPP<=MEKPP & ~ [MEKPP_ERK<=Raf1Star_RKIP]] | [[RKIP<=ERK | Raf1Star_RKIP<=ERKPP] & ~ [Raf1Star<=ERKPP]]]]
normalized: ~ [E [true U ~ [[[ERKPP<=MEKPP & ~ [MEKPP_ERK<=Raf1Star_RKIP]] | [[RKIP<=ERK | Raf1Star_RKIP<=ERKPP] & ~ [Raf1Star<=ERKPP]]]]]]

abstracting: (Raf1Star<=ERKPP) states: 7
abstracting: (Raf1Star_RKIP<=ERKPP) states: 11
abstracting: (RKIP<=ERK) states: 11
abstracting: (MEKPP_ERK<=Raf1Star_RKIP) states: 10
abstracting: (ERKPP<=MEKPP) states: 13
-> the formula is FALSE

FORMULA ERK-PT-000001-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec


Total processing time: 0m 6.085sec


BK_STOP 1463532290717

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


iterations count:35 (3), effective:8 (0)

initing FirstDep: 0m 0.000sec


iterations count:11 (1), effective:0 (0)

iterations count:14 (1), effective:1 (0)

iterations count:15 (1), effective:1 (0)

iterations count:15 (1), effective:1 (0)

iterations count:11 (1), effective:0 (0)

iterations count:24 (2), effective:4 (0)

iterations count:40 (3), effective:9 (0)

iterations count:11 (1), effective:0 (0)

iterations count:11 (1), effective:0 (0)

iterations count:11 (1), effective:0 (0)

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

iterations count:16 (1), effective:2 (0)

iterations count:15 (1), effective:2 (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="ERK-PT-000001"
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/ERK-PT-000001.tgz
mv ERK-PT-000001 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 ERK-PT-000001, 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 r041kn-smll-146351484500088"
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 ;