About the Execution of Marcie for CircularTrains-PT-012
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5412.650 | 21188.00 | 21070.00 | 20.00 | TFTTFTFFFFFTTTFF | 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-2979
Executing tool marcie
Input is CircularTrains-PT-012, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r017kn-qhx2-146347851000057
=====================================================================
--------------------
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 CircularTrains-PT-012-CTLCardinality-0
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-1
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-10
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-11
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-12
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-13
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-14
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-15
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-2
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-3
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-4
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-5
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-6
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-7
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-8
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1463596310102
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=CTLCardinality.xml --mcc-mode --memory=6 --suppress
parse successfull
net created successfully
Net: CircularTrains_PT_012
(NrP: 24 NrTr: 12 NrArc: 48)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
init dd package: 0m16.833sec
RS generation: 0m 0.003sec
-> reachability set: #nodes 203 (2.0e+02) #states 195
starting MCC model checker
--------------------------
checking: 3<=Section_5
normalized: 3<=Section_5
abstracting: (3<=Section_5) states: 0
-> the formula is FALSE
FORMULA CircularTrains-PT-012-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: 3<=Section_11
normalized: 3<=Section_11
abstracting: (3<=Section_11) states: 0
-> the formula is FALSE
FORMULA CircularTrains-PT-012-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: ~ [AG [2<=Section_1]]
normalized: E [true U ~ [2<=Section_1]]
abstracting: (2<=Section_1) states: 0
-> the formula is TRUE
FORMULA CircularTrains-PT-012-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: 2<=F2
normalized: 2<=F2
abstracting: (2<=F2) states: 69
-> the formula is FALSE
FORMULA CircularTrains-PT-012-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: 3<=F8
normalized: 3<=F8
abstracting: (3<=F8) states: 0
-> the formula is FALSE
FORMULA CircularTrains-PT-012-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: Section_5<=Section_12
normalized: Section_5<=Section_12
abstracting: (Section_5<=Section_12) states: 144
-> the formula is TRUE
FORMULA CircularTrains-PT-012-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[2<=F12 | EG [1<=Section_12]]]
normalized: E [true U [2<=F12 | EG [1<=Section_12]]]
abstracting: (1<=Section_12) states: 75
....................
EG iterations: 20
abstracting: (2<=F12) states: 0
-> the formula is FALSE
FORMULA CircularTrains-PT-012-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: F9<=F11
normalized: F9<=F11
abstracting: (F9<=F11) states: 178
-> the formula is TRUE
FORMULA CircularTrains-PT-012-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [AF [~ [Section_2<=F9]]]
normalized: E [true U ~ [EG [Section_2<=F9]]]
abstracting: (Section_2<=F9) states: 154
........
EG iterations: 8
-> the formula is TRUE
FORMULA CircularTrains-PT-012-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: AG [A [F10<=Section_2 U 2<=Section_2]]
normalized: ~ [E [true U ~ [[~ [EG [~ [2<=Section_2]]] & ~ [E [~ [2<=Section_2] U [~ [F10<=Section_2] & ~ [2<=Section_2]]]]]]]]
abstracting: (2<=Section_2) states: 0
abstracting: (F10<=Section_2) states: 154
abstracting: (2<=Section_2) states: 0
abstracting: (2<=Section_2) states: 0
EG iterations: 0
-> the formula is FALSE
FORMULA CircularTrains-PT-012-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: [F10<=F12 | 2<=F6]
normalized: [F10<=F12 | 2<=F6]
abstracting: (2<=F6) states: 0
abstracting: (F10<=F12) states: 144
-> the formula is FALSE
FORMULA CircularTrains-PT-012-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AF [~ [[[3<=F4 & 1<=F6] & 3<=Section_2]]]
normalized: ~ [EG [[3<=Section_2 & [3<=F4 & 1<=F6]]]]
abstracting: (1<=F6) states: 75
abstracting: (3<=F4) states: 0
abstracting: (3<=Section_2) states: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA CircularTrains-PT-012-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [[~ [EX [F2<=Section_1]] & EG [~ [F9<=F11]]] & EF [EG [2<=F10]]]
normalized: [E [true U EG [2<=F10]] & [EG [~ [F9<=F11]] & ~ [EX [F2<=Section_1]]]]
abstracting: (F2<=Section_1) states: 41
.abstracting: (F9<=F11) states: 178
...........
EG iterations: 11
abstracting: (2<=F10) states: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA CircularTrains-PT-012-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: [AF [AF [1<=Section_2]] | ~ [[[~ [3<=Section_5] & ~ [2<=F12]] | ~ [[1<=Section_7 & F6<=Section_3]]]]]
normalized: [~ [[[~ [2<=F12] & ~ [3<=Section_5]] | ~ [[1<=Section_7 & F6<=Section_3]]]] | ~ [EG [EG [~ [1<=Section_2]]]]]
abstracting: (1<=Section_2) states: 75
.....................
EG iterations: 21
.
EG iterations: 1
abstracting: (F6<=Section_3) states: 154
abstracting: (1<=Section_7) states: 45
abstracting: (3<=Section_5) states: 0
abstracting: (2<=F12) states: 0
-> the formula is TRUE
FORMULA CircularTrains-PT-012-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: A [Section_10<=Section_1 U ~ [[F8<=F11 & F8<=Section_4]]]
normalized: [~ [EG [[F8<=F11 & F8<=Section_4]]] & ~ [E [[F8<=F11 & F8<=Section_4] U [~ [Section_10<=Section_1] & [F8<=F11 & F8<=Section_4]]]]]
abstracting: (F8<=Section_4) states: 48
abstracting: (F8<=F11) states: 135
abstracting: (Section_10<=Section_1) states: 161
abstracting: (F8<=Section_4) states: 48
abstracting: (F8<=F11) states: 135
abstracting: (F8<=Section_4) states: 48
abstracting: (F8<=F11) states: 135
.......
EG iterations: 7
-> the formula is TRUE
FORMULA CircularTrains-PT-012-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: [[AG [[F7<=F5 & F1<=F12]] | AG [[2<=F5 & 1<=F5]]] & AG [[[2<=Section_10 & 2<=F8] | ~ [Section_1<=F3]]]]
normalized: [~ [E [true U ~ [[~ [Section_1<=F3] | [2<=Section_10 & 2<=F8]]]]] & [~ [E [true U ~ [[2<=F5 & 1<=F5]]]] | ~ [E [true U ~ [[F7<=F5 & F1<=F12]]]]]]
abstracting: (F1<=F12) states: 150
abstracting: (F7<=F5) states: 178
abstracting: (1<=F5) states: 171
abstracting: (2<=F5) states: 69
abstracting: (2<=F8) states: 69
abstracting: (2<=Section_10) states: 0
abstracting: (Section_1<=F3) states: 167
-> the formula is FALSE
FORMULA CircularTrains-PT-012-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
Total processing time: 0m21.139sec
BK_STOP 1463596331290
--------------------
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.003sec
iterations count:112 (9), effective:24 (2)
initing FirstDep: 0m 0.000sec
iterations count:12 (1), effective:0 (0)
iterations count:55 (4), effective:15 (1)
iterations count:70 (5), effective:13 (1)
iterations count:12 (1), effective:0 (0)
iterations count:70 (5), effective:12 (1)
iterations count:57 (4), effective:12 (1)
iterations count:40 (3), effective:5 (0)
iterations count:24 (2), effective:5 (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="CircularTrains-PT-012"
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/CircularTrains-PT-012.tgz
mv CircularTrains-PT-012 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 CircularTrains-PT-012, 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 r017kn-qhx2-146347851000057"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; 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 ;