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-R003C010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444128500304
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464598231494


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=ReachabilityCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: ResAllocation_PT_R003C010
(NrP: 60 NrTr: 40 NrArc: 174)

net check time: 0m 0.000sec

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

init dd package: 0m 4.202sec


RS generation: 0m 0.005sec


-> reachability set: #nodes 376 (3.8e+02) #states 823,552 (5)



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

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

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

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: AG [p_5_1<=r_9_0]
normalized: ~ [E [true U ~ [p_5_1<=r_9_0]]]

abstracting: (p_5_1<=r_9_0) states: 753,408 (5)
-> the formula is FALSE

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

MC time: 0m 0.007sec

checking: EF [[~ [~ [3<=p_0_1]] | 3<=r_1_2]]
normalized: E [true U [3<=p_0_1 | 3<=r_1_2]]

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

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

MC time: 0m 0.000sec

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

abstracting: (r_7_1<=r_7_1) states: 823,552 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[r_5_0<=p_5_0 | ~ [3<=p_0_0]]]
normalized: ~ [E [true U ~ [[r_5_0<=p_5_0 | ~ [3<=p_0_0]]]]]

abstracting: (3<=p_0_0) states: 0
abstracting: (r_5_0<=p_5_0) states: 418,304 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [2<=r_9_1] | ~ [[2<=p_6_0 | r_1_1<=p_4_2]]]]
normalized: ~ [E [true U ~ [[~ [[2<=p_6_0 | r_1_1<=p_4_2]] | ~ [2<=r_9_1]]]]]

abstracting: (2<=r_9_1) states: 0
abstracting: (r_1_1<=p_4_2) states: 440,704 (5)
abstracting: (2<=p_6_0) states: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [[p_5_0<=r_6_2 & [3<=r_0_0 & ~ [2<=r_7_0]]]]
normalized: E [true U [p_5_0<=r_6_2 & [3<=r_0_0 & ~ [2<=r_7_0]]]]

abstracting: (2<=r_7_0) states: 0
abstracting: (3<=r_0_0) states: 0
abstracting: (p_5_0<=r_6_2) states: 770,048 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [[1<=r_0_1 & 3<=r_1_0]] | [2<=p_5_0 & ~ [r_9_0<=r_3_2]]]]
normalized: ~ [E [true U ~ [[[2<=p_5_0 & ~ [r_9_0<=r_3_2]] | ~ [[1<=r_0_1 & 3<=r_1_0]]]]]]

abstracting: (3<=r_1_0) states: 0
abstracting: (1<=r_0_1) states: 356,352 (5)
abstracting: (r_9_0<=r_3_2) states: 525,056 (5)
abstracting: (2<=p_5_0) states: 0
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: AG [[[p_0_1<=p_4_2 | ~ [2<=p_0_2]] | ~ [[3<=r_7_2 | 3<=r_5_2]]]]
normalized: ~ [E [true U ~ [[~ [[3<=r_7_2 | 3<=r_5_2]] | [p_0_1<=p_4_2 | ~ [2<=p_0_2]]]]]]

abstracting: (2<=p_0_2) states: 0
abstracting: (p_0_1<=p_4_2) states: 548,352 (5)
abstracting: (3<=r_5_2) states: 0
abstracting: (3<=r_7_2) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[~ [~ [p_2_2<=r_6_0]] & [[1<=r_0_1 | p_1_1<=p_0_2] & 2<=r_4_1]]]
normalized: E [true U [p_2_2<=r_6_0 & [2<=r_4_1 & [1<=r_0_1 | p_1_1<=p_0_2]]]]

abstracting: (p_1_1<=p_0_2) states: 680,192 (5)
abstracting: (1<=r_0_1) states: 356,352 (5)
abstracting: (2<=r_4_1) states: 0
abstracting: (p_2_2<=r_6_0) states: 748,288 (5)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [[p_7_1<=r_9_0 | [[p_3_2<=p_0_2 & r_9_2<=r_7_2] | r_6_0<=p_8_1]]]
normalized: ~ [E [true U ~ [[p_7_1<=r_9_0 | [r_6_0<=p_8_1 | [p_3_2<=p_0_2 & r_9_2<=r_7_2]]]]]]

abstracting: (r_9_2<=r_7_2) states: 588,096 (5)
abstracting: (p_3_2<=p_0_2) states: 592,384 (5)
abstracting: (r_6_0<=p_8_1) states: 521,920 (5)
abstracting: (p_7_1<=r_9_0) states: 729,984 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [[[[3<=r_9_2 & p_3_2<=p_7_1] | r_6_1<=r_0_2] & [[r_1_0<=r_6_2 & r_0_2<=r_8_2] & [2<=r_5_2 & 2<=r_0_1]]]]
normalized: E [true U [[[2<=r_5_2 & 2<=r_0_1] & [r_1_0<=r_6_2 & r_0_2<=r_8_2]] & [r_6_1<=r_0_2 | [3<=r_9_2 & p_3_2<=p_7_1]]]]

abstracting: (p_3_2<=p_7_1) states: 613,632 (5)
abstracting: (3<=r_9_2) states: 0
abstracting: (r_6_1<=r_0_2) states: 592,448 (5)
abstracting: (r_0_2<=r_8_2) states: 647,232 (5)
abstracting: (r_1_0<=r_6_2) states: 602,624 (5)
abstracting: (2<=r_0_1) states: 0
abstracting: (2<=r_5_2) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec


Total processing time: 0m 5.758sec


BK_STOP 1464598237286

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


iterations count:306 (7), effective:60 (1)

initing FirstDep: 0m 0.000sec


iterations count:155 (3), effective:17 (0)

iterations count:181 (4), effective:22 (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-R003C010"
export BK_EXAMINATION="ReachabilityCardinality"
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-R003C010.tgz
mv S_ResAllocation-PT-R003C010 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-R003C010, examination is ReachabilityCardinality"
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-146444128500304"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;