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 MAPK-PT-008, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r031-blw7-149440473900205
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494456888279

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

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

net check time: 0m 0.000sec

init dd package: 0m 1.104sec

parse successfull
net created successfully

Net: MAPK_PT_008
(NrP: 22 NrTr: 30 NrArc: 90)

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

net check time: 0m 0.000sec

init dd package: 0m 3.629sec


RS generation: 0m 0.008sec


-> reachability set: #nodes 259 (2.6e+02) #states 6,110,643 (6)



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

checking: EF [2<=ERKPP_Phase3]
normalized: E [true U 2<=ERKPP_Phase3]

abstracting: (2<=ERKPP_Phase3)
states: 1,848,380 (6)
-> the formula is TRUE

FORMULA MAPK-PT-008-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

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

abstracting: (2<=ERKPP)
states: 1,848,380 (6)
-> the formula is FALSE

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

MC time: 0m 0.003sec

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

abstracting: (ERK<=MEKP_RafP)
states: 3,175,002 (6)
-> the formula is FALSE

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

MC time: 0m 0.022sec

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

abstracting: (MEKPP<=Raf)
states: 5,402,607 (6)
-> the formula is FALSE

FORMULA MAPK-PT-008-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

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

abstracting: (Raf<=ERKP_Phase3)
states: 2,634,993 (6)
-> the formula is TRUE

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

MC time: 0m 0.011sec

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

abstracting: (Phase2<=ERK_MEKPP)
states: 194,145 (5)
-> the formula is TRUE

FORMULA MAPK-PT-008-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: AG [[MEKP_Phase2<=Phase1 | 3<=MEKPP]]
normalized: ~ [E [true U ~ [[MEKP_Phase2<=Phase1 | 3<=MEKPP]]]]

abstracting: (3<=MEKPP)
states: 171,990 (5)
abstracting: (MEKP_Phase2<=Phase1)
states: 5,923,449 (6)
-> the formula is FALSE

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

MC time: 0m 0.017sec

checking: EF [[~ [RafP<=Phase3] & 3<=ERKP_Phase3]]
normalized: E [true U [3<=ERKP_Phase3 & ~ [RafP<=Phase3]]]

abstracting: (RafP<=Phase3)
states: 4,929,078 (6)
abstracting: (3<=ERKP_Phase3)
states: 863,522 (5)
-> the formula is TRUE

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

MC time: 0m 0.015sec

checking: AG [~ [[~ [Phase2<=Phase1] & [1<=MEKP_Phase2 & ERK_MEKPP<=ERKP_Phase3]]]]
normalized: ~ [E [true U [[1<=MEKP_Phase2 & ERK_MEKPP<=ERKP_Phase3] & ~ [Phase2<=Phase1]]]]

abstracting: (Phase2<=Phase1)
states: 4,731,405 (6)
abstracting: (ERK_MEKPP<=ERKP_Phase3)
states: 5,401,147 (6)
abstracting: (1<=MEKP_Phase2)
states: 2,358,384 (6)
-> the formula is FALSE

FORMULA MAPK-PT-008-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: EF [[[[2<=ERKP & RasGTP<=MEKP_Phase2] & ~ [3<=Phase1]] & MEK_RafP<=RafP_Phase1]]
normalized: E [true U [[[2<=ERKP & RasGTP<=MEKP_Phase2] & ~ [3<=Phase1]] & MEK_RafP<=RafP_Phase1]]

abstracting: (MEK_RafP<=RafP_Phase1)
states: 5,495,847 (6)
abstracting: (3<=Phase1)
states: 4,765,626 (6)
abstracting: (RasGTP<=MEKP_Phase2)
states: 2,639,546 (6)
abstracting: (2<=ERKP)
states: 1,848,380 (6)
-> the formula is TRUE

FORMULA MAPK-PT-008-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EF [[Phase2<=ERK_MEKPP & ~ [[MEKPP_Phase2<=ERKP_Phase3 & Phase2<=MEKP]]]]
normalized: E [true U [Phase2<=ERK_MEKPP & ~ [[MEKPP_Phase2<=ERKP_Phase3 & Phase2<=MEKP]]]]

abstracting: (Phase2<=MEKP)
states: 330,750 (5)
abstracting: (MEKPP_Phase2<=ERKP_Phase3)
states: 4,889,661 (6)
abstracting: (Phase2<=ERK_MEKPP)
states: 194,145 (5)
-> the formula is TRUE

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

MC time: 0m 0.034sec

checking: EF [[~ [[MEKP_RafP<=ERK & Phase2<=MEKPP]] & [~ [MEKPP_Phase2<=ERKP_Phase3] & 3<=MEKP]]]
normalized: E [true U [[3<=MEKP & ~ [MEKPP_Phase2<=ERKP_Phase3]] & ~ [[MEKP_RafP<=ERK & Phase2<=MEKPP]]]]

abstracting: (Phase2<=MEKPP)
states: 330,750 (5)
abstracting: (MEKP_RafP<=ERK)
states: 5,211,423 (6)
abstracting: (MEKPP_Phase2<=ERKP_Phase3)
states: 4,889,661 (6)
abstracting: (3<=MEKP)
states: 171,990 (5)
-> the formula is TRUE

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

MC time: 0m 0.013sec

