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

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

=== Now, execution of the tool begins

BK_START 1495816616740

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_N0002P0
(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.344sec

parse successfull
net created successfully

Net: ClientsAndServers_PT_N0002P0
(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.403sec


RS generation: 0m 1.980sec


-> reachability set: #nodes 17697 (1.8e+04) #states 7,081,638 (6)



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

checking: AG [AF [~ [1<=SA]]]
normalized: ~ [E [true U EG [1<=SA]]]

abstracting: (1<=SA)
states: 1,899,571 (6)
................................
EG iterations: 32
-> the formula is FALSE

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

MC time: 0m 0.750sec

checking: AF [AG [~ [1<=Ci]]]
normalized: ~ [EG [E [true U 1<=Ci]]]

abstracting: (1<=Ci)
states: 5,643,787 (6)
.................................
EG iterations: 33
-> the formula is FALSE

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

MC time: 0m 0.207sec

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

abstracting: (3<=SpG)
states: 31,164 (4)
.-> the formula is FALSE

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

MC time: 0m 0.410sec

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

abstracting: (3<=SA)
states: 59,166 (4)
-> the formula is TRUE

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

MC time: 0m 0.152sec

checking: ~ [~ [~ [AF [3<=CF]]]]
normalized: EG [~ [3<=CF]]

abstracting: (3<=CF)
states: 1,511,349 (6)
............................
EG iterations: 28
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P0-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.294sec

checking: ~ [AF [EG [StF<=Ci]]]
normalized: EG [~ [EG [StF<=Ci]]]

abstracting: (StF<=Ci)
states: 6,728,802 (6)
.
EG iterations: 1
......................
EG iterations: 22
-> the formula is FALSE

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

MC time: 0m 0.410sec

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

abstracting: (3<=StR)
states: 61,191 (4)
............................
EG iterations: 28
abstracting: (1<=Uf)
states: 5,586,990 (6)
-> the formula is TRUE

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

MC time: 0m 0.184sec

checking: AX [AF [[2<=MtF & StF<=SpG]]]
normalized: ~ [EX [EG [~ [[2<=MtF & StF<=SpG]]]]]

abstracting: (StF<=SpG)
states: 5,776,402 (6)
abstracting: (2<=MtF)
states: 261,870 (5)
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.070sec

checking: EF [E [CwA<=StR U 3<=SpA]]
normalized: E [true U E [CwA<=StR U 3<=SpA]]

abstracting: (3<=SpA)
states: 59,166 (4)
abstracting: (CwA<=StR)
states: 204,597 (5)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P0-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.304sec

checking: A [3<=Uf U [~ [SpG<=CA] & ~ [2<=MpA]]]
normalized: [~ [EG [~ [[~ [2<=MpA] & ~ [SpG<=CA]]]]] & ~ [E [~ [[~ [2<=MpA] & ~ [SpG<=CA]]] U [~ [3<=Uf] & ~ [[~ [2<=MpA] & ~ [SpG<=CA]]]]]]]

abstracting: (SpG<=CA)
states: 6,728,802 (6)
abstracting: (2<=MpA)
states: 402,021 (5)
abstracting: (3<=Uf)
states: 2,822,484 (6)
abstracting: (SpG<=CA)
states: 6,728,802 (6)
abstracting: (2<=MpA)
states: 402,021 (5)
abstracting: (SpG<=CA)
states: 6,728,802 (6)
abstracting: (2<=MpA)
states: 402,021 (5)
......................................
EG iterations: 38
-> the formula is TRUE

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

MC time: 0m 0.880sec

checking: ~ [A [[1<=CR | MpA<=SwG] U [1<=Cb & 2<=Si]]]
normalized: ~ [[~ [E [~ [[1<=Cb & 2<=Si]] U [~ [[1<=Cb & 2<=Si]] & ~ [[1<=CR | MpA<=SwG]]]]] & ~ [EG [~ [[1<=Cb & 2<=Si]]]]]]

abstracting: (2<=Si)
states: 617,211 (5)
abstracting: (1<=Cb)
states: 4,510,948 (6)
.
EG iterations: 1
abstracting: (MpA<=SwG)
states: 6,212,744 (6)
abstracting: (1<=CR)
states: 5,643,787 (6)
abstracting: (2<=Si)
states: 617,211 (5)
abstracting: (1<=Cb)
states: 4,510,948 (6)
abstracting: (2<=Si)
states: 617,211 (5)
abstracting: (1<=Cb)
states: 4,510,948 (6)
-> the formula is TRUE

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

MC time: 0m 1.235sec

checking: [[MwU<=MwU & ~ [SA<=StF]] | ~ [~ [AF [2<=MpG]]]]
normalized: [~ [EG [~ [2<=MpG]]] | [MwU<=MwU & ~ [SA<=StF]]]

abstracting: (SA<=StF)
states: 5,469,131 (6)
abstracting: (MwU<=MwU)
states: 7,081,638 (6)
abstracting: (2<=MpG)
states: 261,870 (5)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.077sec

checking: AG [[[3<=StF | StR<=Si] | AF [Mi<=SpG]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [Mi<=SpG]]] | [3<=StF | StR<=Si]]]]]

