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-3254
Executing tool marcie
Input is S_Kanban-PT-0005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r111-blw7-149441636900120
=====================================================================

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

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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

parse successfull
net created successfully

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

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

net check time: 0m 0.000sec

init dd package: 0m 1.085sec

parse successfull
net created successfully

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

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

net check time: 0m 0.000sec

init dd package: 0m 3.489sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 111 (1.1e+02) #states 2,546,432 (6)



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

checking: AF [AG [~ [3<=Pout3]]]
normalized: ~ [EG [E [true U 3<=Pout3]]]

abstracting: (3<=Pout3)
states: 567,616 (5)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.003sec

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

abstracting: (3<=Pback2)
states: 567,616 (5)
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

abstracting: (3<=P1)
states: 454,720 (5)
-> the formula is TRUE

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

MC time: 0m 0.001sec

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

abstracting: (3<=Pm1)
states: 454,720 (5)
-> the formula is FALSE

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

MC time: 0m 0.000sec

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

abstracting: (1<=Pout2)
states: 1,712,256 (6)
-> the formula is FALSE

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: EG [E [3<=P2 U 3<=Pback3]]
normalized: EG [E [3<=P2 U 3<=Pback3]]

abstracting: (3<=Pback3)
states: 567,616 (5)
abstracting: (3<=P2)
states: 144,256 (5)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EX [EF [[2<=Pm2 & 2<=Pout1]]]
normalized: EX [E [true U [2<=Pm2 & 2<=Pout1]]]

abstracting: (2<=Pout1)
states: 909,440 (5)
abstracting: (2<=Pm2)
states: 1,053,696 (6)
.-> the formula is TRUE

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

MC time: 0m 0.002sec

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

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

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

MC time: 0m 0.005sec

checking: AG [[AX [Pm3<=Pm3] | AG [1<=Pback3]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [1<=Pback3]]] | ~ [EX [~ [Pm3<=Pm3]]]]]]]

abstracting: (Pm3<=Pm3)
states: 2,546,432 (6)
.abstracting: (1<=Pback3)
states: 1,712,256 (6)
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: [Pback4<=Pback2 & ~ [EF [~ [1<=P2]]]]
normalized: [~ [E [true U ~ [1<=P2]]] & Pback4<=Pback2]

abstracting: (Pback4<=Pback2)
states: 1,676,808 (6)
abstracting: (1<=P2)
states: 1,163,456 (6)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AF [[EX [P3<=Pm2] | EF [2<=Pm1]]]
normalized: ~ [EG [~ [[E [true U 2<=Pm1] | EX [P3<=Pm2]]]]]

abstracting: (P3<=Pm2)
states: 1,947,456 (6)
.abstracting: (2<=Pm1)
states: 909,440 (5)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: ~ [E [Pm3<=Pout3 U P3<=Pback1]]
normalized: ~ [E [Pm3<=Pout3 U P3<=Pback1]]

abstracting: (P3<=Pback1)
states: 1,958,208 (6)
abstracting: (Pm3<=Pout3)
states: 1,499,008 (6)
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: AG [[[[Pout3<=Pout2 | Pback3<=P3] | 2<=Pout1] | EX [1<=P4]]]
normalized: ~ [E [true U ~ [[EX [1<=P4] | [2<=Pout1 | [Pout3<=Pout2 | Pback3<=P3]]]]]]

abstracting: (Pback3<=P3)
states: 1,244,992 (6)
abstracting: (Pout3<=Pout2)
states: 1,580,544 (6)
abstracting: (2<=Pout1)
states: 909,440 (5)
abstracting: (1<=P4)
states: 1,591,520 (6)
.-> the formula is FALSE

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

MC time: 0m 0.007sec

checking: [[A [3<=Pout1 U 1<=Pback1] & ~ [1<=P1]] | [EF [[1<=Pback1 & P1<=Pout2]] | [2<=Pm2 | 2<=Pback4]]]
normalized: [[[2<=Pm2 | 2<=Pback4] | E [true U [1<=Pback1 & P1<=Pout2]]] | [~ [1<=P1] & [~ [EG [~ [1<=Pback1]]] & ~ [E [~ [1<=Pback1] U [~ [3<=Pout1] & ~ [1<=Pback1]]]]]]]

