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_ResAllocation-PT-R003C003, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444128400282
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464597966830


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: ResAllocation_PT_R003C003
(NrP: 18 NrTr: 12 NrArc: 48)

net check time: 0m 0.000sec

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

init dd package: 0m 3.717sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 62 (6.2e+01) #states 92



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

checking: 3<=p_0_0
normalized: 3<=p_0_0

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

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

MC time: 0m 0.000sec

checking: 3<=p_1_2
normalized: 3<=p_1_2

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

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

MC time: 0m 0.000sec

checking: 3<=r_1_1
normalized: 3<=r_1_1

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

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

MC time: 0m 0.000sec

checking: ~ [AX [EG [r_1_0<=r_0_1]]]
normalized: EX [~ [EG [r_1_0<=r_0_1]]]

abstracting: (r_1_0<=r_0_1) states: 68
...
EG iterations: 3
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [~ [p_1_2<=r_1_0]]
normalized: p_1_2<=r_1_0

abstracting: (p_1_2<=r_1_0) states: 80
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: p_2_1<=p_2_0
normalized: p_2_1<=p_2_0

abstracting: (p_2_1<=p_2_0) states: 72
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: p_2_2<=r_0_2
normalized: p_2_2<=r_0_2

abstracting: (p_2_2<=r_0_2) states: 76
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: ~ [EF [[[3<=p_1_1 | 2<=p_1_1] | [1<=p_2_2 & 1<=r_0_0]]]]
normalized: ~ [E [true U [[3<=p_1_1 | 2<=p_1_1] | [1<=p_2_2 & 1<=r_0_0]]]]

abstracting: (1<=r_0_0) states: 44
abstracting: (1<=p_2_2) states: 32
abstracting: (2<=p_1_1) states: 0
abstracting: (3<=p_1_1) states: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: ~ [[EG [[1<=p_0_2 | p_0_0<=r_2_0]] | ~ [EX [r_1_0<=r_1_0]]]]
normalized: ~ [[EG [[1<=p_0_2 | p_0_0<=r_2_0]] | ~ [EX [r_1_0<=r_1_0]]]]

abstracting: (r_1_0<=r_1_0) states: 92
.abstracting: (p_0_0<=r_2_0) states: 70
abstracting: (1<=p_0_2) states: 32
......
EG iterations: 6
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: [~ [AX [p_0_2<=r_0_0]] & AX [[[1<=r_1_1 & 3<=r_0_2] | r_1_1<=r_1_2]]]
normalized: [~ [EX [~ [[r_1_1<=r_1_2 | [1<=r_1_1 & 3<=r_0_2]]]]] & EX [~ [p_0_2<=r_0_0]]]

abstracting: (p_0_2<=r_0_0) states: 76
.abstracting: (3<=r_0_2) states: 0
abstracting: (1<=r_1_1) states: 42
abstracting: (r_1_1<=r_1_2) states: 67
.-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: [AF [AF [r_0_1<=p_0_0]] | ~ [[EF [p_2_0<=p_0_1] & [2<=p_0_1 | [1<=r_2_1 | r_2_0<=p_0_2]]]]]
normalized: [~ [[E [true U p_2_0<=p_0_1] & [2<=p_0_1 | [1<=r_2_1 | r_2_0<=p_0_2]]]] | ~ [EG [EG [~ [r_0_1<=p_0_0]]]]]

abstracting: (r_0_1<=p_0_0) states: 70
......
EG iterations: 6
.
EG iterations: 1
abstracting: (r_2_0<=p_0_2) states: 60
abstracting: (1<=r_2_1) states: 52
abstracting: (2<=p_0_1) states: 0
abstracting: (p_2_0<=p_0_1) states: 68
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: [[EF [[r_2_0<=p_1_0 & 1<=r_2_1]] | 3<=r_2_2] | [A [p_0_0<=r_2_2 U 1<=r_2_0] | E [1<=p_1_1 U r_2_0<=r_0_2]]]
normalized: [[[~ [E [~ [1<=r_2_0] U [~ [1<=r_2_0] & ~ [p_0_0<=r_2_2]]]] & ~ [EG [~ [1<=r_2_0]]]] | E [1<=p_1_1 U r_2_0<=r_0_2]] | [3<=r_2_2 | E [true U [r_2_0<=p_1_0 & 1<=r_2_1]]]]

abstracting: (1<=r_2_1) states: 52
abstracting: (r_2_0<=p_1_0) states: 48
abstracting: (3<=r_2_2) states: 0
abstracting: (r_2_0<=r_0_2) states: 64
abstracting: (1<=p_1_1) states: 10
abstracting: (1<=r_2_0) states: 48
...
EG iterations: 3
abstracting: (p_0_0<=r_2_2) states: 76
abstracting: (1<=r_2_0) states: 48
abstracting: (1<=r_2_0) states: 48
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C003-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [[~ [p_2_2<=p_2_1] & p_2_2<=p_1_2] U [[3<=p_2_2 & r_0_1<=p_1_0] | [p_0_1<=p_1_0 | 3<=r_0_0]]]
normalized: E [[p_2_2<=p_1_2 & ~ [p_2_2<=p_2_1]] U [[3<=p_2_2 & r_0_1<=p_1_0] | [p_0_1<=p_1_0 | 3<=r_0_0]]]

