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_Kanban-PT-0010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r162st-ebro-143319441000451
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433375330838

Model: S_Kanban-PT-0010
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

(NrP: 16 NrTr: 16 NrArc: 40)

net check time: 0m0sec

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

init dd package: 0m4sec


RS generation: 0m0sec


-> reachability set: #nodes 706 (7.1e+02) #states 1,005,927,208 (9)



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

checking: AG [[[P1<=Pout1 | [Pout4<=P2 & 3<=Pback3]] | ~ [3<=Pm1]]]
normalized: ~ [E [true U ~ [[~ [3<=Pm1] | [P1<=Pout1 | [Pout4<=P2 & 3<=Pback3]]]]]]

abstracting: (3<=Pback3) states: 479,488,152 (8)
abstracting: (Pout4<=P2) states: 469,877,122 (8)
abstracting: (P1<=Pout1) states: 566,273,708 (8)
abstracting: (3<=Pm1) states: 422,067,360 (8)
-> the formula is FALSE

FORMULA Kanban-PT-0010-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17sec

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

abstracting: (3<=P3) states: 236,554,032 (8)
-> the formula is FALSE

FORMULA Kanban-PT-0010-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[Pout4<=Pm3 & Pout3<=Pm4] & [3<=P3 | Pback4<=Pout3]] | [[3<=Pout3 | Pback4<=P1] | ~ [Pm3<=Pm1]]]]
normalized: ~ [E [true U ~ [[[~ [Pm3<=Pm1] | [3<=Pout3 | Pback4<=P1]] | [[3<=P3 | Pback4<=Pout3] & [Pout4<=Pm3 & Pout3<=Pm4]]]]]]

abstracting: (Pout3<=Pm4) states: 535,886,494 (8)
abstracting: (Pout4<=Pm3) states: 612,243,060 (8)
abstracting: (Pback4<=Pout3) states: 612,243,060 (8)
abstracting: (3<=P3) states: 236,554,032 (8)
abstracting: (Pback4<=P1) states: 578,584,006 (8)
abstracting: (3<=Pout3) states: 479,488,152 (8)
abstracting: (Pm3<=Pm1) states: 535,886,494 (8)
-> the formula is FALSE

FORMULA Kanban-PT-0010-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 13m41sec

checking: EF [2<=Pm1]
normalized: E [true U 2<=Pm1]

abstracting: (2<=Pm1) states: 580,342,620 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (2<=P2) states: 402,190,932 (8)
-> the formula is FALSE

FORMULA Kanban-PT-0010-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (Pm2<=P2) states: 433,437,004 (8)
-> the formula is FALSE

FORMULA Kanban-PT-0010-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16sec

checking: EF [P3<=Pout1]
normalized: E [true U P3<=Pout1]

abstracting: (P3<=Pout1) states: 715,510,510 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30sec

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

abstracting: (3<=Pback3) states: 479,488,152 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[~ [2<=Pout1] & 2<=Pm4] & [[P2<=Pback2 | 3<=Pback3] & [P4<=Pm3 | 3<=Pm3]]]]
normalized: E [true U [[2<=Pm4 & ~ [2<=Pout1]] & [[P2<=Pback2 | 3<=Pback3] & [P4<=Pm3 | 3<=Pm3]]]]

abstracting: (3<=Pm3) states: 479,488,152 (8)
abstracting: (P4<=Pm3) states: 612,243,060 (8)
abstracting: (3<=Pback3) states: 479,488,152 (8)
abstracting: (P2<=Pback2) states: 721,440,720 (8)
abstracting: (2<=Pout1) states: 580,342,620 (8)
abstracting: (2<=Pm4) states: 580,342,620 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 6m9sec

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

abstracting: (Pm2<=Pm2) states: 1,005,927,208 (9)
-> the formula is TRUE

FORMULA Kanban-PT-0010-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m42sec

checking: EF [[[Pout2<=Pback4 | ~ [1<=Pm4]] & [~ [1<=P1] & [Pback2<=Pback3 | 1<=Pout4]]]]
normalized: E [true U [[~ [1<=P1] & [Pback2<=Pback3 | 1<=Pout4]] & [Pout2<=Pback4 | ~ [1<=Pm4]]]]

abstracting: (1<=Pm4) states: 773,790,160 (8)
abstracting: (Pout2<=Pback4) states: 535,886,494 (8)
abstracting: (1<=Pout4) states: 773,790,160 (8)
abstracting: (Pback2<=Pback3) states: 573,144,572 (8)
abstracting: (1<=P1) states: 773,790,160 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 13m33sec

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

abstracting: (1<=P1) states: 773,790,160 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[~ [~ [Pback2<=Pout2]] | [Pback4<=Pout3 | ~ [P2<=Pout3]]]]
normalized: ~ [E [true U ~ [[Pback2<=Pout2 | [Pback4<=Pout3 | ~ [P2<=Pout3]]]]]]

abstracting: (P2<=Pout3) states: 721,440,720 (8)
abstracting: (Pback4<=Pout3) states: 612,243,060 (8)
abstracting: (Pback2<=Pout2) states: 555,967,412 (8)
-> the formula is FALSE

FORMULA Kanban-PT-0010-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m54sec

checking: AG [[[~ [3<=Pm3] | [2<=P4 | 1<=P3]] | ~ [~ [Pm2<=Pm2]]]]
normalized: ~ [E [true U ~ [[Pm2<=Pm2 | [[2<=P4 | 1<=P3] | ~ [3<=Pm3]]]]]]

abstracting: (3<=Pm3) states: 479,488,152 (8)
abstracting: (1<=P3) states: 649,623,832 (8)
abstracting: (2<=P4) states: 580,342,620 (8)
abstracting: (Pm2<=Pm2) states: 1,005,927,208 (9)
-> the formula is TRUE

FORMULA Kanban-PT-0010-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m49sec

checking: EF [~ [[P3<=Pm1 | 3<=P2]]]
normalized: E [true U ~ [[P3<=Pm1 | 3<=P2]]]

abstracting: (3<=P2) states: 236,554,032 (8)
abstracting: (P3<=Pm1) states: 715,510,510 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m31sec

checking: EF [P2<=Pout1]
normalized: E [true U P2<=Pout1]

abstracting: (P2<=Pout1) states: 715,510,510 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20sec


Total processing time: 39m57sec


BK_STOP 1433377728282

--------------------
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:716 (44), effective:210 (13)

initing FirstDep: 0m0sec


iterations count:89 (5), effective:20 (1)

iterations count:116 (7), effective:25 (1)

iterations count:94 (5), effective:23 (1)

iterations count:71 (4), effective:14 (0)

iterations count:128 (8), effective:28 (1)

iterations count:119 (7), effective:26 (1)

iterations count:140 (8), effective:31 (1)

iterations count:84 (5), effective:17 (1)

iterations count:87 (5), effective:20 (1)

iterations count:169 (10), effective:39 (2)

iterations count:162 (10), effective:36 (2)

iterations count:127 (7), effective:30 (1)

iterations count:147 (9), effective:34 (2)

iterations count:140 (8), effective:31 (1)

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_Kanban-PT-0010"
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/S_Kanban-PT-0010.tgz
mv S_Kanban-PT-0010 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_Kanban-PT-0010, 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 r162st-ebro-143319441000451"
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 ;