fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r161-ebro-149580906300147
Last Updated
June 27, 2017

About the Execution of MARCIE for ClientsAndServers-PT-N0001P0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7483.480 19283.00 19058.00 20.40 FTTTFFTTFFFTTTFT normal

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-N0001P0, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161-ebro-149580906300147
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1495816605332

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

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

net check time: 0m 0.000sec

init dd package: 0m 2.413sec

parse successfull
net created successfully

Net: ClientsAndServers_PT_N0001P0
(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 8.132sec


RS generation: 0m 0.132sec


-> reachability set: #nodes 2197 (2.2e+03) #states 27,576 (4)



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

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

abstracting: (2<=CG)
states: 4,753 (3)
.-> the formula is FALSE

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

MC time: 0m 0.114sec

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

abstracting: (StR<=Ci)
states: 25,886 (4)
-> the formula is FALSE

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

MC time: 0m 0.021sec

checking: ~ [EF [[2<=MpA & 1<=SpG]]]
normalized: ~ [E [true U [2<=MpA & 1<=SpG]]]

abstracting: (1<=SpG)
states: 3,168 (3)
abstracting: (2<=MpA)
states: 281
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: EF [Uf<=SpA]
normalized: E [true U Uf<=SpA]

abstracting: (Uf<=SpA)
states: 10,245 (4)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: E [EF [2<=Cb] U EX [3<=Cb]]
normalized: E [E [true U 2<=Cb] U EX [3<=Cb]]

abstracting: (3<=Cb)
states: 1,266 (3)
.abstracting: (2<=Cb)
states: 4,753 (3)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.109sec

checking: ~ [AG [[~ [2<=CA] & ~ [Mi<=CA]]]]
normalized: E [true U ~ [[~ [Mi<=CA] & ~ [2<=CA]]]]

abstracting: (2<=CA)
states: 11,126 (4)
abstracting: (Mi<=CA)
states: 9,101 (3)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.086sec

checking: EF [~ [[~ [3<=SwG] | [SR<=SwG & 3<=Ci]]]]
normalized: E [true U ~ [[[SR<=SwG & 3<=Ci] | ~ [3<=SwG]]]]

abstracting: (3<=SwG)
states: 0
abstracting: (3<=Ci)
states: 5,811 (3)
abstracting: (SR<=SwG)
states: 27,576 (4)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: ~ [[E [3<=CwA U SpA<=Si] & EF [~ [1<=Mi]]]]
normalized: ~ [[E [true U ~ [1<=Mi]] & E [3<=CwA U SpA<=Si]]]

abstracting: (SpA<=Si)
states: 23,934 (4)
abstracting: (3<=CwA)
states: 15,570 (4)
abstracting: (1<=Mi)
states: 27,576 (4)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: EF [[~ [[3<=Si & 2<=SwG]] & ~ [[3<=Si | Mi<=Mi]]]]
normalized: E [true U [~ [[3<=Si | Mi<=Mi]] & ~ [[3<=Si & 2<=SwG]]]]

abstracting: (2<=SwG)
states: 2,780 (3)
abstracting: (3<=Si)
states: 0
abstracting: (Mi<=Mi)
states: 27,576 (4)
abstracting: (3<=Si)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EF [~ [[[SA<=CwA | CF<=SA] | ~ [2<=SG]]]]
normalized: E [true U ~ [[~ [2<=SG] | [SA<=CwA | CF<=SA]]]]

abstracting: (CF<=SA)
states: 16,174 (4)
abstracting: (SA<=CwA)
states: 27,576 (4)
abstracting: (2<=SG)
states: 181
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: E [EX [StF<=SwG] U [[2<=SA | 1<=SpA] & 3<=SpA]]
normalized: E [EX [StF<=SwG] U [3<=SpA & [2<=SA | 1<=SpA]]]

abstracting: (1<=SpA)
states: 4,188 (3)
abstracting: (2<=SA)
states: 281
abstracting: (3<=SpA)
states: 0
abstracting: (StF<=SwG)
states: 25,332 (4)
.-> the formula is FALSE

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

MC time: 0m 0.029sec

checking: [EF [AG [CwA<=MtF]] | A [CR<=SG U ~ [MpG<=CG]]]
normalized: [E [true U ~ [E [true U ~ [CwA<=MtF]]]] | [~ [EG [MpG<=CG]] & ~ [E [MpG<=CG U [MpG<=CG & ~ [CR<=SG]]]]]]

abstracting: (CR<=SG)
states: 10,045 (4)
abstracting: (MpG<=CG)
states: 25,690 (4)
abstracting: (MpG<=CG)
states: 25,690 (4)
abstracting: (MpG<=CG)
states: 25,690 (4)
.........................................................
EG iterations: 57
abstracting: (CwA<=MtF)
states: 1,905 (3)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.310sec

checking: E [[~ [SF<=SpA] | [1<=MwU | 2<=CF]] U EG [SwA<=SpG]]
normalized: E [[[1<=MwU | 2<=CF] | ~ [SF<=SpA]] U EG [SwA<=SpG]]

abstracting: (SwA<=SpG)
states: 15,374 (4)
....................
EG iterations: 20
abstracting: (SF<=SpA)
states: 24,689 (4)
abstracting: (2<=CF)
states: 4,753 (3)
abstracting: (1<=MwU)
states: 4,458 (3)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.081sec

checking: [MpG<=Cb & EG [[StF<=SF | ~ [SF<=SA]]]]
normalized: [MpG<=Cb & EG [[StF<=SF | ~ [SF<=SA]]]]

abstracting: (SF<=SA)
states: 24,689 (4)
abstracting: (StF<=SF)
states: 24,589 (4)
.
EG iterations: 1
abstracting: (MpG<=Cb)
states: 25,690 (4)
-> the formula is TRUE

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

MC time: 0m 0.014sec

checking: [EG [AX [MtF<=SpA]] & [EX [~ [Si<=SR]] & ~ [[~ [SwG<=CwG] & ~ [3<=Si]]]]]
normalized: [[~ [[~ [3<=Si] & ~ [SwG<=CwG]]] & EX [~ [Si<=SR]]] & EG [~ [EX [~ [MtF<=SpA]]]]]

abstracting: (MtF<=SpA)
states: 24,689 (4)
..................................................
EG iterations: 49
abstracting: (Si<=SR)
states: 21,714 (4)
.abstracting: (SwG<=CwG)
states: 27,576 (4)
abstracting: (3<=Si)
states: 0
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.139sec

checking: [AG [[[2<=SF | MwU<=MwU] | [CwA<=CG | MwU<=SpA]]] & ~ [[[3<=SpG & [1<=CG & 2<=SpG]] & [1<=MpA & ~ [StF<=SpG]]]]]
normalized: [~ [[[1<=MpA & ~ [StF<=SpG]] & [3<=SpG & [1<=CG & 2<=SpG]]]] & ~ [E [true U ~ [[[CwA<=CG | MwU<=SpA] | [2<=SF | MwU<=MwU]]]]]]

abstracting: (MwU<=MwU)
states: 27,576 (4)
abstracting: (2<=SF)
states: 181
abstracting: (MwU<=SpA)
states: 23,489 (4)
abstracting: (CwA<=CG)
states: 5,513 (3)
abstracting: (2<=SpG)
states: 181
abstracting: (1<=CG)
states: 12,636 (4)
abstracting: (3<=SpG)
states: 0
abstracting: (StF<=SpG)
states: 24,589 (4)
abstracting: (1<=MpA)
states: 4,188 (3)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

totally nodes used: 171147 (1.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 374250 522600 896850
used/not used/entry size/cache size: 666292 66442572 16 1024MB
basic ops cache: hits/miss/sum: 80465 152887 233352
used/not used/entry size/cache size: 258089 16519127 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: 11790 18919 30709
used/not used/entry size/cache size: 18914 8369694 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 66948428
1 154069
2 5214
3 510
4 200
5 90
6 87
7 13
8 44
9 30
>= 10 179

Total processing time: 0m19.040sec


BK_STOP 1495816624615

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


iterations count:1006 (55), effective:216 (12)

initing FirstDep: 0m 0.000sec


iterations count:355 (19), effective:74 (4)

iterations count:34 (1), effective:6 (0)

iterations count:222 (12), effective:45 (2)

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

iterations count:351 (19), effective:72 (4)

iterations count:213 (11), effective:39 (2)

iterations count:27 (1), effective:2 (0)

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

iterations count:65 (3), effective:11 (0)

iterations count:109 (6), effective:25 (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="ClientsAndServers-PT-N0001P0"
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-N0001P0.tgz
mv ClientsAndServers-PT-N0001P0 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-N0001P0, 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-149580906300147"
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 ;