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

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

=== Now, execution of the tool begins

BK_START 1495085040851

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_R003C015
(NrP: 90 NrTr: 60 NrArc: 264)

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

net check time: 0m 0.000sec

init dd package: 0m 1.331sec


RS generation: 0m 0.004sec


-> reachability set: #nodes 321 (3.2e+02) #states 578,878,464 (8)



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

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

abstracting: (2<=p_8_2)
states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AX [[AF [2<=p_0_2] | EX [3<=p_8_1]]]
normalized: ~ [EX [~ [[~ [EG [~ [2<=p_0_2]]] | EX [3<=p_8_1]]]]]

abstracting: (3<=p_8_1)
states: 0
.abstracting: (2<=p_0_2)
states: 0

EG iterations: 0
.-> the formula is FALSE

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

MC time: 0m 0.007sec

checking: A [2<=p_0_1 U EF [3<=r_9_2]]
normalized: [~ [EG [~ [E [true U 3<=r_9_2]]]] & ~ [E [~ [E [true U 3<=r_9_2]] U [~ [E [true U 3<=r_9_2]] & ~ [2<=p_0_1]]]]]

abstracting: (2<=p_0_1)
states: 0
abstracting: (3<=r_9_2)
states: 0
abstracting: (3<=r_9_2)
states: 0
abstracting: (3<=r_9_2)
states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: AF [r_2_2<=p_13_2]
normalized: ~ [EG [~ [r_2_2<=p_13_2]]]

abstracting: (r_2_2<=p_13_2)
states: 395,111,424 (8)
.......................
EG iterations: 23
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.110sec

checking: [~ [AX [r_1_2<=r_13_1]] | AF [AX [2<=p_0_1]]]
normalized: [~ [EG [EX [~ [2<=p_0_1]]]] | EX [~ [r_1_2<=r_13_1]]]

abstracting: (r_1_2<=r_13_1)
states: 408,683,264 (8)
.abstracting: (2<=p_0_1)
states: 0
.........................
EG iterations: 24
-> the formula is FALSE

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

MC time: 0m 0.143sec

checking: AF [[AF [2<=r_1_0] & AF [r_2_2<=r_13_0]]]
normalized: ~ [EG [~ [[~ [EG [~ [r_2_2<=r_13_0]]] & ~ [EG [~ [2<=r_1_0]]]]]]]

abstracting: (2<=r_1_0)
states: 0

EG iterations: 0
abstracting: (r_2_2<=r_13_0)
states: 434,813,952 (8)
............................
EG iterations: 28

EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.076sec

checking: EX [EG [[p_7_0<=r_0_0 | r_0_1<=r_5_0]]]
normalized: EX [EG [[p_7_0<=r_0_0 | r_0_1<=r_5_0]]]

abstracting: (r_0_1<=r_5_0)
states: 449,756,672 (8)
abstracting: (p_7_0<=r_0_0)
states: 538,661,888 (8)
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m 0.006sec

checking: AF [[EG [r_11_0<=p_12_0] & EG [r_0_1<=p_0_0]]]
normalized: ~ [EG [~ [[EG [r_0_1<=p_0_0] & EG [r_11_0<=p_12_0]]]]]

abstracting: (r_11_0<=p_12_0)
states: 306,291,712 (8)
.....................
EG iterations: 21
abstracting: (r_0_1<=p_0_0)
states: 442,203,648 (8)
.
EG iterations: 1
........................
EG iterations: 24
-> the formula is FALSE

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

MC time: 0m 0.291sec

checking: ~ [EG [[~ [2<=r_9_1] & [3<=r_14_1 | r_8_2<=r_13_0]]]]
normalized: ~ [EG [[[3<=r_14_1 | r_8_2<=r_13_0] & ~ [2<=r_9_1]]]]

abstracting: (2<=r_9_1)
states: 0
abstracting: (r_8_2<=r_13_0)
states: 428,494,848 (8)
abstracting: (3<=r_14_1)
states: 0
.....................
EG iterations: 21
-> the formula is FALSE

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

MC time: 0m 0.050sec

checking: A [AF [r_0_1<=r_8_0] U [p_9_2<=r_2_0 & 1<=p_7_0]]
normalized: [~ [EG [~ [[p_9_2<=r_2_0 & 1<=p_7_0]]]] & ~ [E [~ [[p_9_2<=r_2_0 & 1<=p_7_0]] U [EG [~ [r_0_1<=r_8_0]] & ~ [[p_9_2<=r_2_0 & 1<=p_7_0]]]]]]

abstracting: (1<=p_7_0)
states: 74,097,664 (7)
abstracting: (p_9_2<=r_2_0)
states: 461,428,736 (8)
abstracting: (r_0_1<=r_8_0)
states: 449,274,368 (8)
..........................
EG iterations: 26
abstracting: (1<=p_7_0)
states: 74,097,664 (7)
abstracting: (p_9_2<=r_2_0)
states: 461,428,736 (8)
abstracting: (1<=p_7_0)
states: 74,097,664 (7)
abstracting: (p_9_2<=r_2_0)
states: 461,428,736 (8)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.177sec

checking: E [AF [r_5_1<=p_6_2] U [[3<=r_6_0 & 3<=p_5_1] & [3<=r_7_0 | 2<=r_9_2]]]
normalized: E [~ [EG [~ [r_5_1<=p_6_2]]] U [[3<=r_7_0 | 2<=r_9_2] & [3<=r_6_0 & 3<=p_5_1]]]

abstracting: (3<=p_5_1)
states: 0
abstracting: (3<=r_6_0)
states: 0
abstracting: (2<=r_9_2)
states: 0
abstracting: (3<=r_7_0)
states: 0
abstracting: (r_5_1<=p_6_2)
states: 334,886,912 (8)
........................
EG iterations: 24
-> the formula is FALSE

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

