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

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

=== Now, execution of the tool begins

BK_START 1433783084507

Model: S_ResAllocation-PT-R010C002
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: 40 NrTr: 22 NrArc: 100)

net check time: 0m0sec

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

init dd package: 0m6sec


RS generation: 0m0sec


-> reachability set: #nodes 105 (1.0e+02) #states 6,144 (3)



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

checking: ~ [AF [[~ [p_0_7<=p_1_5] | [1<=p_1_0 & p_1_2<=r_1_4]]]]
normalized: EG [~ [[[1<=p_1_0 & p_1_2<=r_1_4] | ~ [p_0_7<=p_1_5]]]]

abstracting: (p_0_7<=p_1_5) states: 5,120 (3)
abstracting: (p_1_2<=r_1_4) states: 5,632 (3)
abstracting: (1<=p_1_0) states: 512
..............................
EG iterations: 30
-> the formula is TRUE

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

MC time: 0m0sec

checking: [[~ [[[3<=p_1_1 | p_1_6<=r_1_9] & ~ [2<=p_1_0]]] & 3<=p_0_3] | [AG [~ [2<=r_1_8]] | AG [[p_0_2<=r_0_9 | p_0_6<=p_0_9]]]]
normalized: [[3<=p_0_3 & ~ [[~ [2<=p_1_0] & [3<=p_1_1 | p_1_6<=r_1_9]]]] | [~ [E [true U ~ [[p_0_2<=r_0_9 | p_0_6<=p_0_9]]]] | ~ [E [true U 2<=r_1_8]]]]

abstracting: (2<=r_1_8) states: 0
abstracting: (p_0_6<=p_0_9) states: 5,120 (3)
abstracting: (p_0_2<=r_0_9) states: 4,864 (3)
abstracting: (p_1_6<=r_1_9) states: 5,120 (3)
abstracting: (3<=p_1_1) states: 0
abstracting: (2<=p_1_0) states: 0
abstracting: (3<=p_0_3) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[A [1<=r_0_8 U r_0_1<=r_1_2] & EF [~ [p_0_9<=r_1_2]]] & AG [~ [2<=p_1_8]]]
normalized: [~ [E [true U 2<=p_1_8]] & [E [true U ~ [p_0_9<=r_1_2]] & [~ [E [~ [1<=r_0_8] U [~ [1<=r_0_8] & ~ [r_0_1<=r_1_2]]]] & ~ [EG [~ [r_0_1<=r_1_2]]]]]]

abstracting: (r_0_1<=r_1_2) states: 5,760 (3)
................................
EG iterations: 32
abstracting: (r_0_1<=r_1_2) states: 5,760 (3)
abstracting: (1<=r_0_8) states: 2,816 (3)
abstracting: (1<=r_0_8) states: 2,816 (3)
abstracting: (p_0_9<=r_1_2) states: 6,144 (3)
abstracting: (2<=p_1_8) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (2<=r_1_5) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [EF [AG [1<=p_1_4]]]
normalized: ~ [E [true U ~ [E [true U ~ [1<=p_1_4]]]]]

abstracting: (1<=p_1_4) states: 1,536 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: [EF [[[r_0_4<=r_0_6 & 3<=p_1_8] & 3<=r_0_0]] & [AF [[3<=p_0_6 & 3<=r_1_7]] | AF [[p_1_0<=p_0_5 & r_1_5<=r_1_3]]]]
normalized: [[~ [EG [~ [[3<=p_0_6 & 3<=r_1_7]]]] | ~ [EG [~ [[p_1_0<=p_0_5 & r_1_5<=r_1_3]]]]] & E [true U [3<=r_0_0 & [r_0_4<=r_0_6 & 3<=p_1_8]]]]

abstracting: (3<=p_1_8) states: 0
abstracting: (r_0_4<=r_0_6) states: 4,608 (3)
abstracting: (3<=r_0_0) states: 0
abstracting: (r_1_5<=r_1_3) states: 5,504 (3)
abstracting: (p_1_0<=p_0_5) states: 5,632 (3)
..................
EG iterations: 18
abstracting: (3<=r_1_7) states: 0
abstracting: (3<=p_0_6) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: [[[EG [1<=r_0_7] & 1<=r_1_4] & E [3<=r_0_4 U p_1_2<=r_0_8]] | E [~ [p_0_9<=p_1_8] U [3<=p_1_4 & p_1_5<=r_1_6]]]
normalized: [E [~ [p_0_9<=p_1_8] U [3<=p_1_4 & p_1_5<=r_1_6]] | [E [3<=r_0_4 U p_1_2<=r_0_8] & [1<=r_1_4 & EG [1<=r_0_7]]]]

