fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r579-smll-171734921100015
Last Updated
July 7, 2024

About the Execution of LTSMin+red for MedleyA-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
328.060 10184.00 24968.00 131.90 TTTFTFTFFTTTTFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r579-smll-171734921100015.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is MedleyA-PT-02, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921100015
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 48K Jun 2 16:33 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 MedleyA-PT-02-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-02-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-02-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-02-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-02-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-02-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-02-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-02-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-02-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-02-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-02-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-02-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-02-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-02-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-02-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-02-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717351718052

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:08:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:08:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:08:41] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2024-06-02 18:08:41] [INFO ] Transformed 69 places.
[2024-06-02 18:08:41] [INFO ] Transformed 168 transitions.
[2024-06-02 18:08:41] [INFO ] Found NUPN structural information;
[2024-06-02 18:08:41] [INFO ] Parsed PT model containing 69 places and 168 transitions and 765 arcs in 417 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40000 steps (3983 resets) in 3595 ms. (11 steps per ms) remains 11/15 properties
FORMULA MedleyA-PT-02-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-02-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-02-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-02-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-02-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (1209 resets) in 668 ms. (59 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1243 resets) in 306 ms. (130 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (926 resets) in 790 ms. (50 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1193 resets) in 315 ms. (126 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (928 resets) in 118 ms. (336 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (892 resets) in 140 ms. (283 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (742 resets) in 107 ms. (370 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (895 resets) in 150 ms. (264 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (907 resets) in 131 ms. (303 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (807 resets) in 319 ms. (125 steps per ms) remains 10/11 properties
FORMULA MedleyA-PT-02-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (928 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
// Phase 1: matrix 162 rows 69 cols
[2024-06-02 18:08:43] [INFO ] Computed 9 invariants in 12 ms
[2024-06-02 18:08:43] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem MedleyA-PT-02-ReachabilityFireability-2024-07 is UNSAT
FORMULA MedleyA-PT-02-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-02-ReachabilityFireability-2024-08 is UNSAT
FORMULA MedleyA-PT-02-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 14/66 variables, 8/60 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 14/74 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/74 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/67 variables, 1/75 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 1/76 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/76 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 160/227 variables, 67/143 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 60/203 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/203 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 4/231 variables, 2/205 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 2/207 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 0/207 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/231 variables, 0/207 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 207 constraints, problems are : Problem set: 2 solved, 8 unsolved in 1114 ms.
Refiners :[Domain max(s): 69/69 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem MedleyA-PT-02-ReachabilityFireability-2024-04 is UNSAT
FORMULA MedleyA-PT-02-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-02-ReachabilityFireability-2024-12 is UNSAT
FORMULA MedleyA-PT-02-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 14/66 variables, 8/60 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 14/74 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/74 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/67 variables, 1/75 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 1/76 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/76 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 160/227 variables, 67/143 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 60/203 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 2/205 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-02 18:08:45] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 25 ms to minimize.
[2024-06-02 18:08:45] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 2/207 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-02 18:08:45] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 1/208 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 0/208 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 4/231 variables, 2/210 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 2/212 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/231 variables, 4/216 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-02 18:08:46] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/231 variables, 1/217 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/231 variables, 0/217 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/231 variables, 0/217 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 217 constraints, problems are : Problem set: 4 solved, 6 unsolved in 2455 ms.
Refiners :[Domain max(s): 69/69 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 6/10 constraints, Known Traps: 4/4 constraints]
After SMT, in 3785ms problems are : Problem set: 4 solved, 6 unsolved
FORMULA MedleyA-PT-02-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-02-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-02-ReachabilityFireability-2024-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-02-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-02-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 323 ms.
Support contains 29 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 162/162 transitions.
Graph (complete) has 288 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 55 transition count 143
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 55 transition count 143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 26 place count 54 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 54 transition count 138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 53 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 53 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 33 place count 51 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 46 place count 51 transition count 136
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 51 transition count 136
Applied a total of 50 rules in 117 ms. Remains 51 /69 variables (removed 18) and now considering 136/162 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 51/69 places, 136/162 transitions.
RANDOM walk for 40000 steps (5287 resets) in 450 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2242 resets) in 368 ms. (108 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 35521 steps, run visited all 1 properties in 138 ms. (steps per millisecond=257 )
Probabilistic random walk after 35521 steps, saw 9311 distinct states, run finished after 146 ms. (steps per millisecond=243 ) properties seen :1
FORMULA MedleyA-PT-02-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 7496 ms.
ITS solved all properties within timeout

BK_STOP 1717351728236

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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="MedleyA-PT-02"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is MedleyA-PT-02, 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 r579-smll-171734921100015"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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