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

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

=== Now, execution of the tool begins

BK_START 1495816688487

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_N0005P1
(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.291sec

parse successfull
net created successfully

Net: ClientsAndServers_PT_N0005P1
(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.841sec


RS generation: 3m 3.546sec


-> reachability set: #nodes 545079 (5.5e+05) #states 211,714,654,767 (11)



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

checking: EF [EG [~ [1<=Cb]]]
normalized: E [true U EG [~ [1<=Cb]]]

abstracting: (1<=Cb)
states: 180,492,554,396 (11)
.....................................................................................................................................MC time: 3m33.052sec

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

abstracting: (3<=CA)
states: 142,069,347,387 (11)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m18.339sec

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

abstracting: (3<=SF)
states: 15,057,985,374 (10)
.-> the formula is TRUE

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

MC time: 0m28.207sec

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

abstracting: (2<=StF)
states: 38,875,393,935 (10)
.
EG iterations: 1
..............................................................................
EG iterations: 78
-> the formula is TRUE

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

MC time: 0m17.209sec

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

abstracting: (3<=CwG)
states: 210,718,206,644 (11)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m11.846sec

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

abstracting: (SpG<=SA)
states: 147,268,347,779 (11)
.........................................................................................
EG iterations: 89
..............................................................................................................................................
EG iterations: 142
-> the formula is TRUE

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

MC time: 3m55.297sec

checking: AF [AF [~ [MpA<=MwU]]]
normalized: ~ [EG [EG [MpA<=MwU]]]

abstracting: (MpA<=MwU)
states: 144,462,474,323 (11)
..................................................................................
EG iterations: 82
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 1m28.476sec

checking: ~ [EG [EG [SwA<=MwU]]]
normalized: ~ [EG [EG [SwA<=MwU]]]

abstracting: (SwA<=MwU)
states: 46,324,494,431 (10)
..............................................................
EG iterations: 62
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 7.236sec

checking: AF [[AG [SA<=MtF] & AX [2<=CA]]]
normalized: ~ [EG [~ [[~ [EX [~ [2<=CA]]] & ~ [E [true U ~ [SA<=MtF]]]]]]]

abstracting: (SA<=MtF)
states: 143,374,068,449 (11)
abstracting: (2<=CA)
states: 163,490,881,521 (11)

before gc: list nodes free: 2226114

after gc: idd nodes used:2805944, unused:61194056; list nodes free:512497559
..................................................................................
EG iterations: 81
-> the formula is FALSE

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

MC time: 1m16.334sec

checking: [~ [~ [AF [1<=MpG]]] & AX [~ [~ [MtF<=StF]]]]
normalized: [~ [EX [~ [MtF<=StF]]] & ~ [EG [~ [1<=MpG]]]]

abstracting: (1<=MpG)
states: 93,508,716,980 (10)
....................................................................................................................................................................MC time: 5m39.255sec

checking: EG [AF [[1<=SA & CA<=Si]]]
normalized: EG [~ [EG [~ [[1<=SA & CA<=Si]]]]]

abstracting: (CA<=Si)
states: 44,969,134,485 (10)
abstracting: (1<=SA)
states: 96,784,631,615 (10)
..............................................................................................................................................MC time: 4m57.276sec

checking: [EX [AG [CA<=MwU]] & AF [EX [1<=Mi]]]
normalized: [~ [EG [~ [EX [1<=Mi]]]] & EX [~ [E [true U ~ [CA<=MwU]]]]]

abstracting: (CA<=MwU)
states: 42,435,074,167 (10)
.abstracting: (1<=Mi)
states: 211,714,654,767 (11)
..
EG iterations: 1
-> the formula is FALSE

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

MC time: 1m24.619sec

checking: ~ [EF [[~ [SG<=Uf] & CwG<=CG]]]
normalized: ~ [E [true U [CwG<=CG & ~ [SG<=Uf]]]]

abstracting: (SG<=Uf)
states: 204,707,859,961 (11)
abstracting: (CwG<=CG)
states: 332,693,460 (8)
-> the formula is TRUE

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

MC time: 0m 3.687sec

checking: EF [[AF [CwG<=CF] & ~ [~ [Mi<=CR]]]]
normalized: E [true U [Mi<=CR & ~ [EG [~ [CwG<=CF]]]]]

abstracting: (CwG<=CF)
states: 27,404,285,733 (10)
.................................................................
EG iterations: 65
abstracting: (Mi<=CR)
states: 53,586,307,450 (10)
-> the formula is TRUE

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

MC time: 1m55.845sec

checking: [EG [[~ [3<=CA] | [2<=SpA & 2<=CwA]]] & EF [EG [MpA<=MwU]]]
normalized: [E [true U EG [MpA<=MwU]] & EG [[[2<=SpA & 2<=CwA] | ~ [3<=CA]]]]

abstracting: (3<=CA)
states: 142,069,347,387 (11)
abstracting: (2<=CwA)
states: 211,438,244,061 (11)
abstracting: (2<=SpA)
states: 41,647,071,915 (10)
.
EG iterations: 1
abstracting: (MpA<=MwU)
states: 144,462,474,323 (11)
..................................................................................
EG iterations: 82

BK_TIME_CONFINEMENT_REACHED

--------------------
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:4822 (267), effective:1040 (57)

initing FirstDep: 0m 0.001sec


net_ddint.h:596: Timeout: after 212 sec


iterations count:664 (36), effective:187 (10)

iterations count:163 (9), effective:27 (1)

net_ddint.h:596: Timeout: after 338 sec


net_ddint.h:596: Timeout: after 296 sec


iterations count:445 (24), effective:94 (5)

iterations count:1441 (80), effective:360 (20)

iterations count:312 (17), effective:58 (3)

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