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 S_MAPK-PT-080, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161kn-blw3-146416418700327
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464341427722


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=CTLCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: MAPK_PT_080
(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.700sec


RS generation: 0m 1.127sec


-> reachability set: #nodes 11932 (1.2e+04) #states 5,634,903,909,420,423,840 (18)



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

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

abstracting: (3<=ERKPP) states: 4,504,831,172,343,094,234 (18)
-> the formula is FALSE

FORMULA MAPK-PT-080-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.152sec

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

abstracting: (1<=ERK) states: 5,236,807,571,553,594,730 (18)
abstracting: (1<=RafP_Phase1) states: 5,456,047,635,655,681,980 (18)
-> the formula is TRUE

FORMULA MAPK-PT-080-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.513sec

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

abstracting: (Raf<=RasGTP) states: 1,800,333,752,566,862,820 (18)
.-> the formula is FALSE

FORMULA MAPK-PT-080-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.208sec

checking: EG [EF [~ [Raf_RasGTP<=Phase1]]]
normalized: EG [E [true U ~ [Raf_RasGTP<=Phase1]]]

abstracting: (Raf_RasGTP<=Phase1) states: 5,468,083,710,663,968,485 (18)

EG iterations: 0
-> the formula is TRUE

FORMULA MAPK-PT-080-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.836sec

checking: AG [[ERKP_Phase3<=Raf_RasGTP | EF [2<=Phase2]]]
normalized: ~ [E [true U ~ [[ERKP_Phase3<=Raf_RasGTP | E [true U 2<=Phase2]]]]]

abstracting: (2<=Phase2) states: 5,634,893,429,429,561,184 (18)
abstracting: (ERKP_Phase3<=Raf_RasGTP) states: 2,812,929,265,737,497,304 (18)
-> the formula is TRUE

FORMULA MAPK-PT-080-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.145sec

checking: EF [EX [[Phase1<=ERKP_MEKPP & 3<=MEKP_RafP]]]
normalized: E [true U EX [[Phase1<=ERKP_MEKPP & 3<=MEKP_RafP]]]

abstracting: (3<=MEKP_RafP) states: 3,123,442,203,130,395,858 (18)
abstracting: (Phase1<=ERKP_MEKPP) states: 88,938,998,294,073,804 (16)
.-> the formula is TRUE

FORMULA MAPK-PT-080-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 2.136sec

checking: EF [[3<=ERKP & ~ [[1<=MEK_RafP & RafP<=Raf_RasGTP]]]]
normalized: E [true U [3<=ERKP & ~ [[1<=MEK_RafP & RafP<=Raf_RasGTP]]]]

abstracting: (RafP<=Raf_RasGTP) states: 1,614,365,216,569,401,172 (18)
abstracting: (1<=MEK_RafP) states: 4,650,781,599,537,436,350 (18)
abstracting: (3<=ERKP) states: 4,504,831,172,343,094,234 (18)
-> the formula is TRUE

FORMULA MAPK-PT-080-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.993sec

checking: E [ERKPP_Phase3<=MEK U AG [ERKP_Phase3<=ERKP]]
normalized: E [ERKPP_Phase3<=MEK U ~ [E [true U ~ [ERKP_Phase3<=ERKP]]]]

abstracting: (ERKP_Phase3<=ERKP) states: 2,919,736,604,089,942,894 (18)
abstracting: (ERKPP_Phase3<=MEK) states: 1,867,371,330,764,512,950 (18)
-> the formula is FALSE

FORMULA MAPK-PT-080-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m12.101sec

checking: EG [[AX [MEKPP<=MEK] & EF [Raf<=RasGTP]]]
normalized: EG [[E [true U Raf<=RasGTP] & ~ [EX [~ [MEKPP<=MEK]]]]]

abstracting: (MEKPP<=MEK) states: 3,042,210,437,429,479,866 (18)
.abstracting: (Raf<=RasGTP) states: 1,800,333,752,566,862,820 (18)
.
EG iterations: 1
-> the formula is TRUE

FORMULA MAPK-PT-080-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.017sec

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

abstracting: (ERKP_MEKPP<=ERKP) states: 4,426,511,893,448,890,448 (18)
abstracting: (Phase1<=RasGTP) states: 393,479,331,188,818,155 (17)
abstracting: (2<=Phase1) states: 5,608,291,465,365,915,304 (18)
-> the formula is FALSE

FORMULA MAPK-PT-080-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m46.797sec

checking: E [AF [ERKPP_Phase3<=Raf_RasGTP] U [[3<=MEKP_RafP | 2<=ERKP_MEKPP] | 2<=MEKPP_Phase2]]
normalized: E [~ [EG [~ [ERKPP_Phase3<=Raf_RasGTP]]] U [2<=MEKPP_Phase2 | [3<=MEKP_RafP | 2<=ERKP_MEKPP]]]

abstracting: (2<=ERKP_MEKPP) states: 3,504,511,893,657,893,424 (18)
abstracting: (3<=MEKP_RafP) states: 3,123,442,203,130,395,858 (18)
abstracting: (2<=MEKPP_Phase2) states: 4,059,600,091,186,934,348 (18)
abstracting: (ERKPP_Phase3<=Raf_RasGTP) states: 2,812,929,265,737,497,304 (18)
..
EG iterations: 2
-> the formula is TRUE

FORMULA MAPK-PT-080-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m33.618sec

checking: EF [[~ [[1<=RafP_Phase1 | MEKP<=ERKP]] & [[1<=RafP_Phase1 | 2<=MEK_RafP] & ~ [2<=Phase3]]]]
normalized: E [true U [[~ [2<=Phase3] & [1<=RafP_Phase1 | 2<=MEK_RafP]] & ~ [[1<=RafP_Phase1 | MEKP<=ERKP]]]]

abstracting: (MEKP<=ERKP) states: 4,076,483,351,005,334,820 (18)
abstracting: (1<=RafP_Phase1) states: 5,456,047,635,655,681,980 (18)
abstracting: (2<=MEK_RafP) states: 3,820,663,975,153,611,204 (18)
abstracting: (1<=RafP_Phase1) states: 5,456,047,635,655,681,980 (18)
abstracting: (2<=Phase3) states: 5,634,779,271,134,439,276 (18)
-> the formula is TRUE

FORMULA MAPK-PT-080-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.077sec

checking: EF [[~ [1<=MEK] & [[Phase1<=RafP & 2<=MEKPP] & [3<=ERKP_MEKPP & MEKPP_Phase2<=MEK_RafP]]]]
normalized: E [true U [[[3<=ERKP_MEKPP & MEKPP_Phase2<=MEK_RafP] & [Phase1<=RafP & 2<=MEKPP]] & ~ [1<=MEK]]]

abstracting: (1<=MEK) states: 4,793,059,919,194,204,860 (18)
abstracting: (2<=MEKPP) states: 4,059,600,091,186,934,348 (18)
abstracting: (Phase1<=RafP) states: 758,527,799,433,603,120 (17)
abstracting: (MEKPP_Phase2<=MEK_RafP) states: 2,844,549,402,251,466,265 (18)
abstracting: (3<=ERKP_MEKPP) states: 2,741,724,210,690,654,393 (18)
-> the formula is TRUE

FORMULA MAPK-PT-080-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m33.175sec

checking: AG [[AG [MEKP_RafP<=RasGTP] | [ERKPP_Phase3<=Phase1 & [3<=MEK & Phase3<=MEKP_RafP]]]]
normalized: ~ [E [true U ~ [[[ERKPP_Phase3<=Phase1 & [3<=MEK & Phase3<=MEKP_RafP]] | ~ [E [true U ~ [MEKP_RafP<=RasGTP]]]]]]]

abstracting: (MEKP_RafP<=RasGTP) states: 4,730,124,033,489,881,070 (18)

BK_TIME_CONFINEMENT_REACHED

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

1838 3642 5301 5500 5719 5588 11864 9244 9829 10095
iterations count:10470 (349), effective:1720 (57)

initing FirstDep: 0m 0.000sec


iterations count:603 (20), effective:93 (3)

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

iterations count:505 (16), effective:119 (3)

iterations count:894 (29), effective:206 (6)

iterations count:56 (1), effective:4 (0)
11425
iterations count:1190 (39), effective:261 (8)

iterations count:407 (13), effective:77 (2)
12778 15218 12823
iterations count:3423 (114), effective:567 (18)

iterations count:510 (17), effective:120 (4)
14004 12282 12087
iterations count:3152 (105), effective:582 (19)

iterations count:377 (12), effective:65 (2)
6623 9833 8049 11082 11613 11372
iterations count:6194 (206), effective:1099 (36)
14276 11156
iterations count:2500 (83), effective:480 (16)

iterations count:266 (8), effective:74 (2)

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_MAPK-PT-080"
export BK_EXAMINATION="CTLCardinality"
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/S_MAPK-PT-080.tgz
mv S_MAPK-PT-080 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 S_MAPK-PT-080, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r161kn-blw3-146416418700327"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;