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-V10P10N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r190su-smll-143330904400015
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433423770938

Model: BridgeAndVehicles-COL-V10P10N10
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|=48|T|=288|A|=1977
Time for unfolding: 0m0sec

(NrP: 48 NrTr: 288 NrArc: 1977)

net check time: 0m0sec

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

init dd package: 0m3sec


RS generation: 0m1sec


-> reachability set: #nodes 63317 (6.3e+04) #states 61,184 (4)



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

checking: [AF [[~ [SUR_PONT_B<=SORTI_A] & CAPACITE<=ATTENTE_B]] | [~ [ROUTE_B<=ATTENTE_A] & A [2<=ROUTE_B U 3<=COMPTEUR]]]
normalized: [~ [EG [~ [[CAPACITE<=ATTENTE_B & ~ [SUR_PONT_B<=SORTI_A]]]]] | [~ [ROUTE_B<=ATTENTE_A] & [~ [E [~ [2<=ROUTE_B] U [~ [2<=ROUTE_B] & ~ [3<=COMPTEUR]]]] & ~ [EG [~ [3<=COMPTEUR]]]]]]


FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-0CANNOT_COMPUTE

MC time: 0m0sec

checking: [EG [[[2<=SUR_PONT_A & 3<=ROUTE_A] | CONTROLEUR<=ROUTE_B]] | ~ [SORTI_B<=ROUTE_B]]
normalized: [~ [SORTI_B<=ROUTE_B] | EG [[CONTROLEUR<=ROUTE_B | [2<=SUR_PONT_A & 3<=ROUTE_A]]]]


FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-1CANNOT_COMPUTE

MC time: 0m0sec

checking: [E [ATTENTE_A<=ROUTE_B U [3<=SORTI_A & 3<=SORTI_B]] & ATTENTE_A<=VIDANGE]
normalized: [ATTENTE_A<=VIDANGE & E [ATTENTE_A<=ROUTE_B U [3<=SORTI_A & 3<=SORTI_B]]]


FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2CANNOT_COMPUTE

MC time: 0m0sec

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


FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-3CANNOT_COMPUTE

MC time: 0m0sec

checking: ~ [AG [[SUR_PONT_A<=ROUTE_A | ~ [2<=VIDANGE]]]]
normalized: E [true U ~ [[SUR_PONT_A<=ROUTE_A | ~ [2<=VIDANGE]]]]


FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-4CANNOT_COMPUTE

MC time: 0m0sec

checking: ~ [[EG [[1<=CHOIX & SORTI_B<=CAPACITE]] | [EG [SORTI_B<=ROUTE_A] | 1<=SORTI_B]]]
normalized: ~ [[[1<=SORTI_B | EG [SORTI_B<=ROUTE_A]] | EG [[1<=CHOIX & SORTI_B<=CAPACITE]]]]

abstracting: (SORTI_B<=CAPACITE) states: 0

FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-5CANNOT_COMPUTE

MC time: 0m0sec

checking: ~ [EF [AG [ROUTE_B<=SORTI_B]]]
normalized: ~ [E [true U ~ [E [true U ~ [ROUTE_B<=SORTI_B]]]]]

abstracting: (ROUTE_B<=SORTI_B) states: 0
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [[2<=SORTI_B | AF [2<=SUR_PONT_B]]]
normalized: EG [[2<=SORTI_B | ~ [EG [~ [2<=SUR_PONT_B]]]]]


FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-7CANNOT_COMPUTE

MC time: 0m0sec

checking: A [~ [~ [COMPTEUR<=SUR_PONT_B]] U AF [ROUTE_B<=SORTI_A]]
normalized: [~ [E [~ [COMPTEUR<=SUR_PONT_B] U [~ [COMPTEUR<=SUR_PONT_B] & EG [~ [ROUTE_B<=SORTI_A]]]]] & ~ [EG [EG [~ [ROUTE_B<=SORTI_A]]]]]

abstracting: (ROUTE_B<=SORTI_A) states: 0

EG iterations: 0

EG iterations: 0
abstracting: (ROUTE_B<=SORTI_A) states: 0

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

FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [EF [[[SORTI_A<=SUR_PONT_A & SORTI_A<=NB_ATTENTE_B] & [3<=VIDANGE & 1<=ROUTE_B]]]]
normalized: ~ [E [true U [[SORTI_A<=SUR_PONT_A & SORTI_A<=NB_ATTENTE_B] & [3<=VIDANGE & 1<=ROUTE_B]]]]


FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-9CANNOT_COMPUTE

MC time: 0m0sec

checking: A [[VIDANGE<=COMPTEUR | [SORTI_B<=NB_ATTENTE_A | 3<=SORTI_B]] U 2<=SUR_PONT_A]
normalized: [~ [E [~ [[VIDANGE<=COMPTEUR | [SORTI_B<=NB_ATTENTE_A | 3<=SORTI_B]]] U [~ [2<=SUR_PONT_A] & ~ [[VIDANGE<=COMPTEUR | [SORTI_B<=NB_ATTENTE_A | 3<=SORTI_B]]]]]] & ~ [EG [~ [2<=SUR_PONT_A]]]]


FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-10CANNOT_COMPUTE

MC time: 0m0sec

checking: AX [EG [[SORTI_A<=SUR_PONT_A | VIDANGE<=SUR_PONT_A]]]
normalized: ~ [EX [~ [EG [[SORTI_A<=SUR_PONT_A | VIDANGE<=SUR_PONT_A]]]]]

abstracting: (VIDANGE<=SUR_PONT_A) states: 0
abstracting: (SORTI_A<=SUR_PONT_A) states: 0
.
EG iterations: 1
.-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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


FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-12CANNOT_COMPUTE

MC time: 0m0sec

checking: EG [EF [[3<=SORTI_A & 2<=NB_ATTENTE_A]]]
normalized: EG [E [true U [3<=SORTI_A & 2<=NB_ATTENTE_A]]]


FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-13CANNOT_COMPUTE

MC time: 0m0sec

checking: [E [[2<=SORTI_B | ATTENTE_B<=ATTENTE_A] U CAPACITE<=COMPTEUR] | ROUTE_B<=NB_ATTENTE_B]
normalized: [ROUTE_B<=NB_ATTENTE_B | E [[2<=SORTI_B | ATTENTE_B<=ATTENTE_A] U CAPACITE<=COMPTEUR]]

abstracting: (CAPACITE<=COMPTEUR) states: 0
abstracting: (ATTENTE_B<=ATTENTE_A) states: 0

FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-14CANNOT_COMPUTE

MC time: 0m0sec

checking: [~ [[~ [[CAPACITE<=ATTENTE_A | NB_ATTENTE_A<=CONTROLEUR]] | 2<=ROUTE_B]] | AF [EX [NB_ATTENTE_A<=SUR_PONT_B]]]
normalized: [~ [[2<=ROUTE_B | ~ [[CAPACITE<=ATTENTE_A | NB_ATTENTE_A<=CONTROLEUR]]]] | ~ [EG [~ [EX [NB_ATTENTE_A<=SUR_PONT_B]]]]]

abstracting: (NB_ATTENTE_A<=SUR_PONT_B) states: 0
.
EG iterations: 0
abstracting: (NB_ATTENTE_A<=CONTROLEUR) states: 0
abstracting: (CAPACITE<=ATTENTE_A) states: 0

FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-15CANNOT_COMPUTE

MC time: 0m0sec


Total processing time: 0m11sec


BK_STOP 1433423782347

--------------------
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

2713 5278 7288 9072 9842 9918 10029 10149 10376 10402 10429 10473 17191 17326 17413 17440 17462 20462 19895 18854 18895 18904 18948 20926 19910 19937 19959 19982 21810 20848 20874 20919 20924 22496 21672 21698 21743 21743 23064 22378 22404 22449 22449 23514 22970 22992 23019 23042 23816 23440 23467 23489 23536 24018 23796 23837 23846 23890 24135
iterations count:59908 (208), effective:1138 (3)

initing FirstDep: 0m0sec

Unknown names:
COMPTEUR
/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:
SORTI_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:
VIDANGE
/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


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


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

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

Unknown names:
ROUTE_B
/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:
SORTI_B
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

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

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-V10P10N10"
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-V10P10N10.tgz
mv BridgeAndVehicles-COL-V10P10N10 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-V10P10N10, 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-143330904400015"
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 ;