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

About the Execution of 2020-gold for SmartHome-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
258.224 3600000.00 16126.00 759.90 TTFTTTFTTTTTTTFT 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.r265-tall-162106800300100.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 SmartHome-PT-06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800300100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 13:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 13:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 56K May 5 16:52 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 SmartHome-PT-06-ReachabilityFireability-00
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-01
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-02
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-03
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-04
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-05
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-06
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-07
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-08
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-09
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-10
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-11
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-12
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-13
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-14
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621197779140

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 20:43:00] [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-16 20:43:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 20:43:00] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2021-05-16 20:43:00] [INFO ] Transformed 219 places.
[2021-05-16 20:43:00] [INFO ] Transformed 254 transitions.
[2021-05-16 20:43:00] [INFO ] Found NUPN structural information;
[2021-05-16 20:43:00] [INFO ] Parsed PT model containing 219 places and 254 transitions in 96 ms.
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 18 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA SmartHome-PT-06-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 60 resets, run finished after 63 ms. (steps per millisecond=158 ) properties seen :[1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1]
FORMULA SmartHome-PT-06-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 1, 0]
FORMULA SmartHome-PT-06-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 236 rows 202 cols
[2021-05-16 20:43:01] [INFO ] Computed 9 place invariants in 8 ms
[2021-05-16 20:43:01] [INFO ] [Real]Absence check using 9 positive place invariants in 19 ms returned sat
[2021-05-16 20:43:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:43:01] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-16 20:43:01] [INFO ] Deduced a trap composed of 43 places in 73 ms
[2021-05-16 20:43:01] [INFO ] Deduced a trap composed of 47 places in 47 ms
[2021-05-16 20:43:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2021-05-16 20:43:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:43:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 305 ms returned sat
[2021-05-16 20:43:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:43:02] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2021-05-16 20:43:02] [INFO ] Deduced a trap composed of 33 places in 126 ms
[2021-05-16 20:43:02] [INFO ] Deduced a trap composed of 27 places in 40 ms
[2021-05-16 20:43:02] [INFO ] Deduced a trap composed of 47 places in 26 ms
[2021-05-16 20:43:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
[2021-05-16 20:43:02] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 16 ms.
[2021-05-16 20:43:03] [INFO ] Added : 231 causal constraints over 47 iterations in 699 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-16 20:43:03] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned unsat
[2021-05-16 20:43:03] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2021-05-16 20:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:43:03] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-16 20:43:03] [INFO ] Deduced a trap composed of 27 places in 61 ms
[2021-05-16 20:43:03] [INFO ] Deduced a trap composed of 47 places in 28 ms
[2021-05-16 20:43:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2021-05-16 20:43:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:43:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 309 ms returned sat
[2021-05-16 20:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:43:03] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-16 20:43:03] [INFO ] Deduced a trap composed of 47 places in 42 ms
[2021-05-16 20:43:03] [INFO ] Deduced a trap composed of 33 places in 28 ms
[2021-05-16 20:43:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2021-05-16 20:43:03] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 16 ms.
[2021-05-16 20:43:04] [INFO ] Added : 235 causal constraints over 47 iterations in 698 ms. Result :sat
[2021-05-16 20:43:04] [INFO ] Deduced a trap composed of 47 places in 39 ms
[2021-05-16 20:43:04] [INFO ] Deduced a trap composed of 27 places in 20 ms
[2021-05-16 20:43:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-16 20:43:04] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2021-05-16 20:43:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:43:04] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-16 20:43:04] [INFO ] Deduced a trap composed of 47 places in 34 ms
[2021-05-16 20:43:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2021-05-16 20:43:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:43:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 23 ms returned sat
[2021-05-16 20:43:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:43:05] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-16 20:43:05] [INFO ] Deduced a trap composed of 27 places in 41 ms
[2021-05-16 20:43:05] [INFO ] Deduced a trap composed of 47 places in 33 ms
[2021-05-16 20:43:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2021-05-16 20:43:05] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 16 ms.
[2021-05-16 20:43:05] [INFO ] Added : 235 causal constraints over 47 iterations in 649 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-16 20:43:05] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2021-05-16 20:43:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:43:06] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-16 20:43:06] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 15 ms.
[2021-05-16 20:43:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:43:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 97 ms returned sat
[2021-05-16 20:43:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:43:06] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2021-05-16 20:43:06] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 19 ms.
[2021-05-16 20:43:07] [INFO ] Added : 231 causal constraints over 47 iterations in 630 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
FORMULA SmartHome-PT-06-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 23700 steps, including 292 resets, run finished after 82 ms. (steps per millisecond=289 ) properties seen :[1, 1, 0, 0] could not realise parikh vector
FORMULA SmartHome-PT-06-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA SmartHome-PT-06-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 22200 steps, including 167 resets, run finished after 57 ms. (steps per millisecond=389 ) properties seen :[1, 0] could not realise parikh vector
FORMULA SmartHome-PT-06-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 31400 steps, including 377 resets, run finished after 64 ms. (steps per millisecond=490 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 20200 steps, including 215 resets, run finished after 49 ms. (steps per millisecond=412 ) properties seen :[0] could not realise parikh vector
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 236/236 transitions.
Graph (trivial) has 189 edges and 202 vertex of which 57 / 202 are part of one of the 5 SCC in 4 ms
Free SCC test removed 52 places
Drop transitions removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 150 transition count 108
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 70 rules applied. Total rules applied 199 place count 91 transition count 97
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 204 place count 86 transition count 97
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 204 place count 86 transition count 91
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 216 place count 80 transition count 91
Symmetric choice reduction at 3 with 29 rule applications. Total rules 245 place count 80 transition count 91
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 29 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 303 place count 51 transition count 62
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 308 place count 51 transition count 57
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 308 place count 51 transition count 55
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 312 place count 49 transition count 55
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 340 place count 35 transition count 41
Drop transitions removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 92 edges and 35 vertex of which 34 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Iterating post reduction 4 with 10 rules applied. Total rules applied 350 place count 34 transition count 32
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 356 place count 34 transition count 26
Reduce places removed 6 places and 0 transitions.
Discarding 17 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Graph (complete) has 55 edges and 28 vertex of which 11 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Iterating post reduction 5 with 7 rules applied. Total rules applied 363 place count 11 transition count 24
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 376 place count 11 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 377 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 378 place count 9 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 378 place count 9 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 380 place count 8 transition count 9
Applied a total of 380 rules in 39 ms. Remains 8 /202 variables (removed 194) and now considering 9/236 (removed 227) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/202 places, 9/236 transitions.
Finished random walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
FORMULA SmartHome-PT-06-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_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="SmartHome-PT-06"
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 SmartHome-PT-06, 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 r265-tall-162106800300100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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