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-PT-V04P05N02, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r190su-smll-143330904700268
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433548965330

Model: BridgeAndVehicles-PT-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=ReachabilityBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 28 NrTr: 52 NrArc: 326)

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 2204 (2.2e+03) #states 2,874 (3)



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

checking: sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=1
normalized: sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=1

abstracting: (2<=1) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: [maxVal(ATTENTE_B)<=3 & sum(maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=1]
normalized: [maxVal(ATTENTE_B)<=3 & sum(maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=1]

abstracting: (5<=1) states: 0
abstracting: (4<=3) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityBounds-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=2 & [[[[sum(maxVal(NB_ATTENTE_A_4), maxVal(NB_ATTENTE_A_3), maxVal(NB_ATTENTE_A_2), maxVal(NB_ATTENTE_A_1), maxVal(NB_ATTENTE_A_0))<=1 & maxVal(ATTENTE_B)<=3] & maxVal(SORTI_A)<=1] & [sum(maxVal(NB_ATTENTE_A_4), maxVal(NB_ATTENTE_A_3), maxVal(NB_ATTENTE_A_2), maxVal(NB_ATTENTE_A_1), maxVal(NB_ATTENTE_A_0))<=1 & sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=1]] & maxVal(SORTI_B)<=3]] & maxVal(ATTENTE_B)<=3]
normalized: [maxVal(ATTENTE_B)<=3 & [sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=2 & [maxVal(SORTI_B)<=3 & [[sum(maxVal(NB_ATTENTE_A_4), maxVal(NB_ATTENTE_A_3), maxVal(NB_ATTENTE_A_2), maxVal(NB_ATTENTE_A_1), maxVal(NB_ATTENTE_A_0))<=1 & sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=1] & [maxVal(SORTI_A)<=1 & [sum(maxVal(NB_ATTENTE_A_4), maxVal(NB_ATTENTE_A_3), maxVal(NB_ATTENTE_A_2), maxVal(NB_ATTENTE_A_1), maxVal(NB_ATTENTE_A_0))<=1 & maxVal(ATTENTE_B)<=3]]]]]]

abstracting: (4<=3) states: 0
abstracting: (5<=1) states: 0
abstracting: (4<=1) states: 0
abstracting: (2<=1) states: 0
abstracting: (5<=1) states: 0
abstracting: (4<=3) states: 0
abstracting: (2<=2) states: 2,874 (3)
abstracting: (4<=3) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityBounds-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(SUR_PONT_A)<=2 & maxVal(ATTENTE_A)<=2]
normalized: [maxVal(SUR_PONT_A)<=2 & maxVal(ATTENTE_A)<=2]

abstracting: (4<=2) states: 0
abstracting: (2<=2) states: 2,874 (3)
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityBounds-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(CONTROLEUR_2), maxVal(CONTROLEUR_1))<=3
normalized: sum(maxVal(CONTROLEUR_2), maxVal(CONTROLEUR_1))<=3

abstracting: (2<=3) states: 2,874 (3)
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityBounds-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(SORTI_A)<=1
normalized: maxVal(SORTI_A)<=1

abstracting: (4<=1) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityBounds-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(ATTENTE_B)<=1
normalized: maxVal(ATTENTE_B)<=1

abstracting: (4<=1) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=3
normalized: sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=3

abstracting: (2<=3) states: 2,874 (3)
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityBounds-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(ATTENTE_B)<=2
normalized: maxVal(ATTENTE_B)<=2

abstracting: (4<=2) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityBounds-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(ATTENTE_A)<=1
normalized: maxVal(ATTENTE_A)<=1

abstracting: (4<=1) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityBounds-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [sum(maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=3 & maxVal(ATTENTE_A)<=2]
normalized: [sum(maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=3 & maxVal(ATTENTE_A)<=2]

abstracting: (4<=2) states: 0
abstracting: (5<=3) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityBounds-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(ATTENTE_B)<=1 & [[maxVal(ROUTE_A)<=1 & [[maxVal(ATTENTE_A)<=3 & maxVal(SUR_PONT_B)<=1] & [sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=3 & maxVal(ATTENTE_B)<=2]]] & [maxVal(ATTENTE_B)<=2 & [[maxVal(SUR_PONT_B)<=1 & maxVal(SORTI_B)<=2] & maxVal(SUR_PONT_A)<=3]]]] & [maxVal(SUR_PONT_A)<=1 & sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))<=3]]
normalized: [[maxVal(SUR_PONT_A)<=1 & sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))<=3] & [[[maxVal(ATTENTE_B)<=2 & [maxVal(SUR_PONT_A)<=3 & [maxVal(SUR_PONT_B)<=1 & maxVal(SORTI_B)<=2]]] & [maxVal(ROUTE_A)<=1 & [[sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=3 & maxVal(ATTENTE_B)<=2] & [maxVal(ATTENTE_A)<=3 & maxVal(SUR_PONT_B)<=1]]]] & maxVal(ATTENTE_B)<=1]]

