About the Execution of Marcie for SharedMemory-COL-000010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3967.140 | 239801.00 | 239859.00 | 100.50 | ???????T??FFF??? | 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-2265
Executing tool marcie
Input is SharedMemory-COL-000010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r092kn-qhx2-143267650300184
=====================================================================
--------------------
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 SharedMemory-COL-000010-CTLCardinality-0
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-1
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-10
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-11
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-12
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-13
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-14
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-15
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-2
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-3
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-4
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-5
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-6
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-7
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-8
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1432989712205
Model: SharedMemory-COL-000010
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
Unfolding complete |P|=141|T|=220|A|=840
Time for unfolding: 0m0sec
(NrP: 141 NrTr: 220 NrArc: 840)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec
init dd package: 0m13sec
RS generation: 0m1sec
-> reachability set: #nodes 8815 (8.8e+03) #states 1,830,519 (6)
starting MCC model checker
--------------------------
checking: [1<=active & E [ownMemAcc<=queue U ~ [2<=memory]]]
normalized: [1<=active & E [ownMemAcc<=queue U ~ [2<=memory]]]
FORMULA SharedMemory-COL-000010-CTLCardinality-0CANNOT_COMPUTE
MC time: 0m0sec
checking: AG [EF [[1<=extMemAcc | extMemAcc<=extMemAcc]]]
normalized: ~ [E [true U ~ [E [true U [1<=extMemAcc | extMemAcc<=extMemAcc]]]]]
abstracting: (extMemAcc<=extMemAcc) states: 0
FORMULA SharedMemory-COL-000010-CTLCardinality-1CANNOT_COMPUTE
MC time: 0m14sec
checking: ~ [E [[queue<=queue & extMemAcc<=memory] U ~ [3<=memory]]]
normalized: ~ [E [[queue<=queue & extMemAcc<=memory] U ~ [3<=memory]]]
FORMULA SharedMemory-COL-000010-CTLCardinality-2CANNOT_COMPUTE
MC time: 0m0sec
checking: E [[extMemAcc<=ownMemAcc & [extBus<=queue & 2<=extMemAcc]] U AG [extMemAcc<=extMemAcc]]
normalized: E [[extMemAcc<=ownMemAcc & [extBus<=queue & 2<=extMemAcc]] U ~ [E [true U ~ [extMemAcc<=extMemAcc]]]]
abstracting: (extMemAcc<=extMemAcc) states: 0
FORMULA SharedMemory-COL-000010-CTLCardinality-3CANNOT_COMPUTE
MC time: 0m15sec
checking: EF [AG [extMemAcc<=memory]]
normalized: E [true U ~ [E [true U ~ [extMemAcc<=memory]]]]
abstracting: (extMemAcc<=memory) states: 0
-> the formula is FALSE
FORMULA SharedMemory-COL-000010-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m14sec
checking: AG [[queue<=queue | EF [queue<=memory]]]
normalized: ~ [E [true U ~ [[E [true U queue<=memory] | queue<=queue]]]]
abstracting: (queue<=queue) states: 0
abstracting: (queue<=memory) states: 0
-> the formula is FALSE
FORMULA SharedMemory-COL-000010-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m28sec
checking: E [EG [extMemAcc<=queue] U AG [queue<=memory]]
normalized: E [EG [extMemAcc<=queue] U ~ [E [true U ~ [queue<=memory]]]]
abstracting: (queue<=memory) states: 0
abstracting: (extMemAcc<=queue) states: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA SharedMemory-COL-000010-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m29sec
checking: AX [~ [EF [2<=extMemAcc]]]
normalized: ~ [EX [E [true U 2<=extMemAcc]]]
FORMULA SharedMemory-COL-000010-CTLCardinality-7CANNOT_COMPUTE
MC time: 0m0sec
checking: AG [EF [[queue<=memory | 2<=ownMemAcc]]]
normalized: ~ [E [true U ~ [E [true U [queue<=memory | 2<=ownMemAcc]]]]]
FORMULA SharedMemory-COL-000010-CTLCardinality-8CANNOT_COMPUTE
MC time: 0m0sec
checking: E [EX [extMemAcc<=active] U [[1<=active | 1<=ownMemAcc] & [3<=extMemAcc & ownMemAcc<=memory]]]
normalized: E [EX [extMemAcc<=active] U [[3<=extMemAcc & ownMemAcc<=memory] & [1<=active | 1<=ownMemAcc]]]
FORMULA SharedMemory-COL-000010-CTLCardinality-9CANNOT_COMPUTE
MC time: 0m0sec
checking: EF [[AG [1<=extBus] & EX [queue<=extMemAcc]]]
normalized: E [true U [~ [E [true U ~ [1<=extBus]]] & EX [queue<=extMemAcc]]]
abstracting: (queue<=extMemAcc) states: 0
.
FORMULA SharedMemory-COL-000010-CTLCardinality-10CANNOT_COMPUTE
MC time: 0m14sec
checking: AX [A [1<=memory U extBus<=ownMemAcc]]
normalized: ~ [EX [~ [[~ [EG [~ [extBus<=ownMemAcc]]] & ~ [E [~ [1<=memory] U [~ [1<=memory] & ~ [extBus<=ownMemAcc]]]]]]]]
abstracting: (extBus<=ownMemAcc) states: 0
FORMULA SharedMemory-COL-000010-CTLCardinality-11CANNOT_COMPUTE
MC time: 0m15sec
checking: EF [[~ [[active<=extMemAcc | active<=extMemAcc]] | ~ [2<=memory]]]
normalized: E [true U [~ [2<=memory] | ~ [[active<=extMemAcc | active<=extMemAcc]]]]
abstracting: (active<=extMemAcc) states: 0
abstracting: (active<=extMemAcc) states: 0
FORMULA SharedMemory-COL-000010-CTLCardinality-12CANNOT_COMPUTE
MC time: 0m29sec
checking: ~ [[[active<=queue & [~ [active<=queue] & [ownMemAcc<=active & 2<=extBus]]] | EF [~ [2<=memory]]]]
normalized: ~ [[[active<=queue & [[ownMemAcc<=active & 2<=extBus] & ~ [active<=queue]]] | E [true U ~ [2<=memory]]]]
FORMULA SharedMemory-COL-000010-CTLCardinality-13CANNOT_COMPUTE
MC time: 0m0sec
checking: ~ [AG [[[3<=extBus | active<=active] & [ownMemAcc<=ownMemAcc | memory<=active]]]]
normalized: E [true U ~ [[[3<=extBus | active<=active] & [ownMemAcc<=ownMemAcc | memory<=active]]]]
abstracting: (memory<=active) states: 0
abstracting: (ownMemAcc<=ownMemAcc) states: 0
abstracting: (active<=active) states: 0
FORMULA SharedMemory-COL-000010-CTLCardinality-14CANNOT_COMPUTE
MC time: 0m43sec
checking: AX [~ [AG [extMemAcc<=active]]]
normalized: ~ [EX [~ [E [true U ~ [extMemAcc<=active]]]]]
abstracting: (extMemAcc<=active) states: 0
.-> the formula is TRUE
FORMULA SharedMemory-COL-000010-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m14sec
Total processing time: 3m59sec
BK_STOP 1432989952006
--------------------
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
669 966 1808 2258 2858 3406 4163 4701 4739 5219 5257
iterations count:11641 (52), effective:110 (0)
initing FirstDep: 0m0sec
Unknown names:
memory
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
extMemAcc
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
memory
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
iterations count:220 (1), effective:0 (0)
Unknown names:
extMemAcc
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
iterations count:220 (1), effective:0 (0)
iterations count:220 (1), effective:0 (0)
iterations count:220 (1), effective:0 (0)
Unknown names:
extMemAcc
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
ownMemAcc
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
ownMemAcc
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
extBus
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
memory
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
memory
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
memory
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
extBus
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
iterations count:220 (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="SharedMemory-COL-000010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/fko/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/SharedMemory-COL-000010.tgz
mv SharedMemory-COL-000010 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 SharedMemory-COL-000010, 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 r092kn-qhx2-143267650300184"
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 '
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 ;