About the Execution of Marcie for SmallOperatingSystem-PT-MT0256DC0128
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3958.410 | 3846.00 | 3000.00 | 20.20 | FFFTFFTFFTFTTFTF | normal |
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-MT0256DC0128, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r260su-blw3-143374349500269
=====================================================================
--------------------
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-MT0256DC0128-ReachabilityCardinality-0
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-1
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-15
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-2
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-3
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-4
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-5
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-6
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-7
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-8
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1433803561472
Model: SmallOperatingSystem-PT-MT0256DC0128
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=ReachabilityCardinality.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: AG [[~ [1<=FreeMemSegment] & [2<=TaskSuspended & [CPUUnit<=TaskReady | 3<=LoadingMem]]]]
normalized: ~ [E [true U ~ [[[2<=TaskSuspended & [CPUUnit<=TaskReady | 3<=LoadingMem]] & ~ [1<=FreeMemSegment]]]]]
abstracting: (1<=FreeMemSegment) states: 1
abstracting: (3<=LoadingMem) states: 0
abstracting: (CPUUnit<=TaskReady) states: 1
abstracting: (2<=TaskSuspended) states: 0
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[[1<=CPUUnit & [TaskReady<=TaskReady | TaskSuspended<=CPUUnit]] & FreeMemSegment<=ExecutingTask]]
normalized: ~ [E [true U ~ [[FreeMemSegment<=ExecutingTask & [1<=CPUUnit & [TaskReady<=TaskReady | TaskSuspended<=CPUUnit]]]]]]
abstracting: (TaskSuspended<=CPUUnit) states: 1
abstracting: (TaskReady<=TaskReady) states: 1
abstracting: (1<=CPUUnit) states: 0
abstracting: (FreeMemSegment<=ExecutingTask) states: 0
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[FreeMemSegment<=DiskControllerUnit & CPUUnit<=ExecutingTask]]
normalized: E [true U [FreeMemSegment<=DiskControllerUnit & CPUUnit<=ExecutingTask]]
abstracting: (CPUUnit<=ExecutingTask) states: 1
abstracting: (FreeMemSegment<=DiskControllerUnit) states: 0
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[[~ [TaskSuspended<=TaskReady] & ~ [TaskReady<=FreeMemSegment]] | [[1<=TaskReady | 1<=LoadingMem] | [1<=TaskOnDisk & 2<=TaskOnDisk]]]]
normalized: ~ [E [true U ~ [[[[1<=TaskReady | 1<=LoadingMem] | [1<=TaskOnDisk & 2<=TaskOnDisk]] | [~ [TaskReady<=FreeMemSegment] & ~ [TaskSuspended<=TaskReady]]]]]]
abstracting: (TaskSuspended<=TaskReady) states: 1
abstracting: (TaskReady<=FreeMemSegment) states: 1
abstracting: (2<=TaskOnDisk) states: 1
abstracting: (1<=TaskOnDisk) states: 1
abstracting: (1<=LoadingMem) states: 0
abstracting: (1<=TaskReady) states: 0
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[[1<=CPUUnit & [1<=CPUUnit | 2<=TaskReady]] | [[2<=ExecutingTask & 3<=TransferToDisk] | 1<=TransferToDisk]]]
normalized: E [true U [[1<=CPUUnit & [1<=CPUUnit | 2<=TaskReady]] | [1<=TransferToDisk | [2<=ExecutingTask & 3<=TransferToDisk]]]]
abstracting: (3<=TransferToDisk) states: 0
abstracting: (2<=ExecutingTask) states: 0
abstracting: (1<=TransferToDisk) states: 0
abstracting: (2<=TaskReady) states: 0
abstracting: (1<=CPUUnit) states: 0
abstracting: (1<=CPUUnit) states: 0
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [TaskSuspended<=TransferToDisk]
normalized: ~ [E [true U ~ [TaskSuspended<=TransferToDisk]]]
abstracting: (TaskSuspended<=TransferToDisk) states: 1
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [CPUUnit<=TaskReady]
normalized: ~ [E [true U ~ [CPUUnit<=TaskReady]]]
abstracting: (CPUUnit<=TaskReady) states: 1
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[[[1<=LoadingMem | 3<=FreeMemSegment] & ~ [ExecutingTask<=TaskOnDisk]] & [[2<=ExecutingTask & CPUUnit<=TaskReady] | ~ [TaskSuspended<=TransferToDisk]]]]
normalized: ~ [E [true U ~ [[[~ [TaskSuspended<=TransferToDisk] | [2<=ExecutingTask & CPUUnit<=TaskReady]] & [~ [ExecutingTask<=TaskOnDisk] & [1<=LoadingMem | 3<=FreeMemSegment]]]]]]
abstracting: (3<=FreeMemSegment) states: 1
abstracting: (1<=LoadingMem) states: 0
abstracting: (ExecutingTask<=TaskOnDisk) states: 1
abstracting: (CPUUnit<=TaskReady) states: 1
abstracting: (2<=ExecutingTask) states: 0
abstracting: (TaskSuspended<=TransferToDisk) states: 1
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[ExecutingTask<=FreeMemSegment | [[2<=CPUUnit | TaskOnDisk<=LoadingMem] | [FreeMemSegment<=TaskSuspended | 3<=TransferToDisk]]]]
normalized: ~ [E [true U ~ [[ExecutingTask<=FreeMemSegment | [[2<=CPUUnit | TaskOnDisk<=LoadingMem] | [FreeMemSegment<=TaskSuspended | 3<=TransferToDisk]]]]]]
abstracting: (3<=TransferToDisk) states: 0
abstracting: (FreeMemSegment<=TaskSuspended) states: 0
abstracting: (TaskOnDisk<=LoadingMem) states: 0
abstracting: (2<=CPUUnit) states: 0
abstracting: (ExecutingTask<=FreeMemSegment) states: 1
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [FreeMemSegment<=DiskControllerUnit]
normalized: ~ [E [true U ~ [FreeMemSegment<=DiskControllerUnit]]]
abstracting: (FreeMemSegment<=DiskControllerUnit) states: 0
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[~ [[TaskReady<=ExecutingTask | LoadingMem<=LoadingMem]] & [[CPUUnit<=ExecutingTask & 3<=TaskReady] | ~ [3<=TaskSuspended]]]]
normalized: E [true U [[~ [3<=TaskSuspended] | [CPUUnit<=ExecutingTask & 3<=TaskReady]] & ~ [[TaskReady<=ExecutingTask | LoadingMem<=LoadingMem]]]]
abstracting: (LoadingMem<=LoadingMem) states: 1
abstracting: (TaskReady<=ExecutingTask) states: 1
abstracting: (3<=TaskReady) states: 0
abstracting: (CPUUnit<=ExecutingTask) states: 1
abstracting: (3<=TaskSuspended) states: 0
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [~ [~ [[3<=FreeMemSegment & LoadingMem<=TaskReady]]]]
normalized: E [true U [3<=FreeMemSegment & LoadingMem<=TaskReady]]
abstracting: (LoadingMem<=TaskReady) states: 1
abstracting: (3<=FreeMemSegment) states: 1
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [2<=TaskSuspended]
normalized: ~ [E [true U ~ [2<=TaskSuspended]]]
abstracting: (2<=TaskSuspended) states: 0
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[~ [[1<=TaskOnDisk | 3<=TaskReady]] & ~ [[LoadingMem<=TaskSuspended & 1<=CPUUnit]]]]
normalized: E [true U [~ [[LoadingMem<=TaskSuspended & 1<=CPUUnit]] & ~ [[1<=TaskOnDisk | 3<=TaskReady]]]]
abstracting: (3<=TaskReady) states: 0
abstracting: (1<=TaskOnDisk) states: 1
abstracting: (1<=CPUUnit) states: 0
abstracting: (LoadingMem<=TaskSuspended) states: 1
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [~ [[[TaskReady<=FreeMemSegment & CPUUnit<=TaskOnDisk] & [2<=TaskSuspended & TaskReady<=FreeMemSegment]]]]
normalized: ~ [E [true U [[2<=TaskSuspended & TaskReady<=FreeMemSegment] & [TaskReady<=FreeMemSegment & CPUUnit<=TaskOnDisk]]]]
abstracting: (CPUUnit<=TaskOnDisk) states: 1
abstracting: (TaskReady<=FreeMemSegment) states: 1
abstracting: (TaskReady<=FreeMemSegment) states: 1
abstracting: (2<=TaskSuspended) states: 0
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [~ [[~ [3<=ExecutingTask] | 1<=FreeMemSegment]]]
normalized: ~ [E [true U [1<=FreeMemSegment | ~ [3<=ExecutingTask]]]]
abstracting: (3<=ExecutingTask) states: 0
abstracting: (1<=FreeMemSegment) states: 1
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 0m3sec
BK_STOP 1433803565318
--------------------
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
iterations count:8 (1), effective:0 (0)
iterations count:8 (1), effective:0 (0)
iterations count:8 (1), effective:0 (0)
iterations count:8 (1), effective:0 (0)
iterations count:8 (1), effective:0 (0)
iterations count:8 (1), effective:0 (0)
iterations count:8 (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="SmallOperatingSystem-PT-MT0256DC0128"
export BK_EXAMINATION="ReachabilityCardinality"
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-MT0256DC0128.tgz
mv SmallOperatingSystem-PT-MT0256DC0128 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-MT0256DC0128, 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 r260su-blw3-143374349500269"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; 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 '
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 ;