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-2265
Executing tool marcie
Input is Diffusion2D-PT-D05N200, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r022kn-blw3-143214376400138
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432485801579

Model: Diffusion2D-PT-D05N200
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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=ReachabilityBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 25 NrTr: 144 NrArc: 288)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m2sec


RS generation: 0m18sec


-> reachability set: #nodes 4825 (4.8e+03) #states 114,386,128,575,629,019,874,142,761,713,876 (32)



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

checking: [maxVal(cAMP__3_3_)<=3 & maxVal(cAMP__3_2_)<=2]
normalized: [maxVal(cAMP__3_3_)<=3 & maxVal(cAMP__3_2_)<=2]

abstracting: (200<=2) states: 0
abstracting: (200<=3) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N200-ReachabilityBounds-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(cAMP__5_2_)<=1 & maxVal(cAMP__4_5_)<=1] & maxVal(cAMP__2_4_)<=2]
normalized: [maxVal(cAMP__2_4_)<=2 & [maxVal(cAMP__5_2_)<=1 & maxVal(cAMP__4_5_)<=1]]

abstracting: (200<=1) states: 0
abstracting: (200<=1) states: 0
abstracting: (200<=2) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N200-ReachabilityBounds-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(cAMP__3_1_)<=1 & maxVal(cAMP__1_4_)<=2] & [maxVal(cAMP__4_3_)<=1 & maxVal(cAMP__3_3_)<=3]]
normalized: [[maxVal(cAMP__4_3_)<=1 & maxVal(cAMP__3_3_)<=3] & [maxVal(cAMP__3_1_)<=1 & maxVal(cAMP__1_4_)<=2]]

abstracting: (200<=2) states: 0
abstracting: (200<=1) states: 0
abstracting: (200<=3) states: 0
abstracting: (200<=1) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N200-ReachabilityBounds-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(cAMP__3_4_)<=1 & maxVal(cAMP__5_5_)<=1]
normalized: [maxVal(cAMP__3_4_)<=1 & maxVal(cAMP__5_5_)<=1]

abstracting: (200<=1) states: 0
abstracting: (200<=1) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N200-ReachabilityBounds-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__4_1_)<=1
normalized: maxVal(cAMP__4_1_)<=1

abstracting: (200<=1) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N200-ReachabilityBounds-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__1_3_)<=2
normalized: maxVal(cAMP__1_3_)<=2

abstracting: (200<=2) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N200-ReachabilityBounds-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__3_5_)<=2
normalized: maxVal(cAMP__3_5_)<=2

abstracting: (200<=2) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N200-ReachabilityBounds-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(cAMP__2_1_)<=3 & [[[[[maxVal(cAMP__5_1_)<=2 & maxVal(cAMP__5_5_)<=2] & [maxVal(cAMP__3_1_)<=3 & maxVal(cAMP__1_1_)<=2]] & maxVal(cAMP__4_2_)<=3] & maxVal(cAMP__1_4_)<=1] & maxVal(cAMP__5_5_)<=3]]
normalized: [maxVal(cAMP__2_1_)<=3 & [maxVal(cAMP__5_5_)<=3 & [maxVal(cAMP__1_4_)<=1 & [maxVal(cAMP__4_2_)<=3 & [[maxVal(cAMP__5_1_)<=2 & maxVal(cAMP__5_5_)<=2] & [maxVal(cAMP__3_1_)<=3 & maxVal(cAMP__1_1_)<=2]]]]]]

abstracting: (200<=2) states: 0
abstracting: (200<=3) states: 0
abstracting: (200<=2) states: 0
abstracting: (200<=2) states: 0
abstracting: (200<=3) states: 0
abstracting: (200<=1) states: 0
abstracting: (200<=3) states: 0
abstracting: (200<=3) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N200-ReachabilityBounds-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__5_4_)<=1
normalized: maxVal(cAMP__5_4_)<=1

abstracting: (200<=1) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N200-ReachabilityBounds-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__4_4_)<=2
normalized: maxVal(cAMP__4_4_)<=2

abstracting: (200<=2) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N200-ReachabilityBounds-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__3_1_)<=2
normalized: maxVal(cAMP__3_1_)<=2

