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

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

=== Now, execution of the tool begins

BK_START 1495923987038

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_00005
(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.373sec

parse successfull
net created successfully

Net: RobotManipulation_PT_00005
(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 4.128sec


RS generation: 0m 0.019sec


-> reachability set: #nodes 1827 (1.8e+03) #states 184,756 (5)



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

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

abstracting: (p_m<=r_active)
states: 175,186 (5)
-> the formula is TRUE

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

MC time: 0m 0.072sec

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

abstracting: (access<=access)
states: 184,756 (5)
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

abstracting: (r_stopped<=moved)
states: 99,144 (4)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00005-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

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

abstracting: (initialize<=initialize)
states: 184,756 (5)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00005-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (initialize<=p_sc)
states: 81,372 (4)
-> the formula is FALSE

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

MC time: 0m 0.027sec

checking: E [1<=p_i1 U EX [access<=initialized]]
normalized: E [1<=p_i1 U EX [access<=initialized]]

abstracting: (access<=initialized)
states: 6,006 (3)
.abstracting: (1<=p_i1)
states: 140,998 (5)
-> the formula is TRUE

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

MC time: 0m 0.055sec

checking: EF [AG [[moved<=off | p_rel<=p_sc]]]
normalized: E [true U ~ [E [true U ~ [[moved<=off | p_rel<=p_sc]]]]]

abstracting: (p_rel<=p_sc)
states: 120,344 (5)
abstracting: (moved<=off)
states: 131,350 (5)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00005-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: ~ [E [[move<=p_i1 | 3<=p_rel] U [1<=p_m & 3<=off]]]
normalized: ~ [E [[move<=p_i1 | 3<=p_rel] U [1<=p_m & 3<=off]]]

abstracting: (3<=off)
states: 42,185 (4)
abstracting: (1<=p_m)
states: 168,740 (5)
abstracting: (3<=p_rel)
states: 22,880 (4)
abstracting: (move<=p_i1)
states: 141,544 (5)
-> the formula is FALSE

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

MC time: 0m 0.079sec

checking: [~ [AX [[moved<=initialized | initialized<=off]]] | AG [AG [2<=r_stopped]]]
normalized: [~ [E [true U E [true U ~ [2<=r_stopped]]]] | EX [~ [[moved<=initialized | initialized<=off]]]]

abstracting: (initialized<=off)
states: 131,350 (5)
abstracting: (moved<=initialized)
states: 120,344 (5)
.abstracting: (2<=r_stopped)
states: 74,360 (4)
-> the formula is FALSE

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

MC time: 0m 0.047sec

checking: A [AG [2<=p_sc] U [p_rel<=p_m | ~ [p_i1<=p_i1]]]
normalized: [~ [EG [~ [[p_rel<=p_m | ~ [p_i1<=p_i1]]]]] & ~ [E [~ [[p_rel<=p_m | ~ [p_i1<=p_i1]]] U [E [true U ~ [2<=p_sc]] & ~ [[p_rel<=p_m | ~ [p_i1<=p_i1]]]]]]]

abstracting: (p_i1<=p_i1)
states: 184,756 (5)
abstracting: (p_rel<=p_m)
states: 157,016 (5)
abstracting: (2<=p_sc)
states: 48,620 (4)
abstracting: (p_i1<=p_i1)
states: 184,756 (5)
abstracting: (p_rel<=p_m)
states: 157,016 (5)
abstracting: (p_i1<=p_i1)
states: 184,756 (5)
abstracting: (p_rel<=p_m)
states: 157,016 (5)
...
EG iterations: 3
-> the formula is TRUE

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

MC time: 0m 0.016sec

checking: [[~ [~ [[move<=initialize | r_moving<=p_m]]] | AF [~ [1<=initialized]]] & AG [EX [p_rdy<=r_stopped]]]
normalized: [~ [E [true U ~ [EX [p_rdy<=r_stopped]]]] & [~ [EG [1<=initialized]] | [move<=initialize | r_moving<=p_m]]]

abstracting: (r_moving<=p_m)
states: 184,756 (5)
abstracting: (move<=initialize)
states: 141,544 (5)
abstracting: (1<=initialized)
states: 97,240 (4)
.
EG iterations: 1
abstracting: (p_rdy<=r_stopped)
states: 131,350 (5)
.-> the formula is FALSE

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

MC time: 0m 0.079sec

checking: [~ [[[[2<=move | 3<=p_sc] | [1<=r_stopped | p_i1<=p_i1]] | moved<=r_stopped]] | EF [[[1<=p_i1 & 3<=r_moving] & ~ [2<=r_active]]]]
normalized: [E [true U [~ [2<=r_active] & [1<=p_i1 & 3<=r_moving]]] | ~ [[moved<=r_stopped | [[1<=r_stopped | p_i1<=p_i1] | [2<=move | 3<=p_sc]]]]]

abstracting: (3<=p_sc)
states: 22,880 (4)
abstracting: (2<=move)
states: 48,620 (4)
abstracting: (p_i1<=p_i1)
states: 184,756 (5)
abstracting: (1<=r_stopped)
states: 121,550 (5)
abstracting: (moved<=r_stopped)
states: 131,350 (5)
abstracting: (3<=r_moving)
states: 22,880 (4)
abstracting: (1<=p_i1)
states: 140,998 (5)
abstracting: (2<=r_active)
states: 184,214 (5)
-> the formula is TRUE

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

MC time: 0m 0.058sec

checking: [EX [[[p_rdy<=p_rel & 1<=p_rdy] | [3<=moved & r_stopped<=p_i2]]] | A [~ [r_moving<=off] U ~ [off<=r_moving]]]
normalized: [[~ [EG [off<=r_moving]] & ~ [E [off<=r_moving U [r_moving<=off & off<=r_moving]]]] | EX [[[3<=moved & r_stopped<=p_i2] | [p_rdy<=p_rel & 1<=p_rdy]]]]

abstracting: (1<=p_rdy)
states: 97,240 (4)
abstracting: (p_rdy<=p_rel)
states: 120,344 (5)
abstracting: (r_stopped<=p_i2)
states: 152,550 (5)
abstracting: (3<=moved)
states: 22,880 (4)
.abstracting: (off<=r_moving)
states: 99,144 (4)
abstracting: (r_moving<=off)
states: 131,350 (5)
abstracting: (off<=r_moving)
states: 99,144 (4)
abstracting: (off<=r_moving)
states: 99,144 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RobotManipulation-PT-00005-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.093sec

checking: [[[[[p_rel<=p_rdy | 1<=p_i2] & [2<=moved | 3<=p_rel]] | AX [2<=r_moving]] | EF [[off<=r_moving & 2<=off]]] & p_rel<=initialize]
normalized: [p_rel<=initialize & [E [true U [off<=r_moving & 2<=off]] | [~ [EX [~ [2<=r_moving]]] | [[2<=moved | 3<=p_rel] & [p_rel<=p_rdy | 1<=p_i2]]]]]

abstracting: (1<=p_i2)
states: 165,308 (5)
abstracting: (p_rel<=p_rdy)
states: 120,344 (5)
abstracting: (3<=p_rel)
states: 22,880 (4)
abstracting: (2<=moved)
states: 48,620 (4)
abstracting: (2<=r_moving)
states: 48,620 (4)
.abstracting: (2<=off)
states: 74,360 (4)
abstracting: (off<=r_moving)
states: 99,144 (4)
abstracting: (p_rel<=initialize)
states: 141,544 (5)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00005-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.068sec

checking: [[[[~ [r_stopped<=p_i2] | [1<=p_sc | p_rel<=r_stopped]] | [2<=r_moving | [p_rdy<=moved | 1<=p_m]]] & [EG [3<=p_rdy] | EF [3<=moved]]] | EG [AX [1<=move]]]
normalized: [EG [~ [EX [~ [1<=move]]]] | [[E [true U 3<=moved] | EG [3<=p_rdy]] & [[2<=r_moving | [p_rdy<=moved | 1<=p_m]] | [[1<=p_sc | p_rel<=r_stopped] | ~ [r_stopped<=p_i2]]]]]

abstracting: (r_stopped<=p_i2)
states: 152,550 (5)
abstracting: (p_rel<=r_stopped)
states: 131,350 (5)
abstracting: (1<=p_sc)
states: 97,240 (4)
abstracting: (1<=p_m)
states: 168,740 (5)
abstracting: (p_rdy<=moved)
states: 120,344 (5)
abstracting: (2<=r_moving)
states: 48,620 (4)
abstracting: (3<=p_rdy)
states: 22,880 (4)
.
EG iterations: 1
abstracting: (3<=moved)
states: 22,880 (4)
abstracting: (1<=move)
states: 97,240 (4)
...
EG iterations: 2
-> the formula is TRUE

FORMULA RobotManipulation-PT-00005-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.059sec

checking: [[~ [[[p_sc<=initialize | p_i1<=p_rdy] & ~ [p_rdy<=p_sc]]] & [[[move<=p_i2 & 1<=moved] & ~ [1<=p_sc]] & ~ [~ [1<=off]]]] | ~ [EF [~ [off<=r_stopped]]]]
normalized: [~ [E [true U ~ [off<=r_stopped]]] | [[1<=off & [~ [1<=p_sc] & [move<=p_i2 & 1<=moved]]] & ~ [[~ [p_rdy<=p_sc] & [p_sc<=initialize | p_i1<=p_rdy]]]]]

abstracting: (p_i1<=p_rdy)
states: 81,372 (4)
abstracting: (p_sc<=initialize)
states: 141,544 (5)
abstracting: (p_rdy<=p_sc)
states: 120,344 (5)
abstracting: (1<=moved)
states: 97,240 (4)
abstracting: (move<=p_i2)
states: 156,226 (5)
abstracting: (1<=p_sc)
states: 97,240 (4)
abstracting: (1<=off)
states: 121,550 (5)
abstracting: (off<=r_stopped)
states: 110,150 (5)
-> the formula is FALSE

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

MC time: 0m 0.054sec

totally nodes used: 183951 (1.8e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 616673 487651 1104324
used/not used/entry size/cache size: 624312 66484552 16 1024MB
basic ops cache: hits/miss/sum: 273304 259601 532905
used/not used/entry size/cache size: 466233 16310983 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: 49178 37725 86903
used/not used/entry size/cache size: 37691 8350917 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 66946746
1 152639
2 6005
3 1729
4 415
5 392
6 249
7 145
8 88
9 87
>= 10 369

Total processing time: 0m 8.683sec


BK_STOP 1495923995835

--------------------
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:433 (39), effective:101 (9)

initing FirstDep: 0m 0.000sec


iterations count:241 (21), effective:54 (4)

iterations count:159 (14), effective:29 (2)

iterations count:183 (16), effective:31 (2)

iterations count:133 (12), effective:38 (3)

iterations count:199 (18), effective:42 (3)

iterations count:273 (24), effective:77 (7)

iterations count:65 (5), effective:18 (1)

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

iterations count:101 (9), effective:9 (0)

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

iterations count:187 (17), effective:50 (4)

iterations count:370 (33), effective:74 (6)

iterations count:31 (2), effective:10 (0)

iterations count:196 (17), effective:45 (4)

iterations count:110 (10), effective:27 (2)

iterations count:106 (9), effective:27 (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="RobotManipulation-PT-00005"
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-00005.tgz
mv RobotManipulation-PT-00005 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-00005, 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-149581161700210"
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 ;