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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r050kn-ebro-143236503700431
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432541818191

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=CTLCardinality.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<=P1]
normalized: ~ [E [true U ~ [1<=P1]]]

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

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

MC time: 0m0sec

checking: [[3<=P4 & EF [2<=Pm1]] & [Pback2<=Pm3 | A [3<=P1 U Pout1<=P1]]]
normalized: [[Pback2<=Pm3 | [~ [EG [~ [Pout1<=P1]]] & ~ [E [~ [3<=P1] U [~ [3<=P1] & ~ [Pout1<=P1]]]]]] & [3<=P4 & E [true U 2<=Pm1]]]

abstracting: (2<=Pm1) states: 909,440 (5)
abstracting: (3<=P4) states: 454,720 (5)
abstracting: (Pout1<=P1) states: 1,546,048 (6)
abstracting: (3<=P1) states: 454,720 (5)
abstracting: (3<=P1) states: 454,720 (5)
abstracting: (Pout1<=P1) states: 1,546,048 (6)
.
EG iterations: 1
abstracting: (Pback2<=Pm3) states: 1,580,544 (6)
-> the formula is TRUE

FORMULA Kanban-PT-0005-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: E [[[1<=Pout3 & 1<=Pback2] | [Pout1<=Pout3 & Pback3<=Pback2]] U 3<=Pout1]
normalized: E [[[Pout1<=Pout3 & Pback3<=Pback2] | [1<=Pout3 & 1<=Pback2]] U 3<=Pout1]

abstracting: (3<=Pout1) states: 454,720 (5)
abstracting: (1<=Pback2) states: 1,712,256 (6)
abstracting: (1<=Pout3) states: 1,712,256 (6)
abstracting: (Pback3<=Pback2) states: 1,580,544 (6)
abstracting: (Pout1<=Pout3) states: 1,676,808 (6)
-> the formula is TRUE

FORMULA Kanban-PT-0005-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m2sec

checking: A [AX [Pout4<=Pout2] U EF [3<=Pout1]]
normalized: [~ [EG [~ [E [true U 3<=Pout1]]]] & ~ [E [EX [~ [Pout4<=Pout2]] U [EX [~ [Pout4<=Pout2]] & ~ [E [true U 3<=Pout1]]]]]]

abstracting: (3<=Pout1) states: 454,720 (5)
abstracting: (Pout4<=Pout2) states: 1,676,808 (6)
.abstracting: (Pout4<=Pout2) states: 1,676,808 (6)
.abstracting: (3<=Pout1) states: 454,720 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Kanban-PT-0005-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[~ [EG [Pback1<=Pout1]] & P1<=Pout2] | AG [EX [1<=P2]]]
normalized: [~ [E [true U ~ [EX [1<=P2]]]] | [P1<=Pout2 & ~ [EG [Pback1<=Pout1]]]]

abstracting: (Pback1<=Pout1) states: 1,546,048 (6)
.
EG iterations: 1
abstracting: (P1<=Pout2) states: 1,676,808 (6)
abstracting: (1<=P2) states: 1,163,456 (6)
.-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[~ [~ [P1<=Pout1]] & ~ [[Pout3<=Pout2 & 1<=P2]]]]
normalized: E [true U [P1<=Pout1 & ~ [[Pout3<=Pout2 & 1<=P2]]]]

abstracting: (1<=P2) states: 1,163,456 (6)
abstracting: (Pout3<=Pout2) states: 1,580,544 (6)
abstracting: (P1<=Pout1) states: 1,546,048 (6)
-> the formula is TRUE

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

MC time: 0m0sec

checking: [EF [[[3<=Pback1 & Pm1<=Pm1] | [3<=Pm1 & Pout4<=Pout2]]] & [EX [1<=Pout3] | Pm4<=Pout4]]
normalized: [E [true U [[3<=Pback1 & Pm1<=Pm1] | [3<=Pm1 & Pout4<=Pout2]]] & [Pm4<=Pout4 | EX [1<=Pout3]]]

abstracting: (1<=Pout3) states: 1,712,256 (6)
.abstracting: (Pm4<=Pout4) states: 1,546,048 (6)
abstracting: (Pout4<=Pout2) states: 1,676,808 (6)
abstracting: (3<=Pm1) states: 454,720 (5)
abstracting: (Pm1<=Pm1) states: 2,546,432 (6)
abstracting: (3<=Pback1) states: 454,720 (5)
-> the formula is TRUE

FORMULA Kanban-PT-0005-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[[3<=Pout3 | P1<=Pm3] | 1<=Pm1] & AX [2<=Pback2]]]
normalized: E [true U [~ [EX [~ [2<=Pback2]]] & [1<=Pm1 | [3<=Pout3 | P1<=Pm3]]]]

abstracting: (P1<=Pm3) states: 1,676,808 (6)
abstracting: (3<=Pout3) states: 567,616 (5)
abstracting: (1<=Pm1) states: 1,591,520 (6)
abstracting: (2<=Pback2) states: 1,053,696 (6)
.-> the formula is TRUE

FORMULA Kanban-PT-0005-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: [E [Pout4<=Pm2 U [1<=Pback3 & 3<=P4]] & [EX [[P4<=P3 | 2<=P1]] & EF [~ [P2<=Pback4]]]]
normalized: [[E [true U ~ [P2<=Pback4]] & EX [[P4<=P3 | 2<=P1]]] & E [Pout4<=Pm2 U [1<=Pback3 & 3<=P4]]]

