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-3254
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 r021-blw3-149440255100358
=====================================================================

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

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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

parse successfull
net created successfully

Net: ERK_PT_000001
(NrP: 11 NrTr: 11 NrArc: 34)

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

net check time: 0m 0.000sec

init dd package: 0m 1.096sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 11 (1.1e+01) #states 13



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

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

abstracting: (3<=MEKPP)
states: 0
-> 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 [RKIPP_RP<=Raf1Star_RKIP]
normalized: ~ [E [true U ~ [RKIPP_RP<=Raf1Star_RKIP]]]

abstracting: (RKIPP_RP<=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: 0m 0.000sec

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

abstracting: (RKIPP_RP<=ERKPP)
states: 11
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: EF [[~ [[1<=ERK & RKIPP_RP<=ERKPP]] & 2<=ERK]]
normalized: E [true U [2<=ERK & ~ [[1<=ERK & RKIPP_RP<=ERKPP]]]]

abstracting: (RKIPP_RP<=ERKPP)
states: 11
abstracting: (1<=ERK)
states: 4
abstracting: (2<=ERK)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[~ [~ [MEKPP<=MEKPP_ERK]] & [~ [1<=RKIPP] & 2<=Raf1Star_RKIP_ERKPP]]]
normalized: E [true U [[~ [1<=RKIPP] & 2<=Raf1Star_RKIP_ERKPP] & MEKPP<=MEKPP_ERK]]

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

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

MC time: 0m 0.000sec

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

abstracting: (Raf1Star_RKIP<=MEKPP)
states: 12
abstracting: (MEKPP_ERK<=MEKPP)
states: 9
-> 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: EF [[2<=Raf1Star & [1<=Raf1Star_RKIP_ERKPP | [1<=Raf1Star | Raf1Star_RKIP_ERKPP<=RP]]]]
normalized: E [true U [[[1<=Raf1Star | Raf1Star_RKIP_ERKPP<=RP] | 1<=Raf1Star_RKIP_ERKPP] & 2<=Raf1Star]]

abstracting: (2<=Raf1Star)
states: 0
abstracting: (1<=Raf1Star_RKIP_ERKPP)
states: 1
abstracting: (Raf1Star_RKIP_ERKPP<=RP)
states: 13
abstracting: (1<=Raf1Star)
states: 9
-> 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 [[2<=RKIPP_RP | [[3<=RKIPP_RP | 1<=ERK] & [2<=ERK & 3<=RKIP]]]]
normalized: ~ [E [true U ~ [[[[2<=ERK & 3<=RKIP] & [3<=RKIPP_RP | 1<=ERK]] | 2<=RKIPP_RP]]]]

abstracting: (2<=RKIPP_RP)
states: 0
abstracting: (1<=ERK)
states: 4
abstracting: (3<=RKIPP_RP)
states: 0
abstracting: (3<=RKIP)
states: 0
abstracting: (2<=ERK)
states: 0
-> 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 [[[2<=MEKPP | [1<=Raf1Star_RKIP | 1<=RKIPP_RP]] & [~ [ERKPP<=MEKPP] | 2<=MEKPP]]]
normalized: E [true U [[~ [ERKPP<=MEKPP] | 2<=MEKPP] & [[1<=Raf1Star_RKIP | 1<=RKIPP_RP] | 2<=MEKPP]]]

abstracting: (2<=MEKPP)
states: 0
abstracting: (1<=RKIPP_RP)
states: 3
abstracting: (1<=Raf1Star_RKIP)
states: 3
abstracting: (2<=MEKPP)
states: 0
abstracting: (ERKPP<=MEKPP)
states: 13
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [[2<=MEKPP & [~ [Raf1Star<=RKIPP_RP] & [MEKPP<=RKIPP & RP<=Raf1Star_RKIP]]]]
normalized: ~ [E [true U ~ [[[[MEKPP<=RKIPP & RP<=Raf1Star_RKIP] & ~ [Raf1Star<=RKIPP_RP]] & 2<=MEKPP]]]]

abstracting: (2<=MEKPP)
states: 0
abstracting: (Raf1Star<=RKIPP_RP)
states: 7
abstracting: (RP<=Raf1Star_RKIP)
states: 6
abstracting: (MEKPP<=RKIPP)
states: 6
-> 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 [~ [[[3<=Raf1Star_RKIP_ERKPP | ERKPP<=MEKPP_ERK] & [MEKPP_ERK<=ERKPP & MEKPP_ERK<=RKIP]]]]
normalized: E [true U ~ [[[MEKPP_ERK<=ERKPP & MEKPP_ERK<=RKIP] & [3<=Raf1Star_RKIP_ERKPP | ERKPP<=MEKPP_ERK]]]]

