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-2265
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 r218st-ebro-143344930401068
=====================================================================

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

Model: S_ResAllocation-PT-R003C015
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 90 NrTr: 60 NrArc: 264)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m5sec


RS generation: 0m0sec


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



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

checking: A [~ [2<=p_7_1] U AX [1<=r_12_2]]
normalized: [~ [E [2<=p_7_1 U [2<=p_7_1 & EX [~ [1<=r_12_2]]]]] & ~ [EG [EX [~ [1<=r_12_2]]]]]

abstracting: (1<=r_12_2) states: 300,168,704 (8)
..
EG iterations: 1
abstracting: (1<=r_12_2) states: 300,168,704 (8)
.abstracting: (2<=p_7_1) states: 0
abstracting: (2<=p_7_1) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: [AF [AG [p_3_1<=p_12_2]] | [1<=p_7_2 | AG [~ [1<=r_9_1]]]]
normalized: [~ [EG [E [true U ~ [p_3_1<=p_12_2]]]] | [1<=p_7_2 | ~ [E [true U 1<=r_9_1]]]]

abstracting: (1<=r_9_1) states: 278,065,664 (8)
abstracting: (1<=p_7_2) states: 222,930,432 (8)
abstracting: (p_3_1<=p_12_2) states: 467,082,240 (8)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m20sec

checking: AF [[~ [[r_3_2<=r_12_2 | 3<=r_7_0]] & EF [r_8_2<=r_14_2]]]
normalized: ~ [EG [~ [[~ [[r_3_2<=r_12_2 | 3<=r_7_0]] & E [true U r_8_2<=r_14_2]]]]]

abstracting: (r_8_2<=r_14_2) states: 496,598,016 (8)
abstracting: (3<=r_7_0) states: 0
abstracting: (r_3_2<=r_12_2) states: 442,619,392 (8)
.......................
EG iterations: 23
-> the formula is FALSE

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

MC time: 0m13sec

checking: EX [E [r_8_1<=r_9_0 U 3<=p_7_1]]
normalized: EX [E [r_8_1<=r_9_0 U 3<=p_7_1]]

abstracting: (3<=p_7_1) states: 0
abstracting: (r_8_1<=r_9_0) states: 428,700,160 (8)
.-> the formula is FALSE

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

MC time: 0m0sec

checking: EG [E [p_6_2<=r_0_1 U r_6_0<=p_7_0]]
normalized: EG [E [p_6_2<=r_0_1 U r_6_0<=p_7_0]]

abstracting: (r_6_0<=p_7_0) states: 300,650,496 (8)
abstracting: (p_6_2<=r_0_1) states: 535,182,336 (8)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 4m27sec

checking: E [[[2<=r_9_0 | 2<=r_12_0] | ~ [p_12_2<=r_12_2]] U EG [r_9_0<=r_1_2]]
normalized: E [[~ [p_12_2<=r_12_2] | [2<=r_9_0 | 2<=r_12_0]] U EG [r_9_0<=r_1_2]]

abstracting: (r_9_0<=r_1_2) states: 445,619,456 (8)
......................
EG iterations: 22
abstracting: (2<=r_12_0) states: 0
abstracting: (2<=r_9_0) states: 0
abstracting: (p_12_2<=r_12_2) states: 480,975,872 (8)
-> the formula is TRUE

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

MC time: 9m37sec

checking: ~ [~ [E [r_4_0<=r_8_1 U 2<=p_8_2]]]
normalized: E [r_4_0<=r_8_1 U 2<=p_8_2]

abstracting: (2<=p_8_2) states: 0
abstracting: (r_4_0<=r_8_1) states: 436,065,280 (8)
-> the formula is FALSE

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

MC time: 0m2sec

checking: AF [[AF [3<=p_10_1] | [[p_7_2<=p_7_1 & r_6_1<=r_8_1] & r_10_2<=p_4_1]]]
normalized: ~ [EG [~ [[[r_10_2<=p_4_1 & [p_7_2<=p_7_1 & r_6_1<=r_8_1]] | ~ [EG [~ [3<=p_10_1]]]]]]]

abstracting: (3<=p_10_1) states: 0

EG iterations: 0
abstracting: (r_6_1<=r_8_1) states: 424,477,696 (8)
abstracting: (p_7_2<=p_7_1) states: 429,114,112 (8)
abstracting: (r_10_2<=p_4_1) states: 371,753,472 (8)
..........................
EG iterations: 26
-> the formula is FALSE

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

MC time: 0m5sec

checking: EG [p_5_0<=p_12_1]
normalized: EG [p_5_0<=p_12_1]

abstracting: (p_5_0<=p_12_1) states: 527,592,448 (8)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m1sec

