## About the Execution of Marcie for S_ResAllocation-PT-R002C002

Execution Summary | |||||

Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |

5414.010 | 5323.00 | 4919.00 | 120.30 | TTTTFFTTTTTFFFTF | normal |

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

Executing tool marcie

Input is S_ResAllocation-PT-R002C002, examination is CTLCardinality

Time confinement is 3600 seconds

Memory confinement is 16384 MBytes

Number of cores is 1

Run identifier is r185kn-smll-146444128300264

=====================================================================

--------------------

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-R002C002-CTLCardinality-0

FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-1

FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-10

FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-11

FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-12

FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-13

FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-14

FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-15

FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-2

FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-3

FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-4

FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-5

FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-6

FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-7

FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-8

FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-9

=== Now, execution of the tool begins

**BK_START 1464597583127
**

Marcie rev. 8535M (built: crohr on 2016-04-27)

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 --mcc-mode --memory=6 --suppress

parse successfull

net created successfully

Net: ResAllocation_PT_R002C002

(NrP: 8 NrTr: 6 NrArc: 20)

net check time: 0m 0.000sec

parse formulas

formulas created successfully

place and transition orderings generation:0m 0.000sec

init dd package: 0m 3.731sec

RS generation: 0m 0.000sec

-> reachability set: #nodes 22 (2.2e+01) #states 8

starting MCC model checker

--------------------------

checking: 1<=p_0_0

normalized: 1<=p_0_0

abstracting: (1<=p_0_0) states: 3

-> the formula is FALSE

**FORMULA ResAllocation-PT-R002C002-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
**

MC time: 0m 0.000sec

checking: ~ [AG [2<=r_0_0]]

normalized: E [true U ~ [2<=r_0_0]]

abstracting: (2<=r_0_0) states: 0

-> the formula is TRUE

**FORMULA ResAllocation-PT-R002C002-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
**

MC time: 0m 0.000sec

checking: EG [~ [r_1_0<=p_0_1]]

normalized: EG [~ [r_1_0<=p_0_1]]

abstracting: (r_1_0<=p_0_1) states: 4

.

EG iterations: 1

-> the formula is TRUE

**FORMULA ResAllocation-PT-R002C002-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
**

MC time: 0m 0.000sec

checking: EG [r_0_0<=r_0_1]

normalized: EG [r_0_0<=r_0_1]

abstracting: (r_0_0<=r_0_1) states: 6

..

EG iterations: 2

-> the formula is TRUE

**FORMULA ResAllocation-PT-R002C002-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
**

MC time: 0m 0.000sec

checking: ~ [r_0_1<=p_0_0]

normalized: ~ [r_0_1<=p_0_0]

abstracting: (r_0_1<=p_0_0) states: 6

-> the formula is TRUE

**FORMULA ResAllocation-PT-R002C002-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
**

MC time: 0m 0.000sec

checking: EX [E [2<=p_0_1 U 1<=r_1_0]]

normalized: EX [E [2<=p_0_1 U 1<=r_1_0]]

abstracting: (1<=r_1_0) states: 6

abstracting: (2<=p_0_1) states: 0

.-> the formula is TRUE

**FORMULA ResAllocation-PT-R002C002-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
**

MC time: 0m 0.000sec

checking: ~ [[~ [1<=p_0_0] | EF [p_1_0<=p_1_1]]]

normalized: ~ [[E [true U p_1_0<=p_1_1] | ~ [1<=p_0_0]]]

abstracting: (1<=p_0_0) states: 3

abstracting: (p_1_0<=p_1_1) states: 7

-> the formula is FALSE

**FORMULA ResAllocation-PT-R002C002-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
**

MC time: 0m 0.000sec

checking: [EF [p_0_1<=r_1_0] & r_1_1<=r_1_0]

normalized: [r_1_1<=r_1_0 & E [true U p_0_1<=r_1_0]]

abstracting: (p_0_1<=r_1_0) states: 8

