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 S_ERK-PT-000001, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101-blw3-149441598900354
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494878837625

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=CTLCardinality.xml --memory=6

parse successfull
net created successfully

Net: ERK_PT_000001
(NrP: 11 NrTr: 11 NrArc: 34)

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

net check time: 0m 0.000sec

init dd package: 0m 1.205sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 11 (1.1e+01) #states 13



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

checking: 2<=MEKPP_ERK
normalized: 2<=MEKPP_ERK

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

FORMULA ERK-PT-000001-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: 1<=MEKPP
normalized: 1<=MEKPP

abstracting: (1<=MEKPP)
states: 9
-> the formula is TRUE

FORMULA ERK-PT-000001-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: 1<=ERKPP
normalized: 1<=ERKPP

abstracting: (1<=ERKPP)
states: 4
-> the formula is FALSE

FORMULA ERK-PT-000001-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: RKIPP<=Raf1Star
normalized: RKIPP<=Raf1Star

abstracting: (RKIPP<=Raf1Star)
states: 13
-> the formula is TRUE

FORMULA ERK-PT-000001-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (Raf1Star_RKIP<=ERKPP)
states: 11
-> the formula is TRUE

FORMULA ERK-PT-000001-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EX [~ [MEKPP<=MEKPP_ERK]] | ~ [1<=RKIPP]]
normalized: [~ [1<=RKIPP] | EX [~ [MEKPP<=MEKPP_ERK]]]

abstracting: (MEKPP<=MEKPP_ERK)
states: 4
.abstracting: (1<=RKIPP)
states: 3
-> the formula is TRUE

FORMULA ERK-PT-000001-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (ERKPP<=RP)
states: 12
abstracting: (ERK<=RP)
states: 12
-> the formula is TRUE

FORMULA ERK-PT-000001-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [EG [Raf1Star<=Raf1Star] U AG [MEKPP_ERK<=Raf1Star_RKIP_ERKPP]]
normalized: [~ [E [E [true U ~ [MEKPP_ERK<=Raf1Star_RKIP_ERKPP]] U [~ [EG [Raf1Star<=Raf1Star]] & E [true U ~ [MEKPP_ERK<=Raf1Star_RKIP_ERKPP]]]]] & ~ [EG [E [true U ~ [MEKPP_ERK<=Raf1Star_RKIP_ERKPP]]]]]

abstracting: (MEKPP_ERK<=Raf1Star_RKIP_ERKPP)
states: 9

EG iterations: 0
abstracting: (MEKPP_ERK<=Raf1Star_RKIP_ERKPP)
states: 9
abstracting: (Raf1Star<=Raf1Star)
states: 13

EG iterations: 0
abstracting: (MEKPP_ERK<=Raf1Star_RKIP_ERKPP)
states: 9
-> the formula is FALSE

FORMULA ERK-PT-000001-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [~ [[EF [3<=Raf1Star_RKIP_ERKPP] | Raf1Star_RKIP<=RP]] | AX [AF [Raf1Star<=Raf1Star_RKIP_ERKPP]]]
normalized: [~ [EX [EG [~ [Raf1Star<=Raf1Star_RKIP_ERKPP]]]] | ~ [[E [true U 3<=Raf1Star_RKIP_ERKPP] | Raf1Star_RKIP<=RP]]]

abstracting: (Raf1Star_RKIP<=RP)
states: 13
abstracting: (3<=Raf1Star_RKIP_ERKPP)
states: 0
abstracting: (Raf1Star<=Raf1Star_RKIP_ERKPP)
states: 4
..
EG iterations: 2
.-> the formula is FALSE

FORMULA ERK-PT-000001-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [E [[MEKPP<=RKIPP_RP | 1<=MEKPP] U [1<=RP & RKIP<=RKIPP_RP]]]
normalized: ~ [E [[MEKPP<=RKIPP_RP | 1<=MEKPP] U [1<=RP & RKIP<=RKIPP_RP]]]

abstracting: (RKIP<=RKIPP_RP)
states: 10
abstracting: (1<=RP)
states: 10
abstracting: (1<=MEKPP)
states: 9
abstracting: (MEKPP<=RKIPP_RP)
states: 6
-> the formula is FALSE

