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-3254
Executing tool marcie
Input is BridgeAndVehicles-COL-V50P20N20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r001-csrt-149436061400340
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494455901143

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=ReachabilityCardinality.xml --memory=6

parse successfull
net created successfully

Unfolding complete |P|=138|T|=2348|A|=18090
Time for unfolding: 0m 1.135sec

Net: BridgeAndVehicles_COL_V50P20N20
(NrP: 138 NrTr: 2348 NrArc: 18090)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.052sec

net check time: 0m 0.002sec

init dd package: 0m 1.244sec

parse successfull
net created successfully

Unfolding complete |P|=138|T|=2348|A|=18090
Time for unfolding: 0m 1.024sec

Net: BridgeAndVehicles_COL_V50P20N20
(NrP: 138 NrTr: 2348 NrArc: 18090)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.052sec

net check time: 0m 0.002sec

init dd package: 0m 4.104sec


before gc: list nodes free: 1990284

after gc: idd nodes used:1824558, unused:62175442; list nodes free:317010487

RS generation: 52m18.783sec


-> reachability set: #nodes 8798112 (8.8e+06) #states 896,290,210 (8)



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

checking: AG [2<=CAPACITE_dot]
normalized: ~ [E [true U ~ [2<=CAPACITE_dot]]]

abstracting: (2<=CAPACITE_dot)
states: 888,429,298 (8)
MC time: 0m28.002sec

checking: EF [~ [sum(CHOIX_sens2, CHOIX_sens1)<=CAPACITE_dot]]
normalized: E [true U ~ [sum(CHOIX_sens2, CHOIX_sens1)<=CAPACITE_dot]]

abstracting: (sum(CHOIX_sens2, CHOIX_sens1)<=CAPACITE_dot)
states: 895,021,126 (8)
MC time: 0m26.000sec

checking: AG [~ [[[2<=SORTI_A_dot | ROUTE_B_dot<=SORTI_B_dot] & SORTI_A_dot<=SUR_PONT_A_dot]]]
normalized: ~ [E [true U [SORTI_A_dot<=SUR_PONT_A_dot & [2<=SORTI_A_dot | ROUTE_B_dot<=SORTI_B_dot]]]]

abstracting: (ROUTE_B_dot<=SORTI_B_dot)
states: 522,777,603 (8)
abstracting: (2<=SORTI_A_dot)
states: 868,288,471 (8)
abstracting: (SORTI_A_dot<=SUR_PONT_A_dot)
states: 82,523,178 (7)

before gc: list nodes free: 1914087

after gc: idd nodes used:29955622, unused:34044378; list nodes free:179997039
MC time: 3m22.274sec

checking: AG [~ [[[2<=sum(VIDANGE_sens2, VIDANGE_sens1) & SUR_PONT_A_dot<=sum(VIDANGE_sens2, VIDANGE_sens1)] & 2<=ATTENTE_A_dot]]]
normalized: ~ [E [true U [2<=ATTENTE_A_dot & [2<=sum(VIDANGE_sens2, VIDANGE_sens1) & SUR_PONT_A_dot<=sum(VIDANGE_sens2, VIDANGE_sens1)]]]]

abstracting: (SUR_PONT_A_dot<=sum(VIDANGE_sens2, VIDANGE_sens1))
states: 497,962,027 (8)
abstracting: (2<=sum(VIDANGE_sens2, VIDANGE_sens1))
MC time: 0m20.604sec

checking: AG [~ [[SUR_PONT_B_dot<=sum(VIDANGE_sens2, VIDANGE_sens1) & ~ [sum(VIDANGE_sens2, VIDANGE_sens1)<=CAPACITE_dot]]]]
normalized: ~ [E [true U [SUR_PONT_B_dot<=sum(VIDANGE_sens2, VIDANGE_sens1) & ~ [sum(VIDANGE_sens2, VIDANGE_sens1)<=CAPACITE_dot]]]]

abstracting: (sum(VIDANGE_sens2, VIDANGE_sens1)<=CAPACITE_dot)
states: 895,021,126 (8)
abstracting: (SUR_PONT_B_dot<=sum(VIDANGE_sens2, VIDANGE_sens1))
MC time: 0m16.965sec

