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.r590-smll-171734924900098.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 ltsminxred
Input is MedleyA-PT-20, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r590-smll-171734924900098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 130K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1717352788860

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:26:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:26:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:26:32] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2024-06-02 18:26:32] [INFO ] Transformed 273 places.
[2024-06-02 18:26:32] [INFO ] Transformed 518 transitions.
[2024-06-02 18:26:32] [INFO ] Found NUPN structural information;
[2024-06-02 18:26:32] [INFO ] Parsed PT model containing 273 places and 518 transitions and 1795 arcs in 476 ms.
Graph (trivial) has 233 edges and 273 vertex of which 30 / 273 are part of one of the 3 SCC in 7 ms
Free SCC test removed 27 places
Structural test allowed to assert that 98 places are NOT stable. Took 72 ms.
Ensure Unique test removed 36 transitions
Reduce redundant transitions removed 36 transitions.
RANDOM walk for 40000 steps (33 resets) in 4778 ms. (8 steps per ms) remains 58/175 properties
BEST_FIRST walk for 4004 steps (16 resets) in 106 ms. (37 steps per ms) remains 34/58 properties
BEST_FIRST walk for 4003 steps (19 resets) in 112 ms. (35 steps per ms) remains 30/34 properties
BEST_FIRST walk for 4004 steps (15 resets) in 82 ms. (48 steps per ms) remains 25/30 properties
BEST_FIRST walk for 4004 steps (18 resets) in 95 ms. (41 steps per ms) remains 19/25 properties
BEST_FIRST walk for 4004 steps (19 resets) in 69 ms. (57 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (17 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (25 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 24 ms. (160 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (16 resets) in 44 ms. (88 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (24 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (19 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (21 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (15 resets) in 51 ms. (76 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (19 resets) in 12 ms. (308 steps per ms) remains 14/18 properties
BEST_FIRST walk for 4003 steps (21 resets) in 11 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (17 resets) in 18 ms. (210 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4002 steps (15 resets) in 23 ms. (166 steps per ms) remains 9/13 properties
[2024-06-02 18:26:34] [INFO ] Flow matrix only has 480 transitions (discarded 2 similar events)
// Phase 1: matrix 480 rows 246 cols
[2024-06-02 18:26:34] [INFO ] Computed 11 invariants in 28 ms
[2024-06-02 18:26:34] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 117/126 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 65/191 variables, 7/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 65/200 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 55/246 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 55/257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 479/725 variables, 246/503 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/725 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 1/726 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/726 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/726 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 504 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1725 ms.
Refiners :[Domain max(s): 246/246 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 246/246 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 117/126 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 65/191 variables, 7/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 65/200 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 55/246 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 55/257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 18:26:36] [INFO ] Deduced a trap composed of 148 places in 382 ms of which 57 ms to minimize.
[2024-06-02 18:26:37] [INFO ] Deduced a trap composed of 138 places in 300 ms of which 5 ms to minimize.
[2024-06-02 18:26:37] [INFO ] Deduced a trap composed of 140 places in 273 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 18:26:37] [INFO ] Deduced a trap composed of 138 places in 233 ms of which 3 ms to minimize.
[2024-06-02 18:26:38] [INFO ] Deduced a trap composed of 151 places in 230 ms of which 3 ms to minimize.
[2024-06-02 18:26:38] [INFO ] Deduced a trap composed of 125 places in 173 ms of which 3 ms to minimize.
[2024-06-02 18:26:38] [INFO ] Deduced a trap composed of 124 places in 209 ms of which 4 ms to minimize.
[2024-06-02 18:26:38] [INFO ] Deduced a trap composed of 137 places in 206 ms of which 4 ms to minimize.
[2024-06-02 18:26:39] [INFO ] Deduced a trap composed of 124 places in 168 ms of which 3 ms to minimize.
[2024-06-02 18:26:39] [INFO ] Deduced a trap composed of 121 places in 165 ms of which 3 ms to minimize.
[2024-06-02 18:26:39] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 4 ms to minimize.
[2024-06-02 18:26:39] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 5 ms to minimize.
[2024-06-02 18:26:39] [INFO ] Deduced a trap composed of 106 places in 203 ms of which 2 ms to minimize.
[2024-06-02 18:26:40] [INFO ] Deduced a trap composed of 134 places in 301 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 11/271 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 479/725 variables, 246/517 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/725 variables, 9/526 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 18:26:40] [INFO ] Deduced a trap composed of 136 places in 221 ms of which 4 ms to minimize.
[2024-06-02 18:26:41] [INFO ] Deduced a trap composed of 163 places in 182 ms of which 3 ms to minimize.
SMT process timed out in 6965ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 482/482 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 246 transition count 465
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 232 transition count 463
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 103 place count 162 transition count 393
Iterating global reduction 2 with 70 rules applied. Total rules applied 173 place count 162 transition count 393
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 173 place count 162 transition count 383
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 193 place count 152 transition count 383
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 196 place count 152 transition count 380
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 231 place count 117 transition count 275
Iterating global reduction 3 with 35 rules applied. Total rules applied 266 place count 117 transition count 275
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 18 rules applied. Total rules applied 284 place count 117 transition count 257
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 290 place count 114 transition count 254
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 291 place count 113 transition count 252
Iterating global reduction 5 with 1 rules applied. Total rules applied 292 place count 113 transition count 252
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 293 place count 112 transition count 249
Iterating global reduction 5 with 1 rules applied. Total rules applied 294 place count 112 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 295 place count 112 transition count 248
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 6 with 28 rules applied. Total rules applied 323 place count 98 transition count 234
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 343 place count 88 transition count 250
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 354 place count 88 transition count 239
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 355 place count 87 transition count 236
Iterating global reduction 6 with 1 rules applied. Total rules applied 356 place count 87 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 357 place count 87 transition count 235
Free-agglomeration rule applied 24 times.
Iterating global reduction 7 with 24 rules applied. Total rules applied 381 place count 87 transition count 211
Reduce places removed 24 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 33 rules applied. Total rules applied 414 place count 63 transition count 202
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 420 place count 60 transition count 199
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 421 place count 60 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 422 place count 59 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 423 place count 58 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 424 place count 57 transition count 199
Applied a total of 424 rules in 291 ms. Remains 57 /246 variables (removed 189) and now considering 199/482 (removed 283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 312 ms. Remains : 57/246 places, 199/482 transitions.
RANDOM walk for 2008 steps (26 resets) in 99 ms. (20 steps per ms) remains 0/9 properties
Able to resolve query StableMarking after proving 177 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 9849 ms.
ITS solved all properties within timeout

BK_STOP 1717352801522

--------------------
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 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="MedleyA-PT-20"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is MedleyA-PT-20, 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 r590-smll-171734924900098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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