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 S_ERK-PT-000010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r176st-qhx2-143322681900139
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433606037222

Model: S_ERK-PT-000010
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: 0m12sec


RS generation: 0m0sec


-> reachability set: #nodes 111 (1.1e+02) #states 47,047 (4)



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

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

abstracting: (ERK<=MEKPP_ERK) states: 25,921 (4)
abstracting: (1<=RP) states: 46,981 (4)
abstracting: (ERKPP<=Raf1Star) states: 42,042 (4)
abstracting: (RP<=Raf1Star) states: 19,110 (4)
abstracting: (Raf1Star_RKIP<=RKIP) states: 26,922 (4)
-> the formula is TRUE

FORMULA ERK-PT-000010-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (3<=RKIP) states: 17,160 (4)
abstracting: (ERK<=MEKPP_ERK) states: 25,921 (4)
abstracting: (RP<=ERKPP) states: 4,900 (3)
abstracting: (1<=MEKPP) states: 46,761 (4)
abstracting: (1<=ERK) states: 38,038 (4)
-> the formula is FALSE

FORMULA ERK-PT-000010-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (3<=Raf1Star) states: 44,214 (4)
abstracting: (RKIPP_RP<=ERKPP) states: 31,031 (4)
abstracting: (2<=RKIP) states: 24,882 (4)
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (3<=RP) states: 46,122 (4)
-> the formula is FALSE

FORMULA ERK-PT-000010-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (RKIP<=Raf1Star_RKIP) states: 26,922 (4)
abstracting: (3<=RKIPP) states: 17,160 (4)
abstracting: (RKIPP_RP<=Raf1Star_RKIP_ERKPP) states: 22,575 (4)
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (Raf1Star<=MEKPP_ERK) states: 8,008 (3)
abstracting: (1<=RKIP) states: 34,749 (4)
abstracting: (ERK<=MEKPP) states: 47,047 (4)
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[[~ [ERK<=RP] & ~ [3<=Raf1Star_RKIP]] & [ERK<=Raf1Star & 3<=Raf1Star_RKIP]]]
normalized: E [true U [[~ [3<=Raf1Star_RKIP] & ~ [ERK<=RP]] & [ERK<=Raf1Star & 3<=Raf1Star_RKIP]]]

abstracting: (3<=Raf1Star_RKIP) states: 17,160 (4)
abstracting: (ERK<=Raf1Star) states: 42,042 (4)
abstracting: (ERK<=RP) states: 43,939 (4)
abstracting: (3<=Raf1Star_RKIP) states: 17,160 (4)
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[RP<=Raf1Star_RKIP & [~ [1<=RKIPP_RP] & [RP<=MEKPP & ERK<=RKIPP]]]]
normalized: E [true U [RP<=Raf1Star_RKIP & [[RP<=MEKPP & ERK<=RKIPP] & ~ [1<=RKIPP_RP]]]]

abstracting: (1<=RKIPP_RP) states: 34,749 (4)
abstracting: (ERK<=RKIPP) states: 23,023 (4)
abstracting: (RP<=MEKPP) states: 23,023 (4)
abstracting: (RP<=Raf1Star_RKIP) states: 726
-> the formula is TRUE

FORMULA ERK-PT-000010-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[~ [3<=MEKPP] | ~ [Raf1Star<=MEKPP]] & [[ERKPP<=RKIPP & MEKPP_ERK<=Raf1Star_RKIP_ERKPP] | [ERK<=RP & RP<=RKIPP]]]]
normalized: E [true U [[[ERKPP<=RKIPP & MEKPP_ERK<=Raf1Star_RKIP_ERKPP] | [ERK<=RP & RP<=RKIPP]] & [~ [Raf1Star<=MEKPP] | ~ [3<=MEKPP]]]]

abstracting: (3<=MEKPP) states: 44,506 (4)
abstracting: (Raf1Star<=MEKPP) states: 29,771 (4)
abstracting: (RP<=RKIPP) states: 726
abstracting: (ERK<=RP) states: 43,939 (4)
abstracting: (MEKPP_ERK<=Raf1Star_RKIP_ERKPP) states: 18,480 (4)
abstracting: (ERKPP<=RKIPP) states: 23,023 (4)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (1<=RP) states: 46,981 (4)
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (RP<=RP) states: 47,047 (4)
-> the formula is TRUE

FORMULA ERK-PT-000010-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[RKIPP_RP<=RKIPP | [[3<=ERKPP | 3<=RP] | [MEKPP_ERK<=ERKPP | 1<=ERK]]]]
normalized: ~ [E [true U ~ [[RKIPP_RP<=RKIPP | [[MEKPP_ERK<=ERKPP | 1<=ERK] | [3<=ERKPP | 3<=RP]]]]]]

abstracting: (3<=RP) states: 46,122 (4)
abstracting: (3<=ERKPP) states: 23,022 (4)
abstracting: (1<=ERK) states: 38,038 (4)
abstracting: (MEKPP_ERK<=ERKPP) states: 25,921 (4)
abstracting: (RKIPP_RP<=RKIPP) states: 26,922 (4)
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (3<=MEKPP_ERK) states: 23,022 (4)
abstracting: (2<=MEKPP) states: 45,969 (4)
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [~ [[RKIPP<=ERKPP | [Raf1Star_RKIP<=RP | 2<=RP]]]]
normalized: E [true U ~ [[RKIPP<=ERKPP | [Raf1Star_RKIP<=RP | 2<=RP]]]]

abstracting: (2<=RP) states: 46,728 (4)
abstracting: (Raf1Star_RKIP<=RP) states: 47,047 (4)
abstracting: (RKIPP<=ERKPP) states: 31,031 (4)
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[1<=RKIPP_RP & [[3<=Raf1Star_RKIP & RKIP<=ERKPP] & [1<=ERKPP & RP<=Raf1Star_RKIP]]]]
normalized: E [true U [1<=RKIPP_RP & [[1<=ERKPP & RP<=Raf1Star_RKIP] & [3<=Raf1Star_RKIP & RKIP<=ERKPP]]]]

abstracting: (RKIP<=ERKPP) states: 31,031 (4)
abstracting: (3<=Raf1Star_RKIP) states: 17,160 (4)
abstracting: (RP<=Raf1Star_RKIP) states: 726
abstracting: (1<=ERKPP) states: 38,038 (4)
abstracting: (1<=RKIPP_RP) states: 34,749 (4)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (2<=RP) states: 46,728 (4)
abstracting: (MEKPP_ERK<=RKIP) states: 23,023 (4)
-> the formula is FALSE

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

MC time: 0m0sec


Total processing time: 0m16sec


BK_STOP 1433606053834

--------------------
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:251 (22), effective:80 (7)

initing FirstDep: 0m0sec


iterations count:42 (3), effective:10 (0)

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

iterations count:58 (5), effective:14 (1)

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

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

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

iterations count:48 (4), effective:12 (1)

iterations count:45 (4), effective:11 (1)

iterations count:52 (4), effective:12 (1)

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_ERK-PT-000010"
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/S_ERK-PT-000010.tgz
mv S_ERK-PT-000010 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 S_ERK-PT-000010, 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 r176st-qhx2-143322681900139"
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 ;