fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r006-tajo-165245688700031
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ASLink-PT-02a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
355.355 15441.00 28389.00 51.00 FTFFTFTTFFFTTFFF 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/mcc2022-input.r006-tajo-165245688700031.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 itstools
Input is ASLink-PT-02a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245688700031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 8.2K Apr 30 07:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 30 07:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 07:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 07:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 06:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 06:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 06:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 06:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 30 07:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 201K Apr 30 07:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 07:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 07:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 06:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 06:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 279K May 10 09: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 ASLink-PT-02a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654264822018

Running Version 202205111006
[2022-06-03 14:00:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 14:00:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 14:00:23] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2022-06-03 14:00:23] [INFO ] Transformed 626 places.
[2022-06-03 14:00:23] [INFO ] Transformed 1008 transitions.
[2022-06-03 14:00:23] [INFO ] Found NUPN structural information;
[2022-06-03 14:00:23] [INFO ] Parsed PT model containing 626 places and 1008 transitions in 292 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 644 ms. (steps per millisecond=15 ) properties (out of 16) seen :5
FORMULA ASLink-PT-02a-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :1
FORMULA ASLink-PT-02a-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 998 rows 626 cols
[2022-06-03 14:00:25] [INFO ] Computed 118 place invariants in 45 ms
[2022-06-03 14:00:26] [INFO ] [Real]Absence check using 28 positive place invariants in 8 ms returned sat
[2022-06-03 14:00:26] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 24 ms returned sat
[2022-06-03 14:00:26] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-03 14:00:26] [INFO ] [Nat]Absence check using 28 positive place invariants in 10 ms returned sat
[2022-06-03 14:00:26] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 35 ms returned sat
[2022-06-03 14:00:31] [INFO ] After 5166ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :2
[2022-06-03 14:00:33] [INFO ] Deduced a trap composed of 71 places in 304 ms of which 6 ms to minimize.
[2022-06-03 14:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 387 ms
[2022-06-03 14:00:34] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 2 ms to minimize.
[2022-06-03 14:00:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 346 ms
[2022-06-03 14:00:34] [INFO ] After 8051ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :1
Attempting to minimize the solution found.
Minimization took 368 ms.
[2022-06-03 14:00:34] [INFO ] After 8853ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :1
FORMULA ASLink-PT-02a-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 459 ms.
Support contains 13 out of 626 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 614 transition count 947
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 114 place count 563 transition count 947
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 114 place count 563 transition count 898
Deduced a syphon composed of 49 places in 4 ms
Ensure Unique test removed 19 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 231 place count 495 transition count 898
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 232 place count 495 transition count 897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 233 place count 494 transition count 897
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 238 place count 489 transition count 874
Ensure Unique test removed 1 places
Iterating global reduction 4 with 6 rules applied. Total rules applied 244 place count 488 transition count 874
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 250 place count 487 transition count 869
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 253 place count 484 transition count 869
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 254 place count 483 transition count 861
Iterating global reduction 6 with 1 rules applied. Total rules applied 255 place count 483 transition count 861
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 256 place count 482 transition count 853
Iterating global reduction 6 with 1 rules applied. Total rules applied 257 place count 482 transition count 853
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 258 place count 481 transition count 845
Iterating global reduction 6 with 1 rules applied. Total rules applied 259 place count 481 transition count 845
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 260 place count 480 transition count 837
Iterating global reduction 6 with 1 rules applied. Total rules applied 261 place count 480 transition count 837
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 262 place count 479 transition count 829
Iterating global reduction 6 with 1 rules applied. Total rules applied 263 place count 479 transition count 829
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 264 place count 478 transition count 821
Iterating global reduction 6 with 1 rules applied. Total rules applied 265 place count 478 transition count 821
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 266 place count 477 transition count 813
Iterating global reduction 6 with 1 rules applied. Total rules applied 267 place count 477 transition count 813
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 268 place count 476 transition count 805
Iterating global reduction 6 with 1 rules applied. Total rules applied 269 place count 476 transition count 805
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 270 place count 475 transition count 797
Iterating global reduction 6 with 1 rules applied. Total rules applied 271 place count 475 transition count 797
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 272 place count 474 transition count 789
Iterating global reduction 6 with 1 rules applied. Total rules applied 273 place count 474 transition count 789
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 274 place count 473 transition count 781
Iterating global reduction 6 with 1 rules applied. Total rules applied 275 place count 473 transition count 781
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 276 place count 472 transition count 773
Iterating global reduction 6 with 1 rules applied. Total rules applied 277 place count 472 transition count 773
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 278 place count 471 transition count 765
Iterating global reduction 6 with 1 rules applied. Total rules applied 279 place count 471 transition count 765
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 280 place count 470 transition count 757
Iterating global reduction 6 with 1 rules applied. Total rules applied 281 place count 470 transition count 757
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 282 place count 469 transition count 749
Iterating global reduction 6 with 1 rules applied. Total rules applied 283 place count 469 transition count 749
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 284 place count 468 transition count 741
Iterating global reduction 6 with 1 rules applied. Total rules applied 285 place count 468 transition count 741
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 313 place count 454 transition count 727
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 314 place count 454 transition count 726
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 315 place count 453 transition count 726
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 318 place count 453 transition count 726
Applied a total of 318 rules in 510 ms. Remains 453 /626 variables (removed 173) and now considering 726/998 (removed 272) transitions.
Finished structural reductions, in 1 iterations. Remains : 453/626 places, 726/998 transitions.
Finished random walk after 637531 steps, including 9704 resets, run visited all 1 properties in 1433 ms. (steps per millisecond=444 )
FORMULA ASLink-PT-02a-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 14003 ms.

BK_STOP 1654264837459

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ASLink-PT-02a"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ASLink-PT-02a, 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 r006-tajo-165245688700031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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