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

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

=== Now, execution of the tool begins

BK_START 1495816681525

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=ReachabilityCardinality.xml --memory=6

parse successfull
net created successfully

Net: ClientsAndServers_PT_N0005P0
(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.265sec

parse successfull
net created successfully

Net: ClientsAndServers_PT_N0005P0
(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 6.954sec


RS generation: 2m51.922sec


-> reachability set: #nodes 427155 (4.3e+05) #states 125,510,607,915 (11)



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

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

abstracting: (2<=Cb)
states: 82,808,402,259 (10)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P0-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m43.673sec

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

abstracting: (1<=Uf)
states: 112,652,287,440 (11)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P0-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.085sec

checking: EF [2<=MtF]
normalized: E [true U 2<=MtF]

abstracting: (2<=MtF)
states: 21,371,823,675 (10)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P0-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.129sec

checking: AG [SpG<=CwG]
normalized: ~ [E [true U ~ [SpG<=CwG]]]

abstracting: (SpG<=CwG)
states: 125,510,607,915 (11)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P0-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.571sec

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

abstracting: (MtF<=MtF)
states: 125,510,607,915 (11)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P0-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (CwG<=CwG)
states: 125,510,607,915 (11)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P0-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [CA<=CwG]
normalized: ~ [E [true U ~ [CA<=CwG]]]

abstracting: (CA<=CwG)
states: 101,043,981,993 (11)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P0-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m12.722sec

checking: AG [[CR<=MpG | [~ [3<=CA] | 2<=Uf]]]
normalized: ~ [E [true U ~ [[CR<=MpG | [2<=Uf | ~ [3<=CA]]]]]]

abstracting: (3<=CA)
states: 92,358,121,779 (10)
abstracting: (2<=Uf)
states: 99,881,473,065 (10)
abstracting: (CR<=MpG)
states: 18,895,572,454 (10)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P0-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m38.795sec

checking: AG [~ [[~ [MwU<=Ci] & [2<=CwA | 1<=SR]]]]
normalized: ~ [E [true U [[2<=CwA | 1<=SR] & ~ [MwU<=Ci]]]]

abstracting: (MwU<=Ci)
states: 116,104,501,051 (11)
abstracting: (1<=SR)
states: 59,231,063,885 (10)
abstracting: (2<=CwA)
states: 125,339,659,137 (11)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P0-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 5.146sec

checking: AG [[~ [2<=MpA] | [CR<=CF | ~ [SF<=SwA]]]]
normalized: ~ [E [true U ~ [[[CR<=CF | ~ [SF<=SwA]] | ~ [2<=MpA]]]]]

abstracting: (2<=MpA)
states: 26,298,415,395 (10)
abstracting: (SF<=SwA)
states: 125,510,607,915 (11)
abstracting: (CR<=CF)
states: 46,089,269,252 (10)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P0-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m45.737sec

checking: EF [[~ [~ [1<=CwA]] & [~ [MtF<=SpA] & [2<=CwA & 3<=Ci]]]]
normalized: E [true U [1<=CwA & [[2<=CwA & 3<=Ci] & ~ [MtF<=SpA]]]]

abstracting: (MtF<=SpA)
states: 89,616,150,951 (10)
abstracting: (3<=Ci)
states: 92,358,121,779 (10)
abstracting: (2<=CwA)
states: 125,339,659,137 (11)
abstracting: (1<=CwA)
states: 125,484,420,897 (11)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P0-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m28.273sec

checking: EF [[[~ [SwA<=MpG] & [SF<=SpA & 2<=Si]] & ~ [~ [2<=CF]]]]
normalized: E [true U [2<=CF & [[SF<=SpA & 2<=Si] & ~ [SwA<=MpG]]]]

abstracting: (SwA<=MpG)
states: 25,545,857,531 (10)
abstracting: (2<=Si)
states: 31,731,104,223 (10)
abstracting: (SF<=SpA)
states: 89,616,150,951 (10)
abstracting: (2<=CF)
states: 82,808,402,259 (10)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P0-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m50.063sec

checking: EF [[[1<=MtF | Mi<=SwA] & [3<=SA & CwA<=SwG]]]
normalized: E [true U [[3<=SA & CwA<=SwG] & [1<=MtF | Mi<=SwA]]]

abstracting: (Mi<=SwA)
states: 682,364,472 (8)
abstracting: (1<=MtF)
states: 53,433,939,020 (10)
abstracting: (CwA<=SwG)
states: 4,734,811,600 (9)
abstracting: (3<=SA)
states: 10,874,905,965 (10)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P0-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m49.106sec

checking: EF [[3<=CF | [[SR<=CF & CG<=Cb] & ~ [MtF<=Ci]]]]
normalized: E [true U [3<=CF | [~ [MtF<=Ci] & [SR<=CF & CG<=Cb]]]]

abstracting: (CG<=Cb)
states: 68,941,699,233 (10)
abstracting: (SR<=CF)
states: 108,781,662,715 (11)
abstracting: (MtF<=Ci)
states: 117,867,900,931 (11)
abstracting: (3<=CF)
states: 66,081,753,342 (10)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P0-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m32.496sec

checking: AG [[[[3<=Ci & SA<=CwA] | [3<=SA & MtF<=StR]] | 2<=CwA]]
normalized: ~ [E [true U ~ [[2<=CwA | [[3<=SA & MtF<=StR] | [3<=Ci & SA<=CwA]]]]]]

abstracting: (SA<=CwA)
states: 125,510,607,915 (11)
abstracting: (3<=Ci)
states: 92,358,121,779 (10)
abstracting: (MtF<=StR)
states: 89,616,150,951 (10)
abstracting: (3<=SA)
states: 10,874,905,965 (10)
abstracting: (2<=CwA)
states: 125,339,659,137 (11)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P0-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 5.346sec

checking: AG [[Si<=Cb | [[Mi<=CA & 3<=MtF] | [1<=Mi | Uf<=SG]]]]
normalized: ~ [E [true U ~ [[Si<=Cb | [[1<=Mi | Uf<=SG] | [Mi<=CA & 3<=MtF]]]]]]

abstracting: (3<=MtF)
states: 7,947,858,726 (9)
abstracting: (Mi<=CA)
states: 25,665,213,794 (10)
abstracting: (Uf<=SG)
states: 22,112,107,094 (10)
abstracting: (1<=Mi)
states: 125,510,607,915 (11)
abstracting: (Si<=Cb)
states: 106,280,460,440 (11)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P0-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.396sec

totally nodes used: 54217680 (5.4e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 738184566 273651876 1011836442
used/not used/entry size/cache size: 66028766 1080098 16 1024MB
basic ops cache: hits/miss/sum: 205462172 90799454 296261626
used/not used/entry size/cache size: 16742279 34937 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: 22082284 7161823 29244107
used/not used/entry size/cache size: 4676323 3712285 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 31900563
1 22688117
2 8803570
3 2581271
4 708038
5 210382
6 77851
7 43009
8 24472
9 15693
>= 10 55898

Total processing time: 17m15.787sec


BK_STOP 1495817718038

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


iterations count:5070 (281), effective:1104 (61)

initing FirstDep: 0m 0.004sec


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

iterations count:992 (55), effective:221 (12)

iterations count:253 (14), effective:53 (2)

iterations count:1894 (105), effective:433 (24)

iterations count:1300 (72), effective:285 (15)

iterations count:467 (25), effective:69 (3)

iterations count:767 (42), effective:166 (9)

iterations count:427 (23), effective:92 (5)

iterations count:610 (33), effective:129 (7)

iterations count:1566 (87), effective:339 (18)

iterations count:575 (31), effective:106 (5)

iterations count:1714 (95), effective:348 (19)

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-N0005P0"
export BK_EXAMINATION="ReachabilityCardinality"
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-N0005P0.tgz
mv ClientsAndServers-PT-N0005P0 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-N0005P0, 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 r161-ebro-149580906300178"
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 ;