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-2270
Executing tool marcie
Input is BridgeAndVehicles-COL-V04P05N02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r190su-smll-143330904400002
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433423672457

Model: BridgeAndVehicles-COL-V04P05N02
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

Unfolding complete |P|=28|T|=52|A|=311
Time for unfolding: 0m0sec

(NrP: 28 NrTr: 52 NrArc: 311)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m3sec


RS generation: 0m0sec


-> reachability set: #nodes 709 (7.1e+02) #states 864



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

checking: EG [SUR_PONT_B<=ATTENTE_A]
normalized: EG [SUR_PONT_B<=ATTENTE_A]

abstracting: (SUR_PONT_B<=ATTENTE_A) states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: A [AX [ROUTE_A<=SORTI_A] U AF [3<=CONTROLEUR]]
normalized: [~ [E [EX [~ [ROUTE_A<=SORTI_A]] U [EG [~ [3<=CONTROLEUR]] & EX [~ [ROUTE_A<=SORTI_A]]]]] & ~ [EG [EG [~ [3<=CONTROLEUR]]]]]


FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-1CANNOT_COMPUTE

MC time: 0m0sec

checking: [[[AG [2<=ATTENTE_B] | EG [SUR_PONT_A<=VIDANGE]] | ROUTE_B<=SUR_PONT_A] & E [~ [ROUTE_A<=CONTROLEUR] U [ATTENTE_B<=NB_ATTENTE_B | 3<=SORTI_B]]]
normalized: [[[EG [SUR_PONT_A<=VIDANGE] | ~ [E [true U ~ [2<=ATTENTE_B]]]] | ROUTE_B<=SUR_PONT_A] & E [~ [ROUTE_A<=CONTROLEUR] U [ATTENTE_B<=NB_ATTENTE_B | 3<=SORTI_B]]]


FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2CANNOT_COMPUTE

MC time: 0m0sec

checking: AF [AG [[3<=ROUTE_B & 1<=SORTI_A]]]
normalized: ~ [EG [E [true U ~ [[3<=ROUTE_B & 1<=SORTI_A]]]]]


FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-3CANNOT_COMPUTE

MC time: 0m0sec

checking: ~ [AF [[3<=CAPACITE & ~ [ATTENTE_B<=COMPTEUR]]]]
normalized: EG [~ [[~ [ATTENTE_B<=COMPTEUR] & 3<=CAPACITE]]]


FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-4CANNOT_COMPUTE

MC time: 0m0sec

checking: EX [[EF [3<=NB_ATTENTE_B] | [[COMPTEUR<=SUR_PONT_A | 2<=CHOIX] & ~ [1<=SUR_PONT_A]]]]
normalized: EX [[E [true U 3<=NB_ATTENTE_B] | [~ [1<=SUR_PONT_A] & [COMPTEUR<=SUR_PONT_A | 2<=CHOIX]]]]


FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-5CANNOT_COMPUTE

MC time: 0m0sec

checking: EG [EF [[ROUTE_A<=SUR_PONT_A & ATTENTE_A<=CAPACITE]]]
normalized: EG [E [true U [ROUTE_A<=SUR_PONT_A & ATTENTE_A<=CAPACITE]]]

abstracting: (ATTENTE_A<=CAPACITE) states: 0
abstracting: (ROUTE_A<=SUR_PONT_A) states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[1<=NB_ATTENTE_B & AG [SUR_PONT_B<=SUR_PONT_B]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [SUR_PONT_B<=SUR_PONT_B]]] & 1<=NB_ATTENTE_B]]]]


FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-7CANNOT_COMPUTE

MC time: 0m0sec

checking: ~ [~ [[EF [3<=NB_ATTENTE_B] & [[2<=COMPTEUR | 1<=NB_ATTENTE_B] & [VIDANGE<=COMPTEUR & SORTI_B<=ATTENTE_B]]]]]
normalized: [[[VIDANGE<=COMPTEUR & SORTI_B<=ATTENTE_B] & [2<=COMPTEUR | 1<=NB_ATTENTE_B]] & E [true U 3<=NB_ATTENTE_B]]


FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-8CANNOT_COMPUTE

MC time: 0m0sec

checking: AG [EG [[1<=NB_ATTENTE_B | 3<=CHOIX]]]
normalized: ~ [E [true U ~ [EG [[1<=NB_ATTENTE_B | 3<=CHOIX]]]]]


FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-9CANNOT_COMPUTE

MC time: 0m0sec

