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.r586-smll-171734923800087.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 greatspnxred
Input is MedleyA-PT-18, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r586-smll-171734923800087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 26K 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 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 158K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717352540070

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:22:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 18:22:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:22:23] [INFO ] Load time of PNML (sax parser for PT used): 318 ms
[2024-06-02 18:22:23] [INFO ] Transformed 252 places.
[2024-06-02 18:22:23] [INFO ] Transformed 543 transitions.
[2024-06-02 18:22:23] [INFO ] Found NUPN structural information;
[2024-06-02 18:22:23] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 562 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 252/252 places, 543/543 transitions.
Graph (trivial) has 293 edges and 252 vertex of which 13 / 252 are part of one of the 3 SCC in 10 ms
Free SCC test removed 10 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 242 transition count 474
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 61 rules applied. Total rules applied 119 place count 185 transition count 470
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 183 transition count 470
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 121 place count 183 transition count 462
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 137 place count 175 transition count 462
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 219 place count 134 transition count 421
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 225 place count 134 transition count 415
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -216
Deduced a syphon composed of 43 places in 4 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 311 place count 91 transition count 631
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 331 place count 91 transition count 611
Applied a total of 331 rules in 230 ms. Remains 91 /252 variables (removed 161) and now considering 611/543 (removed -68) transitions.
[2024-06-02 18:22:23] [INFO ] Flow matrix only has 553 transitions (discarded 58 similar events)
// Phase 1: matrix 553 rows 91 cols
[2024-06-02 18:22:23] [INFO ] Computed 7 invariants in 27 ms
[2024-06-02 18:22:24] [INFO ] Implicit Places using invariants in 572 ms returned []
[2024-06-02 18:22:24] [INFO ] Flow matrix only has 553 transitions (discarded 58 similar events)
[2024-06-02 18:22:24] [INFO ] Invariant cache hit.
[2024-06-02 18:22:24] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-06-02 18:22:25] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
Running 610 sub problems to find dead transitions.
[2024-06-02 18:22:25] [INFO ] Flow matrix only has 553 transitions (discarded 58 similar events)
[2024-06-02 18:22:25] [INFO ] Invariant cache hit.
[2024-06-02 18:22:25] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 610 unsolved
[2024-06-02 18:22:36] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 13 ms to minimize.
[2024-06-02 18:22:36] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 5 ms to minimize.
[2024-06-02 18:22:36] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 3 ms to minimize.
[2024-06-02 18:22:37] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 2 ms to minimize.
[2024-06-02 18:22:37] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 2 ms to minimize.
[2024-06-02 18:22:37] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
[2024-06-02 18:22:37] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 1 ms to minimize.
[2024-06-02 18:22:37] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-06-02 18:22:38] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 3 ms to minimize.
[2024-06-02 18:22:38] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 2 ms to minimize.
[2024-06-02 18:22:38] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 2 ms to minimize.
[2024-06-02 18:22:38] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 2 ms to minimize.
[2024-06-02 18:22:38] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 2 ms to minimize.
[2024-06-02 18:22:38] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2024-06-02 18:22:39] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 2 ms to minimize.
[2024-06-02 18:22:39] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2024-06-02 18:22:39] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 2 ms to minimize.
[2024-06-02 18:22:39] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-06-02 18:22:39] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-06-02 18:22:39] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 610 unsolved
[2024-06-02 18:22:40] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 9 ms to minimize.
[2024-06-02 18:22:41] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 2 ms to minimize.
[2024-06-02 18:22:41] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 3 ms to minimize.
[2024-06-02 18:22:41] [INFO ] Deduced a trap composed of 41 places in 265 ms of which 2 ms to minimize.
[2024-06-02 18:22:42] [INFO ] Deduced a trap composed of 28 places in 256 ms of which 2 ms to minimize.
[2024-06-02 18:22:42] [INFO ] Deduced a trap composed of 50 places in 267 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 610 unsolved
[2024-06-02 18:22:45] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 2 ms to minimize.
[2024-06-02 18:22:46] [INFO ] Deduced a trap composed of 28 places in 247 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 610 unsolved
[2024-06-02 18:22:52] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 610 unsolved
[2024-06-02 18:22:55] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 91/644 variables, and 128 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30064 ms.
Refiners :[Domain max(s): 91/91 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/91 constraints, ReadFeed: 0/93 constraints, PredecessorRefiner: 610/610 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 610 unsolved
[2024-06-02 18:23:02] [INFO ] Deduced a trap composed of 28 places in 197 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
At refinement iteration 7 (OVERLAPS) 552/643 variables, 91/220 constraints. Problems are: Problem set: 68 solved, 542 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 92/312 constraints. Problems are: Problem set: 68 solved, 542 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 542/854 constraints. Problems are: Problem set: 68 solved, 542 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/644 variables, and 854 constraints, problems are : Problem set: 68 solved, 542 unsolved in 30025 ms.
Refiners :[Domain max(s): 91/91 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 92/93 constraints, PredecessorRefiner: 542/610 constraints, Known Traps: 31/31 constraints]
After SMT, in 62467ms problems are : Problem set: 68 solved, 542 unsolved
Search for dead transitions found 68 dead transitions in 62530ms
Found 68 dead transitions using SMT.
FORMULA QuasiLiveness FALSE TECHNIQUES STRUCTURAL_REDUCTION
Total runtime 65047 ms.
ITS solved all properties within timeout

BK_STOP 1717352607665

--------------------
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 QuasiLiveness -timeout 180 -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-18"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 greatspnxred"
echo " Input is MedleyA-PT-18, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r586-smll-171734923800087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-18.tgz
mv MedleyA-PT-18 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;