Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r201-smll-167840347600325.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is HealthRecord-PT-12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347600325
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.5K Feb 26 18:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 18:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 17:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 17:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 71K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-12-UpperBounds-00
FORMULA_NAME HealthRecord-PT-12-UpperBounds-01
FORMULA_NAME HealthRecord-PT-12-UpperBounds-02
FORMULA_NAME HealthRecord-PT-12-UpperBounds-03
FORMULA_NAME HealthRecord-PT-12-UpperBounds-04
FORMULA_NAME HealthRecord-PT-12-UpperBounds-05
FORMULA_NAME HealthRecord-PT-12-UpperBounds-06
FORMULA_NAME HealthRecord-PT-12-UpperBounds-07
FORMULA_NAME HealthRecord-PT-12-UpperBounds-08
FORMULA_NAME HealthRecord-PT-12-UpperBounds-09
FORMULA_NAME HealthRecord-PT-12-UpperBounds-10
FORMULA_NAME HealthRecord-PT-12-UpperBounds-11
FORMULA_NAME HealthRecord-PT-12-UpperBounds-12
FORMULA_NAME HealthRecord-PT-12-UpperBounds-13
FORMULA_NAME HealthRecord-PT-12-UpperBounds-14
FORMULA_NAME HealthRecord-PT-12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678640307416

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-12
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:58:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 16:58:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:58:31] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2023-03-12 16:58:31] [INFO ] Transformed 160 places.
[2023-03-12 16:58:31] [INFO ] Transformed 340 transitions.
[2023-03-12 16:58:31] [INFO ] Found NUPN structural information;
[2023-03-12 16:58:31] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 305 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA HealthRecord-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 300 out of 312 initially.
// Phase 1: matrix 300 rows 160 cols
[2023-03-12 16:58:31] [INFO ] Computed 18 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 723 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 15) seen :11
FORMULA HealthRecord-PT-12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 90 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
[2023-03-12 16:58:31] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
// Phase 1: matrix 300 rows 160 cols
[2023-03-12 16:58:31] [INFO ] Computed 18 place invariants in 11 ms
[2023-03-12 16:58:31] [INFO ] [Real]Absence check using 10 positive place invariants in 23 ms returned sat
[2023-03-12 16:58:31] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2023-03-12 16:58:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:58:32] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2023-03-12 16:58:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:58:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2023-03-12 16:58:32] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-12 16:58:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:58:32] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2023-03-12 16:58:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:58:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2023-03-12 16:58:32] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 5 ms to minimize.
[2023-03-12 16:58:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2023-03-12 16:58:32] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 72 ms.
[2023-03-12 16:58:33] [INFO ] Added : 29 causal constraints over 6 iterations in 337 ms. Result :sat
Minimization took 56 ms.
[2023-03-12 16:58:33] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-12 16:58:33] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-12 16:58:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:58:33] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2023-03-12 16:58:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:58:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-12 16:58:33] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-12 16:58:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:58:33] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2023-03-12 16:58:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-12 16:58:33] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 1 ms to minimize.
[2023-03-12 16:58:34] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2023-03-12 16:58:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 301 ms
[2023-03-12 16:58:34] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 51 ms.
[2023-03-12 16:58:34] [INFO ] Added : 21 causal constraints over 5 iterations in 237 ms. Result :sat
Minimization took 53 ms.
[2023-03-12 16:58:34] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-12 16:58:34] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-12 16:58:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:58:34] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2023-03-12 16:58:34] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-12 16:58:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:58:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-12 16:58:34] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-12 16:58:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:58:34] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2023-03-12 16:58:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-12 16:58:35] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 50 ms.
[2023-03-12 16:58:35] [INFO ] Added : 17 causal constraints over 5 iterations in 224 ms. Result :sat
Minimization took 50 ms.
[2023-03-12 16:58:35] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2023-03-12 16:58:35] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-12 16:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:58:35] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2023-03-12 16:58:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:58:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-12 16:58:35] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-12 16:58:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:58:35] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-12 16:58:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 16:58:35] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2023-03-12 16:58:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-12 16:58:35] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 47 ms.
[2023-03-12 16:58:36] [INFO ] Added : 12 causal constraints over 3 iterations in 172 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA HealthRecord-PT-12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-12-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 312/312 transitions.
Graph (trivial) has 242 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 6 ms
Free SCC test removed 4 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 678 edges and 156 vertex of which 128 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Drop transitions removed 117 transitions
Reduce isomorphic transitions removed 117 transitions.
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 128 transition count 162
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 201 place count 46 transition count 80
Iterating global reduction 1 with 82 rules applied. Total rules applied 283 place count 46 transition count 80
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 283 place count 46 transition count 74
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 295 place count 40 transition count 74
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 309 place count 26 transition count 54
Iterating global reduction 1 with 14 rules applied. Total rules applied 323 place count 26 transition count 54
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 332 place count 26 transition count 45
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 334 place count 24 transition count 42
Iterating global reduction 2 with 2 rules applied. Total rules applied 336 place count 24 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 337 place count 24 transition count 41
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 338 place count 23 transition count 40
Iterating global reduction 3 with 1 rules applied. Total rules applied 339 place count 23 transition count 40
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 342 place count 23 transition count 37
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 348 place count 20 transition count 34
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 349 place count 20 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 350 place count 19 transition count 32
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 13 edges and 16 vertex of which 8 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 356 place count 9 transition count 30
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 377 place count 8 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 378 place count 8 transition count 9
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 381 place count 6 transition count 8
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 383 place count 4 transition count 6
Applied a total of 383 rules in 80 ms. Remains 4 /160 variables (removed 156) and now considering 6/312 (removed 306) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 4/160 places, 6/312 transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-12 16:58:36] [INFO ] Computed 0 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 199878 resets, run finished after 701 ms. (steps per millisecond=1426 ) properties (out of 2) seen :2
FORMULA HealthRecord-PT-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6315 ms.
ITS solved all properties within timeout

BK_STOP 1678640318088

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -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="HealthRecord-PT-12"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is HealthRecord-PT-12, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r201-smll-167840347600325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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