checking: ~ [[E [VIDANGE<=ROUTE_B U SORTI_A<=VIDANGE] & [AF [2<=NB_ATTENTE_A] | ~ [[1<=NB_ATTENTE_A | SUR_PONT_B<=CONTROLEUR]]]]]
normalized: ~ [[E [VIDANGE<=ROUTE_B U SORTI_A<=VIDANGE] & [~ [EG [~ [2<=NB_ATTENTE_A]]] | ~ [[1<=NB_ATTENTE_A | SUR_PONT_B<=CONTROLEUR]]]]]

abstracting: (SUR_PONT_B<=CONTROLEUR) states: 0

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-10CANNOT_COMPUTE

MC time: 0m0sec

checking: [~ [[EG [1<=ROUTE_A] | NB_ATTENTE_B<=SORTI_A]] | EG [EG [NB_ATTENTE_B<=ATTENTE_B]]]
normalized: [~ [[EG [1<=ROUTE_A] | NB_ATTENTE_B<=SORTI_A]] | EG [EG [NB_ATTENTE_B<=ATTENTE_B]]]

abstracting: (NB_ATTENTE_B<=ATTENTE_B) states: 0
.
EG iterations: 1
.
EG iterations: 1
abstracting: (NB_ATTENTE_B<=SORTI_A) states: 0

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-11CANNOT_COMPUTE

MC time: 0m0sec

checking: ~ [EG [EX [NB_ATTENTE_A<=ROUTE_A]]]
normalized: ~ [EG [EX [NB_ATTENTE_A<=ROUTE_A]]]

abstracting: (NB_ATTENTE_A<=ROUTE_A) states: 0
..
EG iterations: 1
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [AX [EG [ATTENTE_A<=CONTROLEUR]] | [E [SUR_PONT_B<=SUR_PONT_B U 3<=NB_ATTENTE_A] & AX [COMPTEUR<=COMPTEUR]]]
normalized: [~ [EX [~ [EG [ATTENTE_A<=CONTROLEUR]]]] | [~ [EX [~ [COMPTEUR<=COMPTEUR]]] & E [SUR_PONT_B<=SUR_PONT_B U 3<=NB_ATTENTE_A]]]


FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-13CANNOT_COMPUTE

MC time: 0m0sec

checking: [[AG [[SUR_PONT_B<=CONTROLEUR & NB_ATTENTE_A<=CHOIX]] & [EG [CAPACITE<=SORTI_A] | ~ [[3<=CHOIX & 1<=ROUTE_B]]]] | [ROUTE_B<=SORTI_B | E [1<=COMPTEUR U 2<=COMPTEUR]]]
normalized: [[E [1<=COMPTEUR U 2<=COMPTEUR] | ROUTE_B<=SORTI_B] | [[~ [[3<=CHOIX & 1<=ROUTE_B]] | EG [CAPACITE<=SORTI_A]] & ~ [E [true U ~ [[SUR_PONT_B<=CONTROLEUR & NB_ATTENTE_A<=CHOIX]]]]]]

abstracting: (NB_ATTENTE_A<=CHOIX) states: 0
abstracting: (SUR_PONT_B<=CONTROLEUR) states: 0
abstracting: (CAPACITE<=SORTI_A) states: 0
.
EG iterations: 1

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-14CANNOT_COMPUTE

MC time: 0m0sec

checking: [AG [VIDANGE<=CAPACITE] & VIDANGE<=COMPTEUR]
normalized: [~ [E [true U ~ [VIDANGE<=CAPACITE]]] & VIDANGE<=COMPTEUR]

abstracting: (VIDANGE<=COMPTEUR) states: 0
abstracting: (VIDANGE<=CAPACITE) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m5sec


BK_STOP 1433423678305

--------------------
content from stderr:

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: 0m0sec

709
iterations count:1013 (19), effective:53 (1)

initing FirstDep: 0m0sec

Unknown names:
CONTROLEUR
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
SORTI_B
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
SORTI_A
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
CAPACITE
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
CHOIX
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
NB_ATTENTE_B
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
NB_ATTENTE_B
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
CHOIX
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
NB_ATTENTE_A
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
ROUTE_A
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
NB_ATTENTE_A
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula


iterations count:52 (1), effective:0 (0)
Unknown names:
ROUTE_B
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula


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

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="BridgeAndVehicles-COL-V04P05N02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/BridgeAndVehicles-COL-V04P05N02.tgz
mv BridgeAndVehicles-COL-V04P05N02 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is BridgeAndVehicles-COL-V04P05N02, 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 r190su-smll-143330904400002"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 ;