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 ResAllocation-PT-R020C002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101kn-smll-146369144000372
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463779572904


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_R020C002
(NrP: 80 NrTr: 42 NrArc: 200)

net check time: 0m 0.000sec

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

init dd package: 0m 3.890sec


RS generation: 0m 0.028sec


-> reachability set: #nodes 226 (2.3e+02) #states 11,534,336 (7)



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

checking: AX [~ [AF [3<=p_1_19]]]
normalized: ~ [EX [~ [EG [~ [3<=p_1_19]]]]]

abstracting: (3<=p_1_19) states: 0

EG iterations: 0
.-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EG [AX [~ [1<=p_1_9]]]
normalized: EG [~ [EX [1<=p_1_9]]]

abstracting: (1<=p_1_9) states: 2,883,584 (6)
...................................................................................
EG iterations: 82
-> the formula is TRUE

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

MC time: 0m 0.600sec

checking: AF [~ [1<=r_0_17]]
normalized: ~ [EG [1<=r_0_17]]

abstracting: (1<=r_0_17) states: 5,505,024 (6)
.......................................................................................................................................................................................................................................................................................................................
EG iterations: 311
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.228sec

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

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

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

MC time: 0m 0.000sec

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

abstracting: (2<=r_0_8) states: 0

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

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

MC time: 0m 0.000sec

checking: ~ [EF [AF [2<=r_0_14]]]
normalized: ~ [E [true U ~ [EG [~ [2<=r_0_14]]]]]

abstracting: (2<=r_0_14) states: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AF [AX [[3<=r_1_5 & 2<=r_0_2]]]
normalized: ~ [EG [EX [~ [[3<=r_1_5 & 2<=r_0_2]]]]]

abstracting: (2<=r_0_2) states: 0
abstracting: (3<=r_1_5) states: 0
...............................................................................................................................................................................................
EG iterations: 190
-> the formula is FALSE

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

MC time: 0m 1.097sec

checking: ~ [AF [AF [r_0_8<=p_1_3]]]
normalized: EG [EG [~ [r_0_8<=p_1_3]]]

abstracting: (r_0_8<=p_1_3) states: 6,684,672 (6)
..........................................................................................................................................................................
EG iterations: 170
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.441sec

checking: EG [~ [AG [r_1_6<=p_0_3]]]
normalized: EG [E [true U ~ [r_1_6<=p_0_3]]]

abstracting: (r_1_6<=p_0_3) states: 6,291,456 (6)
...........................................................................................................................................................................................
EG iterations: 187
-> the formula is TRUE

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

MC time: 0m 0.699sec

checking: AG [AF [[2<=r_1_0 & p_1_7<=p_1_18]]]
normalized: ~ [E [true U EG [~ [[2<=r_1_0 & p_1_7<=p_1_18]]]]]

abstracting: (p_1_7<=p_1_18) states: 10,354,688 (7)
abstracting: (2<=r_1_0) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: ~ [AG [[~ [1<=p_0_15] & [r_0_14<=p_0_19 | p_1_9<=r_1_2]]]]
normalized: E [true U ~ [[~ [1<=p_0_15] & [r_0_14<=p_0_19 | p_1_9<=r_1_2]]]]

abstracting: (p_1_9<=r_1_2) states: 11,010,048 (7)
abstracting: (r_0_14<=p_0_19) states: 6,291,456 (6)
abstracting: (1<=p_0_15) states: 1,572,864 (6)
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EG [[[~ [p_1_16<=r_0_5] | 1<=r_1_16] & EX [p_1_12<=p_1_5]]]
normalized: EG [[EX [p_1_12<=p_1_5] & [1<=r_1_16 | ~ [p_1_16<=r_0_5]]]]

abstracting: (p_1_16<=r_0_5) states: 9,043,968 (6)
abstracting: (1<=r_1_16) states: 6,815,744 (6)
abstracting: (p_1_12<=p_1_5) states: 8,781,824 (6)
...............................................................................................................................................................................................................
EG iterations: 206
-> the formula is TRUE

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

MC time: 0m 1.604sec

