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 Diffusion2D-PT-D05N010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r029kn-smll-146348014800057
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463506498057


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: 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 3.935sec


RS generation: 0m 0.023sec


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



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

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

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

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

MC time: 0m 0.058sec

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

abstracting: (3<=cAMP__5_4_) states: 2,629,575 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.088sec

checking: ~ [AX [EF [3<=cAMP__4_5_]]]
normalized: EX [~ [E [true U 3<=cAMP__4_5_]]]

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

FORMULA Diffusion2D-PT-D05N010-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.066sec

checking: AG [EF [~ [cAMP__4_5_<=cAMP__3_2_]]]
normalized: ~ [E [true U ~ [E [true U ~ [cAMP__4_5_<=cAMP__3_2_]]]]]

abstracting: (cAMP__4_5_<=cAMP__3_2_) states: 100,942,636 (8)
-> the formula is TRUE

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

MC time: 0m 0.036sec

checking: AG [EF [~ [cAMP__4_4_<=cAMP__4_3_]]]
normalized: ~ [E [true U ~ [E [true U ~ [cAMP__4_4_<=cAMP__4_3_]]]]]

abstracting: (cAMP__4_4_<=cAMP__4_3_) states: 100,942,636 (8)
-> the formula is TRUE

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

MC time: 0m 0.035sec

checking: EF [[EG [3<=cAMP__1_2_] | AX [2<=cAMP__5_2_]]]
normalized: E [true U [~ [EX [~ [2<=cAMP__5_2_]]] | EG [3<=cAMP__1_2_]]]

abstracting: (3<=cAMP__1_2_) states: 2,629,575 (6)
.
EG iterations: 1
abstracting: (2<=cAMP__5_2_) states: 10,518,300 (7)
.-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.040sec

checking: cAMP__5_5_<=cAMP__1_4_
normalized: cAMP__5_5_<=cAMP__1_4_

abstracting: (cAMP__5_5_<=cAMP__1_4_) states: 100,942,636 (8)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [~ [~ [cAMP__3_2_<=cAMP__5_1_]] U AX [2<=cAMP__2_4_]]
normalized: E [cAMP__3_2_<=cAMP__5_1_ U ~ [EX [~ [2<=cAMP__2_4_]]]]

abstracting: (2<=cAMP__2_4_) states: 10,518,300 (7)
.abstracting: (cAMP__3_2_<=cAMP__5_1_) states: 100,942,636 (8)
-> the formula is TRUE

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

MC time: 0m 0.175sec

checking: [EF [AF [2<=cAMP__2_1_]] & EF [~ [[cAMP__2_4_<=cAMP__4_3_ & cAMP__1_2_<=cAMP__3_2_]]]]
normalized: [E [true U ~ [[cAMP__2_4_<=cAMP__4_3_ & cAMP__1_2_<=cAMP__3_2_]]] & E [true U ~ [EG [~ [2<=cAMP__2_1_]]]]]

abstracting: (2<=cAMP__2_1_) states: 10,518,300 (7)
.
EG iterations: 1
abstracting: (cAMP__1_2_<=cAMP__3_2_) states: 100,942,636 (8)
abstracting: (cAMP__2_4_<=cAMP__4_3_) states: 100,942,636 (8)
-> the formula is TRUE

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

MC time: 0m 0.126sec

checking: E [[[1<=cAMP__1_5_ | cAMP__2_4_<=cAMP__1_4_] | 2<=cAMP__5_4_] U 2<=cAMP__1_4_]
normalized: E [[2<=cAMP__5_4_ | [1<=cAMP__1_5_ | cAMP__2_4_<=cAMP__1_4_]] U 2<=cAMP__1_4_]

abstracting: (2<=cAMP__1_4_) states: 10,518,300 (7)
abstracting: (cAMP__2_4_<=cAMP__1_4_) states: 100,942,636 (8)
abstracting: (1<=cAMP__1_5_) states: 38,567,100 (7)
abstracting: (2<=cAMP__5_4_) states: 10,518,300 (7)
-> the formula is TRUE

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

MC time: 0m 0.105sec

checking: ~ [[EF [~ [cAMP__3_5_<=cAMP__1_4_]] & EF [[cAMP__3_3_<=cAMP__5_2_ & 1<=cAMP__4_2_]]]]
normalized: ~ [[E [true U [cAMP__3_3_<=cAMP__5_2_ & 1<=cAMP__4_2_]] & E [true U ~ [cAMP__3_5_<=cAMP__1_4_]]]]