abstracting: (ERKPP<=MEKPP_ERK)
states: 9
abstracting: (3<=Raf1Star_RKIP_ERKPP)
states: 0
abstracting: (MEKPP_ERK<=RKIP)
states: 10
abstracting: (MEKPP_ERK<=ERKPP)
states: 9
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [[[Raf1Star_RKIP_ERKPP<=RP & RKIP<=ERKPP] | [[Raf1Star_RKIP<=Raf1Star_RKIP_ERKPP & 1<=RKIPP] | ~ [2<=RKIPP_RP]]]]
normalized: E [true U [[~ [2<=RKIPP_RP] | [Raf1Star_RKIP<=Raf1Star_RKIP_ERKPP & 1<=RKIPP]] | [Raf1Star_RKIP_ERKPP<=RP & RKIP<=ERKPP]]]

abstracting: (RKIP<=ERKPP)
states: 11
abstracting: (Raf1Star_RKIP_ERKPP<=RP)
states: 13
abstracting: (1<=RKIPP)
states: 3
abstracting: (Raf1Star_RKIP<=Raf1Star_RKIP_ERKPP)
states: 10
abstracting: (2<=RKIPP_RP)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [[[~ [RKIPP<=RKIPP] | ~ [RKIP<=RKIPP_RP]] | ~ [[Raf1Star_RKIP<=MEKPP_ERK & RP<=ERK]]]]
normalized: ~ [E [true U ~ [[~ [[Raf1Star_RKIP<=MEKPP_ERK & RP<=ERK]] | [~ [RKIP<=RKIPP_RP] | ~ [RKIPP<=RKIPP]]]]]]

abstracting: (RKIPP<=RKIPP)
states: 13
abstracting: (RKIP<=RKIPP_RP)
states: 10
abstracting: (RP<=ERK)
states: 6
abstracting: (Raf1Star_RKIP<=MEKPP_ERK)
states: 11
-> the formula is FALSE

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

MC time: 0m 0.000sec

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

abstracting: (3<=ERKPP)
states: 0
abstracting: (Raf1Star_RKIP_ERKPP<=Raf1Star)
states: 12
abstracting: (1<=MEKPP)
states: 9
abstracting: (3<=Raf1Star)
states: 0
abstracting: (MEKPP_ERK<=MEKPP)
states: 9
abstracting: (RKIPP_RP<=MEKPP_ERK)
states: 11
-> 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 [[[[RKIP<=Raf1Star_RKIP | ERKPP<=RKIP] | 1<=RKIP] | [[MEKPP_ERK<=Raf1Star & MEKPP<=MEKPP] & ~ [ERK<=RKIPP_RP]]]]
normalized: ~ [E [true U ~ [[[~ [ERK<=RKIPP_RP] & [MEKPP_ERK<=Raf1Star & MEKPP<=MEKPP]] | [[RKIP<=Raf1Star_RKIP | ERKPP<=RKIP] | 1<=RKIP]]]]]

abstracting: (1<=RKIP)
states: 3
abstracting: (ERKPP<=RKIP)
states: 10
abstracting: (RKIP<=Raf1Star_RKIP)
states: 10
abstracting: (MEKPP<=MEKPP)
states: 13
abstracting: (MEKPP_ERK<=Raf1Star)
states: 12
abstracting: (ERK<=RKIPP_RP)
states: 10
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

abstracting: (RKIP<=ERKPP)
states: 11
abstracting: (MEKPP_ERK<=Raf1Star)
states: 12
abstracting: (3<=ERK)
states: 0
abstracting: (RKIPP<=MEKPP)
states: 12
abstracting: (Raf1Star_RKIP<=RKIPP)
states: 10
abstracting: (3<=RKIP)
states: 0
abstracting: (MEKPP<=RP)
states: 11
-> the formula is TRUE

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

MC time: 0m 0.000sec

totally nodes used: 753(7.5e+02)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 384 501 885
used/not used/entry size/cache size: 439 67108425 16 1024MB
basic ops cache: hits/miss/sum: 1043 1365 2408
used/not used/entry size/cache size: 2948 16774268 12 192MB
unary ops cache: hits/miss/sum: 0 10 10
used/not used/entry size/cache size: 10 8388598 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 103 88 191
used/not used/entry size/cache size: 88 2097064 32 64MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67108111
1 753
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 1.607sec


BK_STOP 1494459816158

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

check for maximal unmarked siphon
ok
check for constant places
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:31 (2), effective:6 (0)

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

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

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

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

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

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

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

iterations count:28 (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="/tmp/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-3254"
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 r021-blw3-149440255100358"
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 ;