checking: ~ [EG [~ [[2<=p_4_1 & p_13_2<=r_2_2]]]]
normalized: ~ [EG [~ [[2<=p_4_1 & p_13_2<=r_2_2]]]]

abstracting: (p_13_2<=r_2_2) states: 481,510,912 (8)
abstracting: (2<=p_4_1) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 6m35sec

checking: [EG [p_10_2<=p_4_0] & [[1<=r_14_2 | [[2<=r_4_0 & p_2_1<=p_6_1] | [1<=p_6_1 | p_14_0<=r_4_1]]] & ~ [AG [1<=p_0_2]]]]
normalized: [[E [true U ~ [1<=p_0_2]] & [1<=r_14_2 | [[1<=p_6_1 | p_14_0<=r_4_1] | [2<=r_4_0 & p_2_1<=p_6_1]]]] & EG [p_10_2<=p_4_0]]

abstracting: (p_10_2<=p_4_0) states: 530,137,600 (8)
.
EG iterations: 1
abstracting: (p_2_1<=p_6_1) states: 455,218,176 (8)
abstracting: (2<=r_4_0) states: 0
abstracting: (p_14_0<=r_4_1) states: 440,301,056 (8)
abstracting: (1<=p_6_1) states: 151,635,968 (8)
abstracting: (1<=r_14_2) states: 410,565,632 (8)
abstracting: (1<=p_0_2) states: 168,312,832 (8)
-> the formula is TRUE

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

MC time: 0m57sec

checking: [~ [E [p_2_2<=r_6_1 U r_10_0<=p_7_2]] | [EG [~ [p_1_1<=p_10_1]] | [EG [p_7_0<=p_11_0] & [[1<=r_8_2 & r_11_0<=r_9_0] | [p_4_0<=r_8_0 | r_3_2<=r_11_0]]]]]
normalized: [[[[[p_4_0<=r_8_0 | r_3_2<=r_11_0] | [1<=r_8_2 & r_11_0<=r_9_0]] & EG [p_7_0<=p_11_0]] | EG [~ [p_1_1<=p_10_1]]] | ~ [E [p_2_2<=r_6_1 U r_10_0<=p_7_2]]]

abstracting: (r_10_0<=p_7_2) states: 405,761,280 (8)
abstracting: (p_2_2<=r_6_1) states: 526,732,288 (8)
abstracting: (p_1_1<=p_10_1) states: 505,593,088 (8)
.....................
EG iterations: 21
abstracting: (p_7_0<=p_11_0) states: 515,799,040 (8)
.
EG iterations: 1
abstracting: (r_11_0<=r_9_0) states: 428,254,208 (8)
abstracting: (1<=r_8_2) states: 279,429,120 (8)
abstracting: (r_3_2<=r_11_0) states: 428,955,648 (8)
abstracting: (p_4_0<=r_8_0) states: 458,817,024 (8)
-> the formula is TRUE

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

MC time: 13m54sec

checking: EG [A [1<=p_11_2 U p_4_1<=p_13_2]]
normalized: EG [[~ [E [~ [1<=p_11_2] U [~ [1<=p_11_2] & ~ [p_4_1<=p_13_2]]]] & ~ [EG [~ [p_4_1<=p_13_2]]]]]

abstracting: (p_4_1<=p_13_2) states: 471,051,008 (8)
.....................
EG iterations: 21
abstracting: (p_4_1<=p_13_2) states: 471,051,008 (8)
abstracting: (1<=p_11_2) states: 213,769,216 (8)
abstracting: (1<=p_11_2) states: 213,769,216 (8)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m11sec

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

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

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

MC time: 0m0sec

checking: ~ [~ [EF [[2<=r_2_2 & 2<=p_14_1]]]]
normalized: E [true U [2<=r_2_2 & 2<=p_14_1]]

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

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

MC time: 0m0sec

checking: [~ [AF [~ [1<=r_5_0]]] | r_6_1<=p_4_0]
normalized: [r_6_1<=p_4_0 | EG [1<=r_5_0]]

abstracting: (1<=r_5_0) states: 279,715,840 (8)
..........................
EG iterations: 26
abstracting: (r_6_1<=p_4_0) states: 404,795,136 (8)
-> the formula is TRUE

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

MC time: 0m5sec


Total processing time: 36m41sec


BK_STOP 1433784958610

--------------------
content from stderr:

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: 0m0sec


iterations count:499 (8), effective:90 (1)

initing FirstDep: 0m0sec


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

iterations count:127 (2), effective:9 (0)

iterations count:128 (2), effective:11 (0)

iterations count:70 (1), effective:2 (0)

iterations count:138 (2), effective:14 (0)

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

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

iterations count:128 (2), effective:11 (0)

iterations count:60 (1), effective:0 (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="/users/gast00/fkordon/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-2265"
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 r218st-ebro-143344930401068"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 ;