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_Diffusion2D-PT-D05N010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r149kn-smll-146416258000061
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464190059995


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: Diffusion2D_PT_D05N010
(NrP: 25 NrTr: 144 NrArc: 288)

net check time: 0m 0.000sec

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

init dd package: 0m 4.347sec


RS generation: 0m 0.017sec


-> reachability set: #nodes 265 (2.6e+02) #states 131,128,140 (8)



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

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

abstracting: (3<=cAMP__1_2_) states: 2,629,575 (6)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.047sec

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

abstracting: (3<=cAMP__3_5_) states: 2,629,575 (6)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.044sec

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

abstracting: (3<=cAMP__1_4_) states: 2,629,575 (6)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

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

abstracting: (2<=cAMP__1_2_) states: 10,518,300 (7)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

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

abstracting: (3<=cAMP__1_1_) states: 2,629,575 (6)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

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

abstracting: (3<=cAMP__5_2_) states: 2,629,575 (6)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.048sec

checking: EF [[~ [2<=cAMP__1_5_] & 2<=cAMP__1_2_]]
normalized: E [true U [2<=cAMP__1_2_ & ~ [2<=cAMP__1_5_]]]

abstracting: (2<=cAMP__1_5_) states: 10,518,300 (7)
abstracting: (2<=cAMP__1_2_) states: 10,518,300 (7)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: AG [[[~ [cAMP__1_1_<=cAMP__4_1_] & 2<=cAMP__2_5_] | ~ [cAMP__3_3_<=cAMP__2_2_]]]
normalized: ~ [E [true U ~ [[~ [cAMP__3_3_<=cAMP__2_2_] | [2<=cAMP__2_5_ & ~ [cAMP__1_1_<=cAMP__4_1_]]]]]]

abstracting: (cAMP__1_1_<=cAMP__4_1_) states: 100,942,636 (8)
abstracting: (2<=cAMP__2_5_) states: 10,518,300 (7)
abstracting: (cAMP__3_3_<=cAMP__2_2_) states: 100,942,636 (8)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: EF [[cAMP__1_1_<=cAMP__2_2_ & [~ [cAMP__1_3_<=cAMP__2_3_] & 3<=cAMP__3_4_]]]
normalized: E [true U [cAMP__1_1_<=cAMP__2_2_ & [3<=cAMP__3_4_ & ~ [cAMP__1_3_<=cAMP__2_3_]]]]

abstracting: (cAMP__1_3_<=cAMP__2_3_) states: 100,942,636 (8)
abstracting: (3<=cAMP__3_4_) states: 2,629,575 (6)
abstracting: (cAMP__1_1_<=cAMP__2_2_) states: 100,942,636 (8)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.056sec

checking: AG [[~ [[cAMP__2_5_<=cAMP__3_4_ | cAMP__1_4_<=cAMP__5_4_]] | 3<=cAMP__3_3_]]
normalized: ~ [E [true U ~ [[3<=cAMP__3_3_ | ~ [[cAMP__2_5_<=cAMP__3_4_ | cAMP__1_4_<=cAMP__5_4_]]]]]]

abstracting: (cAMP__1_4_<=cAMP__5_4_) states: 100,942,636 (8)
abstracting: (cAMP__2_5_<=cAMP__3_4_) states: 100,942,636 (8)
abstracting: (3<=cAMP__3_3_) states: 2,629,575 (6)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: AG [~ [[[cAMP__5_2_<=cAMP__3_2_ | 3<=cAMP__5_5_] & cAMP__3_3_<=cAMP__2_4_]]]
normalized: ~ [E [true U [cAMP__3_3_<=cAMP__2_4_ & [cAMP__5_2_<=cAMP__3_2_ | 3<=cAMP__5_5_]]]]

abstracting: (3<=cAMP__5_5_) states: 2,629,575 (6)
abstracting: (cAMP__5_2_<=cAMP__3_2_) states: 100,942,636 (8)
abstracting: (cAMP__3_3_<=cAMP__2_4_) states: 100,942,636 (8)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.118sec

checking: AG [[~ [[3<=cAMP__1_4_ | cAMP__1_4_<=cAMP__4_3_]] | [~ [3<=cAMP__5_5_] | ~ [3<=cAMP__3_5_]]]]
normalized: ~ [E [true U ~ [[[~ [3<=cAMP__3_5_] | ~ [3<=cAMP__5_5_]] | ~ [[3<=cAMP__1_4_ | cAMP__1_4_<=cAMP__4_3_]]]]]]

abstracting: (cAMP__1_4_<=cAMP__4_3_) states: 100,942,636 (8)
abstracting: (3<=cAMP__1_4_) states: 2,629,575 (6)
abstracting: (3<=cAMP__5_5_) states: 2,629,575 (6)
abstracting: (3<=cAMP__3_5_) states: 2,629,575 (6)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.072sec

checking: EF [[2<=cAMP__3_5_ & [[cAMP__3_3_<=cAMP__5_5_ | 2<=cAMP__4_4_] | [1<=cAMP__2_3_ & cAMP__1_2_<=cAMP__3_1_]]]]
normalized: E [true U [2<=cAMP__3_5_ & [[cAMP__3_3_<=cAMP__5_5_ | 2<=cAMP__4_4_] | [1<=cAMP__2_3_ & cAMP__1_2_<=cAMP__3_1_]]]]

