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 ResAllocation-PT-R003C010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r061-csrt-149440955100079
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494705834823

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: ResAllocation_PT_R003C010
(NrP: 60 NrTr: 40 NrArc: 174)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 1.320sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 206 (2.1e+02) #states 823,552 (5)



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

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

abstracting: (3<=r_0_1)
states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (3<=r_1_1)
states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [2<=r_5_0]
normalized: E [true U 2<=r_5_0]

abstracting: (2<=r_5_0)
states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [3<=r_8_2]
normalized: E [true U 3<=r_8_2]

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

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [~ [2<=r_6_0]]]
normalized: E [true U 2<=r_6_0]

abstracting: (2<=r_6_0)
states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [3<=p_5_2]
normalized: E [true U 3<=p_5_2]

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

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [3<=r_4_2]
normalized: E [true U 3<=r_4_2]

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

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [~ [2<=p_6_0]] & ~ [3<=p_9_1]]]
normalized: E [true U [~ [3<=p_9_1] & 2<=p_6_0]]

abstracting: (2<=p_6_0)
states: 0
abstracting: (3<=p_9_1)
states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [~ [p_0_0<=r_0_2]] & ~ [~ [3<=r_6_1]]]]
normalized: E [true U [p_0_0<=r_0_2 & 3<=r_6_1]]

abstracting: (3<=r_6_1)
states: 0
abstracting: (p_0_0<=r_0_2)
states: 591,424 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [p_7_0<=r_4_0] | ~ [3<=r_1_0]]]
normalized: ~ [E [true U ~ [[~ [3<=r_1_0] | ~ [p_7_0<=r_4_0]]]]]

abstracting: (p_7_0<=r_4_0)
states: 740,352 (5)
abstracting: (3<=r_1_0)
states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[1<=p_8_2 | 3<=p_4_0] | ~ [3<=p_7_1]] & 3<=r_0_2]]
normalized: E [true U [3<=r_0_2 & [~ [3<=p_7_1] | [1<=p_8_2 | 3<=p_4_0]]]]

abstracting: (3<=p_4_0)
states: 0
abstracting: (1<=p_8_2)
states: 65,024 (4)
abstracting: (3<=p_7_1)
states: 0
abstracting: (3<=r_0_2)
states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[3<=p_6_2 & [~ [3<=r_0_0] | [p_0_0<=r_3_0 & 3<=p_6_0]]]]
normalized: E [true U [3<=p_6_2 & [[p_0_0<=r_3_0 & 3<=p_6_0] | ~ [3<=r_0_0]]]]

abstracting: (3<=r_0_0)
states: 0
abstracting: (3<=p_6_0)
states: 0
abstracting: (p_0_0<=r_3_0)
states: 633,856 (5)
abstracting: (3<=p_6_2)
states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[[2<=r_4_2 & 1<=p_2_2] & [p_7_0<=r_6_0 | r_6_2<=p_6_0]]]]
normalized: ~ [E [true U [[p_7_0<=r_6_0 | r_6_2<=p_6_0] & [2<=r_4_2 & 1<=p_2_2]]]]

abstracting: (1<=p_2_2)
states: 137,728 (5)
abstracting: (2<=r_4_2)
states: 0
abstracting: (r_6_2<=p_6_0)
states: 576,320 (5)
abstracting: (p_7_0<=r_6_0)
states: 685,824 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[3<=r_4_1 & [r_3_2<=r_6_1 & [1<=p_0_2 & p_0_0<=r_3_1]]]]
normalized: E [true U [[[1<=p_0_2 & p_0_0<=r_3_1] & r_3_2<=r_6_1] & 3<=r_4_1]]

abstracting: (3<=r_4_1)
states: 0
abstracting: (r_3_2<=r_6_1)
states: 609,024 (5)
abstracting: (p_0_0<=r_3_1)
states: 636,544 (5)
abstracting: (1<=p_0_2)
states: 238,848 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[2<=p_2_2 & ~ [3<=r_5_0]] | [[r_5_2<=r_4_1 & p_4_2<=p_1_2] & [p_8_2<=r_2_0 & 2<=p_4_2]]]]
normalized: E [true U [[~ [3<=r_5_0] & 2<=p_2_2] | [[r_5_2<=r_4_1 & p_4_2<=p_1_2] & [p_8_2<=r_2_0 & 2<=p_4_2]]]]

abstracting: (2<=p_4_2)
states: 0
abstracting: (p_8_2<=r_2_0)
states: 789,632 (5)
abstracting: (p_4_2<=p_1_2)
states: 738,432 (5)
abstracting: (r_5_2<=r_4_1)
states: 606,016 (5)
abstracting: (2<=p_2_2)
states: 0
abstracting: (3<=r_5_0)
states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[2<=r_4_0 & r_2_2<=p_0_0] & [3<=p_3_0 & r_9_2<=p_3_2]] & [[p_9_1<=p_4_2 & p_3_2<=r_0_0] | [2<=p_5_1 | 3<=r_6_0]]]]
normalized: E [true U [[[3<=p_3_0 & r_9_2<=p_3_2] & [2<=r_4_0 & r_2_2<=p_0_0]] & [[p_9_1<=p_4_2 & p_3_2<=r_0_0] | [2<=p_5_1 | 3<=r_6_0]]]]

abstracting: (3<=r_6_0)
states: 0
abstracting: (2<=p_5_1)
states: 0
abstracting: (p_3_2<=r_0_0)
states: 655,296 (5)
abstracting: (p_9_1<=p_4_2)
states: 540,928 (5)
abstracting: (r_2_2<=p_0_0)
states: 616,384 (5)
abstracting: (2<=r_4_0)
states: 0
abstracting: (r_9_2<=p_3_2)
states: 543,872 (5)
abstracting: (3<=p_3_0)
states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

totally nodes used: 7595(7.6e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 577 6034 6611
used/not used/entry size/cache size: 5711 67103153 16 1024MB
basic ops cache: hits/miss/sum: 2450 10206 12656
used/not used/entry size/cache size: 21253 16755963 12 192MB
unary ops cache: hits/miss/sum: 0 435 435
used/not used/entry size/cache size: 435 8388173 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 694 2000 2694
used/not used/entry size/cache size: 2000 2095152 32 64MB
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 67101269
1 7595
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 2.001sec


BK_STOP 1494705836855

--------------------
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


initing FirstDep: 0m 0.000sec


iterations count:306 (7), effective:60 (1)

initing FirstDep: 0m 0.000sec

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="ResAllocation-PT-R003C010"
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/ResAllocation-PT-R003C010.tgz
mv ResAllocation-PT-R003C010 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 ResAllocation-PT-R003C010, 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 r061-csrt-149440955100079"
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 ;