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

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

=== Now, execution of the tool begins

BK_START 1464332566929


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=CTLCardinality.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.896sec


RS generation: 0m 3.412sec


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



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

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

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

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

MC time: 0m 4.265sec

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

abstracting: (P3<=Pback3) states: 11,298,247,988,617,994,391 (19)
-> the formula is TRUE

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

MC time: 0m 2.317sec

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

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

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

MC time: 0m 0.929sec

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

abstracting: (P3<=Pm4) states: 10,970,016,762,305,884,816 (19)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m12.520sec

checking: EF [AG [[3<=P4 | Pback1<=Pout3]]]
normalized: E [true U ~ [E [true U ~ [[3<=P4 | Pback1<=Pout3]]]]]

abstracting: (Pback1<=Pout3) states: 9,442,299,684,526,363,941 (18)
abstracting: (3<=P4) states: 15,784,063,822,371,005,700 (19)
-> the formula is FALSE

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

MC time: 1m48.842sec

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

abstracting: (1<=P1) states: 16,760,196,402,604,215,700 (19)
abstracting: (P1<=Pout4) states: 8,783,826,636,486,563,506 (18)
.-> the formula is FALSE

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

MC time: 0m18.704sec

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

abstracting: (2<=Pout1) states: 16,267,249,449,586,444,650 (19)
abstracting: (P2<=Pback4) states: 10,970,016,762,305,884,816 (19)
-> the formula is FALSE

FORMULA Kanban-PT-0100-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.917sec

checking: ~ [AG [[[2<=P1 | Pm3<=Pback2] & ~ [3<=Pout3]]]]
normalized: E [true U ~ [[~ [3<=Pout3] & [2<=P1 | Pm3<=Pback2]]]]

abstracting: (Pm3<=Pback2) states: 8,772,547,785,762,958,886 (18)
abstracting: (2<=P1) states: 16,267,249,449,586,444,650 (19)
abstracting: (3<=Pout3) states: 16,018,473,100,860,879,495 (19)
-> the formula is TRUE

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

MC time: 0m 5.153sec

checking: EX [E [Pout1<=Pm4 U P2<=Pback2]]
normalized: EX [E [Pout1<=Pm4 U P2<=Pback2]]

abstracting: (P2<=Pback2) states: 11,298,247,988,617,994,391 (19)
abstracting: (Pout1<=Pm4) states: 8,783,826,636,486,563,506 (18)

before gc: list nodes free: 372

after gc: idd nodes used:4173489, unused:59826511; list nodes free:618905771

before gc: list nodes free: 296

after gc: idd nodes used:3999507, unused:60000493; list nodes free:617785181

FORMULA Kanban-PT-0100-CTLCardinality-2 CANNOT_COMPUTE

MC time: 11m51.871sec

checking: [~ [E [3<=Pm2 U 3<=P3]] | AG [~ [~ [Pback1<=P4]]]]
normalized: [~ [E [true U ~ [Pback1<=P4]]] | ~ [E [3<=Pm2 U 3<=P3]]]


before gc: list nodes free: 125

after gc: idd nodes used:11431, unused:63988569; list nodes free:687723855
abstracting: (3<=P3) states: 14,869,184,890,789,168,170 (19)
abstracting: (3<=Pm2) states: 16,018,473,100,860,879,495 (19)
abstracting: (Pback1<=P4) states: 8,783,826,636,486,563,506 (18)
-> the formula is FALSE

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

MC time: 0m22.375sec

checking: [AG [[3<=Pout1 | ~ [3<=Pm1]]] & AF [Pm3<=Pout4]]
normalized: [~ [EG [~ [Pm3<=Pout4]]] & ~ [E [true U ~ [[3<=Pout1 | ~ [3<=Pm1]]]]]]

abstracting: (3<=Pm1) states: 15,784,063,822,371,005,700 (19)
abstracting: (3<=Pout1) states: 15,784,063,822,371,005,700 (19)
abstracting: (Pm3<=Pout4) states: 8,106,821,143,746,622,531 (18)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.730sec

checking: [AG [AX [P3<=P3]] | ~ [EX [Pout1<=Pout4]]]
normalized: [~ [EX [Pout1<=Pout4]] | ~ [E [true U EX [~ [P3<=P3]]]]]

abstracting: (P3<=P3) states: 17,263,002,294,682,342,171 (19)
.abstracting: (Pout1<=Pout4) states: 8,783,826,636,486,563,506 (18)
.-> the formula is TRUE

FORMULA Kanban-PT-0100-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m44.694sec

checking: ~ [~ [[EF [2<=Pback1] & [~ [2<=Pm2] | [Pout4<=Pback2 & Pback3<=Pm3]]]]]
normalized: [[[Pout4<=Pback2 & Pback3<=Pm3] | ~ [2<=Pm2]] & E [true U 2<=Pback1]]

abstracting: (2<=Pback1) states: 16,267,249,449,586,444,650 (19)

BK_STOP 1464333527181

--------------------
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.001sec

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

initing FirstDep: 0m 0.000sec


iterations count:803 (50), effective:211 (13)

iterations count:866 (54), effective:250 (15)

iterations count:324 (20), effective:103 (6)

iterations count:816 (51), effective:250 (15)
48281 48951 46457
iterations count:3636 (227), effective:1006 (62)
11346 11378 11409
iterations count:3316 (207), effective:900 (56)

iterations count:115 (7), effective:99 (6)

iterations count:716 (44), effective:250 (15)

iterations count:173 (10), effective:118 (7)
std::bad_alloc


iterations count:124 (7), effective:34 (2)

iterations count:353 (22), effective:111 (6)

iterations count:225 (14), effective:128 (8)

iterations count:90 (5), effective:22 (1)
/home/mcc/BenchKit/BenchKit_head.sh: line 13: 313 Killed ${TIMEOUT} marcie --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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="CTLCardinality"
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 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 r161kn-blw3-146416418200138"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; 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 ;