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.r254-tall-171654364100383.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 NoC3x3-PT-4B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-171654364100383
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 07:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 07:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 07:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 07:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 608K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1716636892096

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=NoC3x3-PT-4B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 11:34:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-25 11:34:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 11:34:53] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-05-25 11:34:53] [INFO ] Transformed 2328 places.
[2024-05-25 11:34:53] [INFO ] Transformed 2701 transitions.
[2024-05-25 11:34:53] [INFO ] Found NUPN structural information;
[2024-05-25 11:34:53] [INFO ] Parsed PT model containing 2328 places and 2701 transitions and 6091 arcs in 331 ms.
Graph (trivial) has 2324 edges and 2328 vertex of which 1399 / 2328 are part of one of the 33 SCC in 20 ms
Free SCC test removed 1366 places
Structural test allowed to assert that 1771 places are NOT stable. Took 56 ms.
Ensure Unique test removed 1620 transitions
Reduce redundant transitions removed 1620 transitions.
RANDOM walk for 40000 steps (157 resets) in 2699 ms. (14 steps per ms) remains 50/557 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 50/50 properties
[2024-05-25 11:34:55] [INFO ] Flow matrix only has 1049 transitions (discarded 32 similar events)
// Phase 1: matrix 1049 rows 962 cols
[2024-05-25 11:34:55] [INFO ] Computed 66 invariants in 24 ms
[2024-05-25 11:34:55] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 331/381 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 331/400 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 581/962 variables, 47/447 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/962 variables, 581/1028 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/962 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 1048/2010 variables, 962/1990 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2010 variables, 0/1990 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (OVERLAPS) 1/2011 variables, 1/1991 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2011/2011 variables, and 1991 constraints, problems are : Problem set: 0 solved, 50 unsolved in 5062 ms.
Refiners :[Domain max(s): 962/962 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 962/962 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 331/381 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 331/400 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 581/962 variables, 47/447 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/962 variables, 581/1028 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-25 11:35:02] [INFO ] Deduced a trap composed of 40 places in 244 ms of which 41 ms to minimize.
[2024-05-25 11:35:02] [INFO ] Deduced a trap composed of 33 places in 267 ms of which 31 ms to minimize.
[2024-05-25 11:35:02] [INFO ] Deduced a trap composed of 41 places in 252 ms of which 3 ms to minimize.
[2024-05-25 11:35:03] [INFO ] Deduced a trap composed of 80 places in 234 ms of which 2 ms to minimize.
[2024-05-25 11:35:03] [INFO ] Deduced a trap composed of 72 places in 216 ms of which 18 ms to minimize.
[2024-05-25 11:35:03] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 2 ms to minimize.
[2024-05-25 11:35:03] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 3 ms to minimize.
[2024-05-25 11:35:03] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-05-25 11:35:03] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 2 ms to minimize.
[2024-05-25 11:35:03] [INFO ] Deduced a trap composed of 78 places in 58 ms of which 1 ms to minimize.
[2024-05-25 11:35:03] [INFO ] Deduced a trap composed of 86 places in 50 ms of which 2 ms to minimize.
[2024-05-25 11:35:04] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/962 variables, 12/1040 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 962/2011 variables, and 1040 constraints, problems are : Problem set: 0 solved, 50 unsolved in 5012 ms.
Refiners :[Domain max(s): 962/962 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 0/962 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/50 constraints, Known Traps: 12/12 constraints]
After SMT, in 10187ms problems are : Problem set: 0 solved, 50 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 962/962 places, 1081/1081 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 962 transition count 1015
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 99 place count 929 transition count 1015
Discarding 281 places :
Symmetric choice reduction at 2 with 281 rule applications. Total rules 380 place count 648 transition count 734
Iterating global reduction 2 with 281 rules applied. Total rules applied 661 place count 648 transition count 734
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 661 place count 648 transition count 688
Deduced a syphon composed of 46 places in 3 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 753 place count 602 transition count 688
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 779 place count 576 transition count 652
Iterating global reduction 2 with 26 rules applied. Total rules applied 805 place count 576 transition count 652
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 1041 place count 458 transition count 534
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1043 place count 457 transition count 551
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1046 place count 457 transition count 548
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 1052 place count 457 transition count 542
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1054 place count 456 transition count 553
Free-agglomeration rule applied 200 times.
Iterating global reduction 3 with 200 rules applied. Total rules applied 1254 place count 456 transition count 353
Reduce places removed 200 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Graph (complete) has 642 edges and 256 vertex of which 211 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.1 ms
Discarding 45 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Iterating post reduction 3 with 238 rules applied. Total rules applied 1492 place count 211 transition count 307
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 1532 place count 211 transition count 267
Applied a total of 1532 rules in 319 ms. Remains 211 /962 variables (removed 751) and now considering 267/1081 (removed 814) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 339 ms. Remains : 211/962 places, 267/1081 transitions.
RANDOM walk for 1002110 steps (3 resets) in 3662 ms. (273 steps per ms) remains 0/50 properties
Able to resolve query StableMarking after proving 559 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 13767 ms.
ITS solved all properties within timeout

BK_STOP 1716636907165

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -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="NoC3x3-PT-4B"
export BK_EXAMINATION="StableMarking"
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 NoC3x3-PT-4B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-171654364100383"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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