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_CSRepetitions-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r120st-ebro-143297419500184
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433159357956

Model: S_CSRepetitions-PT-02
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: 23 NrTr: 28 NrArc: 92)

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 304 (3.0e+02) #states 7,424 (3)



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

checking: AF [sum(Server_Waiting_1, Server_Waiting_2)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)]
normalized: ~ [EG [~ [sum(Server_Waiting_1, Server_Waiting_2)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)]]]

abstracting: (sum(Server_Waiting_1, Server_Waiting_2)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)) states: 7,088 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA CSRepetitions-COL-02-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [~ [[sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1) | 3<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]]]
normalized: ~ [E [true U ~ [[sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1) | 3<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]]]

abstracting: (3<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)) states: 2,561 (3)
abstracting: (sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)) states: 7,424 (3)
-> the formula is TRUE

FORMULA CSRepetitions-COL-02-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [E [sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4) U 2<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)] & EF [EX [3<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]]]
normalized: [E [true U EX [3<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]] & E [sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4) U 2<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)]]

abstracting: (2<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)) states: 4,863 (3)
abstracting: (sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)) states: 7,424 (3)
abstracting: (3<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)) states: 0
.-> the formula is FALSE

FORMULA CSRepetitions-COL-02-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (RequestBufferSlots<=RequestBufferSlots) states: 7,424 (3)
-> the formula is TRUE

FORMULA CSRepetitions-COL-02-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[AG [[1<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2) | sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]] | ~ [RequestBufferSlots<=RequestBufferSlots]] & [~ [AX [2<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)]] | ~ [[[1<=RequestBufferSlots | sum(Server_Waiting_1, Server_Waiting_2)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)] & 3<=sum(Server_Waiting_1, Server_Waiting_2)]]]]
normalized: [[~ [[3<=sum(Server_Waiting_1, Server_Waiting_2) & [1<=RequestBufferSlots | sum(Server_Waiting_1, Server_Waiting_2)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)]]] | EX [~ [2<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)]]] & [~ [RequestBufferSlots<=RequestBufferSlots] | ~ [E [true U ~ [[1<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2) | sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]]]]]

abstracting: (sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)) states: 7,424 (3)
abstracting: (1<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)) states: 7,088 (3)
abstracting: (RequestBufferSlots<=RequestBufferSlots) states: 7,424 (3)
abstracting: (2<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)) states: 4,863 (3)
.abstracting: (sum(Server_Waiting_1, Server_Waiting_2)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)) states: 7,088 (3)
abstracting: (1<=RequestBufferSlots) states: 2,400 (3)
abstracting: (3<=sum(Server_Waiting_1, Server_Waiting_2)) states: 0
-> the formula is TRUE

FORMULA CSRepetitions-COL-02-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [EF [1<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]]
normalized: ~ [E [true U ~ [E [true U 1<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]]]]

abstracting: (1<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)) states: 6,240 (3)
-> the formula is FALSE

FORMULA CSRepetitions-COL-02-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [E [3<=sum(Server_Waiting_1, Server_Waiting_2) U sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]]
normalized: ~ [E [true U ~ [E [3<=sum(Server_Waiting_1, Server_Waiting_2) U sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]]]]

abstracting: (sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)) states: 7,424 (3)
abstracting: (3<=sum(Server_Waiting_1, Server_Waiting_2)) states: 0
-> the formula is TRUE

FORMULA CSRepetitions-COL-02-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AF [[AG [2<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)] | ~ [2<=sum(Server_Waiting_1, Server_Waiting_2)]]]
normalized: ~ [EG [~ [[~ [2<=sum(Server_Waiting_1, Server_Waiting_2)] | ~ [E [true U ~ [2<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)]]]]]]]

abstracting: (2<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)) states: 4,863 (3)
abstracting: (2<=sum(Server_Waiting_1, Server_Waiting_2)) states: 336
.
EG iterations: 1
-> the formula is FALSE

FORMULA CSRepetitions-COL-02-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [EF [[sum(Server_Waiting_1, Server_Waiting_2)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4) & 3<=RequestBufferSlots]]]
normalized: ~ [E [true U ~ [E [true U [sum(Server_Waiting_1, Server_Waiting_2)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4) & 3<=RequestBufferSlots]]]]]

