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-00020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r201-smll-149581161800232
=====================================================================

--------------------
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-00020-ReachabilityCardinality-0
FORMULA_NAME RobotManipulation-PT-00020-ReachabilityCardinality-1
FORMULA_NAME RobotManipulation-PT-00020-ReachabilityCardinality-10
FORMULA_NAME RobotManipulation-PT-00020-ReachabilityCardinality-11
FORMULA_NAME RobotManipulation-PT-00020-ReachabilityCardinality-12
FORMULA_NAME RobotManipulation-PT-00020-ReachabilityCardinality-13
FORMULA_NAME RobotManipulation-PT-00020-ReachabilityCardinality-14
FORMULA_NAME RobotManipulation-PT-00020-ReachabilityCardinality-15
FORMULA_NAME RobotManipulation-PT-00020-ReachabilityCardinality-2
FORMULA_NAME RobotManipulation-PT-00020-ReachabilityCardinality-3
FORMULA_NAME RobotManipulation-PT-00020-ReachabilityCardinality-4
FORMULA_NAME RobotManipulation-PT-00020-ReachabilityCardinality-5
FORMULA_NAME RobotManipulation-PT-00020-ReachabilityCardinality-6
FORMULA_NAME RobotManipulation-PT-00020-ReachabilityCardinality-7
FORMULA_NAME RobotManipulation-PT-00020-ReachabilityCardinality-8
FORMULA_NAME RobotManipulation-PT-00020-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1495925232017

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=ReachabilityCardinality.xml --memory=6

parse successfull
net created successfully

