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-0050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161kn-blw3-146416418200133
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464332197820


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_0050
(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 4.094sec


RS generation: 0m 0.297sec


-> reachability set: #nodes 3216 (3.2e+03) #states 10,425,941,194,901,336 (16)



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

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

abstracting: (3<=Pout3) states: 8,979,678,766,436,560 (15)
-> the formula is TRUE

FORMULA Kanban-PT-0050-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.066sec

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

abstracting: (1<=P1) states: 9,835,793,580,095,600 (15)
-> the formula is FALSE

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

MC time: 0m 0.487sec

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

abstracting: (Pback2<=P3) states: 3,871,551,556,998,216 (15)
-> the formula is FALSE

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

MC time: 0m 0.499sec

checking: AG [~ [[[1<=Pback2 & 3<=Pout3] & ~ [3<=Pback3]]]]
normalized: ~ [E [true U [~ [3<=Pback3] & [1<=Pback2 & 3<=Pout3]]]]

abstracting: (3<=Pout3) states: 8,979,678,766,436,560 (15)
abstracting: (1<=Pback2) states: 9,930,998,240,519,460 (15)
abstracting: (3<=Pback3) states: 8,979,678,766,436,560 (15)
-> the formula is FALSE

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

MC time: 0m 0.202sec

checking: EF [~ [[Pback2<=P2 | 2<=Pback2]]]
normalized: E [true U ~ [[Pback2<=P2 | 2<=Pback2]]]

abstracting: (2<=Pback2) states: 9,448,910,947,290,360 (15)
abstracting: (Pback2<=P2) states: 3,871,551,556,998,216 (15)
-> the formula is TRUE

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

MC time: 0m 0.390sec

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

abstracting: (Pout3<=P2) states: 3,871,551,556,998,216 (15)
abstracting: (Pm1<=P4) states: 5,393,441,832,596,766 (15)
-> the formula is FALSE

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

MC time: 0m 1.631sec

checking: AG [[~ [~ [P1<=Pback2]] | [[2<=Pback4 | 2<=Pback1] | ~ [3<=Pback3]]]]
normalized: ~ [E [true U ~ [[P1<=Pback2 | [~ [3<=Pback3] | [2<=Pback4 | 2<=Pback1]]]]]]

abstracting: (2<=Pback1) states: 9,268,343,950,474,700 (15)
abstracting: (2<=Pback4) states: 9,268,343,950,474,700 (15)
abstracting: (3<=Pback3) states: 8,979,678,766,436,560 (15)
abstracting: (P1<=Pback2) states: 5,785,450,047,027,846 (15)
-> the formula is FALSE

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

MC time: 0m 1.587sec

checking: EF [~ [[~ [3<=Pout4] | [Pback2<=Pback2 & Pm1<=P4]]]]
normalized: E [true U ~ [[[Pback2<=Pback2 & Pm1<=P4] | ~ [3<=Pout4]]]]

abstracting: (3<=Pout4) states: 8,723,147,247,505,600 (15)
abstracting: (Pm1<=P4) states: 5,393,441,832,596,766 (15)
abstracting: (Pback2<=Pback2) states: 10,425,941,194,901,336 (16)
-> the formula is TRUE

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

MC time: 0m 1.360sec

checking: EF [[[~ [Pout3<=Pm1] | 2<=Pback4] & P2<=Pout4]]
normalized: E [true U [P2<=Pout4 & [2<=Pback4 | ~ [Pout3<=Pm1]]]]

abstracting: (Pout3<=Pm1) states: 4,979,492,122,731,516 (15)
abstracting: (2<=Pback4) states: 9,268,343,950,474,700 (15)
abstracting: (P2<=Pout4) states: 6,729,415,902,932,346 (15)
-> the formula is TRUE

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

MC time: 1m 1.632sec

checking: EF [~ [[~ [Pback2<=Pout4] | [Pout2<=P2 | 2<=Pback3]]]]
normalized: E [true U ~ [[[Pout2<=P2 | 2<=Pback3] | ~ [Pback2<=Pout4]]]]

abstracting: (Pback2<=Pout4) states: 4,979,492,122,731,516 (15)
abstracting: (2<=Pback3) states: 9,448,910,947,290,360 (15)
abstracting: (Pout2<=P2) states: 3,871,551,556,998,216 (15)
-> the formula is TRUE

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

MC time: 0m 2.695sec

checking: EF [[~ [[3<=Pback2 & Pm3<=P4]] & ~ [[P4<=Pm2 | 3<=P4]]]]
normalized: E [true U [~ [[P4<=Pm2 | 3<=P4]] & ~ [[3<=Pback2 & Pm3<=P4]]]]

abstracting: (Pm3<=P4) states: 4,979,492,122,731,516 (15)
abstracting: (3<=Pback2) states: 8,979,678,766,436,560 (15)
abstracting: (3<=P4) states: 8,723,147,247,505,600 (15)
abstracting: (P4<=Pm2) states: 5,785,450,047,027,846 (15)
-> the formula is TRUE

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

MC time: 0m 2.787sec

checking: AG [[~ [[1<=P2 & Pback3<=Pback1]] | ~ [[P4<=Pm4 & 3<=Pback2]]]]
normalized: ~ [E [true U ~ [[~ [[P4<=Pm4 & 3<=Pback2]] | ~ [[1<=P2 & Pback3<=Pback1]]]]]]

abstracting: (Pback3<=Pback1) states: 4,979,492,122,731,516 (15)
abstracting: (1<=P2) states: 9,461,038,929,509,960 (15)
abstracting: (3<=Pback2) states: 8,979,678,766,436,560 (15)
abstracting: (P4<=Pm4) states: 5,363,400,381,616,836 (15)
-> the formula is FALSE

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

MC time: 0m10.942sec

checking: AG [[~ [~ [Pm2<=P2]] & [[P2<=Pout2 | 2<=P3] & Pm4<=P4]]]
normalized: ~ [E [true U ~ [[Pm2<=P2 & [Pm4<=P4 & [P2<=Pout2 | 2<=P3]]]]]]

abstracting: (2<=P3) states: 8,568,932,545,087,460 (15)
abstracting: (P2<=Pout2) states: 6,909,504,091,400,196 (15)
abstracting: (Pm4<=P4) states: 5,363,400,381,616,836 (15)
abstracting: (Pm2<=P2) states: 3,871,551,556,998,216 (15)
-> the formula is FALSE

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

MC time: 0m 0.882sec

checking: EF [[[~ [2<=Pback3] & [3<=Pout3 & 3<=Pm4]] & [3<=Pback2 & [Pback2<=Pback2 | 1<=Pout4]]]]
normalized: E [true U [[3<=Pback2 & [Pback2<=Pback2 | 1<=Pout4]] & [[3<=Pout3 & 3<=Pm4] & ~ [2<=Pback3]]]]

abstracting: (2<=Pback3) states: 9,448,910,947,290,360 (15)
abstracting: (3<=Pm4) states: 8,723,147,247,505,600 (15)
abstracting: (3<=Pout3) states: 8,979,678,766,436,560 (15)
abstracting: (1<=Pout4) states: 9,835,793,580,095,600 (15)
abstracting: (Pback2<=Pback2) states: 10,425,941,194,901,336 (16)
abstracting: (3<=Pback2) states: 8,979,678,766,436,560 (15)
-> the formula is TRUE

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

MC time: 0m 0.903sec

checking: EF [[~ [1<=Pout3] & [[Pm2<=P4 & Pm1<=P4] & [3<=Pout1 & P1<=Pback3]]]]
normalized: E [true U [[[3<=Pout1 & P1<=Pback3] & [Pm2<=P4 & Pm1<=P4]] & ~ [1<=Pout3]]]

abstracting: (1<=Pout3) states: 9,930,998,240,519,460 (15)
abstracting: (Pm1<=P4) states: 5,393,441,832,596,766 (15)
abstracting: (Pm2<=P4) states: 4,979,492,122,731,516 (15)
abstracting: (P1<=Pback3) states: 5,785,450,047,027,846 (15)
abstracting: (3<=Pout1) states: 8,723,147,247,505,600 (15)
-> the formula is TRUE

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

MC time: 1m22.128sec

checking: AG [[[[2<=Pout2 & 1<=Pm1] | [Pback3<=Pout1 | Pback2<=Pback3]] | [[3<=Pm1 | Pback2<=Pback2] & 2<=P4]]]
normalized: ~ [E [true U ~ [[[2<=P4 & [3<=Pm1 | Pback2<=Pback2]] | [[Pback3<=Pout1 | Pback2<=Pback3] | [2<=Pout2 & 1<=Pm1]]]]]]

abstracting: (1<=Pm1) states: 9,835,793,580,095,600 (15)
abstracting: (2<=Pout2) states: 9,448,910,947,290,360 (15)
abstracting: (Pback2<=Pback3) states: 5,380,094,192,436,756 (15)
abstracting: (Pback3<=Pout1) states: 4,979,492,122,731,516 (15)
abstracting: (Pback2<=Pback2) states: 10,425,941,194,901,336 (16)
abstracting: (3<=Pm1) states: 8,723,147,247,505,600 (15)
abstracting: (2<=P4) states: 9,268,343,950,474,700 (15)
-> the formula is FALSE

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

MC time: 2m55.779sec


Total processing time: 5m53.220sec


BK_STOP 1464332551281

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

1443 3139 3151
iterations count:3566 (222), effective:1100 (68)

initing FirstDep: 0m 0.000sec


iterations count:73 (4), effective:18 (1)
3196
iterations count:1666 (104), effective:450 (28)

iterations count:787 (49), effective:207 (12)

iterations count:139 (8), effective:70 (4)

iterations count:934 (58), effective:256 (16)

iterations count:694 (43), effective:215 (13)

iterations count:599 (37), effective:188 (11)

iterations count:222 (13), effective:67 (4)

iterations count:698 (43), effective:260 (16)
3171
iterations count:1263 (78), effective:398 (24)
3575
iterations count:1237 (77), effective:359 (22)

iterations count:348 (21), effective:149 (9)

iterations count:172 (10), effective:59 (3)

iterations count:284 (17), effective:113 (7)
40226 198176 90539
iterations count:3993 (249), effective:1119 (69)
10071 4807
iterations count:2340 (146), effective:799 (49)

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-0050"
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-0050.tgz
mv S_Kanban-PT-0050 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-0050, 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-146416418200133"
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 ;