fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r075-tall-162039097300160
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for DLCround-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
345.756 3600000.00 50092.00 425.50 TFFFTTTTTFFTTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r075-tall-162039097300160.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is DLCround-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097300160
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 120K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 674K May 5 16:51 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-05b-ReachabilityFireability-00
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-01
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-02
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-03
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-04
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-05
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-06
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-07
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-08
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-09
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-10
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-11
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-12
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-13
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-14
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620535025974

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 04:37:08] [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]
[2021-05-09 04:37:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 04:37:09] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2021-05-09 04:37:09] [INFO ] Transformed 1999 places.
[2021-05-09 04:37:09] [INFO ] Transformed 2887 transitions.
[2021-05-09 04:37:09] [INFO ] Found NUPN structural information;
[2021-05-09 04:37:09] [INFO ] Parsed PT model containing 1999 places and 2887 transitions in 226 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 89 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 91 ms. (steps per millisecond=109 ) properties seen :[1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1]
FORMULA DLCround-PT-05b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 1, 0, 0, 0, 0, 0]
FORMULA DLCround-PT-05b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2887 rows 1999 cols
[2021-05-09 04:37:09] [INFO ] Computed 88 place invariants in 83 ms
[2021-05-09 04:37:10] [INFO ] [Real]Absence check using 88 positive place invariants in 161 ms returned sat
[2021-05-09 04:37:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 04:37:14] [INFO ] [Real]Absence check using state equation in 4456 ms returned (error "Solver has unexpectedly terminated")
[2021-05-09 04:37:15] [INFO ] [Real]Absence check using 88 positive place invariants in 152 ms returned sat
[2021-05-09 04:37:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 04:37:19] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 04:37:19] [INFO ] [Real]Absence check using state equation in 4553 ms returned (error "Failed to check-sat")
[2021-05-09 04:37:20] [INFO ] [Real]Absence check using 88 positive place invariants in 139 ms returned sat
[2021-05-09 04:37:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 04:37:24] [INFO ] [Real]Absence check using state equation in 4577 ms returned (error "Solver has unexpectedly terminated")
[2021-05-09 04:37:25] [INFO ] [Real]Absence check using 88 positive place invariants in 151 ms returned sat
[2021-05-09 04:37:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 04:37:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 04:37:29] [INFO ] [Real]Absence check using state equation in 4561 ms returned unknown
[2021-05-09 04:37:30] [INFO ] [Real]Absence check using 88 positive place invariants in 140 ms returned sat
[2021-05-09 04:37:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 04:37:34] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 04:37:34] [INFO ] [Real]Absence check using state equation in 4623 ms returned (error "Failed to check-sat")
[2021-05-09 04:37:35] [INFO ] [Real]Absence check using 88 positive place invariants in 138 ms returned sat
[2021-05-09 04:37:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 04:37:39] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 04:37:39] [INFO ] [Real]Absence check using state equation in 4572 ms returned unknown
Support contains 35 out of 1999 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1999/1999 places, 2887/2887 transitions.
Graph (trivial) has 1826 edges and 1999 vertex of which 314 / 1999 are part of one of the 26 SCC in 10 ms
Free SCC test removed 288 places
Drop transitions removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Performed 779 Post agglomeration using F-continuation condition.Transition count delta: 779
Iterating post reduction 0 with 1103 rules applied. Total rules applied 1104 place count 1711 transition count 1784
Reduce places removed 779 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 828 rules applied. Total rules applied 1932 place count 932 transition count 1735
Reduce places removed 22 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 28 rules applied. Total rules applied 1960 place count 910 transition count 1729
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1963 place count 907 transition count 1729
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 1963 place count 907 transition count 1707
Deduced a syphon composed of 22 places in 4 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 2007 place count 885 transition count 1707
Symmetric choice reduction at 4 with 228 rule applications. Total rules 2235 place count 885 transition count 1707
Deduced a syphon composed of 228 places in 13 ms
Reduce places removed 228 places and 228 transitions.
Iterating global reduction 4 with 456 rules applied. Total rules applied 2691 place count 657 transition count 1479
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 2695 place count 657 transition count 1475
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 2698 place count 655 transition count 1474
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 87 Pre rules applied. Total rules applied 2698 place count 655 transition count 1387
Deduced a syphon composed of 87 places in 11 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 6 with 174 rules applied. Total rules applied 2872 place count 568 transition count 1387
Symmetric choice reduction at 6 with 35 rule applications. Total rules 2907 place count 568 transition count 1387
Deduced a syphon composed of 35 places in 10 ms
Reduce places removed 35 places and 294 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 2977 place count 533 transition count 1093
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2990 place count 533 transition count 1080
Performed 143 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 143 places in 1 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 7 with 286 rules applied. Total rules applied 3276 place count 390 transition count 932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3277 place count 390 transition count 931
Symmetric choice reduction at 8 with 6 rule applications. Total rules 3283 place count 390 transition count 931
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 54 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 3295 place count 384 transition count 877
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3296 place count 384 transition count 876
Performed 36 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 9 with 72 rules applied. Total rules applied 3368 place count 348 transition count 1142
Drop transitions removed 14 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 3383 place count 348 transition count 1127
Free-agglomeration rule applied 162 times with reduction of 79 identical transitions.
Iterating global reduction 10 with 162 rules applied. Total rules applied 3545 place count 348 transition count 886
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 266 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 277 transitions.
Discarding 7 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Graph (complete) has 594 edges and 186 vertex of which 179 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Iterating post reduction 10 with 440 rules applied. Total rules applied 3985 place count 179 transition count 593
Drop transitions removed 22 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 11 with 23 rules applied. Total rules applied 4008 place count 179 transition count 570
Symmetric choice reduction at 12 with 2 rule applications. Total rules 4010 place count 179 transition count 570
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 12 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 4014 place count 177 transition count 558
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 4020 place count 177 transition count 552
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 4021 place count 177 transition count 559
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 9 rules applied. Total rules applied 4030 place count 176 transition count 551
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 4033 place count 176 transition count 551
Drop transitions removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 14 with 51 rules applied. Total rules applied 4084 place count 176 transition count 500
Symmetric choice reduction at 14 with 3 rule applications. Total rules 4087 place count 176 transition count 500
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 27 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 4093 place count 173 transition count 473
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 4095 place count 173 transition count 471
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 14 with 17 rules applied. Total rules applied 4112 place count 171 transition count 456
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 4115 place count 171 transition count 453
Applied a total of 4115 rules in 708 ms. Remains 171 /1999 variables (removed 1828) and now considering 453/2887 (removed 2434) transitions.
Finished structural reductions, in 1 iterations. Remains : 171/1999 places, 453/2887 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3794 ms. (steps per millisecond=263 ) properties seen :[1, 1, 1, 1, 0, 1]
FORMULA DLCround-PT-05b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 2192 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=438 )
FORMULA DLCround-PT-05b-ReachabilityFireability-11 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-05b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is DLCround-PT-05b, 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 r075-tall-162039097300160"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-05b.tgz
mv DLCround-PT-05b 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 ;