About the Execution of Marcie for Peterson-COL-2
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3970.490 | 6198.00 | 6019.00 | 20.40 | ????FT?F???????? | 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 Peterson-COL-2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r064kn-blw3-143254880400243
=====================================================================
--------------------
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 Peterson-COL-2-ReachabilityCardinality-0
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-1
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-10
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-11
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-12
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-13
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-14
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-15
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-2
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-3
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-4
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-5
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-6
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-7
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-8
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1432736164777
Model: Peterson-COL-2
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
Unfolding complete |P|=108|T|=138|A|=432
Time for unfolding: 0m0sec
(NrP: 108 NrTr: 138 NrArc: 432)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec
init dd package: 0m3sec
RS generation: 0m0sec
-> reachability set: #nodes 3002 (3.0e+03) #states 20,754 (4)
starting MCC model checker
--------------------------
checking: EF [~ [[[2<=testTurn & 1<=askForSection] | [3<=wantSection | idle<=turn]]]]
normalized: E [true U ~ [[[3<=wantSection | idle<=turn] | [2<=testTurn & 1<=askForSection]]]]
FORMULA Peterson-COL-2-ReachabilityCardinality-0CANNOT_COMPUTE
MC time: 0m0sec
checking: AG [1<=wantSection]
normalized: ~ [E [true U ~ [1<=wantSection]]]
FORMULA Peterson-COL-2-ReachabilityCardinality-1CANNOT_COMPUTE
MC time: 0m0sec
checking: AG [1<=wantSection]
normalized: ~ [E [true U ~ [1<=wantSection]]]
FORMULA Peterson-COL-2-ReachabilityCardinality-2CANNOT_COMPUTE
MC time: 0m0sec
checking: AG [[[[isEndLoop<=testIdentity & askForSection<=testAlone] | ~ [3<=testTurn]] | ~ [isEndLoop<=askForSection]]]
normalized: ~ [E [true U ~ [[~ [isEndLoop<=askForSection] | [~ [3<=testTurn] | [isEndLoop<=testIdentity & askForSection<=testAlone]]]]]]
abstracting: (askForSection<=testAlone) states: 0
abstracting: (isEndLoop<=testIdentity) states: 0
FORMULA Peterson-COL-2-ReachabilityCardinality-3CANNOT_COMPUTE
MC time: 0m0sec
checking: EF [~ [[turn<=turn | ~ [2<=endTurn]]]]
normalized: E [true U ~ [[~ [2<=endTurn] | turn<=turn]]]
abstracting: (turn<=turn) states: 0
FORMULA Peterson-COL-2-ReachabilityCardinality-4CANNOT_COMPUTE
MC time: 0m0sec
checking: EF [[[[wantSection<=endTurn & 2<=idle] | [3<=CS & 1<=beginLoop]] & ~ [[testIdentity<=testIdentity & 3<=isEndLoop]]]]
normalized: E [true U [[[3<=CS & 1<=beginLoop] | [wantSection<=endTurn & 2<=idle]] & ~ [[testIdentity<=testIdentity & 3<=isEndLoop]]]]
FORMULA Peterson-COL-2-ReachabilityCardinality-5CANNOT_COMPUTE
MC time: 0m0sec
checking: AG [[[isEndLoop<=beginLoop | [testIdentity<=testTurn | testIdentity<=testIdentity]] | ~ [1<=testTurn]]]
normalized: ~ [E [true U ~ [[[[testIdentity<=testTurn | testIdentity<=testIdentity] | isEndLoop<=beginLoop] | ~ [1<=testTurn]]]]]
FORMULA Peterson-COL-2-ReachabilityCardinality-6CANNOT_COMPUTE
MC time: 0m0sec
checking: EF [3<=endTurn]
normalized: E [true U 3<=endTurn]
FORMULA Peterson-COL-2-ReachabilityCardinality-7CANNOT_COMPUTE
MC time: 0m0sec
checking: EF [~ [[2<=endTurn | endTurn<=wantSection]]]
normalized: E [true U ~ [[2<=endTurn | endTurn<=wantSection]]]
abstracting: (endTurn<=wantSection) states: 0
FORMULA Peterson-COL-2-ReachabilityCardinality-8CANNOT_COMPUTE
MC time: 0m0sec
checking: EF [[2<=turn & [[2<=beginLoop & 3<=testTurn] & [idle<=askForSection & 1<=beginLoop]]]]
normalized: E [true U [[[idle<=askForSection & 1<=beginLoop] & [2<=beginLoop & 3<=testTurn]] & 2<=turn]]
FORMULA Peterson-COL-2-ReachabilityCardinality-9CANNOT_COMPUTE
MC time: 0m0sec
checking: EF [[~ [~ [turn<=wantSection]] & [~ [3<=testAlone] & [beginLoop<=CS & 3<=testIdentity]]]]
normalized: E [true U [[~ [3<=testAlone] & [beginLoop<=CS & 3<=testIdentity]] & turn<=wantSection]]
abstracting: (turn<=wantSection) states: 0
FORMULA Peterson-COL-2-ReachabilityCardinality-10CANNOT_COMPUTE
MC time: 0m0sec
checking: AG [[[[beginLoop<=isEndLoop | 3<=isEndLoop] | 3<=isEndLoop] | [[beginLoop<=wantSection | endTurn<=turn] | [2<=endTurn | testAlone<=testIdentity]]]]
normalized: ~ [E [true U ~ [[[[beginLoop<=wantSection | endTurn<=turn] | [2<=endTurn | testAlone<=testIdentity]] | [[beginLoop<=isEndLoop | 3<=isEndLoop] | 3<=isEndLoop]]]]]
FORMULA Peterson-COL-2-ReachabilityCardinality-11CANNOT_COMPUTE
MC time: 0m0sec
checking: EF [~ [~ [wantSection<=CS]]]
normalized: E [true U wantSection<=CS]
abstracting: (wantSection<=CS) states: 0
-> the formula is FALSE
FORMULA Peterson-COL-2-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [~ [~ [~ [wantSection<=wantSection]]]]
normalized: E [true U ~ [wantSection<=wantSection]]
abstracting: (wantSection<=wantSection) states: 0
-> the formula is TRUE
FORMULA Peterson-COL-2-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[[~ [2<=CS] | [idle<=idle | 3<=askForSection]] | idle<=CS]]
normalized: ~ [E [true U ~ [[[[idle<=idle | 3<=askForSection] | ~ [2<=CS]] | idle<=CS]]]]
abstracting: (idle<=CS) states: 0
FORMULA Peterson-COL-2-ReachabilityCardinality-14CANNOT_COMPUTE
MC time: 0m0sec
checking: AG [[wantSection<=wantSection & ~ [~ [CS<=idle]]]]
normalized: ~ [E [true U ~ [[wantSection<=wantSection & CS<=idle]]]]
abstracting: (CS<=idle) states: 0
abstracting: (wantSection<=wantSection) states: 0
-> the formula is FALSE
FORMULA Peterson-COL-2-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 0m6sec
BK_STOP 1432736170975
--------------------
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
580 1369 1761 2017 2038 2504 2794 2756
iterations count:8661 (62), effective:796 (5)
initing FirstDep: 0m0sec
Unknown names:
askForSection
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
wantSection
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
wantSection
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
testTurn
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
endTurn
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
isEndLoop
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
testTurn
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
endTurn
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
endTurn
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
turn
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
testIdentity
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
isEndLoop
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
iterations count:138 (1), effective:0 (0)
Unknown names:
CS
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
iterations count:138 (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="Peterson-COL-2"
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/Peterson-COL-2.tgz
mv Peterson-COL-2 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 Peterson-COL-2, 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 r064kn-blw3-143254880400243"
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 ;