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-2979
Executing tool marcie
Input is S_Kanban-PT-0020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161kn-blw3-146416418200124
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464331987044


Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: Kanban_PT_0020
(NrP: 16 NrTr: 16 NrArc: 40)

net check time: 0m 0.000sec

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

init dd package: 0m 3.900sec


RS generation: 0m 0.027sec


-> reachability set: #nodes 696 (7.0e+02) #states 805,422,366,595 (11)



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

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

abstracting: (2<=P4) states: 604,862,646,850 (11)
-> the formula is FALSE

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

MC time: 0m 0.046sec

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

abstracting: (1<=P1) states: 700,367,275,300 (11)
-> the formula is FALSE

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

MC time: 0m 0.039sec

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

abstracting: (P3<=Pout1) states: 541,908,899,224 (11)
-> the formula is TRUE

FORMULA Kanban-PT-0020-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.050sec

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

abstracting: (Pout2<=P1) states: 402,700,653,817 (11)
-> the formula is FALSE

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

MC time: 0m 0.025sec

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

abstracting: (P4<=P4) states: 805,422,366,595 (11)
-> the formula is FALSE

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

MC time: 0m 0.001sec

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

abstracting: (2<=Pout4) states: 604,862,646,850 (11)
abstracting: (Pm4<=P2) states: 341,941,966,828 (11)
-> the formula is FALSE

FORMULA Kanban-PT-0020-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.129sec

checking: AG [~ [[P3<=Pout4 | ~ [Pback3<=Pback3]]]]
normalized: ~ [E [true U [P3<=Pout4 | ~ [Pback3<=Pback3]]]]

abstracting: (Pback3<=Pback3) states: 805,422,366,595 (11)
abstracting: (P3<=Pout4) states: 541,908,899,224 (11)
-> the formula is FALSE

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

MC time: 0m 0.059sec

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

abstracting: (P1<=P1) states: 805,422,366,595 (11)
abstracting: (Pout3<=P4) states: 402,700,653,817 (11)
-> the formula is TRUE

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

MC time: 0m 0.006sec

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

abstracting: (Pback3<=Pback3) states: 805,422,366,595 (11)
abstracting: (Pback3<=Pout3) states: 425,671,499,638 (11)
abstracting: (Pm1<=P2) states: 341,941,966,828 (11)
-> the formula is FALSE

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

MC time: 0m 0.045sec

checking: EF [[Pback2<=Pback4 & [P1<=Pback2 & [1<=Pout4 | 2<=Pback4]]]]
normalized: E [true U [Pback2<=Pback4 & [P1<=Pback2 & [1<=Pout4 | 2<=Pback4]]]]

abstracting: (2<=Pback4) states: 604,862,646,850 (11)
abstracting: (1<=Pout4) states: 700,367,275,300 (11)
abstracting: (P1<=Pback2) states: 464,674,039,599 (11)
abstracting: (Pback2<=Pback4) states: 402,700,653,817 (11)
-> the formula is TRUE

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

MC time: 0m 0.974sec

checking: EF [[[[2<=P4 | 2<=P2] & [3<=Pout3 & Pm1<=Pback3]] & ~ [~ [P4<=P4]]]]
normalized: E [true U [P4<=P4 & [[3<=Pout3 & Pm1<=Pback3] & [2<=P4 | 2<=P2]]]]

abstracting: (2<=P2) states: 499,741,690,294 (11)
abstracting: (2<=P4) states: 604,862,646,850 (11)
abstracting: (Pm1<=Pback3) states: 464,674,039,599 (11)
abstracting: (3<=Pout3) states: 555,460,564,659 (11)
abstracting: (P4<=P4) states: 805,422,366,595 (11)
-> the formula is TRUE

FORMULA Kanban-PT-0020-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.558sec

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

abstracting: (Pm3<=Pout3) states: 425,671,499,638 (11)
abstracting: (Pback2<=Pout3) states: 433,261,686,858 (11)
abstracting: (Pout2<=Pout3) states: 433,261,686,858 (11)
abstracting: (1<=Pout1) states: 700,367,275,300 (11)
-> the formula is TRUE

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

MC time: 0m 0.186sec

checking: EF [[[[3<=P3 & 3<=Pm2] & Pback2<=Pout1] & ~ [[P4<=P2 | Pback2<=Pm1]]]]
normalized: E [true U [[Pback2<=Pout1 & [3<=P3 & 3<=Pm2]] & ~ [[P4<=P2 | Pback2<=Pm1]]]]