abstracting: (3<=RequestBufferSlots) states: 0
abstracting: (sum(Server_Waiting_1, Server_Waiting_2)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)) states: 7,151 (3)
-> the formula is FALSE

FORMULA CSRepetitions-COL-02-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4) | 2<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)] | ~ [1<=RequestBufferSlots]] & AF [RequestBufferSlots<=RequestBufferSlots]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [RequestBufferSlots<=RequestBufferSlots]]] & [~ [1<=RequestBufferSlots] | [sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4) | 2<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]]]]]

abstracting: (2<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)) states: 5,423 (3)
abstracting: (sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)) states: 4,863 (3)
abstracting: (1<=RequestBufferSlots) states: 2,400 (3)
abstracting: (RequestBufferSlots<=RequestBufferSlots) states: 7,424 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA CSRepetitions-COL-02-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: E [[sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4) | ~ [sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]] U AG [RequestBufferSlots<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]
normalized: E [[sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4) | ~ [sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]] U ~ [E [true U ~ [RequestBufferSlots<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]]]

abstracting: (RequestBufferSlots<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)) states: 7,174 (3)
abstracting: (sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)) states: 2,913 (3)
abstracting: (sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)) states: 7,424 (3)
-> the formula is TRUE

FORMULA CSRepetitions-COL-02-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [EX [[RequestBufferSlots<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1) | 1<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]]
normalized: ~ [E [true U ~ [EX [[RequestBufferSlots<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1) | 1<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]]]]

abstracting: (1<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)) states: 7,139 (3)
abstracting: (RequestBufferSlots<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)) states: 7,174 (3)
.-> the formula is TRUE

FORMULA CSRepetitions-COL-02-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [EF [EG [3<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]]]
normalized: ~ [E [true U EG [3<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]]]

abstracting: (3<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)) states: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA CSRepetitions-COL-02-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[[RequestBufferSlots<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1) | 3<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)] & ~ [sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)]] & ~ [~ [3<=sum(Server_Waiting_1, Server_Waiting_2)]]]]
normalized: E [true U [3<=sum(Server_Waiting_1, Server_Waiting_2) & [~ [sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)] & [RequestBufferSlots<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1) | 3<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)]]]]

abstracting: (3<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)) states: 2,001 (3)
abstracting: (RequestBufferSlots<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)) states: 7,174 (3)
abstracting: (sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)) states: 4,863 (3)
abstracting: (3<=sum(Server_Waiting_1, Server_Waiting_2)) states: 0
-> the formula is FALSE

FORMULA CSRepetitions-COL-02-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[EX [3<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)] & ~ [~ [3<=sum(Server_Waiting_1, Server_Waiting_2)]]]]
normalized: E [true U [3<=sum(Server_Waiting_1, Server_Waiting_2) & EX [3<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]]

abstracting: (3<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)) states: 2,561 (3)
.abstracting: (3<=sum(Server_Waiting_1, Server_Waiting_2)) states: 0
-> the formula is FALSE

FORMULA CSRepetitions-COL-02-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [AX [~ [sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(Server_Waiting_1, Server_Waiting_2)]]]
normalized: E [true U ~ [EX [sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(Server_Waiting_1, Server_Waiting_2)]]]

abstracting: (sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(Server_Waiting_1, Server_Waiting_2)) states: 2,496 (3)
.-> the formula is TRUE

FORMULA CSRepetitions-COL-02-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m8sec


BK_STOP 1433159366857

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

388
iterations count:1563 (55), effective:220 (7)

initing FirstDep: 0m0sec


iterations count:545 (19), effective:63 (2)

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

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

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

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

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

iterations count:28 (1), effective:0 (0)
524
iterations count:1204 (43), effective:165 (5)

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

iterations count:143 (5), effective:23 (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_CSRepetitions-PT-02"
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_CSRepetitions-PT-02.tgz
mv S_CSRepetitions-PT-02 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_CSRepetitions-PT-02, 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 r120st-ebro-143297419500184"
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 ;