checking: AG [~ [[~ [1<=CAPACITE_dot] | [ROUTE_A_dot<=sum(VIDANGE_sens2, VIDANGE_sens1) & sum(CONTROLEUR_sens2, CONTROLEUR_sens1)<=SUR_PONT_B_dot]]]]
normalized: ~ [E [true U [~ [1<=CAPACITE_dot] | [ROUTE_A_dot<=sum(VIDANGE_sens2, VIDANGE_sens1) & sum(CONTROLEUR_sens2, CONTROLEUR_sens1)<=SUR_PONT_B_dot]]]]

abstracting: (sum(CONTROLEUR_sens2, CONTROLEUR_sens1)<=SUR_PONT_B_dot)
states: 667,807,344 (8)
abstracting: (ROUTE_A_dot<=sum(VIDANGE_sens2, VIDANGE_sens1))
MC time: 0m12.724sec

checking: AG [[[[SORTI_B_dot<=SORTI_B_dot & 3<=ROUTE_B_dot] | 1<=sum(CHOIX_sens2, CHOIX_sens1)] | [2<=CAPACITE_dot & [2<=ROUTE_B_dot & sum(CHOIX_sens2, CHOIX_sens1)<=ATTENTE_B_dot]]]]
normalized: ~ [E [true U ~ [[[1<=sum(CHOIX_sens2, CHOIX_sens1) | [SORTI_B_dot<=SORTI_B_dot & 3<=ROUTE_B_dot]] | [2<=CAPACITE_dot & [2<=ROUTE_B_dot & sum(CHOIX_sens2, CHOIX_sens1)<=ATTENTE_B_dot]]]]]]

abstracting: (sum(CHOIX_sens2, CHOIX_sens1)<=ATTENTE_B_dot)
states: 876,639,225 (8)
abstracting: (2<=ROUTE_B_dot)
states: 817,100,279 (8)
abstracting: (2<=CAPACITE_dot)
states: 888,429,298 (8)
abstracting: (3<=ROUTE_B_dot)
states: 778,916,753 (8)
abstracting: (SORTI_B_dot<=SORTI_B_dot)
states: 896,290,210 (8)
abstracting: (1<=sum(CHOIX_sens2, CHOIX_sens1))

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.007sec

465248 636584 672589 691127 699024 699703 699839 761780 791757 859422 884104 956500 1023335 1047794 1107456 1130455 1195768 1256483 1277090 1332720 1351876 1411861 1463894 1482194 1527226 1539241 1584766 1624371 1636610 1678324 1714198 1726255 1764501 1797607 1808408 1843018 1874094 1892435 1882697 1876820 1873362 1869851 1873795 1865468 1861006 1859365 1856771 1857599 1849361 1848413 1846580 1842614 1842450 1841795 1838665 1843263 1834123 1832620 1834286 1830022 1828768 1831603 1827810 1825233 1824666 1824017 1825326 1821295 1820844 1821632 1819975 1819375 1816415 1816160 1817586 1815513 1815196 1816836 1813466 1811962 1812048 1811465 1812312 1810950 1810804 1811436 1810300 1810213 1807782 1807238 1807159 1806945 1806705 1807359 1806218 1806172 1806638 1805640 1805549 1805953 1805008 1804656
iterations count:10293525 (4383), effective:97567 (41)

initing FirstDep: 0m 0.006sec


sat_reach.icc:155: Timeout: after 27 sec


sat_reach.icc:155: Timeout: after 25 sec


sat_reach.icc:155: Timeout: after 23 sec


idd.h:1025: Timeout: after 11 sec


idd.h:1025: Timeout: after 9 sec


idd.h:1025: Timeout: after 8 sec


idd.h:1025: Timeout: after 7 sec

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-V50P20N20"
export BK_EXAMINATION="ReachabilityCardinality"
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/BridgeAndVehicles-COL-V50P20N20.tgz
mv BridgeAndVehicles-COL-V50P20N20 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is BridgeAndVehicles-COL-V50P20N20, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r001-csrt-149436061400340"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;