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-2270
Executing tool marcie
Input is S_TokenRing-COL-010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r148st-smll-143305874000230
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433305466281

Model: S_TokenRing-COL-010
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|=121|T|=1111|A|=4444
Time for unfolding: 0m0sec

(NrP: 121 NrTr: 1111 NrArc: 4444)

net check time: 0m0sec

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

init dd package: 0m3sec


RS generation: 0m2sec


-> reachability set: #nodes 6527 (6.5e+03) #states 58,905 (4)



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

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


FORMULA TokenRing-COL-010-ReachabilityCardinality-0CANNOT_COMPUTE

MC time: 0m0sec

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

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

FORMULA TokenRing-COL-010-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m2sec

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


FORMULA TokenRing-COL-010-ReachabilityCardinality-2CANNOT_COMPUTE

MC time: 0m0sec

checking: AG [[state<=state | [[3<=state & state<=state] & ~ [state<=state]]]]
normalized: ~ [E [true U ~ [[state<=state | [[3<=state & state<=state] & ~ [state<=state]]]]]]

abstracting: (state<=state) states: 0
abstracting: (state<=state) states: 0

FORMULA TokenRing-COL-010-ReachabilityCardinality-3CANNOT_COMPUTE

MC time: 0m1sec

checking: AG [~ [[state<=state & ~ [2<=state]]]]
normalized: ~ [E [true U [state<=state & ~ [2<=state]]]]


FORMULA TokenRing-COL-010-ReachabilityCardinality-4CANNOT_COMPUTE

MC time: 0m0sec

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


FORMULA TokenRing-COL-010-ReachabilityCardinality-5CANNOT_COMPUTE

MC time: 0m0sec

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


FORMULA TokenRing-COL-010-ReachabilityCardinality-6CANNOT_COMPUTE

MC time: 0m0sec

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

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

FORMULA TokenRing-COL-010-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[state<=state | 1<=state] | [3<=state | state<=state]] & state<=state]]
normalized: ~ [E [true U ~ [[state<=state & [[3<=state | state<=state] | [state<=state | 1<=state]]]]]]


FORMULA TokenRing-COL-010-ReachabilityCardinality-8CANNOT_COMPUTE

MC time: 0m0sec

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

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

FORMULA TokenRing-COL-010-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA TokenRing-COL-010-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[state<=state | 3<=state] | 3<=state] | ~ [[2<=state | state<=state]]]]
normalized: ~ [E [true U ~ [[~ [[2<=state | state<=state]] | [3<=state | [state<=state | 3<=state]]]]]]


FORMULA TokenRing-COL-010-ReachabilityCardinality-11CANNOT_COMPUTE

MC time: 0m0sec

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

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

FORMULA TokenRing-COL-010-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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


FORMULA TokenRing-COL-010-ReachabilityCardinality-13CANNOT_COMPUTE

MC time: 0m0sec

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

abstracting: (state<=state) states: 0
-> the formula is TRUE

FORMULA TokenRing-COL-010-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (state<=state) states: 0
-> the formula is TRUE

FORMULA TokenRing-COL-010-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m21sec


BK_STOP 1433305487863

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

210 242 322 287 332 422 400 356 352 432 533 544 522 489 467 433 429 475 554 677 688 677 655 633 622 600 578 545 521 517 1032 1933 2743 2928 3016 3104 3181 3214 3335 3379 3434 3445 3588 3643 3687 3720 3753 3764 3799 3878 3934 4001 4079 4079 4068 4057 4046 4035 4013 4002 3980 3958 3947 3925 3892 3870 3856 3852 3951 4039 4116 4182 4237 4281 4314 4347 4347 4466 4584 4700 4814 4926 5036 5144 5250 5354 5456 5556 5566 5601 5651 5711 5781 5851 5921 6011 6111 6241 6451 6527
iterations count:100243 (90), effective:295 (0)

initing FirstDep: 0m0sec

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

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

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

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

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

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

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

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

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

6527
iterations count:1111 (1), effective:0 (0)
6527
iterations count:1111 (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_TokenRing-COL-010"
export BK_EXAMINATION="ReachabilityCardinality"
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_TokenRing-COL-010.tgz
mv S_TokenRing-COL-010 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is S_TokenRing-COL-010, 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 r148st-smll-143305874000230"
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 ;