abstracting: (cAMP__3_5_<=cAMP__1_4_) states: 100,942,636 (8)
abstracting: (1<=cAMP__4_2_) states: 38,567,100 (7)
abstracting: (cAMP__3_3_<=cAMP__5_2_) states: 100,942,636 (8)
-> the formula is FALSE

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

MC time: 0m 0.075sec

checking: EF [[[~ [cAMP__5_5_<=cAMP__4_5_] & ~ [cAMP__1_2_<=cAMP__1_1_]] | AX [2<=cAMP__1_2_]]]
normalized: E [true U [~ [EX [~ [2<=cAMP__1_2_]]] | [~ [cAMP__1_2_<=cAMP__1_1_] & ~ [cAMP__5_5_<=cAMP__4_5_]]]]

abstracting: (cAMP__5_5_<=cAMP__4_5_) states: 100,942,636 (8)
abstracting: (cAMP__1_2_<=cAMP__1_1_) states: 100,942,636 (8)
abstracting: (2<=cAMP__1_2_) states: 10,518,300 (7)
.-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.051sec

checking: [~ [~ [AG [cAMP__4_1_<=cAMP__4_1_]]] & [cAMP__5_2_<=cAMP__4_1_ & [~ [~ [cAMP__1_5_<=cAMP__5_3_]] | ~ [~ [2<=cAMP__3_5_]]]]]
normalized: [[cAMP__5_2_<=cAMP__4_1_ & [cAMP__1_5_<=cAMP__5_3_ | 2<=cAMP__3_5_]] & ~ [E [true U ~ [cAMP__4_1_<=cAMP__4_1_]]]]

abstracting: (cAMP__4_1_<=cAMP__4_1_) states: 131,128,140 (8)
abstracting: (2<=cAMP__3_5_) states: 10,518,300 (7)
abstracting: (cAMP__1_5_<=cAMP__5_3_) states: 100,942,636 (8)
abstracting: (cAMP__5_2_<=cAMP__4_1_) states: 100,942,636 (8)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: E [[~ [2<=cAMP__5_2_] & [cAMP__3_2_<=cAMP__4_3_ & cAMP__1_1_<=cAMP__1_3_]] U [[cAMP__2_3_<=cAMP__2_4_ & 2<=cAMP__1_5_] & [1<=cAMP__3_4_ | 1<=cAMP__4_2_]]]
normalized: E [[[cAMP__3_2_<=cAMP__4_3_ & cAMP__1_1_<=cAMP__1_3_] & ~ [2<=cAMP__5_2_]] U [[1<=cAMP__3_4_ | 1<=cAMP__4_2_] & [cAMP__2_3_<=cAMP__2_4_ & 2<=cAMP__1_5_]]]

abstracting: (2<=cAMP__1_5_) states: 10,518,300 (7)
abstracting: (cAMP__2_3_<=cAMP__2_4_) states: 100,942,636 (8)
abstracting: (1<=cAMP__4_2_) states: 38,567,100 (7)
abstracting: (1<=cAMP__3_4_) states: 38,567,100 (7)
abstracting: (2<=cAMP__5_2_) states: 10,518,300 (7)
abstracting: (cAMP__1_1_<=cAMP__1_3_) states: 100,942,636 (8)
abstracting: (cAMP__3_2_<=cAMP__4_3_) states: 100,942,636 (8)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.400sec

checking: [AG [[[cAMP__4_1_<=cAMP__4_1_ | cAMP__2_1_<=cAMP__3_4_] | 1<=cAMP__4_3_]] & EX [[[cAMP__1_2_<=cAMP__2_3_ & 1<=cAMP__5_4_] | [cAMP__3_5_<=cAMP__4_5_ & cAMP__5_4_<=cAMP__4_2_]]]]
normalized: [EX [[[cAMP__3_5_<=cAMP__4_5_ & cAMP__5_4_<=cAMP__4_2_] | [cAMP__1_2_<=cAMP__2_3_ & 1<=cAMP__5_4_]]] & ~ [E [true U ~ [[1<=cAMP__4_3_ | [cAMP__4_1_<=cAMP__4_1_ | cAMP__2_1_<=cAMP__3_4_]]]]]]

