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 MAPK-PT-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065kn-blw3-146358913500313
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463734510458


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: MAPK_PT_020
(NrP: 22 NrTr: 30 NrArc: 90)

net check time: 0m 0.000sec

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

init dd package: 0m 3.889sec


RS generation: 0m 0.048sec


-> reachability set: #nodes 1012 (1.0e+03) #states 88,125,763,956 (10)



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

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

abstracting: (1<=Raf) states: 78,558,858,680 (10)
-> the formula is FALSE

FORMULA MAPK-PT-020-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.139sec

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

abstracting: (3<=ERK) states: 37,845,286,015 (10)
-> the formula is TRUE

FORMULA MAPK-PT-020-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.256sec

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

abstracting: (1<=ERK) states: 67,744,017,220 (10)
-> the formula is FALSE

FORMULA MAPK-PT-020-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.263sec

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

abstracting: (Phase2<=RafP_Phase1) states: 28,352,354,112 (10)
-> the formula is FALSE

FORMULA MAPK-PT-020-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.185sec

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

abstracting: (MEK<=MEKPP_Phase2) states: 54,827,055,446 (10)
-> the formula is FALSE

FORMULA MAPK-PT-020-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.157sec

checking: EF [Raf<=ERKP]
normalized: E [true U Raf<=ERKP]

abstracting: (Raf<=ERKP) states: 31,344,128,969 (10)
-> the formula is TRUE

FORMULA MAPK-PT-020-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.218sec

checking: EF [~ [[[1<=ERKP | 3<=ERKPP] | ~ [2<=ERKP_Phase3]]]]
normalized: E [true U ~ [[~ [2<=ERKP_Phase3] | [1<=ERKP | 3<=ERKPP]]]]

abstracting: (3<=ERKPP) states: 37,845,286,015 (10)
abstracting: (1<=ERKP) states: 67,744,017,220 (10)
abstracting: (2<=ERKP_Phase3) states: 51,153,151,165 (10)
-> the formula is TRUE

FORMULA MAPK-PT-020-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.181sec

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

abstracting: (2<=ERKPP) states: 51,153,151,165 (10)
abstracting: (Raf_RasGTP<=MEK) states: 38,393,510,136 (10)
-> the formula is FALSE

FORMULA MAPK-PT-020-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.107sec

checking: EF [[~ [RasGTP<=ERKP] & 2<=ERKPP]]
normalized: E [true U [2<=ERKPP & ~ [RasGTP<=ERKP]]]

abstracting: (RasGTP<=ERKP) states: 44,167,702,364 (10)
abstracting: (2<=ERKPP) states: 51,153,151,165 (10)
-> the formula is TRUE

FORMULA MAPK-PT-020-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.196sec

checking: AG [~ [~ [[2<=Raf | MEK_RafP<=MEK_RafP]]]]
normalized: ~ [E [true U ~ [[2<=Raf | MEK_RafP<=MEK_RafP]]]]

abstracting: (MEK_RafP<=MEK_RafP) states: 88,125,763,956 (10)
abstracting: (2<=Raf) states: 69,343,275,025 (10)
-> the formula is TRUE

FORMULA MAPK-PT-020-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: EF [~ [[[3<=ERK | 1<=MEKPP] | [3<=ERKP | 1<=ERKPP]]]]
normalized: E [true U ~ [[[3<=ERKP | 1<=ERKPP] | [3<=ERK | 1<=MEKPP]]]]

abstracting: (1<=MEKPP) states: 52,616,276,700 (10)
abstracting: (3<=ERK) states: 37,845,286,015 (10)
abstracting: (1<=ERKPP) states: 67,744,017,220 (10)
abstracting: (3<=ERKP) states: 37,845,286,015 (10)
-> the formula is TRUE

FORMULA MAPK-PT-020-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.221sec

checking: AG [[[[3<=MEK & 3<=ERKP_Phase3] & MEK<=Raf] | RafP<=Raf]]
normalized: ~ [E [true U ~ [[RafP<=Raf | [MEK<=Raf & [3<=MEK & 3<=ERKP_Phase3]]]]]]

abstracting: (3<=ERKP_Phase3) states: 37,845,286,015 (10)
abstracting: (3<=MEK) states: 16,079,210,945 (10)
abstracting: (MEK<=Raf) states: 76,697,673,756 (10)
abstracting: (RafP<=Raf) states: 46,492,181,583 (10)
-> the formula is FALSE

FORMULA MAPK-PT-020-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.277sec

checking: EF [[[[2<=ERK_MEKPP & 2<=Phase2] & [3<=MEK & 3<=MEKP_RafP]] & [1<=Raf_RasGTP & Phase3<=ERKP]]]
normalized: E [true U [[1<=Raf_RasGTP & Phase3<=ERKP] & [[3<=MEK & 3<=MEKP_RafP] & [2<=ERK_MEKPP & 2<=Phase2]]]]