abstracting: (3<=r_0_0) states: 0
abstracting: (p_0_1<=p_1_0) states: 52
abstracting: (r_0_1<=p_1_0) states: 52
abstracting: (3<=p_2_2) states: 0
abstracting: (p_2_2<=p_2_1) states: 76
abstracting: (p_2_2<=p_1_2) states: 60
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: ~ [[[[p_1_1<=p_0_2 | [r_2_1<=p_0_2 | 3<=p_2_2]] & [r_0_2<=p_2_1 | [1<=p_1_0 & 2<=r_2_0]]] | ~ [~ [[3<=p_1_0 | r_0_0<=p_1_1]]]]]
normalized: ~ [[[[r_0_2<=p_2_1 | [1<=p_1_0 & 2<=r_2_0]] & [p_1_1<=p_0_2 | [r_2_1<=p_0_2 | 3<=p_2_2]]] | [3<=p_1_0 | r_0_0<=p_1_1]]]

abstracting: (r_0_0<=p_1_1) states: 52
abstracting: (3<=p_1_0) states: 0
abstracting: (3<=p_2_2) states: 0
abstracting: (r_2_1<=p_0_2) states: 56
abstracting: (p_1_1<=p_0_2) states: 82
abstracting: (2<=r_2_0) states: 0
abstracting: (1<=p_1_0) states: 4
abstracting: (r_0_2<=p_2_1) states: 70
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: [AX [[1<=p_2_1 & [1<=p_2_1 | 3<=p_0_2]]] | [[EF [p_1_2<=p_0_1] | [[1<=p_2_1 & p_1_0<=r_1_2] & p_2_1<=r_1_0]] | A [2<=r_1_2 U r_2_1<=p_0_1]]]
normalized: [[[~ [EG [~ [r_2_1<=p_0_1]]] & ~ [E [~ [r_2_1<=p_0_1] U [~ [2<=r_1_2] & ~ [r_2_1<=p_0_1]]]]] | [[p_2_1<=r_1_0 & [1<=p_2_1 & p_1_0<=r_1_2]] | E [true U p_1_2<=p_0_1]]] | ~ [EX [~ [[1<=p_2_1 & [1<=p_2_1 | 3<=p_0_2]]]]]]

abstracting: (3<=p_0_2) states: 0
abstracting: (1<=p_2_1) states: 40
abstracting: (1<=p_2_1) states: 40
.abstracting: (p_1_2<=p_0_1) states: 78
abstracting: (p_1_0<=r_1_2) states: 90
abstracting: (1<=p_2_1) states: 40
abstracting: (p_2_1<=r_1_0) states: 72
abstracting: (r_2_1<=p_0_1) states: 60
abstracting: (2<=r_1_2) states: 0
abstracting: (r_2_1<=p_0_1) states: 60
abstracting: (r_2_1<=p_0_1) states: 60
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: [[EF [~ [3<=r_1_1]] | ~ [[2<=p_0_2 | [2<=r_1_0 & p_0_2<=p_0_2]]]] | [[[2<=p_2_1 & p_0_0<=p_0_1] | r_0_2<=r_2_2] | [EF [r_2_0<=r_0_0] & [[p_0_2<=p_2_1 & 3<=p_1_1] & r_1_2<=r_2_0]]]]
normalized: [[[E [true U r_2_0<=r_0_0] & [r_1_2<=r_2_0 & [p_0_2<=p_2_1 & 3<=p_1_1]]] | [r_0_2<=r_2_2 | [2<=p_2_1 & p_0_0<=p_0_1]]] | [~ [[2<=p_0_2 | [2<=r_1_0 & p_0_2<=p_0_2]]] | E [true U ~ [3<=r_1_1]]]]

abstracting: (3<=r_1_1) states: 0
abstracting: (p_0_2<=p_0_2) states: 92
abstracting: (2<=r_1_0) states: 0
abstracting: (2<=p_0_2) states: 0
abstracting: (p_0_0<=p_0_1) states: 68
abstracting: (2<=p_2_1) states: 0
abstracting: (r_0_2<=r_2_2) states: 76
abstracting: (3<=p_1_1) states: 0
abstracting: (p_0_2<=p_2_1) states: 76
abstracting: (r_1_2<=r_2_0) states: 74
abstracting: (r_2_0<=r_0_0) states: 66
-> the formula is TRUE

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

MC time: 0m 0.001sec


Total processing time: 0m 5.214sec


BK_STOP 1464597972078

--------------------
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.001sec


iterations count:89 (7), effective:18 (1)

initing FirstDep: 0m 0.000sec


iterations count:69 (5), effective:12 (1)

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

iterations count:61 (5), effective:15 (1)

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

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

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

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

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

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

iterations count:29 (2), effective:5 (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-R003C003"
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/S_ResAllocation-PT-R003C003.tgz
mv S_ResAllocation-PT-R003C003 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_ResAllocation-PT-R003C003, 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 r185kn-smll-146444128400282"
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 ;