Net: RobotManipulation_PT_00020
(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.308sec

parse successfull
net created successfully

Net: RobotManipulation_PT_00020
(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.665sec


RS generation: 0m 0.865sec


-> reachability set: #nodes 58057 (5.8e+04) #states 4,108,911,268 (9)



starting MCC model checker
--------------------------

checking: EF [~ [p_rel<=access]]
normalized: E [true U ~ [p_rel<=access]]

abstracting: (p_rel<=access)
states: 3,939,856,668 (9)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.545sec

checking: AG [p_sc<=r_active]
normalized: ~ [E [true U ~ [p_sc<=r_active]]]

abstracting: (p_sc<=r_active)
states: 4,108,911,268 (9)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.425sec

checking: EF [r_stopped<=r_active]
normalized: E [true U r_stopped<=r_active]

abstracting: (r_stopped<=r_active)
states: 3,999,634,243 (9)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.316sec

checking: EF [~ [p_rel<=r_stopped]]
normalized: E [true U ~ [p_rel<=r_stopped]]

abstracting: (p_rel<=r_stopped)
states: 2,675,471,964 (9)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.552sec

checking: EF [~ [[3<=access & [1<=r_stopped | 2<=r_active]]]]
normalized: E [true U ~ [[3<=access & [1<=r_stopped | 2<=r_active]]]]

abstracting: (2<=r_active)
states: 4,108,904,306 (9)
abstracting: (1<=r_stopped)
states: 3,668,670,775 (9)
abstracting: (3<=access)
states: 4,104,047,766 (9)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.929sec

checking: EF [[~ [r_moving<=access] & ~ [2<=off]]]
normalized: E [true U [~ [r_moving<=access] & ~ [2<=off]]]

abstracting: (2<=off)
states: 3,247,163,920 (9)
abstracting: (r_moving<=access)
states: 3,939,856,668 (9)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.690sec

checking: AG [~ [[~ [initialized<=initialized] & 2<=r_moving]]]
normalized: ~ [E [true U [2<=r_moving & ~ [initialized<=initialized]]]]

abstracting: (initialized<=initialized)
states: 4,108,911,268 (9)
abstracting: (2<=r_moving)
states: 2,725,298,290 (9)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.147sec

checking: AG [~ [[[2<=off & moved<=move] & 1<=moved]]]
normalized: ~ [E [true U [1<=moved & [2<=off & moved<=move]]]]

abstracting: (moved<=move)
states: 2,260,104,660 (9)
abstracting: (2<=off)
states: 3,247,163,920 (9)
abstracting: (1<=moved)
states: 3,354,213,280 (9)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00020-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.702sec

checking: EF [~ [[2<=p_i1 | [p_sc<=r_stopped & p_i2<=p_rdy]]]]
normalized: E [true U ~ [[2<=p_i1 | [p_sc<=r_stopped & p_i2<=p_rdy]]]]

abstracting: (p_i2<=p_rdy)
states: 901,062,030 (8)
abstracting: (p_sc<=r_stopped)
states: 2,675,471,964 (9)
abstracting: (2<=p_i1)
states: 3,354,213,280 (9)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.520sec

checking: EF [[[3<=off | initialize<=p_rdy] & access<=r_moving]]
normalized: E [true U [access<=r_moving & [3<=off | initialize<=p_rdy]]]

abstracting: (initialize<=p_rdy)
states: 1,639,088,330 (9)
abstracting: (3<=off)
states: 2,850,092,245 (9)
abstracting: (access<=r_moving)
states: 205,036,260 (8)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.349sec

checking: EF [[[~ [3<=access] & [access<=p_m & 2<=r_moving]] & 3<=p_rdy]]
normalized: E [true U [3<=p_rdy & [[access<=p_m & 2<=r_moving] & ~ [3<=access]]]]

abstracting: (3<=access)
states: 4,104,047,766 (9)
abstracting: (2<=r_moving)
states: 2,725,298,290 (9)
abstracting: (access<=p_m)
states: 1,077,443,510 (9)
abstracting: (3<=p_rdy)
states: 2,203,432,660 (9)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00020-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: AG [[~ [~ [3<=r_stopped]] | [p_rel<=move | [p_rel<=r_active & r_stopped<=r_active]]]]
normalized: ~ [E [true U ~ [[3<=r_stopped | [p_rel<=move | [p_rel<=r_active & r_stopped<=r_active]]]]]]

abstracting: (r_stopped<=r_active)
states: 3,999,634,243 (9)
abstracting: (p_rel<=r_active)
states: 4,108,911,268 (9)
abstracting: (p_rel<=move)
states: 2,260,104,660 (9)
abstracting: (3<=r_stopped)
states: 2,850,092,245 (9)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00020-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.704sec

checking: AG [[[[r_active<=p_i1 & moved<=p_i1] | ~ [1<=access]] & [r_active<=move | 3<=r_stopped]]]
normalized: ~ [E [true U ~ [[[r_active<=move | 3<=r_stopped] & [~ [1<=access] | [r_active<=p_i1 & moved<=p_i1]]]]]]

abstracting: (moved<=p_i1)
states: 2,769,140,660 (9)
abstracting: (r_active<=p_i1)
states: 67,687,578 (7)
abstracting: (1<=access)
states: 4,108,639,766 (9)
abstracting: (3<=r_stopped)
states: 2,850,092,245 (9)
abstracting: (r_active<=move)
states: 13,202 (4)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00020-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.774sec

checking: EF [[[[3<=p_m | p_m<=r_stopped] & [access<=p_rdy & initialized<=r_stopped]] & p_rdy<=access]]
normalized: E [true U [p_rdy<=access & [[access<=p_rdy & initialized<=r_stopped] & [3<=p_m | p_m<=r_stopped]]]]

abstracting: (p_m<=r_stopped)
states: 1,060,302,760 (9)
abstracting: (3<=p_m)
states: 3,956,598,646 (9)
abstracting: (initialized<=r_stopped)
states: 2,675,471,964 (9)
abstracting: (access<=p_rdy)
states: 2,443,518 (6)
abstracting: (p_rdy<=access)
states: 4,108,911,268 (9)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.154sec

checking: AG [[[[initialize<=initialized & p_sc<=off] | [2<=access | move<=p_rdy]] | access<=move]]
normalized: ~ [E [true U ~ [[access<=move | [[initialize<=initialized & p_sc<=off] | [2<=access | move<=p_rdy]]]]]]

abstracting: (move<=p_rdy)
states: 2,260,104,660 (9)
abstracting: (2<=access)
states: 4,107,405,666 (9)
abstracting: (p_sc<=off)
states: 2,675,471,964 (9)
abstracting: (initialize<=initialized)
states: 1,639,088,330 (9)
abstracting: (access<=move)
states: 205,036,260 (8)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.486sec

checking: AG [[[[2<=access | p_i2<=p_sc] | [1<=p_rel | off<=r_active]] | [[3<=initialized | p_rel<=moved] | 1<=p_i1]]]
normalized: ~ [E [true U ~ [[[1<=p_i1 | [3<=initialized | p_rel<=moved]] | [[1<=p_rel | off<=r_active] | [2<=access | p_i2<=p_sc]]]]]]

abstracting: (p_i2<=p_sc)
states: 901,062,030 (8)
abstracting: (2<=access)
states: 4,107,405,666 (9)
abstracting: (off<=r_active)
states: 4,108,911,268 (9)
abstracting: (1<=p_rel)
states: 3,354,213,280 (9)
abstracting: (p_rel<=moved)
states: 2,260,104,660 (9)
abstracting: (3<=initialized)
states: 2,203,432,660 (9)
abstracting: (1<=p_i1)
states: 3,731,562,274 (9)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.366sec

totally nodes used: 10832057 (1.1e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 127589078 32546472 160135550
used/not used/entry size/cache size: 29779634 37329230 16 1024MB
basic ops cache: hits/miss/sum: 61572018 19716120 81288138
used/not used/entry size/cache size: 13207034 3570182 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: 7146454 2285093 9431547
used/not used/entry size/cache size: 1995607 6393001 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 58525279
1 7687643
2 590279
3 170237
4 27065
5 33106
6 15483
7 6810
8 5378
9 4518
>= 10 43066

Total processing time: 1m40.023sec


BK_STOP 1495925332206

--------------------
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:1693 (153), effective:401 (36)

initing FirstDep: 0m 0.000sec


iterations count:674 (61), effective:204 (18)

iterations count:171 (15), effective:60 (5)

iterations count:284 (25), effective:87 (7)

iterations count:619 (56), effective:190 (17)

iterations count:749 (68), effective:241 (21)

iterations count:858 (78), effective:173 (15)

iterations count:247 (22), effective:79 (7)

iterations count:810 (73), effective:254 (23)

iterations count:1643 (149), effective:358 (32)

iterations count:180 (16), effective:64 (5)

iterations count:591 (53), effective:174 (15)

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-00020"
export BK_EXAMINATION="ReachabilityCardinality"
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-00020.tgz
mv RobotManipulation-PT-00020 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-00020, 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 r201-smll-149581161800232"
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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;