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

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

=== Now, execution of the tool begins

BK_START 1495923582892

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_00001
(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.437sec

parse successfull
net created successfully

Net: RobotManipulation_PT_00001
(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.804sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 107 (1.1e+02) #states 110



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

checking: 3<=p_rel
normalized: 3<=p_rel

abstracting: (3<=p_rel)
states: 0
-> the formula is FALSE

FORMULA RobotManipulation-PT-00001-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: 3<=p_rdy
normalized: 3<=p_rdy

abstracting: (3<=p_rdy)
states: 0
-> the formula is FALSE

FORMULA RobotManipulation-PT-00001-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [2<=p_i1]
normalized: ~ [EG [~ [2<=p_i1]]]

abstracting: (2<=p_i1)
states: 20
.
EG iterations: 1
-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: 1<=initialize
normalized: 1<=initialize

abstracting: (1<=initialize)
states: 65
-> the formula is FALSE

FORMULA RobotManipulation-PT-00001-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: p_sc<=access
normalized: p_sc<=access

abstracting: (p_sc<=access)
states: 100
-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [[AX [2<=r_moving] & EG [3<=r_moving]]]
normalized: ~ [EG [~ [[EG [3<=r_moving] & ~ [EX [~ [2<=r_moving]]]]]]]

abstracting: (2<=r_moving)
states: 2
.abstracting: (3<=r_moving)
states: 0
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA RobotManipulation-PT-00001-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [p_i1<=p_rdy]
normalized: EX [p_i1<=p_rdy]

abstracting: (p_i1<=p_rdy)
states: 54
.-> the formula is FALSE

FORMULA RobotManipulation-PT-00001-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [p_rel<=p_rel]
normalized: EG [p_rel<=p_rel]

abstracting: (p_rel<=p_rel)
states: 110

EG iterations: 0
-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [EG [[1<=p_rel | moved<=r_active]]]
normalized: E [true U EG [[1<=p_rel | moved<=r_active]]]

abstracting: (moved<=r_active)
states: 110
abstracting: (1<=p_rel)
states: 20

EG iterations: 0
-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [[[~ [[3<=p_rdy | p_rel<=p_i1]] | ~ [~ [3<=p_rdy]]] | 2<=r_moving] & AG [2<=p_rdy]]
normalized: [[[~ [[3<=p_rdy | p_rel<=p_i1]] | 3<=p_rdy] | 2<=r_moving] & ~ [E [true U ~ [2<=p_rdy]]]]

abstracting: (2<=p_rdy)
states: 2
abstracting: (2<=r_moving)
states: 2
abstracting: (3<=p_rdy)
states: 0
abstracting: (p_rel<=p_i1)
states: 100
abstracting: (3<=p_rdy)
states: 0
-> the formula is FALSE

FORMULA RobotManipulation-PT-00001-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [[A [p_i1<=p_rdy U p_rel<=p_m] & ~ [AF [r_active<=off]]]]
normalized: ~ [[[~ [EG [~ [p_rel<=p_m]]] & ~ [E [~ [p_rel<=p_m] U [~ [p_i1<=p_rdy] & ~ [p_rel<=p_m]]]]] & EG [~ [r_active<=off]]]]

abstracting: (r_active<=off)
states: 20
.
EG iterations: 1
abstracting: (p_rel<=p_m)
states: 96
abstracting: (p_i1<=p_rdy)
states: 54
abstracting: (p_rel<=p_m)
states: 96
abstracting: (p_rel<=p_m)
states: 96
...
EG iterations: 3
-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [~ [EF [[initialize<=r_active & p_sc<=move]]] | [p_m<=p_sc & 3<=r_moving]]
normalized: [~ [E [true U [initialize<=r_active & p_sc<=move]]] | [p_m<=p_sc & 3<=r_moving]]

abstracting: (3<=r_moving)
states: 0
abstracting: (p_m<=p_sc)
states: 62
abstracting: (p_sc<=move)
states: 92
abstracting: (initialize<=r_active)
states: 94
-> the formula is FALSE

FORMULA RobotManipulation-PT-00001-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [AX [EF [p_sc<=moved]] | ~ [[[[1<=r_stopped | initialized<=move] | move<=move] | 2<=r_stopped]]]
normalized: [~ [[[[1<=r_stopped | initialized<=move] | move<=move] | 2<=r_stopped]] | ~ [EX [~ [E [true U p_sc<=moved]]]]]

abstracting: (p_sc<=moved)
states: 92
.abstracting: (2<=r_stopped)
states: 4
abstracting: (move<=move)
states: 110
abstracting: (initialized<=move)
states: 92
abstracting: (1<=r_stopped)
states: 29
-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [~ [[~ [[2<=p_m & moved<=moved]] | [~ [3<=off] & ~ [p_m<=move]]]] | [~ [access<=initialized] & EF [[off<=r_active & p_rdy<=r_active]]]]
normalized: [~ [[~ [[2<=p_m & moved<=moved]] | [~ [p_m<=move] & ~ [3<=off]]]] | [E [true U [off<=r_active & p_rdy<=r_active]] & ~ [access<=initialized]]]

abstracting: (access<=initialized)
states: 42
abstracting: (p_rdy<=r_active)
states: 110
abstracting: (off<=r_active)
states: 110
abstracting: (3<=off)
states: 0
abstracting: (p_m<=move)
states: 72
abstracting: (moved<=moved)
states: 110
abstracting: (2<=p_m)
states: 12
-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [[initialized<=p_rdy & p_i1<=r_stopped] | [p_i1<=p_rel & [2<=r_moving & [~ [r_moving<=p_m] | [initialized<=moved & p_m<=p_m]]]]]
normalized: [[[[[initialized<=moved & p_m<=p_m] | ~ [r_moving<=p_m]] & 2<=r_moving] & p_i1<=p_rel] | [initialized<=p_rdy & p_i1<=r_stopped]]

abstracting: (p_i1<=r_stopped)
states: 55
abstracting: (initialized<=p_rdy)
states: 92
abstracting: (p_i1<=p_rel)
states: 54
abstracting: (2<=r_moving)
states: 2
abstracting: (r_moving<=p_m)
states: 110
abstracting: (p_m<=p_m)
states: 110
abstracting: (initialized<=moved)
states: 92
-> the formula is FALSE

FORMULA RobotManipulation-PT-00001-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [[1<=off | EF [[p_i2<=p_rel & 3<=p_i2]]] | [[p_rel<=p_rdy & [[r_moving<=p_rdy | 2<=p_sc] | [2<=p_sc | p_m<=p_rel]]] & [EF [r_moving<=move] & [1<=off | [2<=r_stopped | access<=r_moving]]]]]
normalized: [[[[[2<=r_stopped | access<=r_moving] | 1<=off] & E [true U r_moving<=move]] & [[[2<=p_sc | p_m<=p_rel] | [r_moving<=p_rdy | 2<=p_sc]] & p_rel<=p_rdy]] | [E [true U [p_i2<=p_rel & 3<=p_i2]] | 1<=off]]

abstracting: (1<=off)
states: 29
abstracting: (3<=p_i2)
states: 6
abstracting: (p_i2<=p_rel)
states: 45
abstracting: (p_rel<=p_rdy)
states: 92
abstracting: (2<=p_sc)
states: 2
abstracting: (r_moving<=p_rdy)
states: 92
abstracting: (p_m<=p_rel)
states: 62
abstracting: (2<=p_sc)
states: 2
abstracting: (r_moving<=move)
states: 92
abstracting: (1<=off)
states: 29
abstracting: (access<=r_moving)
states: 40
abstracting: (2<=r_stopped)
states: 4
-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

totally nodes used: 1868 (1.9e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1769 4190 5959
used/not used/entry size/cache size: 5028 67103836 16 1024MB
basic ops cache: hits/miss/sum: 1194 4225 5419
used/not used/entry size/cache size: 6841 16770375 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: 381 691 1072
used/not used/entry size/cache size: 691 8387917 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 67107147
1 1635
2 38
3 27
4 10
5 6
6 1
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 7.317sec


BK_STOP 1495923590323

--------------------
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:97 (8), effective:21 (1)

initing FirstDep: 0m 0.000sec


iterations count:11 (1), effective:0 (0)

iterations count:15 (1), effective:1 (0)

iterations count:30 (2), effective:5 (0)

iterations count:34 (3), effective:5 (0)

iterations count:24 (2), effective:3 (0)

iterations count:11 (1), effective:0 (0)

iterations count:15 (1), effective:2 (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="RobotManipulation-PT-00001"
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-00001.tgz
mv RobotManipulation-PT-00001 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-00001, 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-149581161700192"
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 '' CTLCardinality.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 ;