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 CSRepetitions-COL-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r008kn-ebro-143214238900113
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432328251761

Model: CSRepetitions-COL-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=ReachabilityCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

Unfolding complete |P|=23|T|=28|A|=92
Time for unfolding: 0m0sec

(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: AG [[[[serverAnwering<=serverWaiting & 3<=requestBufferSlots] | [serverAnwering<=requestBufferSlots | 1<=requestBuffer]] | requestBuffer<=requestBuffer]]
normalized: ~ [E [true U ~ [[[[serverAnwering<=serverWaiting & 3<=requestBufferSlots] | [serverAnwering<=requestBufferSlots | 1<=requestBuffer]] | requestBuffer<=requestBuffer]]]]

abstracting: (requestBuffer<=requestBuffer) states: 0

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-0CANNOT_COMPUTE

MC time: 0m0sec

checking: EF [[~ [[2<=clientSending | 1<=clientSending]] & [~ [requestBufferSlots<=clientWaiting] & 3<=requestBufferSlots]]]
normalized: E [true U [~ [[2<=clientSending | 1<=clientSending]] & [~ [requestBufferSlots<=clientWaiting] & 3<=requestBufferSlots]]]


FORMULA CSRepetitions-COL-02-ReachabilityCardinality-1CANNOT_COMPUTE

MC time: 0m0sec

checking: AG [[3<=serverWaiting | [[2<=clientWaiting & 1<=clientSending] | requestBuffer<=requestBuffer]]]
normalized: ~ [E [true U ~ [[[[2<=clientWaiting & 1<=clientSending] | requestBuffer<=requestBuffer] | 3<=serverWaiting]]]]


FORMULA CSRepetitions-COL-02-ReachabilityCardinality-2CANNOT_COMPUTE

MC time: 0m0sec

checking: EF [[[[1<=serverAnwering & 3<=clientWaiting] & ~ [requestBufferSlots<=requestBufferSlots]] & 3<=requestBufferSlots]]
normalized: E [true U [[[1<=serverAnwering & 3<=clientWaiting] & ~ [requestBufferSlots<=requestBufferSlots]] & 3<=requestBufferSlots]]


FORMULA CSRepetitions-COL-02-ReachabilityCardinality-3CANNOT_COMPUTE

MC time: 0m0sec

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

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

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[serverWaiting<=serverWaiting & ~ [clientSending<=clientSending]] & [~ [clientWaiting<=serverWaiting] & ~ [requestBuffer<=clientSending]]]]
normalized: E [true U [[~ [requestBuffer<=clientSending] & ~ [clientWaiting<=serverWaiting]] & [~ [clientSending<=clientSending] & serverWaiting<=serverWaiting]]]

abstracting: (serverWaiting<=serverWaiting) states: 0
abstracting: (clientSending<=clientSending) states: 0
abstracting: (clientWaiting<=serverWaiting) states: 0
abstracting: (requestBuffer<=clientSending) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [~ [3<=serverWaiting]]
normalized: ~ [E [true U 3<=serverWaiting]]


FORMULA CSRepetitions-COL-02-ReachabilityCardinality-6CANNOT_COMPUTE

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: AG [[1<=clientSending | ~ [[1<=clientSending & 2<=clientSending]]]]
normalized: ~ [E [true U ~ [[~ [[1<=clientSending & 2<=clientSending]] | 1<=clientSending]]]]


FORMULA CSRepetitions-COL-02-ReachabilityCardinality-8CANNOT_COMPUTE

MC time: 0m0sec

checking: AG [~ [~ [~ [3<=requestBuffer]]]]
normalized: ~ [E [true U 3<=requestBuffer]]


FORMULA CSRepetitions-COL-02-ReachabilityCardinality-9CANNOT_COMPUTE

MC time: 0m0sec

checking: EF [[serverAnwering<=serverAnwering & [~ [requestBuffer<=requestBufferSlots] & [3<=requestBufferSlots & requestBufferSlots<=requestBuffer]]]]
normalized: E [true U [[~ [requestBuffer<=requestBufferSlots] & [3<=requestBufferSlots & requestBufferSlots<=requestBuffer]] & serverAnwering<=serverAnwering]]

abstracting: (serverAnwering<=serverAnwering) states: 0
abstracting: (requestBufferSlots<=requestBuffer) states: 0

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-10CANNOT_COMPUTE

MC time: 0m0sec

checking: EF [[[[3<=requestBuffer | requestBufferSlots<=requestBuffer] & [1<=requestBuffer | requestBuffer<=serverAnwering]] & ~ [[clientSending<=clientWaiting | serverWaiting<=serverWaiting]]]]
normalized: E [true U [[[1<=requestBuffer | requestBuffer<=serverAnwering] & [3<=requestBuffer | requestBufferSlots<=requestBuffer]] & ~ [[clientSending<=clientWaiting | serverWaiting<=serverWaiting]]]]

abstracting: (serverWaiting<=serverWaiting) states: 0
abstracting: (clientSending<=clientWaiting) states: 0
abstracting: (requestBufferSlots<=requestBuffer) states: 0

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-11CANNOT_COMPUTE

MC time: 0m0sec

checking: EF [[[[3<=clientSending | serverWaiting<=serverWaiting] & clientWaiting<=serverAnwering] & [3<=serverWaiting & ~ [requestBuffer<=clientWaiting]]]]
normalized: E [true U [[~ [requestBuffer<=clientWaiting] & 3<=serverWaiting] & [[3<=clientSending | serverWaiting<=serverWaiting] & clientWaiting<=serverAnwering]]]

abstracting: (clientWaiting<=serverAnwering) states: 0
abstracting: (serverWaiting<=serverWaiting) states: 0

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-12CANNOT_COMPUTE

MC time: 0m0sec

checking: EF [[~ [~ [3<=serverAnwering]] & ~ [2<=requestBuffer]]]
normalized: E [true U [~ [2<=requestBuffer] & 3<=serverAnwering]]


FORMULA CSRepetitions-COL-02-ReachabilityCardinality-13CANNOT_COMPUTE

MC time: 0m0sec

checking: AG [~ [[[3<=serverWaiting & serverAnwering<=clientWaiting] & [requestBufferSlots<=requestBufferSlots | 3<=clientSending]]]]
normalized: ~ [E [true U [[3<=serverWaiting & serverAnwering<=clientWaiting] & [requestBufferSlots<=requestBufferSlots | 3<=clientSending]]]]


FORMULA CSRepetitions-COL-02-ReachabilityCardinality-14CANNOT_COMPUTE

MC time: 0m0sec

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

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

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m8sec


BK_STOP 1432328260959

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

353
iterations count:1539 (54), effective:220 (7)

initing FirstDep: 0m0sec

Unknown names:
requestBuffer
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
requestBufferSlots
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
serverWaiting
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
requestBufferSlots
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula


iterations count:28 (1), effective:0 (0)
Unknown names:
serverWaiting
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula


iterations count:28 (1), effective:0 (0)
Unknown names:
clientSending
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
requestBuffer
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
requestBufferSlots
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
requestBuffer
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
clientSending
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
serverAnwering
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
clientSending
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula


iterations count:28 (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="CSRepetitions-COL-02"
export BK_EXAMINATION="ReachabilityCardinality"
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/CSRepetitions-COL-02.tgz
mv CSRepetitions-COL-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 CSRepetitions-COL-02, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r008kn-ebro-143214238900113"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;