abstracting: (cAMP__1_2_<=cAMP__3_1_) states: 100,942,636 (8)
abstracting: (1<=cAMP__2_3_) states: 38,567,100 (7)
abstracting: (2<=cAMP__4_4_) states: 10,518,300 (7)
abstracting: (cAMP__3_3_<=cAMP__5_5_) states: 100,942,636 (8)
abstracting: (2<=cAMP__3_5_) states: 10,518,300 (7)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.060sec

checking: EF [[cAMP__3_1_<=cAMP__1_3_ & [[cAMP__2_3_<=cAMP__3_4_ | 1<=cAMP__5_2_] & [3<=cAMP__1_1_ & 1<=cAMP__5_4_]]]]
normalized: E [true U [cAMP__3_1_<=cAMP__1_3_ & [[3<=cAMP__1_1_ & 1<=cAMP__5_4_] & [cAMP__2_3_<=cAMP__3_4_ | 1<=cAMP__5_2_]]]]

abstracting: (1<=cAMP__5_2_) states: 38,567,100 (7)
abstracting: (cAMP__2_3_<=cAMP__3_4_) states: 100,942,636 (8)
abstracting: (1<=cAMP__5_4_) states: 38,567,100 (7)
abstracting: (3<=cAMP__1_1_) states: 2,629,575 (6)
abstracting: (cAMP__3_1_<=cAMP__1_3_) states: 100,942,636 (8)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.066sec

checking: EF [[cAMP__4_3_<=cAMP__1_1_ & [[1<=cAMP__3_1_ & 2<=cAMP__5_4_] & [cAMP__2_1_<=cAMP__4_5_ & cAMP__2_3_<=cAMP__1_2_]]]]
normalized: E [true U [cAMP__4_3_<=cAMP__1_1_ & [[cAMP__2_1_<=cAMP__4_5_ & cAMP__2_3_<=cAMP__1_2_] & [1<=cAMP__3_1_ & 2<=cAMP__5_4_]]]]

abstracting: (2<=cAMP__5_4_) states: 10,518,300 (7)
abstracting: (1<=cAMP__3_1_) states: 38,567,100 (7)
abstracting: (cAMP__2_3_<=cAMP__1_2_) states: 100,942,636 (8)
abstracting: (cAMP__2_1_<=cAMP__4_5_) states: 100,942,636 (8)
abstracting: (cAMP__4_3_<=cAMP__1_1_) states: 100,942,636 (8)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.078sec

checking: AG [[[[cAMP__5_2_<=cAMP__5_1_ & cAMP__5_3_<=cAMP__4_2_] | [3<=cAMP__1_4_ | cAMP__5_4_<=cAMP__1_1_]] | [~ [cAMP__1_5_<=cAMP__5_1_] | [cAMP__5_1_<=cAMP__1_3_ & cAMP__3_5_<=cAMP__4_5_]]]]
normalized: ~ [E [true U ~ [[[[cAMP__5_1_<=cAMP__1_3_ & cAMP__3_5_<=cAMP__4_5_] | ~ [cAMP__1_5_<=cAMP__5_1_]] | [[3<=cAMP__1_4_ | cAMP__5_4_<=cAMP__1_1_] | [cAMP__5_2_<=cAMP__5_1_ & cAMP__5_3_<=cAMP__4_2_]]]]]]

abstracting: (cAMP__5_3_<=cAMP__4_2_) states: 100,942,636 (8)
abstracting: (cAMP__5_2_<=cAMP__5_1_) states: 100,942,636 (8)
abstracting: (cAMP__5_4_<=cAMP__1_1_) states: 100,942,636 (8)
abstracting: (3<=cAMP__1_4_) states: 2,629,575 (6)
abstracting: (cAMP__1_5_<=cAMP__5_1_) states: 100,942,636 (8)
abstracting: (cAMP__3_5_<=cAMP__4_5_) states: 100,942,636 (8)
abstracting: (cAMP__5_1_<=cAMP__1_3_) states: 100,942,636 (8)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.228sec


Total processing time: 0m 6.707sec


BK_STOP 1464190066739

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


iterations count:921 (6), effective:24 (0)

initing FirstDep: 0m 0.000sec


iterations count:943 (6), effective:24 (0)

iterations count:940 (6), effective:24 (0)

iterations count:941 (6), effective:24 (0)

iterations count:943 (6), effective:24 (0)

iterations count:944 (6), effective:24 (0)

iterations count:940 (6), effective:24 (0)

iterations count:943 (6), effective:24 (0)

iterations count:406 (2), effective:14 (0)
245
iterations count:1250 (8), effective:39 (0)

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

iterations count:829 (5), effective:28 (0)
187
iterations count:1873 (13), effective:57 (0)
259
iterations count:1202 (8), effective:38 (0)
381
iterations count:1740 (12), effective:51 (0)
499
iterations count:1757 (12), effective:53 (0)
296 251 303
iterations count:3355 (23), effective:106 (0)

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_Diffusion2D-PT-D05N010"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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_Diffusion2D-PT-D05N010.tgz
mv S_Diffusion2D-PT-D05N010 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_Diffusion2D-PT-D05N010, 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 r149kn-smll-146416258000061"
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 ;