FORMULA ERK-PT-000001-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [[1<=ERK & EG [~ [3<=RP]]] | [[~ [MEKPP_ERK<=RKIPP] & 2<=RKIPP_RP] | AF [2<=RP]]]
normalized: [[~ [EG [~ [2<=RP]]] | [~ [MEKPP_ERK<=RKIPP] & 2<=RKIPP_RP]] | [EG [~ [3<=RP]] & 1<=ERK]]

abstracting: (1<=ERK)
states: 4
abstracting: (3<=RP)
states: 0

EG iterations: 0
abstracting: (2<=RKIPP_RP)
states: 0
abstracting: (MEKPP_ERK<=RKIPP)
states: 10
abstracting: (2<=RP)
states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA ERK-PT-000001-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [AX [[~ [2<=RP] & ~ [1<=RP]]] & [AG [~ [3<=MEKPP]] & [RKIPP<=RKIPP_RP & EX [3<=RP]]]]
normalized: [[[EX [3<=RP] & RKIPP<=RKIPP_RP] & ~ [E [true U 3<=MEKPP]]] & ~ [EX [~ [[~ [1<=RP] & ~ [2<=RP]]]]]]

abstracting: (2<=RP)
states: 0
abstracting: (1<=RP)
states: 10
.abstracting: (3<=MEKPP)
states: 0
abstracting: (RKIPP<=RKIPP_RP)
states: 10
abstracting: (3<=RP)
states: 0
.-> the formula is FALSE

FORMULA ERK-PT-000001-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [[EF [RP<=RKIP] & AF [[3<=Raf1Star_RKIP & ERK<=ERK]]] & AG [Raf1Star_RKIP_ERKPP<=ERKPP]]
normalized: [~ [E [true U ~ [Raf1Star_RKIP_ERKPP<=ERKPP]]] & [~ [EG [~ [[3<=Raf1Star_RKIP & ERK<=ERK]]]] & E [true U RP<=RKIP]]]

abstracting: (RP<=RKIP)
states: 6
abstracting: (ERK<=ERK)
states: 13
abstracting: (3<=Raf1Star_RKIP)
states: 0

EG iterations: 0
abstracting: (Raf1Star_RKIP_ERKPP<=ERKPP)
states: 12
-> the formula is FALSE

FORMULA ERK-PT-000001-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: A [[[Raf1Star<=MEKPP_ERK | RKIPP_RP<=Raf1Star_RKIP] | [RKIPP_RP<=MEKPP_ERK & 1<=MEKPP_ERK]] U [[RP<=ERK | 3<=ERK] & [3<=ERKPP & 2<=RP]]]
normalized: [~ [EG [~ [[[3<=ERKPP & 2<=RP] & [RP<=ERK | 3<=ERK]]]]] & ~ [E [~ [[[3<=ERKPP & 2<=RP] & [RP<=ERK | 3<=ERK]]] U [~ [[[RKIPP_RP<=MEKPP_ERK & 1<=MEKPP_ERK] | [Raf1Star<=MEKPP_ERK | RKIPP_RP<=Raf1Star_RKIP]]] & ~ [[[3<=ERKPP & 2<=RP] & [RP<=ERK | 3<=ERK]]]]]]]

abstracting: (3<=ERK)
states: 0
abstracting: (RP<=ERK)
states: 6
abstracting: (2<=RP)
states: 0
abstracting: (3<=ERKPP)
states: 0
abstracting: (RKIPP_RP<=Raf1Star_RKIP)
states: 10
abstracting: (Raf1Star<=MEKPP_ERK)
states: 7
abstracting: (1<=MEKPP_ERK)
states: 4
abstracting: (RKIPP_RP<=MEKPP_ERK)
states: 11
abstracting: (3<=ERK)
states: 0
abstracting: (RP<=ERK)
states: 6
abstracting: (2<=RP)
states: 0
abstracting: (3<=ERKPP)
states: 0
abstracting: (3<=ERK)
states: 0
abstracting: (RP<=ERK)
states: 6
abstracting: (2<=RP)
states: 0
abstracting: (3<=ERKPP)
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA ERK-PT-000001-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [[[AG [ERK<=MEKPP_ERK] & MEKPP<=ERKPP] | ~ [EG [2<=RP]]] | [[[~ [1<=RKIPP_RP] | [Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP | 1<=ERKPP]] | MEKPP_ERK<=Raf1Star] & E [2<=ERK U 3<=RKIP]]]
normalized: [[E [2<=ERK U 3<=RKIP] & [[[Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP | 1<=ERKPP] | ~ [1<=RKIPP_RP]] | MEKPP_ERK<=Raf1Star]] | [~ [EG [2<=RP]] | [~ [E [true U ~ [ERK<=MEKPP_ERK]]] & MEKPP<=ERKPP]]]

