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 S_ResAllocation-PT-R015C002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r218st-ebro-143344930401146
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433783114536

Model: S_ResAllocation-PT-R015C002
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=CTLCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 60 NrTr: 32 NrArc: 150)

net check time: 0m0sec

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

init dd package: 0m5sec


RS generation: 0m0sec


-> reachability set: #nodes 160 (1.6e+02) #states 278,528 (5)



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

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

abstracting: (2<=p_0_5) states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [AF [2<=r_1_2]]
normalized: EG [~ [EG [~ [2<=r_1_2]]]]

abstracting: (2<=r_1_2) states: 0

EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [2<=r_0_7]
normalized: E [true U 2<=r_0_7]

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

FORMULA ResAllocation-PT-R015C002-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[A [2<=r_1_2 U 1<=r_1_5] & EG [r_1_13<=r_1_1]] & [[[[2<=r_1_5 | p_1_7<=r_1_11] & 1<=r_0_7] | EX [p_0_9<=r_1_14]] | EX [[r_0_9<=r_1_2 & p_0_12<=r_0_2]]]]
normalized: [[[~ [EG [~ [1<=r_1_5]]] & ~ [E [~ [2<=r_1_2] U [~ [2<=r_1_2] & ~ [1<=r_1_5]]]]] & EG [r_1_13<=r_1_1]] & [[[1<=r_0_7 & [2<=r_1_5 | p_1_7<=r_1_11]] | EX [p_0_9<=r_1_14]] | EX [[r_0_9<=r_1_2 & p_0_12<=r_0_2]]]]

abstracting: (p_0_12<=r_0_2) states: 262,144 (5)
abstracting: (r_0_9<=r_1_2) states: 262,144 (5)
.abstracting: (p_0_9<=r_1_14) states: 253,952 (5)
.abstracting: (p_1_7<=r_1_11) states: 241,664 (5)
abstracting: (2<=r_1_5) states: 0
abstracting: (1<=r_0_7) states: 131,072 (5)
abstracting: (r_1_13<=r_1_1) states: 266,240 (5)
.................................
EG iterations: 33
abstracting: (1<=r_1_5) states: 221,184 (5)
abstracting: (2<=r_1_2) states: 0
abstracting: (2<=r_1_2) states: 0
abstracting: (1<=r_1_5) states: 221,184 (5)
....................................................
EG iterations: 52
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [~ [EG [~ [r_0_11<=r_0_0]]] & AF [EF [3<=p_0_14]]]
normalized: [~ [EG [~ [E [true U 3<=p_0_14]]]] & ~ [EG [~ [r_0_11<=r_0_0]]]]

abstracting: (r_0_11<=r_0_0) states: 208,896 (5)
.......................................
EG iterations: 39
abstracting: (3<=p_0_14) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [AX [[r_1_1<=r_1_12 & p_0_11<=p_1_13]]]
normalized: EG [~ [EX [~ [[r_1_1<=r_1_12 & p_0_11<=p_1_13]]]]]

abstracting: (p_0_11<=p_1_13) states: 249,856 (5)
abstracting: (r_1_1<=r_1_12) states: 176,128 (5)
....................................................................
EG iterations: 67
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AF [~ [[[p_0_7<=r_0_12 | r_0_6<=p_0_11] | [1<=p_1_2 & 3<=r_1_2]]]]
normalized: ~ [EG [[[p_0_7<=r_0_12 | r_0_6<=p_0_11] | [1<=p_1_2 & 3<=r_1_2]]]]

abstracting: (3<=r_1_2) states: 0
abstracting: (1<=p_1_2) states: 32,768 (4)
abstracting: (r_0_6<=p_0_11) states: 167,936 (5)
abstracting: (p_0_7<=r_0_12) states: 237,568 (5)
..................................
EG iterations: 34
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: A [AF [1<=r_1_10] U AX [3<=p_0_9]]
normalized: [~ [E [EG [~ [1<=r_1_10]] U [EG [~ [1<=r_1_10]] & EX [~ [3<=p_0_9]]]]] & ~ [EG [EX [~ [3<=p_0_9]]]]]

