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 Kanban-PT-0005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r050kn-ebro-143236503800438
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432541870959

Model: Kanban-PT-0005
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: 0m5sec


RS generation: 0m0sec


-> reachability set: #nodes 236 (2.4e+02) #states 2,546,432 (6)



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

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

abstracting: (1<=P2) states: 1,163,456 (6)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[[~ [3<=Pm1] | [3<=Pm3 | 3<=Pout2]] | ~ [~ [1<=Pout2]]]]
normalized: ~ [E [true U ~ [[1<=Pout2 | [[3<=Pm3 | 3<=Pout2] | ~ [3<=Pm1]]]]]]

abstracting: (3<=Pm1) states: 454,720 (5)
abstracting: (3<=Pout2) states: 567,616 (5)
abstracting: (3<=Pm3) states: 567,616 (5)
abstracting: (1<=Pout2) states: 1,712,256 (6)
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (3<=Pm1) states: 454,720 (5)
abstracting: (1<=Pback3) states: 1,712,256 (6)
abstracting: (1<=P2) states: 1,163,456 (6)
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (Pout1<=P2) states: 1,365,504 (6)
-> the formula is FALSE

FORMULA Kanban-PT-0005-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [[[2<=Pm3 & P1<=Pback1] & ~ [2<=P1]]]]
normalized: ~ [E [true U [~ [2<=P1] & [2<=Pm3 & P1<=Pback1]]]]

abstracting: (P1<=Pback1) states: 1,546,048 (6)
abstracting: (2<=Pm3) states: 1,053,696 (6)
abstracting: (2<=P1) states: 909,440 (5)
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [~ [~ [[3<=Pout4 & 3<=Pout3]]]]
normalized: E [true U [3<=Pout4 & 3<=Pout3]]

abstracting: (3<=Pout3) states: 567,616 (5)
abstracting: (3<=Pout4) states: 454,720 (5)
-> the formula is TRUE

FORMULA Kanban-PT-0005-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (Pback1<=Pm2) states: 1,676,808 (6)
abstracting: (Pback2<=Pback1) states: 1,491,000 (6)
-> the formula is FALSE

FORMULA Kanban-PT-0005-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [~ [[3<=P1 | P2<=P4]]]]
normalized: ~ [E [true U ~ [[3<=P1 | P2<=P4]]]]

abstracting: (P2<=P4) states: 1,958,208 (6)
abstracting: (3<=P1) states: 454,720 (5)
-> the formula is FALSE

FORMULA Kanban-PT-0005-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[Pm2<=Pback2 | P3<=P1] & [[2<=P1 & 2<=Pout3] & [3<=Pback2 & Pout2<=Pback3]]]]
normalized: E [true U [[[3<=Pback2 & Pout2<=Pback3] & [2<=P1 & 2<=Pout3]] & [Pm2<=Pback2 | P3<=P1]]]

abstracting: (P3<=P1) states: 1,958,208 (6)
abstracting: (Pm2<=Pback2) states: 1,499,008 (6)
abstracting: (2<=Pout3) states: 1,053,696 (6)
abstracting: (2<=P1) states: 909,440 (5)
abstracting: (Pout2<=Pback3) states: 1,580,544 (6)
abstracting: (3<=Pback2) states: 567,616 (5)
-> the formula is TRUE

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

MC time: 0m2sec

checking: EF [[[3<=Pm2 & [3<=Pm1 & Pout3<=Pback4]] & [[1<=Pm4 & Pout3<=Pback2] | Pm2<=Pback1]]]
normalized: E [true U [[Pm2<=Pback1 | [1<=Pm4 & Pout3<=Pback2]] & [3<=Pm2 & [3<=Pm1 & Pout3<=Pback4]]]]

abstracting: (Pout3<=Pback4) states: 1,491,000 (6)
abstracting: (3<=Pm1) states: 454,720 (5)
abstracting: (3<=Pm2) states: 567,616 (5)
abstracting: (Pout3<=Pback2) states: 1,580,544 (6)
abstracting: (1<=Pm4) states: 1,591,520 (6)
abstracting: (Pm2<=Pback1) states: 1,491,000 (6)
-> the formula is TRUE

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

MC time: 0m1sec

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

