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 ResAllocation-PT-R003C010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r078kn-ebro-143262779601055
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432915775459

Model: ResAllocation-PT-R003C010
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: 40 NrArc: 174)

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 397 (4.0e+02) #states 823,552 (5)



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

checking: AG [EG [[p_3_0<=r_7_0 | 3<=r_6_1]]]
normalized: ~ [E [true U ~ [EG [[p_3_0<=r_7_0 | 3<=r_6_1]]]]]

abstracting: (3<=r_6_1) states: 0
abstracting: (p_3_0<=r_7_0) states: 774,912 (5)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m0sec

checking: EX [[AX [p_6_1<=r_4_1] & AF [3<=p_5_2]]]
normalized: EX [[~ [EX [~ [p_6_1<=r_4_1]]] & ~ [EG [~ [3<=p_5_2]]]]]

abstracting: (3<=p_5_2) states: 0

EG iterations: 0
abstracting: (p_6_1<=r_4_1) states: 747,008 (5)
..-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [~ [[[2<=r_8_0 & 3<=r_6_1] & 2<=p_0_0]]]
normalized: ~ [E [true U [2<=p_0_0 & [2<=r_8_0 & 3<=r_6_1]]]]

abstracting: (3<=r_6_1) states: 0
abstracting: (2<=r_8_0) states: 0
abstracting: (2<=p_0_0) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: ~ [~ [AG [[p_3_0<=r_6_2 | 2<=r_0_0]]]]
normalized: ~ [E [true U ~ [[p_3_0<=r_6_2 | 2<=r_0_0]]]]

abstracting: (2<=r_0_0) states: 0
abstracting: (p_3_0<=r_6_2) states: 774,912 (5)
-> the formula is FALSE

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

MC time: 0m0sec

checking: EG [E [p_0_0<=r_2_0 U 3<=p_8_2]]
normalized: EG [E [p_0_0<=r_2_0 U 3<=p_8_2]]

abstracting: (3<=p_8_2) states: 0
abstracting: (p_0_0<=r_2_0) states: 614,720 (5)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m0sec

checking: E [[[p_5_0<=p_9_1 | r_1_2<=p_7_2] | [1<=r_9_2 & 2<=p_3_0]] U [[3<=r_1_0 & p_9_2<=r_0_2] & ~ [p_3_1<=p_2_1]]]
normalized: E [[[1<=r_9_2 & 2<=p_3_0] | [p_5_0<=p_9_1 | r_1_2<=p_7_2]] U [~ [p_3_1<=p_2_1] & [3<=r_1_0 & p_9_2<=r_0_2]]]

abstracting: (p_9_2<=r_0_2) states: 594,752 (5)
abstracting: (3<=r_1_0) states: 0
abstracting: (p_3_1<=p_2_1) states: 629,248 (5)
abstracting: (r_1_2<=p_7_2) states: 574,016 (5)
abstracting: (p_5_0<=p_9_1) states: 760,320 (5)
abstracting: (2<=p_3_0) states: 0
abstracting: (1<=r_9_2) states: 444,288 (5)
-> the formula is FALSE

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

MC time: 0m2sec

checking: ~ [AG [EX [p_2_0<=r_4_2]]]
normalized: E [true U ~ [EX [p_2_0<=r_4_2]]]

abstracting: (p_2_0<=r_4_2) states: 640,448 (5)
.-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [AG [[2<=p_4_1 | 1<=r_4_2]]]
normalized: E [true U ~ [E [true U ~ [[2<=p_4_1 | 1<=r_4_2]]]]]

abstracting: (1<=r_4_2) states: 389,120 (5)
abstracting: (2<=p_4_1) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [A [3<=p_4_2 U 2<=p_1_1]]
normalized: E [true U [~ [EG [~ [2<=p_1_1]]] & ~ [E [~ [3<=p_4_2] U [~ [3<=p_4_2] & ~ [2<=p_1_1]]]]]]

abstracting: (2<=p_1_1) states: 0
abstracting: (3<=p_4_2) states: 0
abstracting: (3<=p_4_2) states: 0
abstracting: (2<=p_1_1) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: [[EF [[3<=p_6_1 | 2<=r_2_2]] | EG [3<=p_2_2]] & [~ [3<=r_8_2] & A [r_8_0<=p_9_2 U p_5_0<=r_6_0]]]
normalized: [[[~ [EG [~ [p_5_0<=r_6_0]]] & ~ [E [~ [r_8_0<=p_9_2] U [~ [r_8_0<=p_9_2] & ~ [p_5_0<=r_6_0]]]]] & ~ [3<=r_8_2]] & [E [true U [3<=p_6_1 | 2<=r_2_2]] | EG [3<=p_2_2]]]

