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

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

=== Now, execution of the tool begins

BK_START 1432915716933

Model: ResAllocation-PT-R003C005
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: 30 NrTr: 20 NrArc: 84)

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 187 (1.9e+02) #states 1,200 (3)



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

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

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

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

MC time: 0m0sec

checking: [[AX [~ [r_0_1<=r_1_0]] | E [r_1_0<=r_1_2 U 3<=p_1_0]] | 3<=p_4_1]
normalized: [3<=p_4_1 | [~ [EX [r_0_1<=r_1_0]] | E [r_1_0<=r_1_2 U 3<=p_1_0]]]

abstracting: (3<=p_1_0) states: 0
abstracting: (r_1_0<=r_1_2) states: 904
abstracting: (r_0_1<=r_1_0) states: 928
.abstracting: (3<=p_4_1) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: [[p_2_1<=p_4_0 & [[[p_4_2<=r_0_1 & r_4_2<=p_3_2] | 3<=r_1_1] | AG [2<=p_2_2]]] | EF [3<=p_4_2]]
normalized: [E [true U 3<=p_4_2] | [p_2_1<=p_4_0 & [[3<=r_1_1 | [p_4_2<=r_0_1 & r_4_2<=p_3_2]] | ~ [E [true U ~ [2<=p_2_2]]]]]]

abstracting: (2<=p_2_2) states: 0
abstracting: (r_4_2<=p_3_2) states: 720
abstracting: (p_4_2<=r_0_1) states: 1,000 (3)
abstracting: (3<=r_1_1) states: 0
abstracting: (p_2_1<=p_4_0) states: 992
abstracting: (3<=p_4_2) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (2<=p_4_2) states: 0

EG iterations: 0
abstracting: (3<=p_0_2) states: 0
abstracting: (2<=p_4_2) states: 0
abstracting: (3<=p_0_2) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

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

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

FORMULA ResAllocation-PT-R003C005-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[3<=r_0_2 | [p_1_0<=r_2_1 & p_3_0<=p_2_2]] | r_2_1<=r_3_1] & 1<=r_3_1] & [E [1<=r_2_2 U 3<=r_4_0] | E [p_2_0<=p_2_1 U 3<=p_2_0]]]
normalized: [[1<=r_3_1 & [r_2_1<=r_3_1 | [3<=r_0_2 | [p_1_0<=r_2_1 & p_3_0<=p_2_2]]]] & [E [1<=r_2_2 U 3<=r_4_0] | E [p_2_0<=p_2_1 U 3<=p_2_0]]]

abstracting: (3<=p_2_0) states: 0
abstracting: (p_2_0<=p_2_1) states: 880
abstracting: (3<=r_4_0) states: 0
abstracting: (1<=r_2_2) states: 592
abstracting: (p_3_0<=p_2_2) states: 1,120 (3)
abstracting: (p_1_0<=r_2_1) states: 1,176 (3)
abstracting: (3<=r_0_2) states: 0
abstracting: (r_2_1<=r_3_1) states: 920
abstracting: (1<=r_3_1) states: 528
-> the formula is FALSE

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

MC time: 0m0sec

checking: [EF [AF [3<=p_2_0]] & [A [p_3_1<=p_3_2 U r_3_0<=r_2_2] | [[~ [p_4_2<=r_3_2] | [3<=r_3_1 | 1<=r_4_2]] | 3<=p_4_1]]]
normalized: [[[3<=p_4_1 | [[3<=r_3_1 | 1<=r_4_2] | ~ [p_4_2<=r_3_2]]] | [~ [EG [~ [r_3_0<=r_2_2]]] & ~ [E [~ [p_3_1<=p_3_2] U [~ [p_3_1<=p_3_2] & ~ [r_3_0<=r_2_2]]]]]] & E [true U ~ [EG [~ [3<=p_2_0]]]]]

abstracting: (3<=p_2_0) states: 0

