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.r518-tajo-171654455500059.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 ltsminxred
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 r518-tajo-171654455500059
=====================================================================

--------------------
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 1717269313189

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:15:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-06-01 19:15:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:15:14] [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-06-01 19:15:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 19:15:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 636 ms
[2024-06-01 19:15:15] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 22 ms.
[2024-06-01 19:15:15] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2024-06-01 19:15:15] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-06-01 19:15:15] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 44 ms.
[2024-06-01 19:15:15] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-06-01 19:15:15] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 16 ms.
[2024-06-01 19:15:15] [INFO ] Unfolded 65 HLPN properties in 1 ms.
[2024-06-01 19:15:15] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 19:15:15] [INFO ] Reduced 40 identical enabling conditions.
[2024-06-01 19:15:15] [INFO ] Reduced 110 identical enabling conditions.
[2024-06-01 19:15:15] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 1 ms.
[2024-06-01 19:15:15] [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-06-01 19:15:15] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 20 ms.
[2024-06-01 19:15:15] [INFO ] Unfolded 65 HLPN properties in 1 ms.
[2024-06-01 19:15:15] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 19:15:15] [INFO ] Reduced 40 identical enabling conditions.
[2024-06-01 19:15:15] [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 3 ms.28276KB 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 79 ms. Remains 752 /752 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-06-01 19:15:15] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-06-01 19:15:15] [INFO ] Computed 54 invariants in 95 ms
[2024-06-01 19:15:15] [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-06-01 19:15:33] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 24 ms to minimize.
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 3 ms to minimize.
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 3 ms to minimize.
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:15:34] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 373 places in 1380 ms of which 6 ms to minimize.
[2024-06-01 19:15:36] [INFO ] Deduced a trap composed of 381 places in 379 ms of which 5 ms to minimize.
[2024-06-01 19:15:36] [INFO ] Deduced a trap composed of 237 places in 356 ms of which 5 ms to minimize.
[2024-06-01 19:15:37] [INFO ] Deduced a trap composed of 57 places in 184 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.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 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/2144 variables, and 63 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20098 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: 13/13 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, 13/63 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 19:15:39] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:15:41] [INFO ] Deduced a trap composed of 423 places in 385 ms of which 5 ms to minimize.
[2024-06-01 19:15:53] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 3 ms to minimize.
[2024-06-01 19:15:54] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 3 ms to minimize.
[2024-06-01 19:15:54] [INFO ] Deduced a trap composed of 84 places in 195 ms of which 3 ms to minimize.
[2024-06-01 19:15:54] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/2144 variables, and 69 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20028 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: 19/19 constraints]
After SMT, in 42351ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 42399ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 42526 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-06-01 19:15:58] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 19:15:58] [INFO ] Invariant cache hit.
[2024-06-01 19:15:58] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-01 19:15:58] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 19:15:58] [INFO ] Invariant cache hit.
[2024-06-01 19:15:58] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 19:15:58] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2024-06-01 19:15:59] [INFO ] Redundant transitions in 102 ms returned []
Running 1410 sub problems to find dead transitions.
[2024-06-01 19:15:59] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 19:15:59] [INFO ] Invariant cache hit.
[2024-06-01 19:15:59] [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-06-01 19:16:17] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:16:22] [INFO ] Deduced a trap composed of 66 places in 205 ms of which 3 ms to minimize.
[2024-06-01 19:16:23] [INFO ] Deduced a trap composed of 65 places in 174 ms of which 4 ms to minimize.
[2024-06-01 19:16:23] [INFO ] Deduced a trap composed of 65 places in 215 ms of which 3 ms to minimize.
[2024-06-01 19:16:23] [INFO ] Deduced a trap composed of 66 places in 206 ms of which 3 ms to minimize.
[2024-06-01 19:16:23] [INFO ] Deduced a trap composed of 59 places in 193 ms of which 3 ms to minimize.
[2024-06-01 19:16:23] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:16:23] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:16:24] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:16:24] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:16:24] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:16:26] [INFO ] Deduced a trap composed of 432 places in 360 ms of which 5 ms to minimize.
[2024-06-01 19:16:27] [INFO ] Deduced a trap composed of 397 places in 389 ms of which 6 ms to minimize.
[2024-06-01 19:16:27] [INFO ] Deduced a trap composed of 369 places in 354 ms of which 4 ms to minimize.
[2024-06-01 19:16:28] [INFO ] Deduced a trap composed of 384 places in 328 ms of which 5 ms to minimize.
[2024-06-01 19:16:28] [INFO ] Deduced a trap composed of 424 places in 288 ms of which 7 ms to minimize.
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 30034 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-06-01 19:16:33] [INFO ] Deduced a trap composed of 205 places in 382 ms of which 5 ms to minimize.
[2024-06-01 19:16:34] [INFO ] Deduced a trap composed of 246 places in 356 ms of which 6 ms to minimize.
[2024-06-01 19:16:34] [INFO ] Deduced a trap composed of 381 places in 399 ms of which 5 ms to minimize.
[2024-06-01 19:16:35] [INFO ] Deduced a trap composed of 451 places in 371 ms of which 5 ms to minimize.
[2024-06-01 19:16:36] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 4 ms to minimize.
[2024-06-01 19:16:44] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 4 ms to minimize.
[2024-06-01 19:16:46] [INFO ] Deduced a trap composed of 415 places in 396 ms of which 5 ms to minimize.
[2024-06-01 19:16:54] [INFO ] Deduced a trap composed of 402 places in 349 ms of which 6 ms to minimize.
[2024-06-01 19:16:56] [INFO ] Deduced a trap composed of 377 places in 353 ms of which 5 ms to minimize.
[2024-06-01 19:16:56] [INFO ] Deduced a trap composed of 402 places in 366 ms of which 5 ms to minimize.
[2024-06-01 19:16:56] [INFO ] Deduced a trap composed of 369 places in 368 ms of which 6 ms to minimize.
[2024-06-01 19:17:00] [INFO ] Deduced a trap composed of 524 places in 344 ms of which 6 ms to minimize.
[2024-06-01 19:17:01] [INFO ] Deduced a trap composed of 462 places in 333 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30026 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 62446ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 62469ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 63430 ms. Remains : 752/752 places, 1412/1412 transitions.
Finished random walk after 4579 steps, including 0 resets, run found a deadlock after 49 ms. (steps per millisecond=93 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 107004 ms.
ITS solved all properties within timeout

BK_STOP 1717269421655

--------------------
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="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 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 r518-tajo-171654455500059"
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 ;