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

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

=== Now, execution of the tool begins

BK_START 1495816651360

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_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.365sec

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


RS generation: 0m 1.851sec


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



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

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

abstracting: (2<=SA)
states: 597,108 (5)
-> the formula is FALSE

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

MC time: 0m 0.653sec

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

abstracting: (2<=SwA)
states: 4,271,284 (6)
-> the formula is TRUE

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

MC time: 0m 0.052sec

checking: EF [[1<=Uf & 3<=SA]]
normalized: E [true U [1<=Uf & 3<=SA]]

abstracting: (3<=SA)
states: 82,824 (4)
abstracting: (1<=Uf)
states: 12,441,793 (7)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P1-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.069sec

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

abstracting: (1<=SA)
states: 3,075,776 (6)
abstracting: (1<=Ci)
states: 8,885,216 (6)
abstracting: (3<=SA)
states: 82,824 (4)
-> the formula is FALSE

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

MC time: 0m 0.072sec

checking: EF [[~ [~ [2<=MpG]] & SwG<=SF]]
normalized: E [true U [2<=MpG & SwG<=SF]]

abstracting: (SwG<=SF)
states: 4,875,889 (6)
abstracting: (2<=MpG)
states: 535,228 (5)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P1-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.275sec

checking: AG [~ [[~ [2<=SpA] & [3<=MpA & CF<=MwU]]]]
normalized: ~ [E [true U [[3<=MpA & CF<=MwU] & ~ [2<=SpA]]]]

abstracting: (2<=SpA)
states: 597,108 (5)
abstracting: (CF<=MwU)
states: 4,313,086 (6)
abstracting: (3<=MpA)
states: 58,072 (4)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P1-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.935sec

checking: AG [[~ [MpG<=SG] | [~ [2<=Mi] | CF<=CwA]]]
normalized: ~ [E [true U ~ [[[CF<=CwA | ~ [2<=Mi]] | ~ [MpG<=SG]]]]]

abstracting: (MpG<=SG)
states: 10,030,629 (7)
abstracting: (2<=Mi)
states: 8,271,333 (6)
abstracting: (CF<=CwA)
states: 12,462,173 (7)
-> the formula is TRUE

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

MC time: 0m 0.073sec

checking: EF [[~ [~ [1<=SA]] & [[3<=CwG | 2<=CA] & [3<=SwA & 2<=CwA]]]]
normalized: E [true U [1<=SA & [[3<=SwA & 2<=CwA] & [3<=CwG | 2<=CA]]]]

abstracting: (2<=CA)
states: 6,181,050 (6)
abstracting: (3<=CwG)
states: 11,044,998 (7)
abstracting: (2<=CwA)
states: 11,934,077 (7)
abstracting: (3<=SwA)
states: 1,297,576 (6)
abstracting: (1<=SA)
states: 3,075,776 (6)
-> the formula is TRUE

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

MC time: 0m 0.311sec

checking: EF [[[[3<=SG | 1<=SG] & ~ [SwA<=SR]] & 2<=CwG]]
normalized: E [true U [2<=CwG & [~ [SwA<=SR] & [3<=SG | 1<=SG]]]]

abstracting: (1<=SG)
states: 3,075,776 (6)
abstracting: (3<=SG)
states: 82,824 (4)
abstracting: (SwA<=SR)
states: 4,875,889 (6)
abstracting: (2<=CwG)
states: 11,934,077 (7)
-> the formula is TRUE

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

MC time: 0m 0.184sec

checking: AG [~ [[[Uf<=SG | 3<=StR] & [MwU<=MpA & 1<=MpA]]]]
normalized: ~ [E [true U [[MwU<=MpA & 1<=MpA] & [Uf<=SG | 3<=StR]]]]

abstracting: (3<=StR)
states: 82,824 (4)
abstracting: (Uf<=SG)
states: 88,087 (4)
abstracting: (1<=MpA)
states: 2,952,016 (6)
abstracting: (MwU<=MpA)
states: 9,987,313 (6)
-> the formula is FALSE

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

MC time: 0m 0.158sec

checking: AG [[[CwA<=StF | CR<=Cb] | ~ [[SpA<=CA & 3<=CG]]]]
normalized: ~ [E [true U ~ [[[CwA<=StF | CR<=Cb] | ~ [[SpA<=CA & 3<=CG]]]]]]

abstracting: (3<=CG)
states: 4,179,280 (6)
abstracting: (SpA<=CA)
states: 11,428,675 (7)
abstracting: (CR<=Cb)
states: 7,245,861 (6)
abstracting: (CwA<=StF)
states: 166,036 (5)
-> the formula is FALSE

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

MC time: 0m 1.990sec

checking: EF [[[~ [MwU<=CG] & ~ [SA<=SwA]] & [CwG<=Ci | ~ [1<=SpG]]]]
normalized: E [true U [[CwG<=Ci | ~ [1<=SpG]] & [~ [SA<=SwA] & ~ [MwU<=CG]]]]

