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

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

=== Now, execution of the tool begins

BK_START 1464598392564


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_R003C020
(NrP: 120 NrTr: 80 NrArc: 354)

net check time: 0m 0.000sec

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

init dd package: 0m 3.855sec


RS generation: 0m 0.017sec


-> reachability set: #nodes 796 (8.0e+02) #states 406,454,747,136 (11)



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

checking: AG [~ [AX [2<=p_2_2]]]
normalized: ~ [E [true U ~ [EX [~ [2<=p_2_2]]]]]

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

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

MC time: 0m 0.104sec

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

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

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

MC time: 0m 0.000sec

checking: ~ [EG [EG [p_3_0<=r_15_2]]]
normalized: ~ [EG [EG [p_3_0<=r_15_2]]]

abstracting: (p_3_0<=r_15_2) states: 382,804,320,256 (11)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: AF [~ [EX [r_4_2<=r_4_1]]]
normalized: ~ [EG [EX [r_4_2<=r_4_1]]]

abstracting: (r_4_2<=r_4_1) states: 308,253,114,368 (11)
................................
EG iterations: 31
-> the formula is FALSE

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

MC time: 0m 1.063sec

checking: AF [EG [[3<=p_4_2 & r_12_1<=r_7_2]]]
normalized: ~ [EG [~ [EG [[3<=p_4_2 & r_12_1<=r_7_2]]]]]

abstracting: (r_12_1<=r_7_2) states: 304,928,428,032 (11)
abstracting: (3<=p_4_2) states: 0
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: ~ [~ [[AG [r_19_0<=p_6_0] | EF [2<=p_19_2]]]]
normalized: [~ [E [true U ~ [r_19_0<=p_6_0]]] | E [true U 2<=p_19_2]]

abstracting: (2<=p_19_2) states: 0
abstracting: (r_19_0<=p_6_0) states: 230,772,621,312 (11)
-> the formula is FALSE

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

MC time: 0m 0.026sec

checking: [2<=p_17_0 | ~ [[AF [2<=r_10_1] | AX [3<=r_0_2]]]]
normalized: [2<=p_17_0 | ~ [[~ [EG [~ [2<=r_10_1]]] | ~ [EX [~ [3<=r_0_2]]]]]]

abstracting: (3<=r_0_2) states: 0
.abstracting: (2<=r_10_1) states: 0

EG iterations: 0
abstracting: (2<=p_17_0) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [~ [[2<=r_17_2 & p_15_2<=r_7_0]] U 3<=r_15_0]
normalized: E [~ [[2<=r_17_2 & p_15_2<=r_7_0]] U 3<=r_15_0]

abstracting: (3<=r_15_0) states: 0
abstracting: (p_15_2<=r_7_0) states: 322,997,501,952 (11)
abstracting: (2<=r_17_2) states: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EG [A [p_18_1<=r_19_0 U p_15_1<=p_10_0]]
normalized: EG [[~ [EG [~ [p_15_1<=p_10_0]]] & ~ [E [~ [p_15_1<=p_10_0] U [~ [p_15_1<=p_10_0] & ~ [p_18_1<=r_19_0]]]]]]

abstracting: (p_18_1<=r_19_0) states: 406,454,747,136 (11)
abstracting: (p_15_1<=p_10_0) states: 338,028,814,336 (11)
abstracting: (p_15_1<=p_10_0) states: 338,028,814,336 (11)
abstracting: (p_15_1<=p_10_0) states: 338,028,814,336 (11)
.................................
EG iterations: 33
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.370sec

checking: [AG [EF [p_19_1<=r_6_2]] & A [~ [1<=p_19_0] U 1<=p_3_0]]
normalized: [[~ [E [~ [1<=p_3_0] U [1<=p_19_0 & ~ [1<=p_3_0]]]] & ~ [EG [~ [1<=p_3_0]]]] & ~ [E [true U ~ [E [true U p_19_1<=r_6_2]]]]]

abstracting: (p_19_1<=r_6_2) states: 323,125,809,152 (11)
abstracting: (1<=p_3_0) states: 46,310,277,120 (10)
.
EG iterations: 1
abstracting: (1<=p_3_0) states: 46,310,277,120 (10)
abstracting: (1<=p_19_0) states: 118,165,815,296 (11)
abstracting: (1<=p_3_0) states: 46,310,277,120 (10)
-> the formula is FALSE

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

MC time: 0m 0.091sec

checking: AF [~ [[2<=r_0_2 | [p_3_2<=p_2_2 & p_8_2<=p_18_0]]]]
normalized: ~ [EG [[2<=r_0_2 | [p_3_2<=p_2_2 & p_8_2<=p_18_0]]]]