abstracting: (MEKPP<=ERKPP)
states: 8
abstracting: (ERK<=MEKPP_ERK)
states: 9
abstracting: (2<=RP)
states: 0
.
EG iterations: 1
abstracting: (MEKPP_ERK<=Raf1Star)
states: 12
abstracting: (1<=RKIPP_RP)
states: 3
abstracting: (1<=ERKPP)
states: 4
abstracting: (Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP)
states: 12
abstracting: (3<=RKIP)
states: 0
abstracting: (2<=ERK)
states: 0
-> the formula is TRUE

FORMULA ERK-PT-000001-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [[3<=RKIPP & [[[RKIPP<=RKIPP | RKIP<=RKIP] & [2<=Raf1Star & MEKPP_ERK<=RP]] & 2<=Raf1Star_RKIP]] | [E [Raf1Star_RKIP_ERKPP<=MEKPP U Raf1Star_RKIP_ERKPP<=RP] & AG [[RP<=RP | 3<=Raf1Star_RKIP]]]]
normalized: [[~ [E [true U ~ [[RP<=RP | 3<=Raf1Star_RKIP]]]] & E [Raf1Star_RKIP_ERKPP<=MEKPP U Raf1Star_RKIP_ERKPP<=RP]] | [[[[2<=Raf1Star & MEKPP_ERK<=RP] & [RKIPP<=RKIPP | RKIP<=RKIP]] & 2<=Raf1Star_RKIP] & 3<=RKIPP]]

abstracting: (3<=RKIPP)
states: 0
abstracting: (2<=Raf1Star_RKIP)
states: 0
abstracting: (RKIP<=RKIP)
states: 13
abstracting: (RKIPP<=RKIPP)
states: 13
abstracting: (MEKPP_ERK<=RP)
states: 12
abstracting: (2<=Raf1Star)
states: 0
abstracting: (Raf1Star_RKIP_ERKPP<=RP)
states: 13
abstracting: (Raf1Star_RKIP_ERKPP<=MEKPP)
states: 13
abstracting: (3<=Raf1Star_RKIP)
states: 0
abstracting: (RP<=RP)
states: 13
-> the formula is TRUE

FORMULA ERK-PT-000001-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 908(9.1e+02)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 519 637 1156
used/not used/entry size/cache size: 555 67108309 16 1024MB
basic ops cache: hits/miss/sum: 1176 1569 2745
used/not used/entry size/cache size: 3415 16773801 12 192MB
unary ops cache: hits/miss/sum: 0 10 10
used/not used/entry size/cache size: 10 8388598 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 96 82 178
used/not used/entry size/cache size: 82 2097070 32 64MB
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 67107956
1 908
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 1.822sec


BK_STOP 1494878839477

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


initing FirstDep: 0m 0.004sec


iterations count:35 (3), effective:8 (0)

initing FirstDep: 0m 0.000sec


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

iterations count:15 (1), effective:1 (0)

iterations count:32 (2), effective:6 (0)

iterations count:32 (2), effective:6 (0)

iterations count:32 (2), effective:6 (0)

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

iterations count:21 (1), effective:3 (0)

iterations count:27 (2), effective:6 (0)

iterations count:33 (3), effective:7 (0)

iterations count:33 (3), effective:6 (0)

iterations count:11 (1), effective:0 (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_ERK-PT-000001"
export BK_EXAMINATION="CTLCardinality"
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/S_ERK-PT-000001.tgz
mv S_ERK-PT-000001 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 S_ERK-PT-000001, 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 r101-blw3-149441598900354"
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 ;