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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13370.516 124971.00 192424.00 80.30 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-171654454900109.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-S06J04T04, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654454900109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.2K Apr 11 17:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 11 17:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 11 17:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 17:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 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 1717103540366

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-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:12:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:12:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:12:21] [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:12:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 21:12:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 726 ms
[2024-05-30 21:12:22] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 454 PT places and 7036.0 transition bindings in 27 ms.
[2024-05-30 21:12:22] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-30 21:12:22] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-05-30 21:12:22] [INFO ] Unfolded HLPN to a Petri net with 454 places and 6994 transitions 59152 arcs in 174 ms.
[2024-05-30 21:12:22] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-05-30 21:12:23] [INFO ] Unfolded HLPN to a Petri net with 454 places and 6994 transitions 59152 arcs in 95 ms.
[2024-05-30 21:12:23] [INFO ] Unfolded 65 HLPN properties in 3 ms.
[2024-05-30 21:12:23] [INFO ] Reduced 60 identical enabling conditions.
[2024-05-30 21:12:23] [INFO ] Reduced 640 identical enabling conditions.
[2024-05-30 21:12:23] [INFO ] Reduced 4680 identical enabling conditions.
[2024-05-30 21:12:23] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 0 ms.
[2024-05-30 21:12:23] [INFO ] Skeletonized 65 HLPN properties in 3 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_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2024-05-30 21:12:23] [INFO ] Unfolded HLPN to a Petri net with 454 places and 6994 transitions 59152 arcs in 78 ms.
[2024-05-30 21:12:23] [INFO ] Unfolded 65 HLPN properties in 1 ms.
[2024-05-30 21:12:23] [INFO ] Reduced 60 identical enabling conditions.
[2024-05-30 21:12:23] [INFO ] Reduced 640 identical enabling conditions.
[2024-05-30 21:12:23] [INFO ] Reduced 4680 identical enabling conditions.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.64891KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 454/454 places, 1614/1614 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 91 ms. Remains 454 /454 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
Running 1608 sub problems to find dead transitions.
[2024-05-30 21:12:23] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 454 cols
[2024-05-30 21:12:23] [INFO ] Computed 50 invariants in 112 ms
[2024-05-30 21:12:23] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-30 21:12:53] [INFO ] Deduced a trap composed of 85 places in 318 ms of which 32 ms to minimize.
[2024-05-30 21:12:54] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 2 ms to minimize.
[2024-05-30 21:12:54] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 14 ms to minimize.
[2024-05-30 21:13:04] [INFO ] Deduced a trap composed of 251 places in 10207 ms of which 29 ms to minimize.
SMT process timed out in 41401ms, After SMT, problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 41495ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 41667 ms. Remains : 454/454 places, 1614/1614 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 454/454 places, 1614/1614 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 74 ms. Remains 454 /454 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
[2024-05-30 21:13:05] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-05-30 21:13:05] [INFO ] Invariant cache hit.
[2024-05-30 21:13:05] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-30 21:13:05] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-05-30 21:13:05] [INFO ] Invariant cache hit.
[2024-05-30 21:13:05] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-30 21:13:05] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 993 ms to find 0 implicit places.
[2024-05-30 21:13:06] [INFO ] Redundant transitions in 131 ms returned []
Running 1608 sub problems to find dead transitions.
[2024-05-30 21:13:06] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-05-30 21:13:06] [INFO ] Invariant cache hit.
[2024-05-30 21:13:06] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-30 21:13:35] [INFO ] Deduced a trap composed of 85 places in 181 ms of which 1 ms to minimize.
[2024-05-30 21:13:35] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 1 ms to minimize.
[2024-05-30 21:13:35] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 1 ms to minimize.
[2024-05-30 21:13:36] [INFO ] Deduced a trap composed of 242 places in 426 ms of which 5 ms to minimize.
[2024-05-30 21:13:37] [INFO ] Deduced a trap composed of 232 places in 509 ms of which 5 ms to minimize.
[2024-05-30 21:13:37] [INFO ] Deduced a trap composed of 119 places in 413 ms of which 5 ms to minimize.
[2024-05-30 21:13:37] [INFO ] Deduced a trap composed of 131 places in 361 ms of which 3 ms to minimize.
[2024-05-30 21:13:38] [INFO ] Deduced a trap composed of 225 places in 434 ms of which 3 ms to minimize.
[2024-05-30 21:13:39] [INFO ] Deduced a trap composed of 48 places in 441 ms of which 2 ms to minimize.
[2024-05-30 21:13:41] [INFO ] Deduced a trap composed of 282 places in 515 ms of which 3 ms to minimize.
[2024-05-30 21:13:41] [INFO ] Deduced a trap composed of 85 places in 419 ms of which 3 ms to minimize.
[2024-05-30 21:13:41] [INFO ] Deduced a trap composed of 228 places in 475 ms of which 3 ms to minimize.
[2024-05-30 21:13:42] [INFO ] Deduced a trap composed of 41 places in 496 ms of which 3 ms to minimize.
[2024-05-30 21:13:42] [INFO ] Deduced a trap composed of 250 places in 472 ms of which 3 ms to minimize.
[2024-05-30 21:13:43] [INFO ] Deduced a trap composed of 272 places in 382 ms of which 3 ms to minimize.
[2024-05-30 21:13:43] [INFO ] Deduced a trap composed of 269 places in 503 ms of which 3 ms to minimize.
[2024-05-30 21:13:44] [INFO ] Deduced a trap composed of 255 places in 394 ms of which 3 ms to minimize.
[2024-05-30 21:13:44] [INFO ] Deduced a trap composed of 61 places in 380 ms of which 3 ms to minimize.
[2024-05-30 21:13:45] [INFO ] Deduced a trap composed of 11 places in 411 ms of which 3 ms to minimize.
[2024-05-30 21:13:45] [INFO ] Deduced a trap composed of 241 places in 433 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/2044 variables, and 58 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 11/19 constraints, Generalized P Invariants (flows): 27/31 constraints, State Equation: 0/454 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-30 21:14:01] [INFO ] Deduced a trap composed of 211 places in 344 ms of which 4 ms to minimize.
[2024-05-30 21:14:02] [INFO ] Deduced a trap composed of 228 places in 282 ms of which 4 ms to minimize.
[2024-05-30 21:14:02] [INFO ] Deduced a trap composed of 219 places in 395 ms of which 2 ms to minimize.
[2024-05-30 21:14:19] [INFO ] Deduced a trap composed of 199 places in 539 ms of which 6 ms to minimize.
[2024-05-30 21:14:20] [INFO ] Deduced a trap composed of 210 places in 460 ms of which 3 ms to minimize.
[2024-05-30 21:14:21] [INFO ] Deduced a trap composed of 47 places in 446 ms of which 2 ms to minimize.
[2024-05-30 21:14:24] [INFO ] Deduced a trap composed of 163 places in 444 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 9)
(s83 0)
(s84 1)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 1)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 1)
(s249 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/2044 variables, and 65 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 11/19 constraints, Generalized P Invariants (flows): 27/31 constraints, State Equation: 0/454 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 27/27 constraints]
After SMT, in 78963ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 79013ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 80241 ms. Remains : 454/454 places, 1614/1614 transitions.
Finished random walk after 27 steps, including 0 resets, run found a deadlock after 4 ms. (steps per millisecond=6 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 123501 ms.
ITS solved all properties within timeout

BK_STOP 1717103665337

--------------------
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-S06J04T04"
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-S06J04T04, 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-171654454900109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J04T04.tgz
mv PolyORBLF-COL-S06J04T04 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 ;