abstracting: (r_1_1<=r_1_0) states: 7

-> the formula is TRUE

**FORMULA ResAllocation-PT-R002C002-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
**

MC time: 0m 0.000sec

checking: AF [[~ [[r_0_1<=r_0_0 | p_0_1<=p_1_0]] | 3<=r_0_0]]

normalized: ~ [EG [~ [[3<=r_0_0 | ~ [[r_0_1<=r_0_0 | p_0_1<=p_1_0]]]]]]

abstracting: (p_0_1<=p_1_0) states: 6

abstracting: (r_0_1<=r_0_0) states: 6

abstracting: (3<=r_0_0) states: 0

EG iterations: 0

-> the formula is FALSE

**FORMULA ResAllocation-PT-R002C002-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
**

MC time: 0m 0.000sec

checking: [AG [[3<=p_1_1 | [p_0_0<=r_1_1 & 2<=r_0_1]]] | EG [EF [1<=r_1_0]]]

normalized: [EG [E [true U 1<=r_1_0]] | ~ [E [true U ~ [[3<=p_1_1 | [p_0_0<=r_1_1 & 2<=r_0_1]]]]]]

abstracting: (2<=r_0_1) states: 0

abstracting: (p_0_0<=r_1_1) states: 7

abstracting: (3<=p_1_1) states: 0

abstracting: (1<=r_1_0) states: 6

EG iterations: 0

-> the formula is TRUE

**FORMULA ResAllocation-PT-R002C002-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
**

MC time: 0m 0.000sec

checking: [r_0_1<=p_1_1 & [EG [~ [r_0_0<=p_0_0]] | A [3<=r_1_1 U 2<=p_0_0]]]

normalized: [r_0_1<=p_1_1 & [[~ [EG [~ [2<=p_0_0]]] & ~ [E [~ [2<=p_0_0] U [~ [3<=r_1_1] & ~ [2<=p_0_0]]]]] | EG [~ [r_0_0<=p_0_0]]]]

abstracting: (r_0_0<=p_0_0) states: 5

....

EG iterations: 4

abstracting: (2<=p_0_0) states: 0

abstracting: (3<=r_1_1) states: 0

abstracting: (2<=p_0_0) states: 0

abstracting: (2<=p_0_0) states: 0

EG iterations: 0

abstracting: (r_0_1<=p_1_1) states: 5

-> the formula is FALSE

**FORMULA ResAllocation-PT-R002C002-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
**

MC time: 0m 0.000sec

checking: AF [[~ [[r_0_0<=p_0_0 & p_1_0<=r_1_1]] | [p_1_1<=p_0_0 | 2<=p_0_1]]]

normalized: ~ [EG [~ [[[p_1_1<=p_0_0 | 2<=p_0_1] | ~ [[r_0_0<=p_0_0 & p_1_0<=r_1_1]]]]]]

abstracting: (p_1_0<=r_1_1) states: 7

abstracting: (r_0_0<=p_0_0) states: 5

abstracting: (2<=p_0_1) states: 0

abstracting: (p_1_1<=p_0_0) states: 6

.

EG iterations: 1

-> the formula is TRUE

**FORMULA ResAllocation-PT-R002C002-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
**

MC time: 0m 0.000sec

checking: [[p_0_0<=p_1_0 & E [r_1_0<=r_1_1 U p_0_1<=p_1_1]] & EG [[1<=r_0_0 | ~ [1<=r_1_1]]]]

normalized: [EG [[1<=r_0_0 | ~ [1<=r_1_1]]] & [p_0_0<=p_1_0 & E [r_1_0<=r_1_1 U p_0_1<=p_1_1]]]

abstracting: (p_0_1<=p_1_1) states: 6

abstracting: (r_1_0<=r_1_1) states: 6

abstracting: (p_0_0<=p_1_0) states: 5

abstracting: (1<=r_1_1) states: 5

abstracting: (1<=r_0_0) states: 3

.

