fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution%20of%20r161kn-blw3-146416418700340
Last Updated
June 30, 2016

About the Execution of Marcie for S_MAPK-PT-160

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15936.890 3600000.00 3600029.00 29.80 F???T??TT?F?F?FT normal

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


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

=== Now, execution of the tool begins

BK_START 1464341564783


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_160
(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 4.023sec


RS generation: 0m12.371sec


-> reachability set: #nodes 45042 (4.5e+04) #states 106,396,433,139,394,621,907,453 (23)



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

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

abstracting: (1<=RasGTP) states: 104,571,148,199,640,250,206,980 (23)
-> the formula is FALSE

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

MC time: 0m54.391sec

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

abstracting: (3<=MEK) states: 82,209,879,900,049,660,017,330 (22)
-> the formula is FALSE

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

MC time: 3m13.967sec

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

abstracting: (3<=MEK) states: 82,209,879,900,049,660,017,330 (22)
-> the formula is TRUE

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

MC time: 0m17.185sec

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

abstracting: (1<=Phase2) states: 106,396,432,834,043,147,977,082 (23)
-> the formula is TRUE

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

MC time: 3m52.170sec

checking: EF [Phase3<=ERKPP]
normalized: E [true U Phase3<=ERKPP]

abstracting: (Phase3<=ERKPP) states: 1,015,627,556,085,066,727 (18)

FORMULA MAPK-PT-160-ReachabilityCardinality-1 CANNOT_COMPUTE

MC time: 1m25.827sec

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


before gc: list nodes free: 16

after gc: idd nodes used:45067, unused:63954933; list nodes free:690471010
abstracting: (MEK<=RasGTP) states: 85,476,798,739,218,275,317,865 (22)
-> the formula is TRUE

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

MC time: 1m36.618sec

checking: AG [[3<=RafP | 2<=Phase2]]
normalized: ~ [E [true U ~ [[3<=RafP | 2<=Phase2]]]]

abstracting: (2<=Phase2) states: 106,396,430,749,874,575,281,642 (23)
abstracting: (3<=RafP) states: 101,577,431,990,007,528,959,316 (23)
-> the formula is FALSE

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

MC time: 3m31.418sec

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

abstracting: (RafP<=MEK) states: 16,356,120,727,274,107,082,193 (22)
-> the formula is FALSE

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

MC time: 3m 5.989sec

checking: EF [Phase3<=MEKP_RafP]
normalized: E [true U Phase3<=MEKP_RafP]


before gc: list nodes free: 184

after gc: idd nodes used:45184, unused:63954816; list nodes free:690470422
abstracting: (Phase3<=MEKP_RafP) states: 277,701,390,712,417,748,141 (20)

before gc: list nodes free: 20629819

after gc: idd nodes used:991859, unused:63008141; list nodes free:677106374

before gc: list nodes free: 116089321

after gc: idd nodes used:955301, unused:63044699; list nodes free:677407881

before gc: list nodes free: 140469099

after gc: idd nodes used:692696, unused:63307304; list nodes free:680933822
-> the formula is TRUE

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

MC time: 38m55.358sec

checking: AG [[~ [[3<=ERKPP & RafP<=Raf]] | 2<=ERK]]
normalized: ~ [E [true U ~ [[2<=ERK | ~ [[3<=ERKPP & RafP<=Raf]]]]]]

abstracting: (RafP<=Raf) states: 53,602,325,169,490,666,961,711 (22)
abstracting: (3<=ERKPP) states: 95,011,576,130,733,502,177,222 (22)
abstracting: (2<=ERK) states: 98,698,513,935,436,414,461,630 (22)

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

6307 6456 6674 13266 16059 19637 23860 23900 23861 20609 20310 20354 30114 31344 44624 34464 35769 36795 39819 38284
iterations count:20910 (697), effective:3440 (114)

initing FirstDep: 0m 0.000sec


iterations count:350 (11), effective:120 (4)
46370
iterations count:1434 (47), effective:312 (10)
46370
iterations count:1434 (47), effective:312 (10)
24460 27889 32200 38982
iterations count:4430 (147), effective:800 (26)
33370 30605 32236std::bad_alloc


iterations count:830 (27), effective:200 (6)
22952 25895 29567 35026 44812
iterations count:5045 (168), effective:986 (32)
46638
iterations count:1083 (36), effective:243 (8)
460960 438880 423866 334162 190038 42128 51261 56004 44349 44853
iterations count:10110 (337), effective:1800 (60)
47260

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-160"
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/S_MAPK-PT-160.tgz
mv S_MAPK-PT-160 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-160, 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 r161kn-blw3-146416418700340"
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 ;