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 S_ResAllocation-PT-R003C010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r141-csrt-149443423800075
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495085031662

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: 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.248sec


RS generation: 0m 0.001sec


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



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

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

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

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

MC time: 0m 0.000sec

checking: EF [AX [2<=p_8_1]]
normalized: E [true U ~ [EX [~ [2<=p_8_1]]]]

abstracting: (2<=p_8_1)
states: 0
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AF [EF [[2<=r_4_1 & p_7_1<=r_7_0]]]
normalized: ~ [EG [~ [E [true U [2<=r_4_1 & p_7_1<=r_7_0]]]]]

abstracting: (p_7_1<=r_7_0)
states: 695,552 (5)
abstracting: (2<=r_4_1)
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [[AX [p_8_0<=p_2_0] & AF [3<=p_5_1]]]
normalized: EX [[~ [EG [~ [3<=p_5_1]]] & ~ [EX [~ [p_8_0<=p_2_0]]]]]

abstracting: (p_8_0<=p_2_0)
states: 673,344 (5)
.abstracting: (3<=p_5_1)
states: 0

EG iterations: 0
.-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [A [p_6_0<=r_8_2 U 3<=r_2_0]]
normalized: E [true U [~ [EG [~ [3<=r_2_0]]] & ~ [E [~ [3<=r_2_0] U [~ [p_6_0<=r_8_2] & ~ [3<=r_2_0]]]]]]

abstracting: (3<=r_2_0)
states: 0
abstracting: (p_6_0<=r_8_2)
states: 655,296 (5)
abstracting: (3<=r_2_0)
states: 0
abstracting: (3<=r_2_0)
states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: AG [[~ [[2<=r_6_2 | 2<=p_7_0]] | AX [1<=r_6_2]]]
normalized: ~ [E [true U ~ [[~ [EX [~ [1<=r_6_2]]] | ~ [[2<=r_6_2 | 2<=p_7_0]]]]]]

abstracting: (2<=p_7_0)
states: 0
abstracting: (2<=r_6_2)
states: 0
abstracting: (1<=r_6_2)
states: 386,688 (5)
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [AG [[3<=p_4_0 & r_6_1<=r_8_0]]]
normalized: E [true U ~ [E [true U ~ [[3<=p_4_0 & r_6_1<=r_8_0]]]]]

abstracting: (r_6_1<=r_8_0)
states: 597,696 (5)
abstracting: (3<=p_4_0)
states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [AG [[p_6_2<=p_6_0 | p_4_2<=r_2_1]]]
normalized: ~ [EG [E [true U ~ [[p_6_2<=p_6_0 | p_4_2<=r_2_1]]]]]

abstracting: (p_4_2<=r_2_1)
states: 774,912 (5)
abstracting: (p_6_2<=p_6_0)
states: 775,552 (5)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.009sec

checking: E [EF [r_9_0<=r_8_1] U AG [p_2_0<=p_9_0]]
normalized: E [E [true U r_9_0<=r_8_1] U ~ [E [true U ~ [p_2_0<=p_9_0]]]]

abstracting: (p_2_0<=p_9_0)
states: 580,736 (5)
abstracting: (r_9_0<=r_8_1)
states: 475,776 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [E [r_0_0<=r_0_0 U r_9_2<=r_6_2]]
normalized: ~ [E [true U ~ [E [r_0_0<=r_0_0 U r_9_2<=r_6_2]]]]

abstracting: (r_9_2<=r_6_2)
states: 595,520 (5)
abstracting: (r_0_0<=r_0_0)
states: 823,552 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [[2<=p_0_2 & r_5_2<=r_5_1] U EF [3<=p_9_2]]
normalized: E [[2<=p_0_2 & r_5_2<=r_5_1] U E [true U 3<=p_9_2]]

abstracting: (3<=p_9_2)
states: 0
abstracting: (r_5_2<=r_5_1)
states: 628,928 (5)
abstracting: (2<=p_0_2)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: ~ [E [[1<=r_5_2 | p_6_0<=p_5_2] U [1<=r_1_0 & 2<=p_1_0]]]
normalized: ~ [E [[1<=r_5_2 | p_6_0<=p_5_2] U [1<=r_1_0 & 2<=p_1_0]]]

abstracting: (2<=p_1_0)
states: 0
abstracting: (1<=r_1_0)
states: 417,664 (5)
abstracting: (p_6_0<=p_5_2)
states: 628,672 (5)
abstracting: (1<=r_5_2)
states: 404,992 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[1<=p_1_1 | 3<=p_9_1] | [2<=r_6_1 | p_7_2<=r_1_1]] | AF [r_7_0<=p_0_0]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [r_7_0<=p_0_0]]] | [[2<=r_6_1 | p_7_2<=r_1_1] | [1<=p_1_1 | 3<=p_9_1]]]]]]

