About the Execution of 2024-gold for PolyORBLF-PT-S06J06T04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15685.290 | 123649.00 | 176596.00 | 436.30 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r168-tall-174881266800332.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is PolyORBLF-PT-S06J06T04, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881266800332
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.2M
-rw-r--r-- 1 mcc users 19K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 146K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 649K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 28K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 181K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 190K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 878K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 6.9M May 29 14:32 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 QuasiLiveness
=== Now, execution of the tool begins
BK_START 1748900471260
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:41:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-02 21:41:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:41:12] [INFO ] Load time of PNML (sax parser for PT used): 405 ms
[2025-06-02 21:41:12] [INFO ] Transformed 506 places.
[2025-06-02 21:41:13] [INFO ] Transformed 7154 transitions.
[2025-06-02 21:41:13] [INFO ] Parsed PT model containing 506 places and 7154 transitions and 59824 arcs in 566 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 506/506 places, 7154/7154 transitions.
Ensure Unique test removed 6 places
Ensure Unique test removed 5380 transitions
Reduce isomorphic transitions removed 5380 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 5422 rules applied. Total rules applied 5422 place count 500 transition count 1738
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 5458 place count 464 transition count 1738
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 5458 place count 464 transition count 1682
Deduced a syphon composed of 56 places in 10 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 5570 place count 408 transition count 1682
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 5 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 5666 place count 360 transition count 1634
Applied a total of 5666 rules in 178 ms. Remains 360 /506 variables (removed 146) and now considering 1634/7154 (removed 5520) transitions.
Running 1628 sub problems to find dead transitions.
[2025-06-02 21:41:13] [INFO ] Flow matrix only has 1610 transitions (discarded 24 similar events)
// Phase 1: matrix 1610 rows 360 cols
[2025-06-02 21:41:13] [INFO ] Computed 48 invariants in 70 ms
[2025-06-02 21:41:13] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
[2025-06-02 21:41:37] [INFO ] Deduced a trap composed of 11 places in 346 ms of which 16 ms to minimize.
[2025-06-02 21:41:45] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 354/1970 variables, and 43 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 20076 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 25/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1628 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
[2025-06-02 21:41:53] [INFO ] Deduced a trap composed of 98 places in 206 ms of which 2 ms to minimize.
[2025-06-02 21:41:54] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/1970 variables, and 45 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 25/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1628 constraints, Known Traps: 4/4 constraints]
After SMT, in 53450ms problems are : Problem set: 0 solved, 1628 unsolved
Search for dead transitions found 0 dead transitions in 53497ms
[2025-06-02 21:42:06] [INFO ] Flow matrix only has 1610 transitions (discarded 24 similar events)
[2025-06-02 21:42:06] [INFO ] Invariant cache hit.
[2025-06-02 21:42:07] [INFO ] Implicit Places using invariants in 533 ms returned [18, 72, 149, 299]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 542 ms to find 4 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 356/506 places, 1634/7154 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 54287 ms. Remains : 356/506 places, 1634/7154 transitions.
Initial state reduction rules removed 6 formulas.
RANDOM walk for 40000 steps (358 resets) in 5062 ms. (7 steps per ms) remains 674/1628 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 674/674 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 674/674 properties
[2025-06-02 21:42:08] [INFO ] Flow matrix only has 1610 transitions (discarded 24 similar events)
// Phase 1: matrix 1610 rows 356 cols
[2025-06-02 21:42:09] [INFO ] Computed 44 invariants in 55 ms
[2025-06-02 21:42:09] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Problem qltransition_31 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
SMT process timed out in 12648ms, After SMT, problems are : Problem set: 0 solved, 674 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 1634/1634 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 352 transition count 1630
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 352 transition count 1630
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 352 transition count 1628
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 350 transition count 1628
Applied a total of 12 rules in 193 ms. Remains 350 /356 variables (removed 6) and now considering 1628/1634 (removed 6) transitions.
Running 1622 sub problems to find dead transitions.
[2025-06-02 21:42:21] [INFO ] Flow matrix only has 1604 transitions (discarded 24 similar events)
// Phase 1: matrix 1604 rows 350 cols
[2025-06-02 21:42:21] [INFO ] Computed 44 invariants in 33 ms
[2025-06-02 21:42:21] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
[2025-06-02 21:42:44] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 344/1954 variables, and 38 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/350 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1622 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/344 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
[2025-06-02 21:43:00] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2025-06-02 21:43:00] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2025-06-02 21:43:11] [INFO ] Deduced a trap composed of 98 places in 202 ms of which 2 ms to minimize.
[2025-06-02 21:43:11] [INFO ] Deduced a trap composed of 102 places in 222 ms of which 3 ms to minimize.
[2025-06-02 21:43:11] [INFO ] Deduced a trap composed of 82 places in 217 ms of which 2 ms to minimize.
[2025-06-02 21:43:13] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 1 ms to minimize.
[2025-06-02 21:43:13] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 344/1954 variables, and 45 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/350 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1622 constraints, Known Traps: 8/8 constraints]
After SMT, in 52984ms problems are : Problem set: 0 solved, 1622 unsolved
Search for dead transitions found 0 dead transitions in 53000ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53199 ms. Remains : 350/356 places, 1628/1634 transitions.
Total runtime 122396 ms.
ITS solved all properties within timeout
BK_STOP 1748900594909
--------------------
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 QuasiLiveness -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-PT-S06J06T04"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is PolyORBLF-PT-S06J06T04, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-174881266800332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J06T04.tgz
mv PolyORBLF-PT-S06J06T04 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;