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-3253
Executing tool marcie
Input is ClientsAndServers-PT-N0002P1, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161-ebro-149580906300165
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495816643598

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: ClientsAndServers_PT_N0002P1
(NrP: 25 NrTr: 18 NrArc: 54)

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

net check time: 0m 0.000sec

init dd package: 0m 2.292sec

parse successfull
net created successfully

Net: ClientsAndServers_PT_N0002P1
(NrP: 25 NrTr: 18 NrArc: 54)

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

net check time: 0m 0.000sec

init dd package: 0m 7.266sec


RS generation: 0m 2.081sec


-> reachability set: #nodes 26665 (2.7e+04) #states 12,462,173 (7)



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

checking: AF [EG [~ [1<=SpG]]]
normalized: ~ [EG [~ [EG [~ [1<=SpG]]]]]

abstracting: (1<=SpG)
states: 3,075,776 (6)
......................................................................................................................................................................................................
EG iterations: 198

EG iterations: 0
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.593sec

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

abstracting: (2<=Ci)
states: 6,181,050 (6)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.495sec

checking: ~ [AF [~ [[1<=Ci | 2<=SG]]]]
normalized: EG [[1<=Ci | 2<=SG]]

abstracting: (2<=SG)
states: 597,108 (5)
abstracting: (1<=Ci)
states: 8,885,216 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.427sec

checking: EF [AG [Mi<=SR]]
normalized: E [true U ~ [E [true U ~ [Mi<=SR]]]]

abstracting: (Mi<=SR)
states: 2,032,520 (6)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: ~ [EG [EG [SA<=SpG]]]
normalized: ~ [EG [EG [SA<=SpG]]]

abstracting: (SA<=SpG)
states: 9,906,869 (6)
................................................
EG iterations: 48
.
EG iterations: 1
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.373sec

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

abstracting: (SF<=SF)
states: 12,462,173 (7)
abstracting: (1<=CG)
states: 8,885,216 (6)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.167sec

checking: AF [~ [~ [[SG<=CR & 2<=StF]]]]
normalized: ~ [EG [~ [[SG<=CR & 2<=StF]]]]

abstracting: (2<=StF)
states: 597,108 (5)
abstracting: (SG<=CR)
states: 11,428,675 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.274sec

checking: E [EG [MpG<=CG] U AX [Mi<=SpA]]
normalized: E [EG [MpG<=CG] U ~ [EX [~ [Mi<=SpA]]]]

abstracting: (Mi<=SpA)
states: 2,032,520 (6)
.abstracting: (MpG<=CG)
states: 11,483,444 (7)
.............................................................................................................................................................................
EG iterations: 173
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.475sec

checking: AF [EG [[CA<=Uf & CwG<=CF]]]
normalized: ~ [EG [~ [EG [[CA<=Uf & CwG<=CF]]]]]

abstracting: (CwG<=CF)
states: 2,468,088 (6)
abstracting: (CA<=Uf)
states: 12,462,173 (7)
..........................................
EG iterations: 42
.........
EG iterations: 9
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.058sec

checking: EF [[~ [[Mi<=SwA & Mi<=StR]] & AF [3<=StF]]]
normalized: E [true U [~ [EG [~ [3<=StF]]] & ~ [[Mi<=SwA & Mi<=StR]]]]

abstracting: (Mi<=StR)
states: 2,032,520 (6)
abstracting: (Mi<=SwA)
states: 5,244,908 (6)
abstracting: (3<=StF)
states: 82,824 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.657sec

checking: AF [[EF [3<=Uf] & [3<=CG & [2<=SpA & MpA<=SwG]]]]
normalized: ~ [EG [~ [[[3<=CG & [2<=SpA & MpA<=SwG]] & E [true U 3<=Uf]]]]]

abstracting: (3<=Uf)
states: 12,070,992 (7)
abstracting: (MpA<=SwG)
states: 11,119,853 (7)
abstracting: (2<=SpA)
states: 597,108 (5)
abstracting: (3<=CG)
states: 4,179,280 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.423sec

checking: ~ [E [[CwA<=StF & Cb<=SA] U ~ [CA<=CG]]]
normalized: ~ [E [[CwA<=StF & Cb<=SA] U ~ [CA<=CG]]]

abstracting: (CA<=CG)
states: 7,245,861 (6)
abstracting: (Cb<=SA)
states: 4,353,751 (6)
abstracting: (CwA<=StF)
states: 166,036 (5)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.018sec