checking: AG [[[[1<=RafP & ERK_MEKPP<=Raf] & [3<=ERKPP & 2<=Raf_RasGTP]] | MEKP<=MEKP]]
normalized: ~ [E [true U ~ [[MEKP<=MEKP | [[3<=ERKPP & 2<=Raf_RasGTP] & [1<=RafP & ERK_MEKPP<=Raf]]]]]]

abstracting: (ERK_MEKPP<=Raf)
states: 5,752,573 (6)
abstracting: (1<=RafP)
states: 4,701,298 (6)
abstracting: (2<=Raf_RasGTP)
states: 1,552,180 (6)
abstracting: (3<=ERKPP)
states: 863,522 (5)
abstracting: (MEKP<=MEKP)
states: 6,110,643 (6)
-> the formula is TRUE

FORMULA MAPK-PT-008-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[[2<=Phase1 & 2<=MEK_RafP] & ~ [ERKPP<=Raf_RasGTP]] & [~ [3<=Raf_RasGTP] | [ERKPP<=MEKPP_Phase2 & 1<=ERKP_Phase3]]]]
normalized: E [true U [[[ERKPP<=MEKPP_Phase2 & 1<=ERKP_Phase3] | ~ [3<=Raf_RasGTP]] & [~ [ERKPP<=Raf_RasGTP] & [2<=Phase1 & 2<=MEK_RafP]]]]

abstracting: (2<=MEK_RafP)
states: 434,994 (5)
abstracting: (2<=Phase1)
states: 5,416,560 (6)
abstracting: (ERKPP<=Raf_RasGTP)
states: 3,824,610 (6)
abstracting: (3<=Raf_RasGTP)
states: 0
abstracting: (1<=ERKP_Phase3)
states: 3,510,710 (6)
abstracting: (ERKPP<=MEKPP_Phase2)
states: 3,378,312 (6)
-> the formula is TRUE

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

MC time: 0m 0.013sec

checking: EF [[[[Phase3<=ERKP & 3<=MEKP_RafP] & [Phase1<=RafP | MEKP_RafP<=ERK_MEKPP]] & [~ [2<=MEK] & ~ [RafP<=MEKP_Phase2]]]]
normalized: E [true U [[[Phase1<=RafP | MEKP_RafP<=ERK_MEKPP] & [Phase3<=ERKP & 3<=MEKP_RafP]] & [~ [RafP<=MEKP_Phase2] & ~ [2<=MEK]]]]

abstracting: (2<=MEK)
states: 744,156 (5)
abstracting: (RafP<=MEKP_Phase2)
states: 2,047,605 (6)
abstracting: (3<=MEKP_RafP)
states: 72,912 (4)
abstracting: (Phase3<=ERKP)
states: 481,180 (5)
abstracting: (MEKP_RafP<=ERK_MEKPP)
states: 4,564,623 (6)
abstracting: (Phase1<=RafP)
states: 1,767,150 (6)
-> the formula is FALSE

FORMULA MAPK-PT-008-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[[Phase3<=ERKP_MEKPP & ~ [Phase1<=ERKPP]] | [[ERKP_MEKPP<=RasGTP | ERKPP<=Phase1] | [Raf_RasGTP<=MEK_RafP | 3<=MEKP_Phase2]]]]
normalized: ~ [E [true U ~ [[[Phase3<=ERKP_MEKPP & ~ [Phase1<=ERKPP]] | [[Raf_RasGTP<=MEK_RafP | 3<=MEKP_Phase2] | [ERKP_MEKPP<=RasGTP | ERKPP<=Phase1]]]]]]

abstracting: (ERKPP<=Phase1)
states: 5,672,318 (6)
abstracting: (ERKP_MEKPP<=RasGTP)
states: 5,669,538 (6)
abstracting: (3<=MEKP_Phase2)
states: 171,990 (5)
abstracting: (Raf_RasGTP<=MEK_RafP)
states: 3,233,398 (6)
abstracting: (Phase1<=ERKPP)
states: 910,315 (5)
abstracting: (Phase3<=ERKP_MEKPP)
states: 180,451 (5)
-> the formula is FALSE

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

MC time: 0m 0.034sec

totally nodes used: 62664 (6.3e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 372623 275137 647760
used/not used/entry size/cache size: 325966 66782898 16 1024MB
basic ops cache: hits/miss/sum: 86183 77032 163215
used/not used/entry size/cache size: 150005 16627211 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 10289 8226 18515
used/not used/entry size/cache size: 8226 8380382 32 256MB
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 67051323
1 56016
2 1066
3 148
4 65
5 60
6 18
7 31
8 14
9 12
>= 10 111

Total processing time: 0m 6.605sec


BK_STOP 1494456894962

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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

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:1074 (35), effective:172 (5)

initing FirstDep: 0m 0.000sec


iterations count:410 (13), effective:62 (2)

iterations count:412 (13), effective:62 (2)

iterations count:461 (15), effective:77 (2)

iterations count:166 (5), effective:28 (0)

iterations count:84 (2), effective:14 (0)

iterations count:234 (7), effective:36 (1)

iterations count:182 (6), effective:32 (1)

iterations count:403 (13), effective:66 (2)

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

iterations count:332 (11), effective:58 (1)

iterations count:535 (17), effective:87 (2)

iterations count:334 (11), effective:53 (1)

iterations count:351 (11), effective:57 (1)

iterations count:534 (17), effective:95 (3)

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-008"
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/MAPK-PT-008.tgz
mv MAPK-PT-008 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 MAPK-PT-008, 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 r031-blw7-149440473900205"
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 ;