abstracting: (3<=Pm1) states: 454,720 (5)
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [[[[1<=Pback1 & 3<=Pback3] & [Pback1<=Pm4 | Pout1<=P4]] & [~ [Pback4<=Pout2] & [2<=Pback4 | 1<=Pback4]]]]
normalized: E [true U [[[1<=Pback1 & 3<=Pback3] & [Pback1<=Pm4 | Pout1<=P4]] & [~ [Pback4<=Pout2] & [2<=Pback4 | 1<=Pback4]]]]

abstracting: (1<=Pback4) states: 1,591,520 (6)
abstracting: (2<=Pback4) states: 909,440 (5)
abstracting: (Pback4<=Pout2) states: 1,676,808 (6)
abstracting: (Pout1<=P4) states: 1,602,888 (6)
abstracting: (Pback1<=Pm4) states: 1,602,888 (6)
abstracting: (3<=Pback3) states: 567,616 (5)
abstracting: (1<=Pback1) states: 1,591,520 (6)
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [[~ [[P2<=Pback4 | Pout2<=Pout2]] & [[3<=Pout3 & 3<=Pout4] & [Pback4<=P1 & 3<=Pback2]]]]
normalized: E [true U [~ [[P2<=Pback4 | Pout2<=Pout2]] & [[3<=Pout3 & 3<=Pout4] & [Pback4<=P1 & 3<=Pback2]]]]

abstracting: (3<=Pback2) states: 567,616 (5)
abstracting: (Pback4<=P1) states: 1,602,888 (6)
abstracting: (3<=Pout4) states: 454,720 (5)
abstracting: (3<=Pout3) states: 567,616 (5)
abstracting: (Pout2<=Pout2) states: 2,546,432 (6)
abstracting: (P2<=Pback4) states: 1,958,208 (6)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[[[Pback4<=P2 | 2<=Pback3] | [2<=Pout3 & P1<=Pback3]] | ~ [~ [Pback4<=P3]]]]
normalized: ~ [E [true U ~ [[Pback4<=P3 | [[2<=Pout3 & P1<=Pback3] | [Pback4<=P2 | 2<=Pback3]]]]]]

abstracting: (2<=Pback3) states: 1,053,696 (6)
abstracting: (Pback4<=P2) states: 1,365,504 (6)
abstracting: (P1<=Pback3) states: 1,676,808 (6)
abstracting: (2<=Pout3) states: 1,053,696 (6)
abstracting: (Pback4<=P3) states: 1,365,504 (6)
-> the formula is FALSE

FORMULA Kanban-PT-0005-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m2sec

checking: AG [[~ [~ [Pout1<=P3]] & 1<=P1]]
normalized: ~ [E [true U ~ [[Pout1<=P3 & 1<=P1]]]]

abstracting: (1<=P1) states: 1,591,520 (6)
abstracting: (Pout1<=P3) states: 1,365,504 (6)
-> the formula is FALSE

FORMULA Kanban-PT-0005-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[~ [P3<=Pback4] | ~ [1<=Pout3]] | [~ [3<=P1] | ~ [P3<=Pback3]]]]
normalized: ~ [E [true U ~ [[[~ [P3<=Pback4] | ~ [1<=Pout3]] | [~ [P3<=Pback3] | ~ [3<=P1]]]]]]

abstracting: (3<=P1) states: 454,720 (5)
abstracting: (P3<=Pback3) states: 1,947,456 (6)
abstracting: (1<=Pout3) states: 1,712,256 (6)
abstracting: (P3<=Pback4) states: 1,958,208 (6)
-> the formula is FALSE

FORMULA Kanban-PT-0005-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m2sec


Total processing time: 0m17sec


BK_STOP 1432541888585

--------------------
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:366 (22), effective:105 (6)

initing FirstDep: 0m0sec


iterations count:80 (5), effective:16 (1)

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

iterations count:105 (6), effective:22 (1)

iterations count:123 (7), effective:27 (1)

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

iterations count:48 (3), effective:9 (0)

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

iterations count:88 (5), effective:19 (1)

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

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

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

iterations count:133 (8), effective:32 (2)

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

iterations count:123 (7), effective:27 (1)

iterations count:70 (4), effective:16 (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="Kanban-PT-0005"
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/Kanban-PT-0005.tgz
mv Kanban-PT-0005 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 Kanban-PT-0005, 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 r050kn-ebro-143236503800438"
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 ;