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

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

=== Now, execution of the tool begins

BK_START 1464341395012


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_040
(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.834sec


RS generation: 0m 0.233sec


-> reachability set: #nodes 3327 (3.3e+03) #states 478,293,389,221,095 (14)



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

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

abstracting: (MEKPP<=ERK) states: 351,786,678,760,665 (14)
-> the formula is FALSE

FORMULA MAPK-PT-040-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.280sec

checking: EF [[AF [3<=Raf_RasGTP] & EG [3<=MEKP_RafP]]]
normalized: E [true U [EG [3<=MEKP_RafP] & ~ [EG [~ [3<=Raf_RasGTP]]]]]

abstracting: (3<=Raf_RasGTP) states: 316,962,595,548,524 (14)
.
EG iterations: 1
abstracting: (3<=MEKP_RafP) states: 156,121,732,727,640 (14)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.775sec

checking: EF [MEK<=ERK_MEKPP]
normalized: E [true U MEK<=ERK_MEKPP]

abstracting: (MEK<=ERK_MEKPP) states: 238,961,664,204,931 (14)
-> the formula is TRUE

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

MC time: 0m 1.921sec

checking: AF [~ [AG [MEKP_RafP<=Phase1]]]
normalized: ~ [EG [~ [E [true U ~ [MEKP_RafP<=Phase1]]]]]

abstracting: (MEKP_RafP<=Phase1) states: 473,160,786,299,235 (14)
.
EG iterations: 1
-> the formula is TRUE

FORMULA MAPK-PT-040-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.079sec

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

abstracting: (Phase2<=MEKPP) states: 76,714,761,816 (10)
-> the formula is TRUE

FORMULA MAPK-PT-040-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.509sec

checking: AF [EF [[MEKP<=Phase1 & 3<=MEKPP]]]
normalized: ~ [EG [~ [E [true U [MEKP<=Phase1 & 3<=MEKPP]]]]]

abstracting: (3<=MEKPP) states: 187,175,191,943,790 (14)
abstracting: (MEKP<=Phase1) states: 467,876,349,943,666 (14)
.
EG iterations: 1
-> the formula is TRUE

FORMULA MAPK-PT-040-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.499sec

checking: E [EX [MEKP<=MEKPP_Phase2] U AX [1<=ERK_MEKPP]]
normalized: E [EX [MEKP<=MEKPP_Phase2] U ~ [EX [~ [1<=ERK_MEKPP]]]]

abstracting: (1<=ERK_MEKPP) states: 308,783,391,699,665 (14)
.abstracting: (MEKP<=MEKPP_Phase2) states: 273,715,601,971,329 (14)
.-> the formula is TRUE

FORMULA MAPK-PT-040-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.957sec

checking: E [~ [[RafP<=RasGTP & 1<=ERKP]] U AF [2<=ERKP_Phase3]]
normalized: E [~ [[RafP<=RasGTP & 1<=ERKP]] U ~ [EG [~ [2<=ERKP_Phase3]]]]

abstracting: (2<=ERKP_Phase3) states: 358,949,521,865,990 (14)
.
EG iterations: 1
abstracting: (1<=ERKP) states: 415,381,133,003,140 (14)
abstracting: (RafP<=RasGTP) states: 161,399,073,962,970 (14)
-> the formula is TRUE

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

MC time: 0m 7.437sec

checking: ~ [E [[2<=Phase2 | 1<=MEKP_Phase2] U Phase2<=Raf_RasGTP]]
normalized: ~ [E [[2<=Phase2 | 1<=MEKP_Phase2] U Phase2<=Raf_RasGTP]]

abstracting: (Phase2<=Raf_RasGTP) states: 9,745,687,990,468 (12)
abstracting: (1<=MEKP_Phase2) states: 355,287,985,065,900 (14)
abstracting: (2<=Phase2) states: 478,242,116,742,079 (14)
-> the formula is FALSE

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

MC time: 0m 2.504sec

checking: E [EG [MEK<=MEKP_RafP] U EF [MEK<=MEKP_Phase2]]
normalized: E [EG [MEK<=MEKP_RafP] U E [true U MEK<=MEKP_Phase2]]

abstracting: (MEK<=MEKP_Phase2) states: 273,715,601,971,329 (14)
abstracting: (MEK<=MEKP_RafP) states: 257,581,746,861,581 (14)
.
EG iterations: 1
-> the formula is TRUE

FORMULA MAPK-PT-040-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.169sec

checking: EF [EF [[MEK<=MEKP & Phase1<=ERKP_MEKPP]]]
normalized: E [true U E [true U [MEK<=MEKP & Phase1<=ERKP_MEKPP]]]

abstracting: (Phase1<=ERKP_MEKPP) states: 9,620,256,016,528 (12)
abstracting: (MEK<=MEKP) states: 273,715,601,971,329 (14)
-> the formula is TRUE

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

MC time: 0m 6.603sec

checking: AG [[EF [2<=Phase1] | [~ [1<=MEK_RafP] & [Phase2<=ERK | 1<=MEKPP]]]]
normalized: ~ [E [true U ~ [[[[Phase2<=ERK | 1<=MEKPP] & ~ [1<=MEK_RafP]] | E [true U 2<=Phase1]]]]]

abstracting: (2<=Phase1) states: 472,917,438,112,662 (14)
abstracting: (1<=MEK_RafP) states: 334,955,717,201,040 (14)
abstracting: (1<=MEKPP) states: 355,287,985,065,900 (14)
abstracting: (Phase2<=ERK) states: 38,066,769,500,238 (13)
-> the formula is TRUE

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

MC time: 0m 0.702sec

checking: ~ [AG [[[3<=MEK_RafP & Phase3<=RafP_Phase1] | [Phase2<=MEK | 2<=Phase1]]]]
normalized: E [true U ~ [[[Phase2<=MEK | 2<=Phase1] | [3<=MEK_RafP & Phase3<=RafP_Phase1]]]]

abstracting: (Phase3<=RafP_Phase1) states: 92,339,117,634,057 (13)
abstracting: (3<=MEK_RafP) states: 156,121,732,727,640 (14)
abstracting: (2<=Phase1) states: 472,917,438,112,662 (14)
abstracting: (Phase2<=MEK) states: 76,714,761,816 (10)
-> the formula is TRUE

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

MC time: 0m 3.539sec

checking: AG [[[[2<=ERKP_Phase3 | 2<=ERKP] | ~ [RafP_Phase1<=ERK_MEKPP]] | ERKP_MEKPP<=Phase3]]
normalized: ~ [E [true U ~ [[ERKP_MEKPP<=Phase3 | [~ [RafP_Phase1<=ERK_MEKPP] | [2<=ERKP_Phase3 | 2<=ERKP]]]]]]

abstracting: (2<=ERKP) states: 358,949,521,865,990 (14)
abstracting: (2<=ERKP_Phase3) states: 358,949,521,865,990 (14)
abstracting: (RafP_Phase1<=ERK_MEKPP) states: 74,260,546,497,390 (13)
abstracting: (ERKP_MEKPP<=Phase3) states: 478,293,389,221,095 (14)
-> the formula is TRUE

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

MC time: 0m 0.300sec

checking: ~ [E [[1<=ERKPP_Phase3 | ERKP<=ERKP] U [2<=ERKPP_Phase3 & Phase1<=ERKP_Phase3]]]
normalized: ~ [E [[1<=ERKPP_Phase3 | ERKP<=ERKP] U [2<=ERKPP_Phase3 & Phase1<=ERKP_Phase3]]]

abstracting: (Phase1<=ERKP_Phase3) states: 37,067,030,575,887 (13)
abstracting: (2<=ERKPP_Phase3) states: 358,949,521,865,990 (14)
abstracting: (ERKP<=ERKP) states: 478,293,389,221,095 (14)
abstracting: (1<=ERKPP_Phase3) states: 415,381,133,003,140 (14)
-> the formula is FALSE

FORMULA MAPK-PT-040-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.736sec

checking: [EF [EX [3<=MEKPP_Phase2]] | [[[Phase3<=RasGTP | ~ [2<=ERKP]] & [MEK<=RafP_Phase1 & ~ [ERK<=Raf]]] | [[[1<=MEKP_RafP & 2<=MEK_RafP] & [3<=ERKP_Phase3 & 1<=Raf]] & 3<=ERKP_Phase3]]]
normalized: [[[3<=ERKP_Phase3 & [[3<=ERKP_Phase3 & 1<=Raf] & [1<=MEKP_RafP & 2<=MEK_RafP]]] | [[MEK<=RafP_Phase1 & ~ [ERK<=Raf]] & [Phase3<=RasGTP | ~ [2<=ERKP]]]] | E [true U EX [3<=MEKPP_Phase2]]]

abstracting: (3<=MEKPP_Phase2) states: 187,175,191,943,790 (14)
.abstracting: (2<=ERKP) states: 358,949,521,865,990 (14)
abstracting: (Phase3<=RasGTP) states: 13,878,562,641,870 (13)
abstracting: (ERK<=Raf) states: 346,914,866,108,663 (14)
abstracting: (MEK<=RafP_Phase1) states: 410,620,100,810,895 (14)
abstracting: (2<=MEK_RafP) states: 230,738,678,087,340 (14)
abstracting: (1<=MEKP_RafP) states: 334,955,717,201,040 (14)
abstracting: (1<=Raf) states: 450,680,841,133,320 (14)
abstracting: (3<=ERKP_Phase3) states: 308,532,129,402,744 (14)
abstracting: (3<=ERKP_Phase3) states: 308,532,129,402,744 (14)
-> the formula is TRUE

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

MC time: 0m 3.669sec


Total processing time: 0m53.452sec


BK_STOP 1464341448518

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

1081 1611 1655 2634 2859
iterations count:5250 (175), effective:860 (28)

initing FirstDep: 0m 0.000sec

3182 3291
iterations count:2359 (78), effective:395 (13)

iterations count:282 (9), effective:51 (1)

iterations count:390 (13), effective:80 (2)

iterations count:506 (16), effective:114 (3)

iterations count:990 (33), effective:180 (6)

iterations count:293 (9), effective:59 (1)

iterations count:258 (8), effective:38 (1)

iterations count:508 (16), effective:132 (4)

iterations count:660 (22), effective:130 (4)

iterations count:390 (13), effective:80 (2)

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

iterations count:870 (29), effective:190 (6)

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

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

iterations count:545 (18), effective:121 (4)

iterations count:880 (29), effective:172 (5)

iterations count:269 (8), effective:41 (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_MAPK-PT-040"
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-040.tgz
mv S_MAPK-PT-040 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-040, 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-146416418700318"
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 ;