abstracting: (1<=Pback1)
states: 1,591,520 (6)
abstracting: (3<=Pout1)
states: 454,720 (5)
abstracting: (1<=Pback1)
states: 1,591,520 (6)
abstracting: (1<=Pback1)
states: 1,591,520 (6)
.
EG iterations: 1
abstracting: (1<=P1)
states: 1,591,520 (6)
abstracting: (P1<=Pout2)
states: 1,676,808 (6)
abstracting: (1<=Pback1)
states: 1,591,520 (6)
abstracting: (2<=Pback4)
states: 909,440 (5)
abstracting: (2<=Pm2)
states: 1,053,696 (6)
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: [[[[[2<=P1 & 3<=P1] & ~ [Pback2<=P1]] | [[2<=Pout1 | Pm2<=Pout4] | [Pback1<=Pout3 | 2<=Pm4]]] & EX [2<=P2]] & [~ [AG [Pout3<=Pout1]] | [2<=Pback1 & AF [Pout4<=Pm3]]]]
normalized: [[[2<=Pback1 & ~ [EG [~ [Pout4<=Pm3]]]] | E [true U ~ [Pout3<=Pout1]]] & [EX [2<=P2] & [[[Pback1<=Pout3 | 2<=Pm4] | [2<=Pout1 | Pm2<=Pout4]] | [~ [Pback2<=P1] & [2<=P1 & 3<=P1]]]]]

abstracting: (3<=P1)
states: 454,720 (5)
abstracting: (2<=P1)
states: 909,440 (5)
abstracting: (Pback2<=P1)
states: 1,491,000 (6)
abstracting: (Pm2<=Pout4)
states: 1,491,000 (6)
abstracting: (2<=Pout1)
states: 909,440 (5)
abstracting: (2<=Pm4)
states: 909,440 (5)
abstracting: (Pback1<=Pout3)
states: 1,676,808 (6)
abstracting: (2<=P2)
states: 457,856 (5)
.abstracting: (Pout3<=Pout1)
states: 1,491,000 (6)
abstracting: (Pout4<=Pm3)
states: 1,676,808 (6)
.
EG iterations: 1
abstracting: (2<=Pback1)
states: 909,440 (5)
-> the formula is TRUE

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

MC time: 0m 0.006sec

totally nodes used: 13580 (1.4e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 56676 34745 91421
used/not used/entry size/cache size: 44256 67064608 16 1024MB
basic ops cache: hits/miss/sum: 19612 14801 34413
used/not used/entry size/cache size: 29473 16747743 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 2874 2076 4950
used/not used/entry size/cache size: 2076 8386532 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67096098
1 12398
2 235
3 42
4 31
5 15
6 18
7 7
8 4
9 6
>= 10 10

Total processing time: 0m 6.438sec


BK_STOP 1494775491854

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

check for maximal unmarked siphon
ok
check for constant places
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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

check for maximal unmarked siphon
ok
check for constant places
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


iterations count:371 (23), effective:110 (6)

initing FirstDep: 0m 0.000sec


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

iterations count:25 (1), effective:3 (0)

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

iterations count:130 (8), effective:33 (2)

iterations count:38 (2), effective:6 (0)

iterations count:25 (1), effective:3 (0)

iterations count:16 (1), effective:0 (0)

iterations count:164 (10), effective:44 (2)

iterations count:159 (9), effective:39 (2)

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

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

iterations count:92 (5), effective:22 (1)

iterations count:92 (5), effective:22 (1)

iterations count:174 (10), effective:53 (3)

iterations count:19 (1), effective:3 (0)

iterations count:141 (8), effective:35 (2)

iterations count:112 (7), effective:31 (1)

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-0005"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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-0005.tgz
mv S_Kanban-PT-0005 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is S_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 r111-blw7-149441636900120"
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 ;