abstracting: (4<=1) states: 0
abstracting: (2<=1) states: 0
abstracting: (4<=3) states: 0
abstracting: (4<=2) states: 0
abstracting: (2<=3) states: 2,874 (3)
abstracting: (4<=1) states: 0
abstracting: (4<=2) states: 0
abstracting: (2<=1) states: 0
abstracting: (2<=3) states: 2,874 (3)
abstracting: (4<=2) states: 0
abstracting: (2<=3) states: 2,874 (3)
abstracting: (2<=1) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityBounds-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=2 & maxVal(SUR_PONT_A)<=3]
normalized: [sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=2 & maxVal(SUR_PONT_A)<=3]

abstracting: (2<=3) states: 2,874 (3)
abstracting: (2<=2) states: 2,874 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: [sum(maxVal(COMPTEUR_2), maxVal(COMPTEUR_1), maxVal(COMPTEUR_0))<=2 & sum(maxVal(CONTROLEUR_2), maxVal(CONTROLEUR_1))<=1]
normalized: [sum(maxVal(COMPTEUR_2), maxVal(COMPTEUR_1), maxVal(COMPTEUR_0))<=2 & sum(maxVal(CONTROLEUR_2), maxVal(CONTROLEUR_1))<=1]

abstracting: (2<=1) states: 0
abstracting: (3<=2) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityBounds-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(ATTENTE_B)<=2 & [maxVal(ROUTE_B)<=3 & [[[maxVal(ATTENTE_A)<=1 & maxVal(SORTI_A)<=3] & [maxVal(ROUTE_B)<=2 & maxVal(ROUTE_B)<=1]] & sum(maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=3]]] & sum(maxVal(NB_ATTENTE_A_4), maxVal(NB_ATTENTE_A_3), maxVal(NB_ATTENTE_A_2), maxVal(NB_ATTENTE_A_1), maxVal(NB_ATTENTE_A_0))<=1]
normalized: [[maxVal(ATTENTE_B)<=2 & [maxVal(ROUTE_B)<=3 & [sum(maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=3 & [[maxVal(ATTENTE_A)<=1 & maxVal(SORTI_A)<=3] & [maxVal(ROUTE_B)<=2 & maxVal(ROUTE_B)<=1]]]]] & sum(maxVal(NB_ATTENTE_A_4), maxVal(NB_ATTENTE_A_3), maxVal(NB_ATTENTE_A_2), maxVal(NB_ATTENTE_A_1), maxVal(NB_ATTENTE_A_0))<=1]

abstracting: (5<=1) states: 0
abstracting: (4<=1) states: 0
abstracting: (4<=2) states: 0
abstracting: (4<=3) states: 0
abstracting: (4<=1) states: 0
abstracting: (5<=3) states: 0
abstracting: (4<=3) states: 0
abstracting: (4<=2) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityBounds-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [sum(maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=2 & maxVal(SUR_PONT_A)<=3]
normalized: [sum(maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=2 & maxVal(SUR_PONT_A)<=3]

abstracting: (2<=3) states: 2,874 (3)
abstracting: (5<=2) states: 0
-> the formula is FALSE

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

MC time: 0m0sec


Total processing time: 0m4sec


BK_STOP 1433548970059

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

928 1756
iterations count:2592 (49), effective:176 (3)

initing FirstDep: 0m0sec

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-PT-V04P05N02"
export BK_EXAMINATION="ReachabilityBounds"
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-PT-V04P05N02.tgz
mv BridgeAndVehicles-PT-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-PT-V04P05N02, examination is ReachabilityBounds"
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-143330904700268"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityBounds" != "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 "ReachabilityBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityBounds.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 '' ReachabilityBounds.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 ;