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

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

=== Now, execution of the tool begins

BK_START 1464332675809


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_0100
(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.905sec


RS generation: 0m 2.873sec


-> reachability set: #nodes 11416 (1.1e+04) #states 17,263,002,294,682,342,171 (19)



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

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

abstracting: (1<=P1) states: 16,760,196,402,604,215,700 (19)
-> the formula is TRUE

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

MC time: 0m 4.704sec

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

abstracting: (2<=P4) states: 16,267,249,449,586,444,650 (19)
-> the formula is FALSE

FORMULA Kanban-PT-0100-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.817sec

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

abstracting: (3<=Pout2) states: 16,018,473,100,860,879,495 (19)
-> the formula is TRUE

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

MC time: 0m 0.080sec

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

abstracting: (P1<=Pout4) states: 8,783,826,636,486,563,506 (18)
-> the formula is TRUE

FORMULA Kanban-PT-0100-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.231sec

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

abstracting: (Pout3<=P4) states: 8,106,821,143,746,622,531 (18)
-> the formula is FALSE

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

MC time: 0m 2.388sec

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

abstracting: (Pback3<=P2) states: 6,264,473,328,360,996,931 (18)
-> the formula is TRUE

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

MC time: 0m 2.132sec

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

abstracting: (Pout2<=P1) states: 8,106,821,143,746,622,531 (18)
-> the formula is FALSE

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

MC time: 0m 1.569sec

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

abstracting: (P2<=Pback1) states: 10,970,016,762,305,884,816 (19)
-> the formula is TRUE

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

MC time: 0m 6.672sec

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

abstracting: (P4<=Pback2) states: 9,442,299,684,526,363,941 (18)
-> the formula is FALSE

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

MC time: 0m 4.753sec

checking: EF [[P3<=Pout4 & ~ [[1<=Pm3 | 1<=Pout3]]]]
normalized: E [true U [P3<=Pout4 & ~ [[1<=Pm3 | 1<=Pout3]]]]

abstracting: (1<=Pout3) states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=Pm3) states: 16,842,627,999,778,190,295 (19)
abstracting: (P3<=Pout4) states: 10,970,016,762,305,884,816 (19)
-> the formula is TRUE

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

MC time: 0m14.006sec

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

abstracting: (P1<=P3) states: 6,655,648,998,815,905,036 (18)
abstracting: (3<=P3) states: 14,869,184,890,789,168,170 (19)
abstracting: (Pm1<=Pback4) states: 8,783,826,636,486,563,506 (18)
-> the formula is TRUE

FORMULA Kanban-PT-0100-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 23m 4.152sec

checking: EF [[2<=Pback3 & [~ [Pback4<=Pm3] & [P3<=Pback4 & 1<=P2]]]]
normalized: E [true U [2<=Pback3 & [[P3<=Pback4 & 1<=P2] & ~ [Pback4<=Pm3]]]]

abstracting: (Pback4<=Pm3) states: 9,442,299,684,526,363,941 (18)
abstracting: (1<=P2) states: 16,433,155,082,220,173,170 (19)
abstracting: (P3<=Pback4) states: 10,970,016,762,305,884,816 (19)
abstracting: (2<=Pback3) states: 16,427,784,945,596,461,470 (19)
-> the formula is TRUE

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

MC time: 0m26.216sec

checking: AG [[[Pback4<=Pout4 | [3<=Pm2 & Pout1<=Pout4]] | ~ [~ [Pback2<=P3]]]]
normalized: ~ [E [true U ~ [[Pback2<=P3 | [Pback4<=Pout4 | [3<=Pm2 & Pout1<=Pout4]]]]]]

abstracting: (Pout1<=Pout4) states: 8,783,826,636,486,563,506 (18)
abstracting: (3<=Pm2) states: 16,018,473,100,860,879,495 (19)
abstracting: (Pback4<=Pout4) states: 8,758,447,189,400,500,046 (18)
abstracting: (Pback2<=P3) states: 6,264,473,328,360,996,931 (18)

