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-2265
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 r036kn-qhx2-143214464100126
=====================================================================

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

Model: ERK-PT-000001
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: 11 NrTr: 11 NrArc: 34)

net check time: 0m0sec

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

init dd package: 0m13sec


RS generation: 0m0sec


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



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

checking: EF [~ [[Raf1Star_RKIP_ERKPP<=RKIP | ~ [1<=RKIP]]]]
normalized: E [true U ~ [[Raf1Star_RKIP_ERKPP<=RKIP | ~ [1<=RKIP]]]]

abstracting: (1<=RKIP) states: 3
abstracting: (Raf1Star_RKIP_ERKPP<=RKIP) states: 12
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [~ [[3<=ERKPP | [3<=Raf1Star_RKIP_ERKPP | 1<=Raf1Star]]]]
normalized: E [true U ~ [[3<=ERKPP | [3<=Raf1Star_RKIP_ERKPP | 1<=Raf1Star]]]]

abstracting: (1<=Raf1Star) states: 9
abstracting: (3<=Raf1Star_RKIP_ERKPP) states: 0
abstracting: (3<=ERKPP) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [[3<=Raf1Star_RKIP | [[3<=RP | 1<=ERKPP] & 1<=Raf1Star]]]
normalized: ~ [E [true U ~ [[3<=Raf1Star_RKIP | [1<=Raf1Star & [3<=RP | 1<=ERKPP]]]]]]

abstracting: (1<=ERKPP) states: 4
abstracting: (3<=RP) states: 0
abstracting: (1<=Raf1Star) states: 9
abstracting: (3<=Raf1Star_RKIP) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[~ [[3<=Raf1Star | 3<=RP]] | [[3<=RP | 3<=Raf1Star_RKIP] & ~ [ERKPP<=RKIPP_RP]]]]
normalized: ~ [E [true U ~ [[~ [[3<=Raf1Star | 3<=RP]] | [~ [ERKPP<=RKIPP_RP] & [3<=RP | 3<=Raf1Star_RKIP]]]]]]

abstracting: (3<=Raf1Star_RKIP) states: 0
abstracting: (3<=RP) states: 0
abstracting: (ERKPP<=RKIPP_RP) states: 10
abstracting: (3<=RP) states: 0
abstracting: (3<=Raf1Star) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (MEKPP<=Raf1Star) states: 10
abstracting: (RKIPP<=Raf1Star) states: 13
abstracting: (3<=MEKPP_ERK) states: 0
abstracting: (1<=ERK) states: 4
abstracting: (MEKPP<=RKIPP) states: 6
abstracting: (3<=RKIP) states: 0
abstracting: (Raf1Star_RKIP<=RKIPP) states: 10
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[3<=RKIPP | [3<=Raf1Star | [RP<=Raf1Star_RKIP_ERKPP & RKIPP_RP<=ERKPP]]]]
normalized: E [true U [3<=RKIPP | [3<=Raf1Star | [RP<=Raf1Star_RKIP_ERKPP & RKIPP_RP<=ERKPP]]]]

abstracting: (RKIPP_RP<=ERKPP) states: 11
abstracting: (RP<=Raf1Star_RKIP_ERKPP) states: 4
abstracting: (3<=Raf1Star) states: 0
abstracting: (3<=RKIPP) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [~ [~ [[2<=RKIPP & ERK<=RKIPP_RP]]]]
normalized: E [true U [2<=RKIPP & ERK<=RKIPP_RP]]

abstracting: (ERK<=RKIPP_RP) states: 10
abstracting: (2<=RKIPP) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (RKIPP_RP<=RKIPP_RP) states: 13
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[~ [[1<=MEKPP_ERK & 2<=ERK]] & [[1<=RP & 2<=ERK] | ~ [ERK<=Raf1Star_RKIP]]]]
normalized: ~ [E [true U ~ [[[~ [ERK<=Raf1Star_RKIP] | [1<=RP & 2<=ERK]] & ~ [[1<=MEKPP_ERK & 2<=ERK]]]]]]

abstracting: (2<=ERK) states: 0
abstracting: (1<=MEKPP_ERK) states: 4
abstracting: (2<=ERK) states: 0
abstracting: (1<=RP) states: 10
abstracting: (ERK<=Raf1Star_RKIP) states: 10
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [MEKPP_ERK<=MEKPP]
normalized: ~ [E [true U ~ [MEKPP_ERK<=MEKPP]]]

abstracting: (MEKPP_ERK<=MEKPP) states: 9
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (2<=RP) states: 0
abstracting: (1<=MEKPP_ERK) states: 4
abstracting: (2<=MEKPP) states: 0
abstracting: (1<=RKIPP_RP) states: 3
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [~ [~ [~ [ERK<=MEKPP_ERK]]]]
normalized: ~ [E [true U ERK<=MEKPP_ERK]]

abstracting: (ERK<=MEKPP_ERK) states: 9
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[[1<=ERK & ~ [3<=ERK]] & [[MEKPP_ERK<=MEKPP_ERK | 3<=Raf1Star_RKIP] | [MEKPP<=RKIP | 3<=RKIPP_RP]]]]
normalized: E [true U [[[MEKPP<=RKIP | 3<=RKIPP_RP] | [MEKPP_ERK<=MEKPP_ERK | 3<=Raf1Star_RKIP]] & [1<=ERK & ~ [3<=ERK]]]]

abstracting: (3<=ERK) states: 0
abstracting: (1<=ERK) states: 4
abstracting: (3<=Raf1Star_RKIP) states: 0
abstracting: (MEKPP_ERK<=MEKPP_ERK) states: 13
abstracting: (3<=RKIPP_RP) states: 0
abstracting: (MEKPP<=RKIP) states: 6
-> the formula is TRUE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: EF [MEKPP<=RKIP]
normalized: E [true U MEKPP<=RKIP]

abstracting: (MEKPP<=RKIP) states: 6
-> the formula is TRUE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec


Total processing time: 0m17sec


BK_STOP 1432544839109

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


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

initing FirstDep: 0m0sec


iterations count:21 (1), effective:3 (0)

iterations count:21 (1), effective:3 (0)

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

iterations count:27 (2), effective:7 (0)

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

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

iterations count:32 (2), effective:6 (0)

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

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

iterations count:33 (3), effective:6 (0)

iterations count:20 (1), effective:3 (0)

iterations count:26 (2), effective:5 (0)

iterations count:11 (1), effective:0 (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="/home/fko/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-2265"
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 r036kn-qhx2-143214464100126"
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 ;