fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r180-ebro-158987900500607
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for DLCround-PT-12b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.770 3600000.00 77617.00 171.50 FTTTTTTTFFFFTFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987900500607.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DLCround-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900500607
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 3.2K Mar 30 20:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 30 20:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 29 10:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 29 10:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 28 06:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 27 00:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 27 00:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.9M Mar 24 05:37 model.pnml

--------------------
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 DLCround-PT-12b-ReachabilityFireability-00
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-01
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-02
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-03
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-04
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-05
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-06
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-07
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-08
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-09
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-10
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-11
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-12
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-13
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-14
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591259602373

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 08:33:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 08:33:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 08:33:26] [INFO ] Load time of PNML (sax parser for PT used): 591 ms
[2020-06-04 08:33:26] [INFO ] Transformed 4848 places.
[2020-06-04 08:33:26] [INFO ] Transformed 7836 transitions.
[2020-06-04 08:33:26] [INFO ] Found NUPN structural information;
[2020-06-04 08:33:26] [INFO ] Parsed PT model containing 4848 places and 7836 transitions in 932 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 621 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 253 ms. (steps per millisecond=39 ) properties seen :[0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1]
FORMULA DLCround-PT-12b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 49 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 49 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 96 ms. (steps per millisecond=104 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 7836 rows 4848 cols
[2020-06-04 08:33:28] [INFO ] Computed 277 place invariants in 239 ms
[2020-06-04 08:33:31] [INFO ] [Real]Absence check using 277 positive place invariants in 1833 ms returned sat
[2020-06-04 08:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:33:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 08:33:33] [INFO ] [Real]Absence check using state equation in 2087 ms returned (error "Failed to check-sat")
[2020-06-04 08:33:36] [INFO ] [Real]Absence check using 277 positive place invariants in 1784 ms returned sat
[2020-06-04 08:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:33:38] [INFO ] [Real]Absence check using state equation in 2255 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 08:33:41] [INFO ] [Real]Absence check using 277 positive place invariants in 1891 ms returned unsat
[2020-06-04 08:33:43] [INFO ] [Real]Absence check using 277 positive place invariants in 1776 ms returned sat
[2020-06-04 08:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:33:46] [INFO ] [Real]Absence check using state equation in 2395 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 08:33:48] [INFO ] [Real]Absence check using 277 positive place invariants in 1612 ms returned sat
[2020-06-04 08:33:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:33:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 08:33:51] [INFO ] [Real]Absence check using state equation in 2488 ms returned (error "Failed to check-sat")
[2020-06-04 08:33:53] [INFO ] [Real]Absence check using 277 positive place invariants in 1612 ms returned unsat
[2020-06-04 08:33:56] [INFO ] [Real]Absence check using 277 positive place invariants in 1832 ms returned sat
[2020-06-04 08:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:33:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 08:33:58] [INFO ] [Real]Absence check using state equation in 2259 ms returned (error "Failed to check-sat")
[2020-06-04 08:34:00] [INFO ] [Real]Absence check using 277 positive place invariants in 731 ms returned unsat
FORMULA DLCround-PT-12b-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-12b-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-12b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 42 out of 4848 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4848/4848 places, 7836/7836 transitions.
Graph (trivial) has 4361 edges and 4848 vertex of which 746 / 4848 are part of one of the 50 SCC in 50 ms
Free SCC test removed 696 places
Drop transitions removed 775 transitions
Reduce isomorphic transitions removed 775 transitions.
Performed 1712 Post agglomeration using F-continuation condition.Transition count delta: 1712
Iterating post reduction 0 with 2487 rules applied. Total rules applied 2488 place count 4152 transition count 5349
Reduce places removed 1712 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 1797 rules applied. Total rules applied 4285 place count 2440 transition count 5264
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 42 rules applied. Total rules applied 4327 place count 2404 transition count 5258
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4330 place count 2401 transition count 5258
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 4330 place count 2401 transition count 5239
Deduced a syphon composed of 19 places in 159 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 4368 place count 2382 transition count 5239
Symmetric choice reduction at 4 with 666 rule applications. Total rules 5034 place count 2382 transition count 5239
Deduced a syphon composed of 666 places in 119 ms
Reduce places removed 666 places and 666 transitions.
Iterating global reduction 4 with 1332 rules applied. Total rules applied 6366 place count 1716 transition count 4573
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 6370 place count 1716 transition count 4569
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 6373 place count 1714 transition count 4568
Performed 289 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 289 Pre rules applied. Total rules applied 6373 place count 1714 transition count 4279
Deduced a syphon composed of 289 places in 98 ms
Reduce places removed 289 places and 0 transitions.
Iterating global reduction 6 with 578 rules applied. Total rules applied 6951 place count 1425 transition count 4279
Symmetric choice reduction at 6 with 79 rule applications. Total rules 7030 place count 1425 transition count 4279
Deduced a syphon composed of 79 places in 90 ms
Reduce places removed 79 places and 1249 transitions.
Iterating global reduction 6 with 158 rules applied. Total rules applied 7188 place count 1346 transition count 3030
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 7214 place count 1346 transition count 3004
Performed 356 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 356 places in 3 ms
Reduce places removed 356 places and 0 transitions.
Iterating global reduction 7 with 712 rules applied. Total rules applied 7926 place count 990 transition count 2641
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 7938 place count 990 transition count 2629
Renaming transitions due to excessive name length > 1024 char.
Symmetric choice reduction at 8 with 3 rule applications. Total rules 7941 place count 990 transition count 2629
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 48 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 7947 place count 987 transition count 2581
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -185
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 7985 place count 968 transition count 2766
Drop transitions removed 12 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 8002 place count 968 transition count 2749
Free-agglomeration rule applied 536 times with reduction of 234 identical transitions.
Iterating global reduction 9 with 536 rules applied. Total rules applied 8538 place count 968 transition count 1979
Reduce places removed 536 places and 0 transitions.
Drop transitions removed 575 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 588 transitions.
Discarding 45 places :
Also discarding 95 output transitions
Drop transitions removed 95 transitions
Graph (complete) has 1679 edges and 432 vertex of which 387 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.12 ms
Iterating post reduction 9 with 1125 rules applied. Total rules applied 9663 place count 387 transition count 1296
Drop transitions removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 10 with 61 rules applied. Total rules applied 9724 place count 387 transition count 1235
Symmetric choice reduction at 11 with 1 rule applications. Total rules 9725 place count 387 transition count 1235
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 13 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 9727 place count 386 transition count 1222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 9728 place count 386 transition count 1221
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 9730 place count 385 transition count 1232
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 9743 place count 385 transition count 1219
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 13 with 25 rules applied. Total rules applied 9768 place count 385 transition count 1592
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 13 with 403 rules applied. Total rules applied 10171 place count 360 transition count 1214
Symmetric choice reduction at 14 with 1 rule applications. Total rules 10172 place count 360 transition count 1214
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 10174 place count 359 transition count 1213
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 14 with 16 rules applied. Total rules applied 10190 place count 359 transition count 1197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 10192 place count 358 transition count 1196
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 15 with 16 rules applied. Total rules applied 10208 place count 358 transition count 1180
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 10210 place count 358 transition count 1180
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 16 with 60 rules applied. Total rules applied 10270 place count 358 transition count 1120
Free-agglomeration rule applied 2 times.
Iterating global reduction 16 with 2 rules applied. Total rules applied 10272 place count 358 transition count 1118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 10274 place count 356 transition count 1118
Applied a total of 10274 rules in 3285 ms. Remains 356 /4848 variables (removed 4492) and now considering 1118/7836 (removed 6718) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/4848 places, 1118/7836 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 11324 ms. (steps per millisecond=88 ) properties seen :[1, 1, 0, 1, 1]
FORMULA DLCround-PT-12b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 1003 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=143 )
FORMULA DLCround-PT-12b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

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

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="DLCround-PT-12b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DLCround-PT-12b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987900500607"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-12b.tgz
mv DLCround-PT-12b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;