abstracting: (Pback2<=Pm1) states: 402,700,653,817 (11)
abstracting: (P4<=P2) states: 341,941,966,828 (11)
abstracting: (3<=Pm2) states: 555,460,564,659 (11)
abstracting: (3<=P3) states: 386,516,170,194 (11)
abstracting: (Pback2<=Pout1) states: 402,700,653,817 (11)
-> the formula is TRUE

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

MC time: 0m 0.628sec

checking: AG [~ [[[Pout3<=Pm2 & P2<=Pm4] & [Pm2<=Pback1 & P3<=Pback1]]]]
normalized: ~ [E [true U [[Pm2<=Pback1 & P3<=Pback1] & [Pout3<=Pm2 & P2<=Pm4]]]]

abstracting: (P2<=Pm4) states: 541,908,899,224 (11)
abstracting: (Pout3<=Pm2) states: 433,261,686,858 (11)
abstracting: (P3<=Pback1) states: 541,908,899,224 (11)
abstracting: (Pm2<=Pback1) states: 402,700,653,817 (11)
-> the formula is FALSE

FORMULA Kanban-PT-0020-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.699sec

checking: EF [[~ [2<=Pback3] & [[Pout3<=Pout3 | 1<=Pm2] & [P3<=Pout1 & Pout4<=Pm2]]]]
normalized: E [true U [[[Pout3<=Pout3 | 1<=Pm2] & [P3<=Pout1 & Pout4<=Pm2]] & ~ [2<=Pback3]]]

abstracting: (2<=Pback3) states: 633,228,619,254 (11)
abstracting: (Pout4<=Pm2) states: 464,674,039,599 (11)
abstracting: (P3<=Pout1) states: 541,908,899,224 (11)
abstracting: (1<=Pm2) states: 716,548,174,419 (11)
abstracting: (Pout3<=Pout3) states: 805,422,366,595 (11)
-> the formula is TRUE

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

MC time: 0m 0.484sec

checking: AG [[[[1<=Pout3 | 1<=Pm4] | [3<=Pback3 | 2<=P4]] & [[Pout2<=Pm2 | 1<=Pout2] | [3<=Pm4 | 2<=Pback3]]]]
normalized: ~ [E [true U ~ [[[[3<=Pm4 | 2<=Pback3] | [Pout2<=Pm2 | 1<=Pout2]] & [[3<=Pback3 | 2<=P4] | [1<=Pout3 | 1<=Pm4]]]]]]

abstracting: (1<=Pm4) states: 700,367,275,300 (11)
abstracting: (1<=Pout3) states: 716,548,174,419 (11)
abstracting: (2<=P4) states: 604,862,646,850 (11)
abstracting: (3<=Pback3) states: 555,460,564,659 (11)
abstracting: (1<=Pout2) states: 716,548,174,419 (11)
abstracting: (Pout2<=Pm2) states: 425,671,499,638 (11)
abstracting: (2<=Pback3) states: 633,228,619,254 (11)
abstracting: (3<=Pm4) states: 518,453,697,300 (11)
-> the formula is FALSE

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

MC time: 0m 0.088sec


Total processing time: 0m 9.462sec


BK_STOP 1464331996550

--------------------
content from stderr:

check for maximal unmarked siphon
ok
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: 0m 0.000sec

781
iterations count:1436 (89), effective:440 (27)

initing FirstDep: 0m 0.000sec


iterations count:73 (4), effective:19 (1)

iterations count:676 (42), effective:180 (11)

iterations count:316 (19), effective:80 (5)

iterations count:489 (30), effective:129 (8)

iterations count:243 (15), effective:70 (4)

iterations count:196 (12), effective:60 (3)

iterations count:354 (22), effective:91 (5)

iterations count:796 (49), effective:230 (14)

iterations count:495 (30), effective:145 (9)

iterations count:648 (40), effective:194 (12)

iterations count:864 (54), effective:249 (15)
3014
iterations count:1387 (86), effective:395 (24)

iterations count:657 (41), effective:206 (12)
1585
iterations count:1315 (82), effective:382 (23)

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-0020"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/hulinhub/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-0020.tgz
mv S_Kanban-PT-0020 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is S_Kanban-PT-0020, 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 r161kn-blw3-146416418200124"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; 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 ;