checking: ~ [[EG [[1<=p_1_3 | r_1_2<=r_0_5]] & [AG [1<=p_0_11] | ~ [[r_1_0<=p_1_10 & 1<=p_0_18]]]]]
normalized: ~ [[[~ [[r_1_0<=p_1_10 & 1<=p_0_18]] | ~ [E [true U ~ [1<=p_0_11]]]] & EG [[1<=p_1_3 | r_1_2<=r_0_5]]]]

abstracting: (r_1_2<=r_0_5) states: 6,029,312 (6)
abstracting: (1<=p_1_3) states: 1,310,720 (6)
...................................................................................................................................................................................................................................
EG iterations: 227
abstracting: (1<=p_0_11) states: 2,621,440 (6)
abstracting: (1<=p_0_18) states: 786,432 (5)
abstracting: (r_1_0<=p_1_10) states: 3,407,872 (6)
-> the formula is TRUE

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

MC time: 0m 0.526sec

checking: [[EX [1<=r_0_5] & EF [[r_1_2<=r_1_5 & 3<=r_0_18]]] | AX [[[p_1_9<=p_1_0 | 3<=p_0_16] & 3<=p_1_16]]]
normalized: [~ [EX [~ [[3<=p_1_16 & [p_1_9<=p_1_0 | 3<=p_0_16]]]]] | [E [true U [r_1_2<=r_1_5 & 3<=r_0_18]] & EX [1<=r_0_5]]]

abstracting: (1<=r_0_5) states: 5,505,024 (6)
.abstracting: (3<=r_0_18) states: 0
abstracting: (r_1_2<=r_1_5) states: 10,223,616 (7)
abstracting: (3<=p_0_16) states: 0
abstracting: (p_1_9<=p_1_0) states: 8,912,896 (6)
abstracting: (3<=p_1_16) states: 0
.-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: AX [[AG [p_0_19<=p_0_4] | [[p_0_5<=p_1_17 | r_1_5<=r_0_14] & [r_1_11<=p_0_4 | r_0_6<=p_0_17]]]]
normalized: ~ [EX [~ [[[[r_1_11<=p_0_4 | r_0_6<=p_0_17] & [p_0_5<=p_1_17 | r_1_5<=r_0_14]] | ~ [E [true U ~ [p_0_19<=p_0_4]]]]]]]

abstracting: (p_0_19<=p_0_4) states: 11,272,192 (7)
abstracting: (r_1_5<=r_0_14) states: 6,422,528 (6)
abstracting: (p_0_5<=p_1_17) states: 9,043,968 (6)
abstracting: (r_0_6<=p_0_17) states: 6,553,600 (6)
abstracting: (r_1_11<=p_0_4) states: 6,815,744 (6)
.-> the formula is FALSE

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

MC time: 0m 0.040sec

checking: EG [[~ [[2<=r_1_15 | 3<=p_1_4]] | [[p_1_15<=p_1_11 | r_1_10<=p_1_9] & [p_0_5<=p_1_11 & p_1_15<=p_0_18]]]]
normalized: EG [[[[p_0_5<=p_1_11 & p_1_15<=p_0_18] & [p_1_15<=p_1_11 | r_1_10<=p_1_9]] | ~ [[2<=r_1_15 | 3<=p_1_4]]]]

abstracting: (3<=p_1_4) states: 0
abstracting: (2<=r_1_15) states: 0
abstracting: (r_1_10<=p_1_9) states: 4,587,520 (6)
abstracting: (p_1_15<=p_1_11) states: 8,781,824 (6)
abstracting: (p_1_15<=p_0_18) states: 7,077,888 (6)
abstracting: (p_0_5<=p_1_11) states: 8,257,536 (6)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.001sec


Total processing time: 0m11.936sec


BK_STOP 1463779584889

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

467
iterations count:1569 (37), effective:420 (10)

initing FirstDep: 0m 0.000sec


iterations count:126 (3), effective:24 (0)

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

iterations count:260 (6), effective:68 (1)

iterations count:74 (1), effective:9 (0)

iterations count:790 (18), effective:245 (5)

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="ResAllocation-PT-R020C002"
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/ResAllocation-PT-R020C002.tgz
mv ResAllocation-PT-R020C002 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 ResAllocation-PT-R020C002, 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 r101kn-smll-146369144000372"
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 ;