MC time: 0m 0.107sec

checking: EG [[[~ [2<=r_13_0] | [p_6_1<=p_14_0 | p_11_2<=p_5_2]] | AF [3<=p_1_1]]]
normalized: EG [[~ [EG [~ [3<=p_1_1]]] | [[p_6_1<=p_14_0 | p_11_2<=p_5_2] | ~ [2<=r_13_0]]]]

abstracting: (2<=r_13_0)
states: 0
abstracting: (p_11_2<=p_5_2)
states: 447,595,520 (8)
abstracting: (p_6_1<=p_14_0)
states: 497,309,696 (8)
abstracting: (3<=p_1_1)
states: 0

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: AF [[[r_13_1<=p_8_2 | [r_13_2<=p_5_1 & 2<=r_3_1]] & AG [3<=r_4_1]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [3<=r_4_1]]] & [[r_13_2<=p_5_1 & 2<=r_3_1] | r_13_1<=p_8_2]]]]]

abstracting: (r_13_1<=p_8_2)
states: 362,539,520 (8)
abstracting: (2<=r_3_1)
states: 0
abstracting: (r_13_2<=p_5_1)
states: 406,331,904 (8)
abstracting: (3<=r_4_1)
states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: [r_10_1<=p_2_2 | EG [[[1<=r_5_0 | p_8_2<=p_11_2] & p_1_1<=r_3_0]]]
normalized: [r_10_1<=p_2_2 | EG [[p_1_1<=r_3_0 & [1<=r_5_0 | p_8_2<=p_11_2]]]]

abstracting: (p_8_2<=p_11_2)
states: 523,738,112 (8)
abstracting: (1<=r_5_0)
states: 279,715,840 (8)
abstracting: (p_1_1<=r_3_0)
states: 523,666,176 (8)
........................
EG iterations: 24
abstracting: (r_10_1<=p_2_2)
states: 339,442,176 (8)
-> the formula is TRUE

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

MC time: 0m 0.145sec

checking: [[~ [[~ [r_3_1<=p_3_0] | r_2_2<=r_5_0]] | ~ [~ [[3<=r_2_2 | 1<=r_12_0]]]] & [~ [EF [2<=p_2_0]] | [[~ [p_2_2<=r_6_0] | 3<=p_4_0] & EF [3<=r_7_0]]]]
normalized: [[[[3<=p_4_0 | ~ [p_2_2<=r_6_0]] & E [true U 3<=r_7_0]] | ~ [E [true U 2<=p_2_0]]] & [~ [[r_2_2<=r_5_0 | ~ [r_3_1<=p_3_0]]] | [3<=r_2_2 | 1<=r_12_0]]]

abstracting: (1<=r_12_0)
states: 293,114,880 (8)
abstracting: (3<=r_2_2)
states: 0
abstracting: (r_3_1<=p_3_0)
states: 323,854,848 (8)
abstracting: (r_2_2<=r_5_0)
states: 441,153,536 (8)
abstracting: (2<=p_2_0)
states: 0
abstracting: (3<=r_7_0)
states: 0
abstracting: (p_2_2<=r_6_0)
states: 527,137,792 (8)
abstracting: (3<=p_4_0)
states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C015-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [AF [[[r_14_0<=r_11_0 | p_8_0<=p_12_2] & ~ [p_2_0<=p_14_1]]] | [EF [[2<=r_2_1 | 3<=r_1_2]] & [AG [p_5_0<=r_11_2] | [~ [r_6_2<=p_1_1] | [3<=r_1_1 | 2<=r_4_2]]]]]
normalized: [~ [EG [~ [[~ [p_2_0<=p_14_1] & [r_14_0<=r_11_0 | p_8_0<=p_12_2]]]]] | [[~ [E [true U ~ [p_5_0<=r_11_2]]] | [[3<=r_1_1 | 2<=r_4_2] | ~ [r_6_2<=p_1_1]]] & E [true U [2<=r_2_1 | 3<=r_1_2]]]]

abstracting: (3<=r_1_2)
states: 0
abstracting: (2<=r_2_1)
states: 0
abstracting: (r_6_2<=p_1_1)
states: 349,845,248 (8)
abstracting: (2<=r_4_2)
states: 0
abstracting: (3<=r_1_1)
states: 0
abstracting: (p_5_0<=r_11_2)
states: 539,577,344 (8)
abstracting: (p_8_0<=p_12_2)
states: 393,048,064 (8)
abstracting: (r_14_0<=r_11_0)
states: 419,144,192 (8)
abstracting: (p_2_0<=p_14_1)
states: 433,177,600 (8)
..........................
EG iterations: 26
-> the formula is FALSE

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

MC time: 0m 0.293sec

totally nodes used: 2486548(2.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 789886 1602831 2392717
used/not used/entry size/cache size: 1555278 65553586 16 1024MB
basic ops cache: hits/miss/sum: 1000791 2261278 3262069
used/not used/entry size/cache size: 4570099 12207117 12 192MB
unary ops cache: hits/miss/sum: 0 990 990
used/not used/entry size/cache size: 990 8387618 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: 1822 5393 7215
used/not used/entry size/cache size: 5388 2091764 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 64663509
1 2404583
2 40354
3 415
4 3
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 3.535sec


BK_STOP 1495085044417

--------------------
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:459 (7), effective:90 (1)

initing FirstDep: 0m 0.000sec


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

iterations count:230 (3), effective:29 (0)

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

iterations count:173 (2), effective:17 (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-R003C015"
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-R003C015.tgz
mv S_ResAllocation-PT-R003C015 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-R003C015, 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-149443423900084"
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 ;