abstracting: (3<=p_0_9) states: 0
.
EG iterations: 0
abstracting: (3<=p_0_9) states: 0
.abstracting: (1<=r_1_10) states: 180,224 (5)
...............................................
EG iterations: 47
abstracting: (1<=r_1_10) states: 180,224 (5)
...............................................
EG iterations: 47
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [AF [r_1_12<=r_0_5]]
normalized: ~ [E [true U EG [~ [r_1_12<=r_0_5]]]]

abstracting: (r_1_12<=r_0_5) states: 192,512 (5)
..............................................................
EG iterations: 62
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AF [2<=p_0_0]
normalized: ~ [EG [~ [2<=p_0_0]]]

abstracting: (2<=p_0_0) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [AF [AF [1<=r_1_6]] & EG [~ [~ [1<=r_0_14]]]]
normalized: [EG [1<=r_0_14] & ~ [EG [EG [~ [1<=r_1_6]]]]]

abstracting: (1<=r_1_6) states: 212,992 (5)
...............................................
EG iterations: 47
.
EG iterations: 1
abstracting: (1<=r_0_14) states: 131,072 (5)
....................................................................................................................................................................................................................
EG iterations: 212
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [EG [AX [1<=r_1_11]] | r_1_2<=p_1_6]
normalized: [r_1_2<=p_1_6 | EG [~ [EX [~ [1<=r_1_11]]]]]

abstracting: (1<=r_1_11) states: 172,032 (5)
............................................................
EG iterations: 59
abstracting: (r_1_2<=p_1_6) states: 81,920 (4)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [EG [[r_0_2<=r_1_6 | [1<=p_1_14 & 2<=r_0_3]]] | [~ [~ [[r_1_6<=r_1_0 & 3<=r_0_10]]] & AX [3<=p_1_7]]]
normalized: [[~ [EX [~ [3<=p_1_7]]] & [r_1_6<=r_1_0 & 3<=r_0_10]] | EG [[r_0_2<=r_1_6 | [1<=p_1_14 & 2<=r_0_3]]]]

abstracting: (2<=r_0_3) states: 0
abstracting: (1<=p_1_14) states: 131,072 (5)
abstracting: (r_0_2<=r_1_6) states: 249,856 (5)
..........................................
EG iterations: 42
abstracting: (3<=r_0_10) states: 0
abstracting: (r_1_6<=r_1_0) states: 270,336 (5)
abstracting: (3<=p_1_7) states: 0
.-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[p_1_14<=r_1_3 & [AF [r_0_10<=p_1_14] & EF [p_0_3<=r_0_1]]] & [A [1<=r_0_10 U 1<=r_0_11] & ~ [3<=p_0_0]]]
normalized: [[p_1_14<=r_1_3 & [~ [EG [~ [r_0_10<=p_1_14]]] & E [true U p_0_3<=r_0_1]]] & [[~ [E [~ [1<=r_0_10] U [~ [1<=r_0_10] & ~ [1<=r_0_11]]]] & ~ [EG [~ [1<=r_0_11]]]] & ~ [3<=p_0_0]]]

abstracting: (3<=p_0_0) states: 0
abstracting: (1<=r_0_11) states: 131,072 (5)
....................................................................
EG iterations: 68
abstracting: (1<=r_0_11) states: 131,072 (5)
abstracting: (1<=r_0_10) states: 131,072 (5)
abstracting: (1<=r_0_10) states: 131,072 (5)
abstracting: (p_0_3<=r_0_1) states: 225,280 (5)
abstracting: (r_0_10<=p_1_14) states: 208,896 (5)
..................................................................................................................
EG iterations: 114
abstracting: (p_1_14<=r_1_3) states: 258,048 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

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

abstracting: (3<=r_1_3) states: 0
.-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA ResAllocation-PT-R015C002-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m12sec


BK_STOP 1433783127557

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


iterations count:871 (27), effective:240 (7)

initing FirstDep: 0m0sec


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

iterations count:251 (7), effective:65 (2)

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

iterations count:604 (18), effective:167 (5)

iterations count:58 (1), effective:10 (0)

iterations count:81 (2), effective:13 (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_ResAllocation-PT-R015C002"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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_ResAllocation-PT-R015C002.tgz
mv S_ResAllocation-PT-R015C002 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 S_ResAllocation-PT-R015C002, 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 r218st-ebro-143344930401146"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 ;