fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r298-tajo-171654454800059
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PolyORBLF-COL-S02J04T10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1821.756 109156.00 148799.00 67.70 F 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/mcc2024-input.r298-tajo-171654454800059.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-COL-S02J04T10, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654454800059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 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 Liveness

=== Now, execution of the tool begins

BK_START 1717103343177

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-COL-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:09:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:09:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:09:04] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 21:09:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 21:09:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 658 ms
[2024-05-30 21:09:05] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 24 ms.
[2024-05-30 21:09:05] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-30 21:09:05] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-05-30 21:09:05] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 46 ms.
[2024-05-30 21:09:05] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-05-30 21:09:05] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 17 ms.
[2024-05-30 21:09:05] [INFO ] Unfolded 65 HLPN properties in 1 ms.
[2024-05-30 21:09:05] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-30 21:09:05] [INFO ] Reduced 40 identical enabling conditions.
[2024-05-30 21:09:05] [INFO ] Reduced 110 identical enabling conditions.
[2024-05-30 21:09:05] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 1 ms.
[2024-05-30 21:09:05] [INFO ] Skeletonized 65 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-30 21:09:05] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 23 ms.
[2024-05-30 21:09:05] [INFO ] Unfolded 65 HLPN properties in 1 ms.
[2024-05-30 21:09:05] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-30 21:09:05] [INFO ] Reduced 40 identical enabling conditions.
[2024-05-30 21:09:05] [INFO ] Reduced 110 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.27914KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 84 ms. Remains 752 /752 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-05-30 21:09:05] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-05-30 21:09:05] [INFO ] Computed 54 invariants in 96 ms
[2024-05-30 21:09:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-30 21:09:25] [INFO ] Deduced a trap composed of 65 places in 330 ms of which 83 ms to minimize.
[2024-05-30 21:09:25] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 3 ms to minimize.
[2024-05-30 21:09:25] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 2 ms to minimize.
[2024-05-30 21:09:25] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-05-30 21:09:25] [INFO ] Deduced a trap composed of 66 places in 272 ms of which 3 ms to minimize.
[2024-05-30 21:09:25] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 1 ms to minimize.
[2024-05-30 21:09:26] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-30 21:09:26] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-05-30 21:09:26] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 1 ms to minimize.
[2024-05-30 21:09:27] [INFO ] Deduced a trap composed of 373 places in 456 ms of which 9 ms to minimize.
[2024-05-30 21:09:27] [INFO ] Deduced a trap composed of 381 places in 311 ms of which 4 ms to minimize.
[2024-05-30 21:09:27] [INFO ] Deduced a trap composed of 237 places in 384 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/2144 variables, and 62 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20149 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-30 21:09:30] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-05-30 21:09:31] [INFO ] Deduced a trap composed of 360 places in 295 ms of which 4 ms to minimize.
[2024-05-30 21:09:41] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 4 ms to minimize.
[2024-05-30 21:09:42] [INFO ] Deduced a trap composed of 420 places in 373 ms of which 6 ms to minimize.
[2024-05-30 21:09:43] [INFO ] Deduced a trap composed of 512 places in 315 ms of which 4 ms to minimize.
[2024-05-30 21:09:43] [INFO ] Deduced a trap composed of 482 places in 291 ms of which 5 ms to minimize.
[2024-05-30 21:09:43] [INFO ] Deduced a trap composed of 511 places in 383 ms of which 5 ms to minimize.
[2024-05-30 21:09:44] [INFO ] Deduced a trap composed of 492 places in 277 ms of which 4 ms to minimize.
[2024-05-30 21:09:44] [INFO ] Deduced a trap composed of 514 places in 276 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/2144 variables, and 71 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 21/21 constraints]
After SMT, in 42600ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 42645ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 42773 ms. Remains : 752/752 places, 1412/1412 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 38 ms. Remains 752 /752 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
[2024-05-30 21:09:48] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-30 21:09:48] [INFO ] Invariant cache hit.
[2024-05-30 21:09:48] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-30 21:09:48] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-30 21:09:48] [INFO ] Invariant cache hit.
[2024-05-30 21:09:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-30 21:09:49] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1069 ms to find 0 implicit places.
[2024-05-30 21:09:49] [INFO ] Redundant transitions in 106 ms returned []
Running 1410 sub problems to find dead transitions.
[2024-05-30 21:09:49] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-30 21:09:49] [INFO ] Invariant cache hit.
[2024-05-30 21:09:49] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-30 21:10:08] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-05-30 21:10:13] [INFO ] Deduced a trap composed of 66 places in 160 ms of which 2 ms to minimize.
[2024-05-30 21:10:13] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 3 ms to minimize.
[2024-05-30 21:10:13] [INFO ] Deduced a trap composed of 65 places in 188 ms of which 3 ms to minimize.
[2024-05-30 21:10:14] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 3 ms to minimize.
[2024-05-30 21:10:14] [INFO ] Deduced a trap composed of 59 places in 194 ms of which 3 ms to minimize.
[2024-05-30 21:10:14] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-05-30 21:10:14] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-05-30 21:10:14] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2024-05-30 21:10:14] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-30 21:10:15] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 2 ms to minimize.
[2024-05-30 21:10:17] [INFO ] Deduced a trap composed of 432 places in 410 ms of which 6 ms to minimize.
[2024-05-30 21:10:18] [INFO ] Deduced a trap composed of 397 places in 396 ms of which 5 ms to minimize.
[2024-05-30 21:10:18] [INFO ] Deduced a trap composed of 369 places in 411 ms of which 6 ms to minimize.
[2024-05-30 21:10:19] [INFO ] Deduced a trap composed of 384 places in 377 ms of which 6 ms to minimize.
[2024-05-30 21:10:19] [INFO ] Deduced a trap composed of 424 places in 326 ms of which 5 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/2144 variables, and 66 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-30 21:10:24] [INFO ] Deduced a trap composed of 205 places in 397 ms of which 6 ms to minimize.
[2024-05-30 21:10:24] [INFO ] Deduced a trap composed of 246 places in 333 ms of which 5 ms to minimize.
[2024-05-30 21:10:25] [INFO ] Deduced a trap composed of 381 places in 390 ms of which 6 ms to minimize.
[2024-05-30 21:10:26] [INFO ] Deduced a trap composed of 451 places in 363 ms of which 5 ms to minimize.
[2024-05-30 21:10:27] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 3 ms to minimize.
[2024-05-30 21:10:34] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 3 ms to minimize.
[2024-05-30 21:10:36] [INFO ] Deduced a trap composed of 415 places in 282 ms of which 5 ms to minimize.
[2024-05-30 21:10:43] [INFO ] Deduced a trap composed of 402 places in 340 ms of which 5 ms to minimize.
[2024-05-30 21:10:44] [INFO ] Deduced a trap composed of 377 places in 281 ms of which 5 ms to minimize.
[2024-05-30 21:10:45] [INFO ] Deduced a trap composed of 402 places in 383 ms of which 5 ms to minimize.
[2024-05-30 21:10:45] [INFO ] Deduced a trap composed of 369 places in 356 ms of which 5 ms to minimize.
[2024-05-30 21:10:49] [INFO ] Deduced a trap composed of 524 places in 369 ms of which 5 ms to minimize.
[2024-05-30 21:10:49] [INFO ] Deduced a trap composed of 462 places in 359 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/2144 variables, and 79 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 29/29 constraints]
After SMT, in 62441ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 62462ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 63690 ms. Remains : 752/752 places, 1412/1412 transitions.
Finished random walk after 23215 steps, including 0 resets, run found a deadlock after 130 ms. (steps per millisecond=178 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 107663 ms.
ITS solved all properties within timeout

BK_STOP 1717103452333

--------------------
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 Liveness -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="PolyORBLF-COL-S02J04T10"
export BK_EXAMINATION="Liveness"
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 PolyORBLF-COL-S02J04T10, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tajo-171654454800059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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