abstracting: (3<=p_2_2) states: 0
.
EG iterations: 1
abstracting: (2<=r_2_2) states: 0
abstracting: (3<=p_6_1) states: 0
abstracting: (3<=r_8_2) states: 0
abstracting: (p_5_0<=r_6_0) states: 784,640 (5)
abstracting: (r_8_0<=p_9_2) states: 643,904 (5)
abstracting: (r_8_0<=p_9_2) states: 643,904 (5)
abstracting: (p_5_0<=r_6_0) states: 784,640 (5)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m0sec

checking: E [~ [~ [p_6_2<=r_4_1]] U AG [p_5_1<=p_2_2]]
normalized: E [p_6_2<=r_4_1 U ~ [E [true U ~ [p_5_1<=p_2_2]]]]

abstracting: (p_5_1<=p_2_2) states: 632,448 (5)
abstracting: (p_6_2<=r_4_1) states: 784,512 (5)
-> the formula is TRUE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: [[~ [[[2<=p_3_1 & r_2_0<=p_9_0] & [p_6_0<=r_0_0 & 3<=r_1_2]]] | [r_5_2<=r_7_2 | [[r_5_1<=r_6_0 & p_9_1<=p_8_0] | [p_1_0<=p_8_1 | r_2_0<=p_3_0]]]] & EF [[[2<=r_8_2 & 2<=r_6_0] | [p_9_2<=p_4_0 & 3<=r_0_1]]]]
normalized: [E [true U [[2<=r_8_2 & 2<=r_6_0] | [p_9_2<=p_4_0 & 3<=r_0_1]]] & [~ [[[2<=p_3_1 & r_2_0<=p_9_0] & [p_6_0<=r_0_0 & 3<=r_1_2]]] | [r_5_2<=r_7_2 | [[r_5_1<=r_6_0 & p_9_1<=p_8_0] | [p_1_0<=p_8_1 | r_2_0<=p_3_0]]]]]

abstracting: (r_2_0<=p_3_0) states: 436,864 (5)
abstracting: (p_1_0<=p_8_1) states: 769,408 (5)
abstracting: (p_9_1<=p_8_0) states: 584,704 (5)
abstracting: (r_5_1<=r_6_0) states: 593,152 (5)
abstracting: (r_5_2<=r_7_2) states: 608,128 (5)
abstracting: (3<=r_1_2) states: 0
abstracting: (p_6_0<=r_0_0) states: 658,944 (5)
abstracting: (r_2_0<=p_9_0) states: 548,224 (5)
abstracting: (2<=p_3_1) states: 0
abstracting: (3<=r_0_1) states: 0
abstracting: (p_9_2<=p_4_0) states: 591,808 (5)
abstracting: (2<=r_6_0) states: 0
abstracting: (2<=r_8_2) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (1<=r_8_1) states: 356,352 (5)
.................
EG iterations: 17
.-> the formula is TRUE

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

MC time: 0m0sec

checking: A [AX [p_7_1<=p_1_2] U EF [3<=p_2_2]]
normalized: [~ [EG [~ [E [true U 3<=p_2_2]]]] & ~ [E [EX [~ [p_7_1<=p_1_2]] U [~ [E [true U 3<=p_2_2]] & EX [~ [p_7_1<=p_1_2]]]]]]

abstracting: (p_7_1<=p_1_2) states: 655,872 (5)
.abstracting: (3<=p_2_2) states: 0
abstracting: (p_7_1<=p_1_2) states: 655,872 (5)
.abstracting: (3<=p_2_2) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m2sec


Total processing time: 0m15sec


BK_STOP 1432915790738

--------------------
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:346 (8), effective:60 (1)

initing FirstDep: 0m0sec


iterations count:210 (5), effective:26 (0)

iterations count:211 (5), effective:26 (0)

iterations count:235 (5), effective:41 (1)

iterations count:108 (2), effective:11 (0)

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

iterations count:181 (4), effective:21 (0)

iterations count:96 (2), effective:9 (0)

iterations count:185 (4), effective:23 (0)

iterations count:40 (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="ResAllocation-PT-R003C010"
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/ResAllocation-PT-R003C010.tgz
mv ResAllocation-PT-R003C010 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 ResAllocation-PT-R003C010, 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 r078kn-ebro-143262779601055"
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 ;