abstracting: (3<=P4) states: 454,720 (5)
abstracting: (1<=Pback3) states: 1,712,256 (6)
abstracting: (Pout4<=Pm2) states: 1,676,808 (6)
abstracting: (2<=P1) states: 909,440 (5)
abstracting: (P4<=P3) states: 1,365,504 (6)
.abstracting: (P2<=Pback4) states: 1,958,208 (6)
-> the formula is FALSE

FORMULA Kanban-PT-0005-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: E [~ [P2<=Pm1] U [Pout2<=Pm4 & ~ [Pout2<=Pout2]]]
normalized: E [~ [P2<=Pm1] U [Pout2<=Pm4 & ~ [Pout2<=Pout2]]]

abstracting: (Pout2<=Pout2) states: 2,546,432 (6)
abstracting: (Pout2<=Pm4) states: 1,491,000 (6)
abstracting: (P2<=Pm1) states: 1,958,208 (6)
-> the formula is FALSE

FORMULA Kanban-PT-0005-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (Pm1<=P1) states: 1,546,048 (6)
-> the formula is TRUE

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

MC time: 0m0sec

checking: E [EX [Pm1<=P4] U [~ [P2<=P3] & ~ [2<=P2]]]
normalized: E [EX [Pm1<=P4] U [~ [2<=P2] & ~ [P2<=P3]]]

abstracting: (P2<=P3) states: 2,546,432 (6)
abstracting: (2<=P2) states: 457,856 (5)
abstracting: (Pm1<=P4) states: 1,602,888 (6)
.-> the formula is FALSE

FORMULA Kanban-PT-0005-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (Pout3<=P1) states: 1,491,000 (6)
-> the formula is TRUE

FORMULA Kanban-PT-0005-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[~ [EF [2<=Pout1]] | [AG [Pm4<=Pout2] & EG [1<=P4]]] | A [[Pback2<=Pback1 | 3<=Pout3] U P2<=Pm3]]
normalized: [[~ [EG [~ [P2<=Pm3]]] & ~ [E [~ [[Pback2<=Pback1 | 3<=Pout3]] U [~ [[Pback2<=Pback1 | 3<=Pout3]] & ~ [P2<=Pm3]]]]] | [[EG [1<=P4] & ~ [E [true U ~ [Pm4<=Pout2]]]] | ~ [E [true U 2<=Pout1]]]]

abstracting: (2<=Pout1) states: 909,440 (5)
abstracting: (Pm4<=Pout2) states: 1,676,808 (6)
abstracting: (1<=P4) states: 1,591,520 (6)
.
EG iterations: 1
abstracting: (P2<=Pm3) states: 1,947,456 (6)
abstracting: (3<=Pout3) states: 567,616 (5)
abstracting: (Pback2<=Pback1) states: 1,491,000 (6)
abstracting: (3<=Pout3) states: 567,616 (5)
abstracting: (Pback2<=Pback1) states: 1,491,000 (6)
abstracting: (P2<=Pm3) states: 1,947,456 (6)
.......
EG iterations: 7
-> the formula is FALSE

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

MC time: 0m1sec

checking: ~ [Pback1<=Pback1]
normalized: ~ [Pback1<=Pback1]

abstracting: (Pback1<=Pback1) states: 2,546,432 (6)
-> the formula is FALSE

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

MC time: 0m0sec

checking: [Pback4<=Pout2 & [[[[Pout4<=Pm3 & Pm1<=Pback2] & [P1<=Pback1 | 1<=P3]] | AG [Pm3<=Pm2]] | [Pout3<=Pm1 & [P2<=Pback1 & 2<=P3]]]]
normalized: [Pback4<=Pout2 & [[Pout3<=Pm1 & [P2<=Pback1 & 2<=P3]] | [~ [E [true U ~ [Pm3<=Pm2]]] | [[P1<=Pback1 | 1<=P3] & [Pout4<=Pm3 & Pm1<=Pback2]]]]]

abstracting: (Pm1<=Pback2) states: 1,676,808 (6)
abstracting: (Pout4<=Pm3) states: 1,676,808 (6)
abstracting: (1<=P3) states: 1,163,456 (6)
abstracting: (P1<=Pback1) states: 1,546,048 (6)
abstracting: (Pm3<=Pm2) states: 1,580,544 (6)
abstracting: (2<=P3) states: 457,856 (5)
abstracting: (P2<=Pback1) states: 1,958,208 (6)
abstracting: (Pout3<=Pm1) states: 1,491,000 (6)
abstracting: (Pback4<=Pout2) states: 1,676,808 (6)
-> the formula is TRUE

FORMULA Kanban-PT-0005-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m2sec


Total processing time: 0m20sec


BK_STOP 1432541838251

--------------------
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:102 (6), effective:21 (1)

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

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

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

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

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

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

iterations count:103 (6), effective:23 (1)

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

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

iterations count:107 (6), effective:23 (1)

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

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

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

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

iterations count:59 (3), effective:11 (0)

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

iterations count:60 (3), effective:12 (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="Kanban-PT-0005"
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/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 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 r050kn-ebro-143236503700431"
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 ;