FORMULA Kanban-PT-0100-ReachabilityCardinality-2 CANNOT_COMPUTE

MC time: 17m58.429sec

checking: AG [[[[Pout4<=Pback4 & Pback1<=P3] | 1<=Pm4] | [~ [2<=Pout1] | Pm4<=Pm2]]]
normalized: ~ [E [true U ~ [[[Pm4<=Pm2 | ~ [2<=Pout1]] | [1<=Pm4 | [Pout4<=Pback4 & Pback1<=P3]]]]]]


before gc: list nodes free: 29

after gc: idd nodes used:11439, unused:63988561; list nodes free:687723799
abstracting: (Pback1<=P3) states: 6,655,648,998,815,905,036 (18)
abstracting: (Pout4<=Pback4) states: 8,758,447,189,400,500,046 (18)
abstracting: (1<=Pm4) states: 16,760,196,402,604,215,700 (19)
abstracting: (2<=Pout1) states: 16,267,249,449,586,444,650 (19)
abstracting: (Pm4<=Pm2) states: 9,442,299,684,526,363,941 (18)
-> the formula is TRUE

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

MC time: 0m12.223sec

checking: EF [[[[P1<=P4 & Pm1<=Pout2] | [2<=Pback4 & 2<=Pback4]] & ~ [~ [P2<=Pout2]]]]
normalized: E [true U [P2<=Pout2 & [[2<=Pback4 & 2<=Pback4] | [P1<=P4 & Pm1<=Pout2]]]]

abstracting: (Pm1<=Pout2) states: 9,442,299,684,526,363,941 (18)
abstracting: (P1<=P4) states: 8,783,826,636,486,563,506 (18)
abstracting: (2<=Pback4) states: 16,267,249,449,586,444,650 (19)
abstracting: (2<=Pback4) states: 16,267,249,449,586,444,650 (19)
abstracting: (P2<=Pout2) states: 11,298,247,988,617,994,391 (19)
-> the formula is TRUE

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

MC time: 3m 7.434sec

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

abstracting: (3<=Pm2) states: 16,018,473,100,860,879,495 (19)
abstracting: (Pout3<=Pback4) states: 8,106,821,143,746,622,531 (18)
abstracting: (Pm3<=Pback4) states: 8,106,821,143,746,622,531 (18)
abstracting: (2<=Pback2) states: 16,427,784,945,596,461,470 (19)
abstracting: (3<=Pout2) states: 16,018,473,100,860,879,495 (19)
abstracting: (2<=P1) states: 16,267,249,449,586,444,650 (19)
abstracting: (2<=Pback1) states: 16,267,249,449,586,444,650 (19)
abstracting: (2<=Pback4) states: 16,267,249,449,586,444,650 (19)
-> the formula is TRUE

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

MC time: 0m23.336sec


Total processing time: 46m17.905sec


BK_STOP 1464335454117

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

522 4661 11039 11362 11223 11284 11378
iterations count:7116 (444), effective:2200 (137)

initing FirstDep: 0m 0.000sec

11346 11378 11409
iterations count:3316 (207), effective:900 (56)

iterations count:313 (19), effective:99 (6)

iterations count:82 (5), effective:18 (1)

iterations count:916 (57), effective:300 (18)

iterations count:335 (20), effective:106 (6)

iterations count:903 (56), effective:260 (16)
11470 11435
iterations count:2249 (140), effective:609 (38)
19712
iterations count:1516 (94), effective:400 (25)

iterations count:316 (19), effective:100 (6)
1264 15565 29161 40910 44905 23082 14313
iterations count:7360 (460), effective:2085 (130)
13528
iterations count:1724 (107), effective:503 (31)
12628
iterations count:1069 (66), effective:393 (24)
std::bad_alloc

19029 15430
iterations count:2866 (179), effective:715 (44)

iterations count:890 (55), effective:376 (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-0100"
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-0100.tgz
mv S_Kanban-PT-0100 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-0100, 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-146416418300142"
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 ;