abstracting: (cAMP__2_1_<=cAMP__3_4_) states: 100,942,636 (8)
abstracting: (cAMP__4_1_<=cAMP__4_1_) states: 131,128,140 (8)
abstracting: (1<=cAMP__4_3_) states: 38,567,100 (7)
abstracting: (1<=cAMP__5_4_) states: 38,567,100 (7)
abstracting: (cAMP__1_2_<=cAMP__2_3_) states: 100,942,636 (8)
abstracting: (cAMP__5_4_<=cAMP__4_2_) states: 100,942,636 (8)
abstracting: (cAMP__3_5_<=cAMP__4_5_) states: 100,942,636 (8)
.-> the formula is TRUE

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

MC time: 0m 0.103sec

checking: [[[[3<=cAMP__4_1_ | cAMP__3_4_<=cAMP__3_4_] & [[3<=cAMP__5_3_ & 1<=cAMP__2_3_] & [3<=cAMP__2_4_ | cAMP__1_2_<=cAMP__2_5_]]] | ~ [[[3<=cAMP__5_2_ | cAMP__4_3_<=cAMP__3_2_] | [cAMP__3_2_<=cAMP__3_1_ | 3<=cAMP__1_5_]]]] | [E [cAMP__2_2_<=cAMP__5_1_ U cAMP__3_3_<=cAMP__4_3_] & EF [~ [3<=cAMP__1_5_]]]]
normalized: [[E [true U ~ [3<=cAMP__1_5_]] & E [cAMP__2_2_<=cAMP__5_1_ U cAMP__3_3_<=cAMP__4_3_]] | [~ [[[cAMP__3_2_<=cAMP__3_1_ | 3<=cAMP__1_5_] | [3<=cAMP__5_2_ | cAMP__4_3_<=cAMP__3_2_]]] | [[[3<=cAMP__2_4_ | cAMP__1_2_<=cAMP__2_5_] & [3<=cAMP__5_3_ & 1<=cAMP__2_3_]] & [3<=cAMP__4_1_ | cAMP__3_4_<=cAMP__3_4_]]]]

abstracting: (cAMP__3_4_<=cAMP__3_4_) states: 131,128,140 (8)
abstracting: (3<=cAMP__4_1_) states: 2,629,575 (6)
abstracting: (1<=cAMP__2_3_) states: 38,567,100 (7)
abstracting: (3<=cAMP__5_3_) states: 2,629,575 (6)
abstracting: (cAMP__1_2_<=cAMP__2_5_) states: 100,942,636 (8)
abstracting: (3<=cAMP__2_4_) states: 2,629,575 (6)
abstracting: (cAMP__4_3_<=cAMP__3_2_) states: 100,942,636 (8)
abstracting: (3<=cAMP__5_2_) states: 2,629,575 (6)
abstracting: (3<=cAMP__1_5_) states: 2,629,575 (6)
abstracting: (cAMP__3_2_<=cAMP__3_1_) states: 100,942,636 (8)
abstracting: (cAMP__3_3_<=cAMP__4_3_) states: 100,942,636 (8)
abstracting: (cAMP__2_2_<=cAMP__5_1_) states: 100,942,636 (8)
abstracting: (3<=cAMP__1_5_) states: 2,629,575 (6)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.128sec


Total processing time: 0m 7.120sec


BK_STOP 1463506505216

--------------------
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:940 (6), effective:24 (0)

iterations count:966 (6), effective:25 (0)
265
iterations count:1015 (7), effective:25 (0)
250
iterations count:1401 (9), effective:41 (0)
510 515
iterations count:2076 (14), effective:62 (0)

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

iterations count:943 (6), effective:24 (0)
391
iterations count:1226 (8), effective:37 (0)

iterations count:964 (6), effective:25 (0)

iterations count:995 (6), effective:25 (0)

iterations count:943 (6), effective:24 (0)
978
iterations count:1482 (10), effective:47 (0)

iterations count:674 (4), effective:16 (0)

iterations count:160 (1), effective:1 (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="Diffusion2D-PT-D05N010"
export BK_EXAMINATION="CTLCardinality"
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/Diffusion2D-PT-D05N010.tgz
mv 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 Diffusion2D-PT-D05N010, 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 r029kn-smll-146348014800057"
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 ;