abstracting: (2<=Phase2) states: 87,818,902,260 (10)
abstracting: (2<=ERK_MEKPP) states: 17,558,169,432 (10)
abstracting: (3<=MEKP_RafP) states: 11,256,664,704 (10)
abstracting: (3<=MEK) states: 16,079,210,945 (10)
abstracting: (Phase3<=ERKP) states: 862,769,448 (8)
abstracting: (1<=Raf_RasGTP) states: 69,310,935,860 (10)
-> the formula is FALSE

FORMULA MAPK-PT-020-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AG [[[[MEKPP_Phase2<=ERKP_MEKPP | 2<=ERKP_Phase3] | ~ [3<=ERKP_Phase3]] | [[3<=Raf_RasGTP | 1<=ERKP] | ERK_MEKPP<=MEKPP_Phase2]]]
normalized: ~ [E [true U ~ [[[~ [3<=ERKP_Phase3] | [MEKPP_Phase2<=ERKP_MEKPP | 2<=ERKP_Phase3]] | [ERK_MEKPP<=MEKPP_Phase2 | [3<=Raf_RasGTP | 1<=ERKP]]]]]]

abstracting: (1<=ERKP) states: 67,744,017,220 (10)
abstracting: (3<=Raf_RasGTP) states: 36,723,849,718 (10)
abstracting: (ERK_MEKPP<=MEKPP_Phase2) states: 64,892,214,460 (10)
abstracting: (2<=ERKP_Phase3) states: 51,153,151,165 (10)
abstracting: (MEKPP_Phase2<=ERKP_MEKPP) states: 49,234,665,572 (10)
abstracting: (3<=ERKP_Phase3) states: 37,845,286,015 (10)
-> the formula is TRUE

FORMULA MAPK-PT-020-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: EF [[[[1<=ERK_MEKPP & Phase3<=ERK_MEKPP] | Phase2<=MEKPP] & [~ [Phase1<=ERK] & [2<=Raf & 3<=MEKPP]]]]
normalized: E [true U [[[2<=Raf & 3<=MEKPP] & ~ [Phase1<=ERK]] & [Phase2<=MEKPP | [1<=ERK_MEKPP & Phase3<=ERK_MEKPP]]]]

abstracting: (Phase3<=ERK_MEKPP) states: 235,204,431 (8)
abstracting: (1<=ERK_MEKPP) states: 40,547,502,060 (10)
abstracting: (Phase2<=MEKPP) states: 270,141,696 (8)
abstracting: (Phase1<=ERK) states: 8,420,402,396 (9)
abstracting: (3<=MEKPP) states: 16,079,210,945 (10)
abstracting: (2<=Raf) states: 69,343,275,025 (10)
-> the formula is TRUE

FORMULA MAPK-PT-020-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.447sec

checking: AG [[[[Raf_RasGTP<=ERKPP_Phase3 | MEK_RafP<=MEKP] & ~ [RafP_Phase1<=Raf_RasGTP]] | [[1<=Phase2 & 3<=MEKPP] | [ERK_MEKPP<=ERK | ERK<=Phase1]]]]
normalized: ~ [E [true U ~ [[[[1<=Phase2 & 3<=MEKPP] | [ERK_MEKPP<=ERK | ERK<=Phase1]] | [~ [RafP_Phase1<=Raf_RasGTP] & [Raf_RasGTP<=ERKPP_Phase3 | MEK_RafP<=MEKP]]]]]]

abstracting: (MEK_RafP<=MEKP) states: 59,760,229,504 (10)
abstracting: (Raf_RasGTP<=ERKPP_Phase3) states: 53,006,246,651 (10)
abstracting: (RafP_Phase1<=Raf_RasGTP) states: 30,259,451,376 (10)
abstracting: (ERK<=Phase1) states: 82,252,218,556 (10)
abstracting: (ERK_MEKPP<=ERK) states: 73,182,486,647 (10)
abstracting: (3<=MEKPP) states: 16,079,210,945 (10)
abstracting: (1<=Phase2) states: 88,080,740,340 (10)
-> the formula is FALSE

FORMULA MAPK-PT-020-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.982sec


Total processing time: 0m 8.949sec


BK_STOP 1463734519441

--------------------
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.002sec

635 829
iterations count:2640 (88), effective:430 (14)

initing FirstDep: 0m 0.000sec


iterations count:165 (5), effective:35 (1)
1094
iterations count:1043 (34), effective:173 (5)
1070
iterations count:1207 (40), effective:201 (6)

iterations count:150 (5), effective:30 (1)

iterations count:210 (7), effective:40 (1)

iterations count:165 (5), effective:35 (1)
943
iterations count:1127 (37), effective:183 (6)

iterations count:262 (8), effective:53 (1)
1257
iterations count:1133 (37), effective:184 (6)
891 1003
iterations count:2023 (67), effective:334 (11)

iterations count:189 (6), effective:39 (1)

iterations count:721 (24), effective:138 (4)
1016
iterations count:1845 (61), effective:337 (11)

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="MAPK-PT-020"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/hulinhub/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/MAPK-PT-020.tgz
mv MAPK-PT-020 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 MAPK-PT-020, 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 r065kn-blw3-146358913500313"
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 ;