abstracting: (3<=p_9_1)
states: 0
abstracting: (1<=p_1_1)
states: 143,360 (5)
abstracting: (p_7_2<=r_1_1)
states: 663,616 (5)
abstracting: (2<=r_6_1)
states: 0
abstracting: (r_7_0<=p_0_0)
states: 592,960 (5)
...............
EG iterations: 15
-> the formula is FALSE

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

MC time: 0m 0.031sec

checking: AG [[[[r_9_1<=r_3_1 & p_4_0<=p_6_2] | ~ [1<=p_9_0]] | [[1<=p_1_0 | 2<=r_4_2] | r_4_0<=p_0_2]]]
normalized: ~ [E [true U ~ [[[~ [1<=p_9_0] | [r_9_1<=r_3_1 & p_4_0<=p_6_2]] | [r_4_0<=p_0_2 | [1<=p_1_0 | 2<=r_4_2]]]]]]

abstracting: (2<=r_4_2)
states: 0
abstracting: (1<=p_1_0)
states: 65,024 (4)
abstracting: (r_4_0<=p_0_2)
states: 545,792 (5)
abstracting: (p_4_0<=p_6_2)
states: 545,792 (5)
abstracting: (r_9_1<=r_3_1)
states: 572,480 (5)
abstracting: (1<=p_9_0)
states: 238,848 (5)
-> the formula is FALSE

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

MC time: 0m 0.006sec

checking: [~ [[EF [2<=r_7_2] & EX [p_8_1<=r_6_1]]] & AX [[[p_1_2<=p_6_1 | 3<=r_2_0] | [2<=r_6_2 | p_9_1<=r_7_1]]]]
normalized: [~ [[E [true U 2<=r_7_2] & EX [p_8_1<=r_6_1]]] & ~ [EX [~ [[[2<=r_6_2 | p_9_1<=r_7_1] | [p_1_2<=p_6_1 | 3<=r_2_0]]]]]]

abstracting: (3<=r_2_0)
states: 0
abstracting: (p_1_2<=p_6_1)
states: 624,064 (5)
abstracting: (p_9_1<=r_7_1)
states: 700,416 (5)
abstracting: (2<=r_6_2)
states: 0
.abstracting: (p_8_1<=r_6_1)
states: 768,512 (5)
.abstracting: (2<=r_7_2)
states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: E [[[3<=p_8_1 | 1<=r_7_0] | [r_6_1<=p_2_2 | r_6_0<=r_5_2]] U ~ [[r_1_2<=r_1_2 | p_5_1<=r_5_0]]]
normalized: E [[[r_6_1<=p_2_2 | r_6_0<=r_5_2] | [3<=p_8_1 | 1<=r_7_0]] U ~ [[r_1_2<=r_1_2 | p_5_1<=r_5_0]]]

abstracting: (p_5_1<=r_5_0)
states: 704,256 (5)
abstracting: (r_1_2<=r_1_2)
states: 823,552 (5)
abstracting: (1<=r_7_0)
states: 427,904 (5)
abstracting: (3<=p_8_1)
states: 0
abstracting: (r_6_0<=r_5_2)
states: 627,520 (5)
abstracting: (r_6_1<=p_2_2)
states: 502,528 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 156146(1.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 35737 103409 139146
used/not used/entry size/cache size: 100759 67008105 16 1024MB
basic ops cache: hits/miss/sum: 58001 171783 229784
used/not used/entry size/cache size: 413161 16364055 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: 943 2618 3561
used/not used/entry size/cache size: 2614 2094538 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 66952846
1 155891
2 126
3 1
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 1.870sec


BK_STOP 1495085033562

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


iterations count:356 (8), effective:61 (1)

iterations count:136 (3), effective:16 (0)

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

iterations count:233 (5), effective:31 (0)

iterations count:59 (1), effective:4 (0)

iterations count:61 (1), effective:3 (0)

iterations count:74 (1), effective:5 (0)

iterations count:228 (5), effective:32 (0)

iterations count:193 (4), effective:24 (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="S_ResAllocation-PT-R003C010"
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/S_ResAllocation-PT-R003C010.tgz
mv S_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 S_ResAllocation-PT-R003C010, 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 r141-csrt-149443423800075"
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 ;