abstracting: (1<=r_0_7) states: 2,816 (3)
.............................................................
EG iterations: 61
abstracting: (1<=r_1_4) states: 4,608 (3)
abstracting: (p_1_2<=r_0_8) states: 5,632 (3)
abstracting: (3<=r_0_4) states: 0
abstracting: (p_1_5<=r_1_6) states: 5,248 (3)
abstracting: (3<=p_1_4) states: 0
abstracting: (p_0_9<=p_1_8) states: 5,632 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: A [EF [3<=r_0_6] U EF [3<=r_1_1]]
normalized: [~ [E [~ [E [true U 3<=r_0_6]] U [~ [E [true U 3<=r_0_6]] & ~ [E [true U 3<=r_1_1]]]]] & ~ [EG [~ [E [true U 3<=r_1_1]]]]]

abstracting: (3<=r_1_1) states: 0

EG iterations: 0
abstracting: (3<=r_1_1) states: 0
abstracting: (3<=r_0_6) states: 0
abstracting: (3<=r_0_6) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: [p_0_2<=p_1_8 & EG [EF [2<=r_1_2]]]
normalized: [p_0_2<=p_1_8 & EG [E [true U 2<=r_1_2]]]

abstracting: (2<=r_1_2) states: 0
.
EG iterations: 1
abstracting: (p_0_2<=p_1_8) states: 4,736 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [AX [~ [2<=r_0_6]]]
normalized: ~ [E [true U EX [2<=r_0_6]]]

abstracting: (2<=r_0_6) states: 0
.-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AF [E [1<=p_1_2 U r_0_2<=p_1_2]]
normalized: ~ [EG [~ [E [1<=p_1_2 U r_0_2<=p_1_2]]]]

abstracting: (r_0_2<=p_1_2) states: 3,328 (3)
abstracting: (1<=p_1_2) states: 1,024 (3)
.............................................................
EG iterations: 61
-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [EF [3<=p_1_7] & AX [~ [[2<=p_0_4 & r_1_1<=r_0_0]]]]
normalized: [~ [EX [[2<=p_0_4 & r_1_1<=r_0_0]]] & E [true U 3<=p_1_7]]

abstracting: (3<=p_1_7) states: 0
abstracting: (r_1_1<=r_0_0) states: 3,328 (3)
abstracting: (2<=p_0_4) states: 0
.-> the formula is FALSE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA ResAllocation-PT-R010C002-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA ResAllocation-PT-R010C002-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [AX [~ [2<=r_0_8]]]
normalized: ~ [E [true U EX [2<=r_0_8]]]

abstracting: (2<=r_0_8) states: 0
.-> the formula is TRUE

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

MC time: 0m0sec

checking: ~ [[AF [[1<=r_1_2 & 3<=p_0_6]] | EF [[2<=p_0_0 & 2<=p_1_0]]]]
normalized: ~ [[E [true U [2<=p_0_0 & 2<=p_1_0]] | ~ [EG [~ [[1<=r_1_2 & 3<=p_0_6]]]]]]

abstracting: (3<=p_0_6) states: 0
abstracting: (1<=r_1_2) states: 5,120 (3)

EG iterations: 0
abstracting: (2<=p_1_0) states: 0
abstracting: (2<=p_0_0) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m9sec


BK_STOP 1433783094153

--------------------
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:406 (18), effective:110 (5)

initing FirstDep: 0m0sec


iterations count:144 (6), effective:40 (1)

iterations count:42 (1), effective:7 (0)

iterations count:36 (1), effective:5 (0)

iterations count:378 (17), effective:116 (5)

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

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

iterations count:22 (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_ResAllocation-PT-R010C002"
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-R010C002.tgz
mv S_ResAllocation-PT-R010C002 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-R010C002, 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-143344930401133"
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 ;