abstracting: (StR<=Si)
states: 5,612,072 (6)
abstracting: (3<=StF)
states: 31,164 (4)
abstracting: (Mi<=SpG)
states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.254sec

checking: EG [[[~ [2<=SwA] & [MpA<=SF | SwA<=SF]] | [1<=MwU | ~ [1<=MpG]]]]
normalized: EG [[[[MpA<=SF | SwA<=SF] & ~ [2<=SwA]] | [1<=MwU | ~ [1<=MpG]]]]

abstracting: (1<=MpG)
states: 1,537,888 (6)
abstracting: (1<=MwU)
states: 1,906,321 (6)
abstracting: (2<=SwA)
states: 2,459,567 (6)
abstracting: (SwA<=SF)
states: 2,765,445 (6)
abstracting: (MpA<=SF)
states: 5,469,131 (6)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.049sec

checking: E [[[Uf<=Si | 3<=Uf] | [MpG<=MpG & 2<=SG]] U AF [3<=MtF]]
normalized: E [[[MpG<=MpG & 2<=SG] | [Uf<=Si | 3<=Uf]] U ~ [EG [~ [3<=MtF]]]]

abstracting: (3<=MtF)
states: 31,164 (4)
.
EG iterations: 1
abstracting: (3<=Uf)
states: 2,822,484 (6)
abstracting: (Uf<=Si)
states: 2,087,718 (6)
abstracting: (2<=SG)
states: 261,870 (5)
abstracting: (MpG<=MpG)
states: 7,081,638 (6)
-> the formula is TRUE

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

MC time: 0m 0.165sec

checking: [EF [~ [SF<=SF]] | [[CwG<=Ci & Uf<=Si] & ~ [[[Ci<=SA | SF<=SF] | [3<=Ci | SwA<=CR]]]]]
normalized: [[~ [[[Ci<=SA | SF<=SF] | [3<=Ci | SwA<=CR]]] & [CwG<=Ci & Uf<=Si]] | E [true U ~ [SF<=SF]]]

abstracting: (SF<=SF)
states: 7,081,638 (6)
abstracting: (Uf<=Si)
states: 2,087,718 (6)
abstracting: (CwG<=Ci)
states: 1,911,996 (6)
abstracting: (SwA<=CR)
states: 5,470,846 (6)
abstracting: (3<=Ci)
states: 3,278,712 (6)
abstracting: (SF<=SF)
states: 7,081,638 (6)
abstracting: (Ci<=SA)
states: 1,860,398 (6)
-> the formula is FALSE

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

MC time: 0m 0.230sec

totally nodes used: 993423 (9.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4174366 3522652 7697018
used/not used/entry size/cache size: 4163410 62945454 16 1024MB
basic ops cache: hits/miss/sum: 937777 1042370 1980147
used/not used/entry size/cache size: 1639772 15137444 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: 159035 130938 289973
used/not used/entry size/cache size: 129902 8258706 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 66192092
1 871689
2 37787
3 3624
4 966
5 343
6 266
7 277
8 197
9 222
>= 10 1401

Total processing time: 0m21.570sec


BK_STOP 1495816638574

--------------------
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:2022 (112), effective:438 (24)

initing FirstDep: 0m 0.000sec


iterations count:115 (6), effective:20 (1)

iterations count:93 (5), effective:17 (0)

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

iterations count:297 (16), effective:58 (3)

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

iterations count:369 (20), effective:75 (4)

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

iterations count:287 (15), effective:57 (3)

iterations count:326 (18), effective:70 (3)

iterations count:967 (53), effective:197 (10)

iterations count:152 (8), effective:30 (1)

iterations count:463 (25), effective:100 (5)

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-N0002P0"
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-N0002P0.tgz
mv ClientsAndServers-PT-N0002P0 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-N0002P0, 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-149580906300156"
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 ;