abstracting: (p_8_2<=p_18_0) states: 369,675,091,968 (11)
abstracting: (p_3_2<=p_2_2) states: 256,305,561,600 (11)
abstracting: (2<=r_0_2) states: 0
..................................
EG iterations: 34
-> the formula is FALSE

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

MC time: 0m 1.242sec

checking: [E [~ [r_11_2<=r_13_1] U [1<=p_19_2 & 2<=r_5_0]] | AG [~ [3<=p_17_0]]]
normalized: [~ [E [true U 3<=p_17_0]] | E [~ [r_11_2<=r_13_1] U [1<=p_19_2 & 2<=r_5_0]]]

abstracting: (2<=r_5_0) states: 0
abstracting: (1<=p_19_2) states: 187,298,627,584 (11)
abstracting: (r_11_2<=r_13_1) states: 303,343,878,144 (11)
abstracting: (3<=p_17_0) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [[[p_8_0<=r_12_2 | ~ [3<=p_10_0]] & AG [p_11_1<=r_12_0]]]
normalized: EG [[~ [E [true U ~ [p_11_1<=r_12_0]]] & [p_8_0<=r_12_2 | ~ [3<=p_10_0]]]]

abstracting: (3<=p_10_0) states: 0
abstracting: (p_8_0<=r_12_2) states: 323,588,947,968 (11)
abstracting: (p_11_1<=r_12_0) states: 352,763,428,864 (11)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.040sec

checking: [[EG [p_3_1<=p_3_0] & AF [[3<=r_3_1 | 1<=p_17_2]]] & [~ [AF [1<=p_8_1]] & ~ [1<=p_7_0]]]
normalized: [[~ [1<=p_7_0] & EG [~ [1<=p_8_1]]] & [EG [p_3_1<=p_3_0] & ~ [EG [~ [[3<=r_3_1 | 1<=p_17_2]]]]]]

abstracting: (1<=p_17_2) states: 168,774,516,736 (11)
abstracting: (3<=r_3_1) states: 0
..............................
EG iterations: 30
abstracting: (p_3_1<=p_3_0) states: 335,214,772,224 (11)
.............................
EG iterations: 29
abstracting: (1<=p_8_1) states: 104,826,503,168 (11)
.............................
EG iterations: 29
abstracting: (1<=p_7_0) states: 52,671,594,496 (10)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.511sec

checking: AF [~ [[~ [r_17_0<=r_5_2] | [r_4_1<=p_9_2 | p_1_0<=p_2_1]]]]
normalized: ~ [EG [[[r_4_1<=p_9_2 | p_1_0<=p_2_1] | ~ [r_17_0<=r_5_2]]]]

abstracting: (r_17_0<=r_5_2) states: 297,505,562,624 (11)
abstracting: (p_1_0<=p_2_1) states: 374,597,255,168 (11)
abstracting: (r_4_1<=p_9_2) states: 285,990,739,968 (11)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: [AF [EG [r_8_0<=p_7_0]] & [[EF [p_19_0<=r_5_2] & [[3<=p_11_0 & p_4_0<=p_6_2] | ~ [r_6_0<=p_3_1]]] | [EX [p_15_2<=p_13_0] & r_4_0<=p_12_1]]]
normalized: [~ [EG [~ [EG [r_8_0<=p_7_0]]]] & [[r_4_0<=p_12_1 & EX [p_15_2<=p_13_0]] | [[~ [r_6_0<=p_3_1] | [3<=p_11_0 & p_4_0<=p_6_2]] & E [true U p_19_0<=r_5_2]]]]

abstracting: (p_19_0<=r_5_2) states: 345,386,713,088 (11)
abstracting: (p_4_0<=p_6_2) states: 270,632,927,232 (11)
abstracting: (3<=p_11_0) states: 0
abstracting: (r_6_0<=p_3_1) states: 258,057,228,288 (11)
abstracting: (p_15_2<=p_13_0) states: 270,632,927,232 (11)
.abstracting: (r_4_0<=p_12_1) states: 262,052,290,560 (11)
abstracting: (r_8_0<=p_7_0) states: 248,487,149,568 (11)
...............................
EG iterations: 31
.................................
EG iterations: 33
-> the formula is FALSE

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

MC time: 0m 1.553sec


Total processing time: 0m12.100sec


BK_STOP 1464598404711

--------------------
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:611 (7), effective:120 (1)

initing FirstDep: 0m 0.000sec


iterations count:806 (10), effective:131 (1)

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

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

iterations count:204 (2), effective:21 (0)

iterations count:141 (1), effective:9 (0)

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

iterations count:113 (1), effective:5 (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-R003C020"
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-R003C020.tgz
mv S_ResAllocation-PT-R003C020 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-R003C020, 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-146444128500318"
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 ;