EG iterations: 0
abstracting: (r_3_0<=r_2_2) states: 916
abstracting: (p_3_1<=p_3_2) states: 1,108 (3)
abstracting: (p_3_1<=p_3_2) states: 1,108 (3)
abstracting: (r_3_0<=r_2_2) states: 916
.......
EG iterations: 7
abstracting: (p_4_2<=r_3_2) states: 832
abstracting: (1<=r_4_2) states: 832
abstracting: (3<=r_3_1) states: 0
abstracting: (3<=p_4_1) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: [[AG [[p_3_0<=r_4_0 & r_2_1<=r_2_1]] & 1<=r_3_2] | ~ [[EF [r_1_2<=p_2_0] | AF [1<=p_2_1]]]]
normalized: [~ [[E [true U r_1_2<=p_2_0] | ~ [EG [~ [1<=p_2_1]]]]] | [1<=r_3_2 & ~ [E [true U ~ [[p_3_0<=r_4_0 & r_2_1<=r_2_1]]]]]]

abstracting: (r_2_1<=r_2_1) states: 1,200 (3)
abstracting: (p_3_0<=r_4_0) states: 1,200 (3)
abstracting: (1<=r_3_2) states: 480
abstracting: (1<=p_2_1) states: 416
.....
EG iterations: 5
abstracting: (r_1_2<=p_2_0) states: 864
-> the formula is TRUE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: E [AF [p_0_1<=p_1_2] U 3<=r_4_2]
normalized: E [~ [EG [~ [p_0_1<=p_1_2]]] U 3<=r_4_2]

abstracting: (3<=r_4_2) states: 0
abstracting: (p_0_1<=p_1_2) states: 832
.........
EG iterations: 9
-> the formula is FALSE

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

MC time: 0m0sec

checking: [E [~ [p_3_1<=p_2_0] U r_0_2<=p_0_2] | AX [EF [3<=r_3_1]]]
normalized: [~ [EX [~ [E [true U 3<=r_3_1]]]] | E [~ [p_3_1<=p_2_0] U r_0_2<=p_0_2]]

abstracting: (r_0_2<=p_0_2) states: 720
abstracting: (p_3_1<=p_2_0) states: 1,080 (3)
abstracting: (3<=r_3_1) states: 0
.-> the formula is FALSE

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

MC time: 0m0sec

checking: [EF [EF [3<=p_0_2]] | [EF [[p_3_0<=p_2_0 & 1<=r_0_2]] & r_2_2<=p_2_1]]
normalized: [[r_2_2<=p_2_1 & E [true U [p_3_0<=p_2_0 & 1<=r_0_2]]] | E [true U E [true U 3<=p_0_2]]]

abstracting: (3<=p_0_2) states: 0
abstracting: (1<=r_0_2) states: 480
abstracting: (p_3_0<=p_2_0) states: 1,120 (3)
abstracting: (r_2_2<=p_2_1) states: 800
-> the formula is FALSE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: EF [EG [[3<=r_0_2 & 1<=r_2_0]]]
normalized: E [true U EG [[3<=r_0_2 & 1<=r_2_0]]]

abstracting: (1<=r_2_0) states: 592
abstracting: (3<=r_0_2) states: 0
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m0sec

checking: [~ [EF [3<=r_1_1]] & AG [EF [3<=r_4_2]]]
normalized: [~ [E [true U 3<=r_1_1]] & ~ [E [true U ~ [E [true U 3<=r_4_2]]]]]

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

FORMULA ResAllocation-PT-R003C005-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [[~ [3<=p_3_2] | [1<=p_0_0 & 3<=p_2_1]]]]
normalized: E [true U ~ [[[1<=p_0_0 & 3<=p_2_1] | ~ [3<=p_3_2]]]]

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

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

MC time: 0m0sec


Total processing time: 0m8sec


BK_STOP 1432915725147

--------------------
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:194 (9), effective:30 (1)

initing FirstDep: 0m0sec


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

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

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

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

iterations count:41 (2), effective:5 (0)

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

iterations count:20 (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-R003C005"
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-R003C005.tgz
mv ResAllocation-PT-R003C005 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-R003C005, 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-143262779601042"
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 ;