EG iterations: 1

-> the formula is TRUE

**FORMULA ResAllocation-PT-R002C002-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
**

MC time: 0m 0.000sec

checking: AX [[r_1_0<=r_1_0 & [[r_0_1<=p_0_1 | 3<=r_0_0] | [r_0_1<=p_0_0 | 1<=r_1_1]]]]

normalized: ~ [EX [~ [[r_1_0<=r_1_0 & [[r_0_1<=p_0_0 | 1<=r_1_1] | [r_0_1<=p_0_1 | 3<=r_0_0]]]]]]

abstracting: (3<=r_0_0) states: 0

abstracting: (r_0_1<=p_0_1) states: 5

abstracting: (1<=r_1_1) states: 5

abstracting: (r_0_1<=p_0_0) states: 6

abstracting: (r_1_0<=r_1_0) states: 8

.-> the formula is TRUE

**FORMULA ResAllocation-PT-R002C002-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
**

MC time: 0m 0.000sec

checking: [r_1_0<=r_0_1 & [3<=p_1_1 | [[~ [2<=p_1_0] & ~ [p_1_0<=r_0_1]] & [r_1_1<=r_1_1 & r_0_1<=p_0_0]]]]

normalized: [r_1_0<=r_0_1 & [3<=p_1_1 | [[r_1_1<=r_1_1 & r_0_1<=p_0_0] & [~ [p_1_0<=r_0_1] & ~ [2<=p_1_0]]]]]

abstracting: (2<=p_1_0) states: 0

abstracting: (p_1_0<=r_0_1) states: 7

abstracting: (r_0_1<=p_0_0) states: 6

abstracting: (r_1_1<=r_1_1) states: 8

abstracting: (3<=p_1_1) states: 0

abstracting: (r_1_0<=r_0_1) states: 4

-> the formula is FALSE

**FORMULA ResAllocation-PT-R002C002-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
**

MC time: 0m 0.000sec

checking: [AX [3<=r_1_0] | ~ [[[p_0_1<=p_0_1 | [3<=r_1_1 | 3<=r_0_1]] & [[p_1_0<=r_1_0 | p_1_1<=r_0_1] | [2<=p_0_0 | 1<=r_1_1]]]]]

normalized: [~ [[[[2<=p_0_0 | 1<=r_1_1] | [p_1_0<=r_1_0 | p_1_1<=r_0_1]] & [p_0_1<=p_0_1 | [3<=r_1_1 | 3<=r_0_1]]]] | ~ [EX [~ [3<=r_1_0]]]]

abstracting: (3<=r_1_0) states: 0

.abstracting: (3<=r_0_1) states: 0

abstracting: (3<=r_1_1) states: 0

abstracting: (p_0_1<=p_0_1) states: 8

abstracting: (p_1_1<=r_0_1) states: 5

abstracting: (p_1_0<=r_1_0) states: 6

abstracting: (1<=r_1_1) states: 5

abstracting: (2<=p_0_0) states: 0

-> the formula is FALSE

**FORMULA ResAllocation-PT-R002C002-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
**

MC time: 0m 0.000sec

Total processing time: 0m 5.289sec

**BK_STOP 1464597588450
**

--------------------

content from stderr:

check for maximal unmarked siphon

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.001sec

iterations count:25 (4), effective:6 (1)

initing FirstDep: 0m 0.000sec

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

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

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

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

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

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

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

iterations count:8 (1), effective:1 (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-R002C002"

export BK_EXAMINATION="CTLCardinality"

export BK_TOOL="marcie"

export BK_RESULT_DIR="/root/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-R002C002.tgz

mv S_ResAllocation-PT-R002C002 execution

# this is for BenchKit: explicit launching of the test

cd execution

echo "====================================================================="

echo " Generated by BenchKit 2-2979"

echo " Executing tool marcie"

echo " Input is S_ResAllocation-PT-R002C002, 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 r185kn-smll-146444128300264"

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 '

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 ;