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-2270
Executing tool marcie
Input is SmallOperatingSystem-PT-MT0512DC0256, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r260su-blw3-143374349500294
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433803588610

Model: SmallOperatingSystem-PT-MT0512DC0256
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=ReachabilityBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 9 NrTr: 8 NrArc: 27)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m2sec


RS generation: 0m0sec


-> reachability set: #nodes 9 (9.0e+00) #states 1



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

checking: maxVal(TaskOnDisk)<=3
normalized: maxVal(TaskOnDisk)<=3

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

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityBounds-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(LoadingMem)<=2 & [maxVal(DiskControllerUnit)<=1 & [[[maxVal(TransferToDisk)<=3 & [maxVal(TaskReady)<=1 & maxVal(TaskSuspended)<=1]] & maxVal(CPUUnit)<=2] & [[[maxVal(TaskReady)<=2 & maxVal(ExecutingTask)<=1] & [maxVal(LoadingMem)<=2 & maxVal(TransferToDisk)<=1]] & [[maxVal(TransferToDisk)<=3 & maxVal(TransferToDisk)<=3] & maxVal(CPUUnit)<=3]]]]]
normalized: [maxVal(LoadingMem)<=2 & [maxVal(DiskControllerUnit)<=1 & [[maxVal(CPUUnit)<=2 & [maxVal(TransferToDisk)<=3 & [maxVal(TaskReady)<=1 & maxVal(TaskSuspended)<=1]]] & [[maxVal(CPUUnit)<=3 & [maxVal(TransferToDisk)<=3 & maxVal(TransferToDisk)<=3]] & [[maxVal(LoadingMem)<=2 & maxVal(TransferToDisk)<=1] & [maxVal(TaskReady)<=2 & maxVal(ExecutingTask)<=1]]]]]]

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

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityBounds-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(TaskOnDisk)<=2 & maxVal(TransferToDisk)<=1]
normalized: [maxVal(TaskOnDisk)<=2 & maxVal(TransferToDisk)<=1]

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

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityBounds-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(TaskOnDisk)<=1
normalized: maxVal(TaskOnDisk)<=1

abstracting: (512<=1) states: 0
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityBounds-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(TaskOnDisk)<=2 & [[[maxVal(LoadingMem)<=2 & maxVal(LoadingMem)<=2] & [maxVal(DiskControllerUnit)<=1 & [maxVal(TransferToDisk)<=1 & maxVal(CPUUnit)<=3]]] & maxVal(ExecutingTask)<=1]]
normalized: [maxVal(TaskOnDisk)<=2 & [maxVal(ExecutingTask)<=1 & [[maxVal(LoadingMem)<=2 & maxVal(LoadingMem)<=2] & [maxVal(DiskControllerUnit)<=1 & [maxVal(TransferToDisk)<=1 & maxVal(CPUUnit)<=3]]]]]

abstracting: (0<=3) states: 1
abstracting: (0<=1) states: 1
abstracting: (0<=1) states: 1
abstracting: (0<=2) states: 1
abstracting: (0<=2) states: 1
abstracting: (0<=1) states: 1
abstracting: (512<=2) states: 0
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityBounds-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(TransferToDisk)<=2 & maxVal(LoadingMem)<=2] & maxVal(CPUUnit)<=2]
normalized: [maxVal(CPUUnit)<=2 & [maxVal(TransferToDisk)<=2 & maxVal(LoadingMem)<=2]]

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

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityBounds-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(CPUUnit)<=2 & maxVal(DiskControllerUnit)<=2]
normalized: [maxVal(CPUUnit)<=2 & maxVal(DiskControllerUnit)<=2]

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

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityBounds-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(TaskReady)<=2
normalized: maxVal(TaskReady)<=2

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

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityBounds-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(CPUUnit)<=2 & maxVal(TaskReady)<=1]
normalized: [maxVal(CPUUnit)<=2 & maxVal(TaskReady)<=1]

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

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityBounds-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(TransferToDisk)<=2
normalized: maxVal(TransferToDisk)<=2

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

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityBounds-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(FreeMemSegment)<=2
normalized: maxVal(FreeMemSegment)<=2

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

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityBounds-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(CPUUnit)<=2
normalized: maxVal(CPUUnit)<=2

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

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityBounds-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(ExecutingTask)<=3
normalized: maxVal(ExecutingTask)<=3

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

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityBounds-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(DiskControllerUnit)<=2
normalized: maxVal(DiskControllerUnit)<=2

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

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityBounds-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(FreeMemSegment)<=1
normalized: maxVal(FreeMemSegment)<=1

abstracting: (512<=1) states: 0
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityBounds-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[[[maxVal(LoadingMem)<=2 & maxVal(TaskReady)<=2] & maxVal(LoadingMem)<=3] & maxVal(CPUUnit)<=1] & maxVal(DiskControllerUnit)<=2] & maxVal(TransferToDisk)<=2] & maxVal(DiskControllerUnit)<=3]
normalized: [maxVal(DiskControllerUnit)<=3 & [maxVal(TransferToDisk)<=2 & [maxVal(DiskControllerUnit)<=2 & [maxVal(CPUUnit)<=1 & [maxVal(LoadingMem)<=3 & [maxVal(LoadingMem)<=2 & maxVal(TaskReady)<=2]]]]]]

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

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityBounds-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m3sec


BK_STOP 1433803592297

--------------------
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
warning: all transitions are not enabled in the initial marking!

check if there are transitions that can never fire
ok


initing FirstDep: 0m0sec


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

initing FirstDep: 0m0sec

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="SmallOperatingSystem-PT-MT0512DC0256"
export BK_EXAMINATION="ReachabilityBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/user/u8/hulinhub/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/SmallOperatingSystem-PT-MT0512DC0256.tgz
mv SmallOperatingSystem-PT-MT0512DC0256 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is SmallOperatingSystem-PT-MT0512DC0256, examination is ReachabilityBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r260su-blw3-143374349500294"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityBounds" != "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 "ReachabilityBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityBounds.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 '' ReachabilityBounds.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 ;