checking: ~ [[EG [[SwG<=Uf | SwA<=MpG]] & AF [[1<=SpA | 3<=SpA]]]]
normalized: ~ [[~ [EG [~ [[1<=SpA | 3<=SpA]]]] & EG [[SwG<=Uf | SwA<=MpG]]]]

abstracting: (SwA<=MpG)
states: 4,820,197 (6)
abstracting: (SwG<=Uf)
states: 12,381,779 (7)
.
EG iterations: 1
abstracting: (3<=SpA)
states: 82,824 (4)
abstracting: (1<=SpA)
states: 3,075,776 (6)
......................................................................................................................................................................................................
EG iterations: 198
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.753sec

checking: E [EF [3<=SpG] U [[Ci<=CwG & 3<=Uf] & [1<=SwG | StR<=Ci]]]
normalized: E [E [true U 3<=SpG] U [[Ci<=CwG & 3<=Uf] & [1<=SwG | StR<=Ci]]]

abstracting: (StR<=Ci)
states: 11,428,675 (7)
abstracting: (1<=SwG)
states: 8,859,924 (6)
abstracting: (3<=Uf)
states: 12,070,992 (7)
abstracting: (Ci<=CwG)
states: 10,724,721 (7)
abstracting: (3<=SpG)
states: 82,824 (4)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.512sec

checking: AF [[[[SpG<=MpG & 2<=StR] & ~ [2<=SR]] & ~ [[1<=SG & CA<=CR]]]]
normalized: ~ [EG [~ [[~ [[1<=SG & CA<=CR]] & [~ [2<=SR] & [SpG<=MpG & 2<=StR]]]]]]

abstracting: (2<=StR)
states: 597,108 (5)
abstracting: (SpG<=MpG)
states: 9,906,869 (6)
abstracting: (2<=SR)
states: 597,108 (5)
abstracting: (CA<=CR)
states: 7,245,861 (6)
abstracting: (1<=SG)
states: 3,075,776 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.286sec

checking: [A [[CA<=CF | 2<=SwA] U ~ [1<=Uf]] & [[~ [1<=SA] | Cb<=CA] | EG [[3<=CF & 1<=CG]]]]
normalized: [[EG [[3<=CF & 1<=CG]] | [Cb<=CA | ~ [1<=SA]]] & [~ [EG [1<=Uf]] & ~ [E [1<=Uf U [1<=Uf & ~ [[CA<=CF | 2<=SwA]]]]]]]

abstracting: (2<=SwA)
states: 4,271,284 (6)
abstracting: (CA<=CF)
states: 7,245,861 (6)
abstracting: (1<=Uf)
states: 12,441,793 (7)
abstracting: (1<=Uf)
states: 12,441,793 (7)
abstracting: (1<=Uf)
states: 12,441,793 (7)
.
EG iterations: 1
abstracting: (1<=SA)
states: 3,075,776 (6)
abstracting: (Cb<=CA)
states: 7,245,861 (6)
abstracting: (1<=CG)
states: 8,885,216 (6)
abstracting: (3<=CF)
states: 4,179,280 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P1-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.605sec

totally nodes used: 4955024 (5.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 15632078 13614122 29246200
used/not used/entry size/cache size: 15219105 51889759 16 1024MB
basic ops cache: hits/miss/sum: 3532620 3441051 6973671
used/not used/entry size/cache size: 4874353 11902863 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: 355742 242575 598317
used/not used/entry size/cache size: 239005 8149603 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 62799093
1 3956463
2 286138
3 33462
4 9071
5 3712
6 2991
7 2168
8 1572
9 2335
>= 10 11859

Total processing time: 1m 2.261sec


BK_STOP 1495816706100

--------------------
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:1752 (97), effective:370 (20)

initing FirstDep: 0m 0.000sec


iterations count:138 (7), effective:15 (0)

iterations count:56 (3), effective:9 (0)

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

iterations count:339 (18), effective:72 (4)

iterations count:281 (15), effective:60 (3)

iterations count:150 (8), effective:31 (1)

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

iterations count:274 (15), effective:58 (3)

iterations count:237 (13), effective:48 (2)

iterations count:515 (28), effective:109 (6)

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="ClientsAndServers-PT-N0002P1"
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/ClientsAndServers-PT-N0002P1.tgz
mv ClientsAndServers-PT-N0002P1 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool marcie"
echo " Input is ClientsAndServers-PT-N0002P1, 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 r161-ebro-149580906300165"
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 ;