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

About the Execution of 2020-gold for Dekker-PT-015

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
618.964 3600000.00 28146.00 158.50 TFFTFTTFFFFTTFTT 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-162039097600384.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 Dekker-PT-015, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097600384
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 96K 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 Apr 26 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 26 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 26 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 26 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 10:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 22 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 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 141K 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 Dekker-PT-015-ReachabilityFireability-00
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-01
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-02
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-03
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-04
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-05
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-06
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-07
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-08
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-09
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-10
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-11
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-12
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-13
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-14
FORMULA_NAME Dekker-PT-015-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620574837010

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 15:40:38] [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 15:40:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 15:40:38] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2021-05-09 15:40:38] [INFO ] Transformed 75 places.
[2021-05-09 15:40:38] [INFO ] Transformed 255 transitions.
[2021-05-09 15:40:38] [INFO ] Found NUPN structural information;
[2021-05-09 15:40:38] [INFO ] Parsed PT model containing 75 places and 255 transitions in 125 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-015-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 123 ms. (steps per millisecond=81 ) properties seen :[1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1]
FORMULA Dekker-PT-015-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-015-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-015-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-015-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-015-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-015-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-015-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 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 10000 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 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-09 15:40:38] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2021-05-09 15:40:38] [INFO ] Computed 45 place invariants in 4 ms
[2021-05-09 15:40:39] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned unsat
[2021-05-09 15:40:39] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned unsat
[2021-05-09 15:40:39] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2021-05-09 15:40:39] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 2 ms returned unsat
[2021-05-09 15:40:39] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2021-05-09 15:40:39] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 4 ms returned sat
[2021-05-09 15:40:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:40:39] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-09 15:40:39] [INFO ] State equation strengthened by 15 read => feed constraints.
[2021-05-09 15:40:39] [INFO ] [Real]Added 15 Read/Feed constraints in 3 ms returned sat
[2021-05-09 15:40:39] [INFO ] Deduced a trap composed of 6 places in 33 ms
[2021-05-09 15:40:39] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2021-05-09 15:40:39] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2021-05-09 15:40:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 79 ms
[2021-05-09 15:40:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:40:39] [INFO ] [Nat]Absence check using 30 positive place invariants in 13 ms returned sat
[2021-05-09 15:40:39] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-09 15:40:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:40:39] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-09 15:40:39] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2021-05-09 15:40:39] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 15:40:39] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2021-05-09 15:40:39] [INFO ] Deduced a trap composed of 6 places in 22 ms
[2021-05-09 15:40:39] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2021-05-09 15:40:39] [INFO ] Deduced a trap composed of 6 places in 14 ms
[2021-05-09 15:40:39] [INFO ] Deduced a trap composed of 6 places in 17 ms
[2021-05-09 15:40:39] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2021-05-09 15:40:39] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2021-05-09 15:40:39] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2021-05-09 15:40:39] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2021-05-09 15:40:39] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2021-05-09 15:40:39] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2021-05-09 15:40:39] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2021-05-09 15:40:39] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2021-05-09 15:40:39] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 285 ms
[2021-05-09 15:40:39] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 7 ms.
[2021-05-09 15:40:39] [INFO ] Added : 16 causal constraints over 4 iterations in 43 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-09 15:40:39] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2021-05-09 15:40:39] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-09 15:40:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:40:39] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-09 15:40:39] [INFO ] [Real]Added 15 Read/Feed constraints in 2 ms returned sat
[2021-05-09 15:40:39] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2021-05-09 15:40:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2021-05-09 15:40:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:40:39] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2021-05-09 15:40:39] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-09 15:40:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:40:39] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-09 15:40:39] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2021-05-09 15:40:39] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2021-05-09 15:40:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-09 15:40:39] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 7 ms.
[2021-05-09 15:40:39] [INFO ] Added : 16 causal constraints over 4 iterations in 37 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-09 15:40:39] [INFO ] [Real]Absence check using 30 positive place invariants in 2 ms returned unsat
[2021-05-09 15:40:39] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned unsat
[2021-05-09 15:40:40] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2021-05-09 15:40:40] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-09 15:40:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:40:40] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-09 15:40:40] [INFO ] [Real]Added 15 Read/Feed constraints in 3 ms returned sat
[2021-05-09 15:40:40] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2021-05-09 15:40:40] [INFO ] Deduced a trap composed of 5 places in 13 ms
[2021-05-09 15:40:40] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2021-05-09 15:40:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 45 ms
[2021-05-09 15:40:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:40:40] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2021-05-09 15:40:40] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 6 ms returned sat
[2021-05-09 15:40:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:40:40] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-09 15:40:40] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2021-05-09 15:40:40] [INFO ] Deduced a trap composed of 5 places in 8 ms
[2021-05-09 15:40:40] [INFO ] Deduced a trap composed of 4 places in 7 ms
[2021-05-09 15:40:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 25 ms
[2021-05-09 15:40:40] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 10 ms.
[2021-05-09 15:40:40] [INFO ] Added : 16 causal constraints over 4 iterations in 43 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
FORMULA Dekker-PT-015-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-015-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-015-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-015-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-015-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 3600 steps, including 99 resets, run finished after 40 ms. (steps per millisecond=90 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 3500 steps, including 99 resets, run finished after 29 ms. (steps per millisecond=120 ) properties seen :[0, 1, 0] could not realise parikh vector
FORMULA Dekker-PT-015-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 4400 steps, including 98 resets, run finished after 38 ms. (steps per millisecond=115 ) properties seen :[0, 0] could not realise parikh vector
Support contains 36 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 26 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 255/255 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3627 ms. (steps per millisecond=275 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1428 ms. (steps per millisecond=700 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 966 ms. (steps per millisecond=1035 ) properties seen :[0, 0]
Finished probabilistic random walk after 10847067 steps, run visited all 2 properties in 10640 ms. (steps per millisecond=1019 )
Probabilistic random walk after 10847067 steps, saw 175920 distinct states, run finished after 10640 ms. (steps per millisecond=1019 ) properties seen :[1, 1]
FORMULA Dekker-PT-015-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Dekker-PT-015-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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="Dekker-PT-015"
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 Dekker-PT-015, 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-162039097600384"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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