abstracting: (200<=2) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N200-ReachabilityBounds-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__2_5_)<=2
normalized: maxVal(cAMP__2_5_)<=2

abstracting: (200<=2) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N200-ReachabilityBounds-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__5_4_)<=3
normalized: maxVal(cAMP__5_4_)<=3

abstracting: (200<=3) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N200-ReachabilityBounds-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__3_2_)<=2
normalized: maxVal(cAMP__3_2_)<=2

abstracting: (200<=2) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N200-ReachabilityBounds-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__5_1_)<=3
normalized: maxVal(cAMP__5_1_)<=3

abstracting: (200<=3) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N200-ReachabilityBounds-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[[[maxVal(cAMP__1_2_)<=2 & maxVal(cAMP__4_4_)<=2] & maxVal(cAMP__2_5_)<=2] & maxVal(cAMP__5_1_)<=1] & [maxVal(cAMP__2_3_)<=1 & maxVal(cAMP__3_5_)<=1]] & [[[maxVal(cAMP__5_3_)<=3 & [maxVal(cAMP__4_1_)<=2 & maxVal(cAMP__3_3_)<=3]] & maxVal(cAMP__2_5_)<=2] & maxVal(cAMP__4_5_)<=3]] & maxVal(cAMP__1_4_)<=2]
normalized: [maxVal(cAMP__1_4_)<=2 & [[[maxVal(cAMP__2_3_)<=1 & maxVal(cAMP__3_5_)<=1] & [maxVal(cAMP__5_1_)<=1 & [maxVal(cAMP__2_5_)<=2 & [maxVal(cAMP__1_2_)<=2 & maxVal(cAMP__4_4_)<=2]]]] & [maxVal(cAMP__4_5_)<=3 & [maxVal(cAMP__2_5_)<=2 & [maxVal(cAMP__5_3_)<=3 & [maxVal(cAMP__4_1_)<=2 & maxVal(cAMP__3_3_)<=3]]]]]]

abstracting: (200<=3) states: 0
abstracting: (200<=2) states: 0
abstracting: (200<=3) states: 0
abstracting: (200<=2) states: 0
abstracting: (200<=3) states: 0
abstracting: (200<=2) states: 0
abstracting: (200<=2) states: 0
abstracting: (200<=2) states: 0
abstracting: (200<=1) states: 0
abstracting: (200<=1) states: 0
abstracting: (200<=1) states: 0
abstracting: (200<=2) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N200-ReachabilityBounds-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m38sec


BK_STOP 1432485839843

--------------------
content from stderr:

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: 0m0sec

80 136 192 248 304 383 443 503 563 623 683 743 854 918 982 1046 1110 1174 1238 1381 1449 1517 1585 1653 1721 1789 1857 2036 2108 2180 2252 2324 2396 2468 2679 2755 2831 2907 3138 3218 3298 3378 3458 3713 3797 3881 4339 2508 2560 2612 2641 2662 2684 2705 2726 2747 2769 2790 2811 2835 2866 2896 2926 2957 2987 3017 3037 3052 3067 3083 3098 3113 3129 3144 3160 3175 3190 3206 3221 3239 3259 3279 3298 3318 3337 3357 3377 3396 3416 3435 3453 3471 3489 3507 3526 3544 3562 3580 3598 3617 3632 3646 3660 3673 3687 3701 3715 3728 3742 3756 3769 3783 3797 3810 3824 3856 3891 3925 3960 3994 4027 4045 4062 4080 4097 4115 4132 4150 4167 4185 4202 4220 4237 4254 4271 4288 4305 4322 4339 4356 4373 4389 4406 4423 4452 4482 4512 4543 4573 4603 4636 4676 4716 4756 4796
iterations count:155744 (1081), effective:4800 (33)

initing FirstDep: 0m0sec

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="Diffusion2D-PT-D05N200"
export BK_EXAMINATION="ReachabilityBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/user/u8/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/Diffusion2D-PT-D05N200.tgz
mv Diffusion2D-PT-D05N200 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is Diffusion2D-PT-D05N200, examination is ReachabilityBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r022kn-blw3-143214376400138"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityBounds" != "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 "ReachabilityBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityBounds.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 '' ReachabilityBounds.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 ;