About the Execution of Marcie for AutoFlight-PT-05a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5416.780 | 7511.00 | 7029.00 | 10.10 | FTTTTFFTFFFFFFFT | 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 AutoFlight-PT-05a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r209su-blw3-146445825300241
=====================================================================
--------------------
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 AutoFlight-PT-05a-ReachabilityCardinality-0
FORMULA_NAME AutoFlight-PT-05a-ReachabilityCardinality-1
FORMULA_NAME AutoFlight-PT-05a-ReachabilityCardinality-10
FORMULA_NAME AutoFlight-PT-05a-ReachabilityCardinality-11
FORMULA_NAME AutoFlight-PT-05a-ReachabilityCardinality-12
FORMULA_NAME AutoFlight-PT-05a-ReachabilityCardinality-13
FORMULA_NAME AutoFlight-PT-05a-ReachabilityCardinality-14
FORMULA_NAME AutoFlight-PT-05a-ReachabilityCardinality-15
FORMULA_NAME AutoFlight-PT-05a-ReachabilityCardinality-2
FORMULA_NAME AutoFlight-PT-05a-ReachabilityCardinality-3
FORMULA_NAME AutoFlight-PT-05a-ReachabilityCardinality-4
FORMULA_NAME AutoFlight-PT-05a-ReachabilityCardinality-5
FORMULA_NAME AutoFlight-PT-05a-ReachabilityCardinality-6
FORMULA_NAME AutoFlight-PT-05a-ReachabilityCardinality-7
FORMULA_NAME AutoFlight-PT-05a-ReachabilityCardinality-8
FORMULA_NAME AutoFlight-PT-05a-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1464684678012
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=ReachabilityCardinality.xml --mcc-mode --memory=6 --suppress
parse successfull
net created successfully
Net: AutoFlight_PT_05a
(NrP: 132 NrTr: 130 NrArc: 420)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
init dd package: 0m 4.075sec
RS generation: 0m 0.208sec
-> reachability set: #nodes 1211 (1.2e+03) #states 68,179,969 (7)
starting MCC model checker
--------------------------
checking: EF [2<=p49]
normalized: E [true U 2<=p49]
abstracting: (2<=p49) states: 0
-> the formula is FALSE
FORMULA AutoFlight-PT-05a-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [1<=p62]
normalized: E [true U 1<=p62]
abstracting: (1<=p62) states: 248,832 (5)
-> the formula is TRUE
FORMULA AutoFlight-PT-05a-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.392sec
checking: EF [2<=p46]
normalized: E [true U 2<=p46]
abstracting: (2<=p46) states: 0
-> the formula is FALSE
FORMULA AutoFlight-PT-05a-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [3<=p54]
normalized: E [true U 3<=p54]
abstracting: (3<=p54) states: 0
-> the formula is FALSE
FORMULA AutoFlight-PT-05a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [~ [[3<=p82 | 2<=p82]]]]
normalized: E [true U [3<=p82 | 2<=p82]]
abstracting: (2<=p82) states: 0
abstracting: (3<=p82) states: 0
-> the formula is FALSE
FORMULA AutoFlight-PT-05a-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [p81<=p17]
normalized: ~ [E [true U ~ [p81<=p17]]]
abstracting: (p81<=p17) states: 68,014,081 (7)
-> the formula is FALSE
FORMULA AutoFlight-PT-05a-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.305sec
checking: AG [[~ [3<=p122] | 3<=p41]]
normalized: ~ [E [true U ~ [[3<=p41 | ~ [3<=p122]]]]]
abstracting: (3<=p122) states: 0
abstracting: (3<=p41) states: 0
-> the formula is TRUE
FORMULA AutoFlight-PT-05a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [~ [[[3<=p126 & 3<=p126] | ~ [2<=p10]]]]
normalized: E [true U ~ [[~ [2<=p10] | [3<=p126 & 3<=p126]]]]
abstracting: (3<=p126) states: 0
abstracting: (3<=p126) states: 0
abstracting: (2<=p10) states: 0
-> the formula is FALSE
FORMULA AutoFlight-PT-05a-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[~ [p72<=p53] | 2<=p32]]
normalized: E [true U [2<=p32 | ~ [p72<=p53]]]
abstracting: (p72<=p53) states: 67,806,721 (7)
abstracting: (2<=p32) states: 0
-> the formula is TRUE
FORMULA AutoFlight-PT-05a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.109sec
checking: EF [[3<=p41 & ~ [~ [p102<=p82]]]]
normalized: E [true U [3<=p41 & p102<=p82]]
abstracting: (p102<=p82) states: 66,290,401 (7)
abstracting: (3<=p41) states: 0
-> the formula is FALSE
FORMULA AutoFlight-PT-05a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EF [[[2<=p52 | [1<=p83 | 2<=p18]] & ~ [1<=p6]]]
normalized: E [true U [~ [1<=p6] & [2<=p52 | [1<=p83 | 2<=p18]]]]
abstracting: (2<=p18) states: 0
abstracting: (1<=p83) states: 248,832 (5)
abstracting: (2<=p52) states: 0
abstracting: (1<=p6) states: 23,390,208 (7)
-> the formula is TRUE
FORMULA AutoFlight-PT-05a-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.024sec
checking: EF [[[3<=p53 & ~ [p53<=p46]] & ~ [~ [p121<=p36]]]]
normalized: E [true U [p121<=p36 & [3<=p53 & ~ [p53<=p46]]]]
abstracting: (p53<=p46) states: 68,055,553 (7)
abstracting: (3<=p53) states: 0
abstracting: (p121<=p36) states: 67,235,185 (7)
-> the formula is FALSE
FORMULA AutoFlight-PT-05a-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AG [[~ [p28<=p61] | ~ [[1<=p83 & p40<=p128]]]]
normalized: ~ [E [true U ~ [[~ [[1<=p83 & p40<=p128]] | ~ [p28<=p61]]]]]
abstracting: (p28<=p61) states: 248,833 (5)
abstracting: (p40<=p128) states: 35,034,769 (7)
abstracting: (1<=p83) states: 248,832 (5)
-> the formula is TRUE
FORMULA AutoFlight-PT-05a-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [[2<=p2 | [[p83<=p3 & 2<=p12] & [p15<=p88 | 2<=p19]]]]
normalized: E [true U [2<=p2 | [[p83<=p3 & 2<=p12] & [p15<=p88 | 2<=p19]]]]
abstracting: (2<=p19) states: 0
abstracting: (p15<=p88) states: 44,509,825 (7)
abstracting: (2<=p12) states: 0
abstracting: (p83<=p3) states: 68,014,081 (7)
abstracting: (2<=p2) states: 0
-> the formula is FALSE
FORMULA AutoFlight-PT-05a-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [[~ [~ [p86<=p27]] | [[p58<=p117 | 2<=p121] | [p95<=p26 & p34<=p123]]]]
normalized: ~ [E [true U ~ [[p86<=p27 | [[p95<=p26 & p34<=p123] | [p58<=p117 | 2<=p121]]]]]]
abstracting: (2<=p121) states: 0
abstracting: (p58<=p117) states: 68,179,969 (7)
abstracting: (p34<=p123) states: 65,030,689 (7)
abstracting: (p95<=p26) states: 67,620,097 (7)
abstracting: (p86<=p27) states: 68,055,553 (7)
-> the formula is TRUE
FORMULA AutoFlight-PT-05a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AG [[[p43<=p9 & p59<=p73] | [[p117<=p46 & p32<=p58] | [p102<=p3 | p16<=p126]]]]
normalized: ~ [E [true U ~ [[[[p102<=p3 | p16<=p126] | [p117<=p46 & p32<=p58]] | [p43<=p9 & p59<=p73]]]]]
abstracting: (p59<=p73) states: 67,931,137 (7)
abstracting: (p43<=p9) states: 44,520,193 (7)
abstracting: (p32<=p58) states: 44,367,265 (7)
abstracting: (p117<=p46) states: 38,813,905 (7)
abstracting: (p16<=p126) states: 48,136,033 (7)
abstracting: (p102<=p3) states: 66,920,257 (7)
-> the formula is FALSE
FORMULA AutoFlight-PT-05a-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.793sec
Total processing time: 0m 7.479sec
BK_STOP 1464684685523
--------------------
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.000sec
711 820
iterations count:2863 (22), effective:306 (2)
initing FirstDep: 0m 0.000sec
2692
iterations count:1378 (10), effective:108 (0)
1915
iterations count:1387 (10), effective:109 (0)
2699
iterations count:1368 (10), effective:106 (0)
1915
iterations count:1376 (10), effective:109 (0)
1817 3203 4906
iterations count:3273 (25), effective:299 (2)
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="AutoFlight-PT-05a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/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/AutoFlight-PT-05a.tgz
mv AutoFlight-PT-05a 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 AutoFlight-PT-05a, 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 r209su-blw3-146445825300241"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; 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 ;