abstracting: (MwU<=CG)
states: 11,483,444 (7)
abstracting: (SA<=SwA)
states: 12,462,173 (7)
abstracting: (1<=SpG)
states: 3,075,776 (6)
abstracting: (CwG<=Ci)
states: 2,468,088 (6)
-> the formula is FALSE

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

MC time: 0m 0.324sec

checking: EF [[[[2<=SpA & SpG<=MpA] & 3<=Uf] & [StF<=SF & ~ [3<=Uf]]]]
normalized: E [true U [[StF<=SF & ~ [3<=Uf]] & [3<=Uf & [2<=SpA & SpG<=MpA]]]]

abstracting: (SpG<=MpA)
states: 9,906,869 (6)
abstracting: (2<=SpA)
states: 597,108 (5)
abstracting: (3<=Uf)
states: 12,070,992 (7)
abstracting: (3<=Uf)
states: 12,070,992 (7)
abstracting: (StF<=SF)
states: 9,906,869 (6)
-> the formula is FALSE

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

MC time: 0m 0.166sec

checking: AG [[[~ [3<=MpA] | [MpA<=MpA & MpA<=Si]] & [~ [3<=CF] | [CG<=StR & 3<=MwU]]]]
normalized: ~ [E [true U ~ [[[[CG<=StR & 3<=MwU] | ~ [3<=CF]] & [[MpA<=MpA & MpA<=Si] | ~ [3<=MpA]]]]]]

abstracting: (3<=MpA)
states: 58,072 (4)
abstracting: (MpA<=Si)
states: 10,230,685 (7)
abstracting: (MpA<=MpA)
states: 12,462,173 (7)
abstracting: (3<=CF)
states: 4,179,280 (6)
abstracting: (3<=MwU)
states: 58,072 (4)
abstracting: (CG<=StR)
states: 4,353,751 (6)
-> the formula is FALSE

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

MC time: 0m 0.780sec

checking: AG [[CwA<=CwA | [[StF<=SpG | 3<=SR] | [SwA<=SpA & CF<=CwA]]]]
normalized: ~ [E [true U ~ [[CwA<=CwA | [[SwA<=SpA & CF<=CwA] | [StF<=SpG | 3<=SR]]]]]]

abstracting: (3<=SR)
states: 82,824 (4)
abstracting: (StF<=SpG)
states: 9,906,869 (6)
abstracting: (CF<=CwA)
states: 12,462,173 (7)
abstracting: (SwA<=SpA)
states: 4,875,889 (6)
abstracting: (CwA<=CwA)
states: 12,462,173 (7)
-> the formula is TRUE

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

MC time: 0m 0.076sec

checking: AG [[[~ [2<=CA] | [CwG<=Mi & 3<=CwG]] & [[MwU<=Si | Uf<=CG] | [Si<=SwA | SF<=Mi]]]]
normalized: ~ [E [true U ~ [[[[Si<=SwA | SF<=Mi] | [MwU<=Si | Uf<=CG]] & [[CwG<=Mi & 3<=CwG] | ~ [2<=CA]]]]]]

abstracting: (2<=CA)
states: 6,181,050 (6)
abstracting: (3<=CwG)
states: 11,044,998 (7)
abstracting: (CwG<=Mi)
states: 1,477,988 (6)
abstracting: (Uf<=CG)
states: 1,442,411 (6)
abstracting: (MwU<=Si)
states: 10,230,685 (7)
abstracting: (SF<=Mi)
states: 12,245,593 (7)
abstracting: (Si<=SwA)
states: 10,436,912 (7)
-> the formula is FALSE

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

MC time: 0m 1.359sec

totally nodes used: 1019357 (1.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5295664 4290780 9586444
used/not used/entry size/cache size: 4746262 62362602 16 1024MB
basic ops cache: hits/miss/sum: 2085179 1933806 4018985
used/not used/entry size/cache size: 2773905 14003311 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: 416172 287684 703856
used/not used/entry size/cache size: 282802 8105806 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 66153749
1 904344
2 44044
3 4633
4 1155
5 153
6 90
7 264
8 190
9 34
>= 10 208

Total processing time: 0m24.922sec


BK_STOP 1495816676533

--------------------
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:188 (10), effective:36 (2)

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

iterations count:273 (15), effective:54 (3)

iterations count:367 (20), effective:81 (4)

iterations count:919 (51), effective:192 (10)

iterations count:342 (19), effective:71 (3)

iterations count:259 (14), effective:56 (3)

iterations count:941 (52), effective:211 (11)

iterations count:462 (25), effective:103 (5)

iterations count:233 (12), effective:50 (2)

iterations count:249 (13), effective:50 (2)

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="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-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 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-149580906300169"
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 ;