About the Execution of MARCIE for RobotManipulation-PT-00050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15931.030 | 475014.00 | 474949.00 | 70.40 | ??T?T???T???TT?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-3254
Executing tool marcie
Input is RobotManipulation-PT-00050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r201-smll-149581161800237
=====================================================================
--------------------
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 RobotManipulation-PT-00050-CTLCardinality-0
FORMULA_NAME RobotManipulation-PT-00050-CTLCardinality-1
FORMULA_NAME RobotManipulation-PT-00050-CTLCardinality-10
FORMULA_NAME RobotManipulation-PT-00050-CTLCardinality-11
FORMULA_NAME RobotManipulation-PT-00050-CTLCardinality-12
FORMULA_NAME RobotManipulation-PT-00050-CTLCardinality-13
FORMULA_NAME RobotManipulation-PT-00050-CTLCardinality-14
FORMULA_NAME RobotManipulation-PT-00050-CTLCardinality-15
FORMULA_NAME RobotManipulation-PT-00050-CTLCardinality-2
FORMULA_NAME RobotManipulation-PT-00050-CTLCardinality-3
FORMULA_NAME RobotManipulation-PT-00050-CTLCardinality-4
FORMULA_NAME RobotManipulation-PT-00050-CTLCardinality-5
FORMULA_NAME RobotManipulation-PT-00050-CTLCardinality-6
FORMULA_NAME RobotManipulation-PT-00050-CTLCardinality-7
FORMULA_NAME RobotManipulation-PT-00050-CTLCardinality-8
FORMULA_NAME RobotManipulation-PT-00050-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1495925604809
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie rev. 8852M (built: crohr on 2017-05-03)
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
parse successfull
net created successfully
Net: RobotManipulation_PT_00050
(NrP: 15 NrTr: 11 NrArc: 34)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 1.145sec
parse successfull
net created successfully
Net: RobotManipulation_PT_00050
(NrP: 15 NrTr: 11 NrArc: 34)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.798sec
RS generation: 0m25.678sec
-> reachability set: #nodes 759117 (7.6e+05) #states 8,526,843,022,542 (12)
starting MCC model checker
--------------------------
checking: EF [3<=p_rel]
normalized: E [true U 3<=p_rel]
abstracting: (3<=p_rel)
states: 6,567,733,272,100 (12)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00050-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m15.746sec
checking: AG [EF [3<=p_rel]]
normalized: ~ [E [true U ~ [E [true U 3<=p_rel]]]]
abstracting: (3<=p_rel)
states: 6,567,733,272,100 (12)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00050-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EX [~ [AG [2<=access]]]
normalized: EX [E [true U ~ [2<=access]]]
abstracting: (2<=access)
states: 8,526,789,613,540 (12)
.-> the formula is TRUE
FORMULA RobotManipulation-PT-00050-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m 1.630sec
checking: AG [3<=access]
normalized: ~ [E [true U ~ [3<=access]]]
abstracting: (3<=access)
states: 8,526,662,126,290 (12)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00050-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.820sec
checking: AF [~ [1<=initialize]]
normalized: ~ [EG [1<=initialize]]
abstracting: (1<=initialize)
states: 8,174,817,393,171 (12)
.
EG iterations: 1
-> the formula is TRUE
FORMULA RobotManipulation-PT-00050-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m15.965sec
checking: EF [access<=initialized]
normalized: E [true U access<=initialized]
abstracting: (access<=initialized)
states: 193,121,292 (8)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00050-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 3m25.110sec
checking: E [EX [move<=p_sc] U AG [2<=p_i1]]
normalized: E [EX [move<=p_sc] U ~ [E [true U ~ [2<=p_i1]]]]
abstracting: (2<=p_i1)
states: 7,822,791,763,800 (12)
abstracting: (move<=p_sc)
states: 4,446,172,738,722 (12)
FORMULA RobotManipulation-PT-00050-CTLCardinality-8 CANNOT_COMPUTE
MC time: 2m13.187sec
checking: E [[p_m<=off | 3<=r_stopped] U 2<=p_rel]
normalized: E [[p_m<=off | 3<=r_stopped] U 2<=p_rel]
abstracting: (2<=p_rel)
FORMULA RobotManipulation-PT-00050-CTLCardinality-0 CANNOT_COMPUTE
MC time: 0m 0.004sec
checking: AX [[AF [r_stopped<=p_rdy] | EF [p_i1<=p_m]]]
normalized: ~ [EX [~ [[E [true U p_i1<=p_m] | ~ [EG [~ [r_stopped<=p_rdy]]]]]]]
abstracting: (r_stopped<=p_rdy)
FORMULA RobotManipulation-PT-00050-CTLCardinality-1 CANNOT_COMPUTE
MC time: 0m 0.000sec
checking: EF [[AX [move<=off] & EX [p_i1<=p_i2]]]
normalized: E [true U [~ [EX [~ [move<=off]]] & EX [p_i1<=p_i2]]]
abstracting: (p_i1<=p_i2)
FORMULA RobotManipulation-PT-00050-CTLCardinality-11 CANNOT_COMPUTE
MC time: 0m 0.000sec
checking: [[[1<=p_m | access<=access] & ~ [EG [p_i2<=r_stopped]]] | AX [AG [2<=p_i1]]]
normalized: [~ [EX [E [true U ~ [2<=p_i1]]]] | [~ [EG [p_i2<=r_stopped]] & [1<=p_m | access<=access]]]
abstracting: (access<=access)
states: 8,526,843,022,542 (12)
abstracting: (1<=p_m)
FORMULA RobotManipulation-PT-00050-CTLCardinality-15 CANNOT_COMPUTE
MC time: 0m 0.437sec
checking: [E [[off<=p_sc | 3<=p_rel] U ~ [2<=r_stopped]] & [EX [~ [off<=p_rdy]] | EG [~ [3<=p_m]]]]
normalized: [[EG [~ [3<=p_m]] | EX [~ [off<=p_rdy]]] & E [[off<=p_sc | 3<=p_rel] U ~ [2<=r_stopped]]]
abstracting: (2<=r_stopped)
FORMULA RobotManipulation-PT-00050-CTLCardinality-3 CANNOT_COMPUTE
MC time: 0m 0.000sec
checking: ~ [[[[1<=p_rel & ~ [2<=p_rdy]] | EG [r_moving<=p_rel]] & AX [[3<=p_i2 | p_i2<=access]]]]
normalized: ~ [[~ [EX [~ [[3<=p_i2 | p_i2<=access]]]] & [EG [r_moving<=p_rel] | [1<=p_rel & ~ [2<=p_rdy]]]]]
abstracting: (2<=p_rdy)
FORMULA RobotManipulation-PT-00050-CTLCardinality-13 CANNOT_COMPUTE
MC time: 0m 0.000sec
checking: EG [[[[initialized<=initialized & 3<=r_stopped] | moved<=p_i1] & [[3<=r_moving & off<=p_rdy] & [1<=r_active | 1<=p_i1]]]]
normalized: EG [[[[3<=r_moving & off<=p_rdy] & [1<=r_active | 1<=p_i1]] & [moved<=p_i1 | [initialized<=initialized & 3<=r_stopped]]]]
abstracting: (3<=r_stopped)
FORMULA RobotManipulation-PT-00050-CTLCardinality-14 CANNOT_COMPUTE
MC time: 0m 0.000sec
checking: [AG [[~ [3<=p_rel] & [1<=initialized | r_moving<=access]]] | E [[moved<=p_rdy & access<=r_active] U [1<=p_sc & p_i2<=off]]]
normalized: [~ [E [true U ~ [[[1<=initialized | r_moving<=access] & ~ [3<=p_rel]]]]] | E [[moved<=p_rdy & access<=r_active] U [1<=p_sc & p_i2<=off]]]
abstracting: (p_i2<=off)
FORMULA RobotManipulation-PT-00050-CTLCardinality-4 CANNOT_COMPUTE
MC time: 0m 0.000sec
checking: [EG [EF [r_stopped<=p_rel]] & [r_active<=p_sc | [[[move<=moved | 1<=r_active] | [2<=p_i1 & 1<=access]] & ~ [[1<=initialized | 2<=p_m]]]]]
normalized: [[r_active<=p_sc | [~ [[1<=initialized | 2<=p_m]] & [[2<=p_i1 & 1<=access] | [move<=moved | 1<=r_active]]]] & EG [E [true U r_stopped<=p_rel]]]
abstracting: (r_stopped<=p_rel)
FORMULA RobotManipulation-PT-00050-CTLCardinality-5 CANNOT_COMPUTE
MC time: 0m 0.000sec
totally nodes used: 46521278 (4.7e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 635090638 128165046 763255684
used/not used/entry size/cache size: 60552565 6556299 16 1024MB
basic ops cache: hits/miss/sum: 347877735 72872471 420750206
used/not used/entry size/cache size: 16663942 113274 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 71258621 9550379 80809000
used/not used/entry size/cache size: 5635946 2752662 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 34745711
1 22463346
2 7565066
3 1764316
4 322254
5 134089
6 63603
7 21792
8 6614
9 2324
>= 10 19749
Total processing time: 7m54.590sec
BK_STOP 1495926079823
--------------------
content from stderr:
check for maximal unmarked siphon
ok
check for constant places
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
ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!
check for maximal unmarked siphon
ok
check for constant places
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
iterations count:4213 (383), effective:1001 (91)
initing FirstDep: 0m 0.000sec
iterations count:128 (11), effective:27 (2)
iterations count:128 (11), effective:27 (2)
iterations count:1595 (145), effective:495 (45)
iterations count:1579 (143), effective:490 (44)
iterations count:1311 (119), effective:400 (36)
iterations count:211 (19), effective:100 (9)
std::bad_alloc
std::bad_alloc
std::bad_alloc
std::bad_alloc
std::bad_alloc
std::bad_alloc
std::bad_alloc
std::bad_alloc
std::bad_alloc
std::bad_alloc
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="RobotManipulation-PT-00050"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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/RobotManipulation-PT-00050.tgz
mv RobotManipulation-PT-00050 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is RobotManipulation-PT-00050, 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 r201-smll-149581161800237"
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 ;