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.r199-smll-167840345500109.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 lolaxred
Input is GPUForwardProgress-PT-28b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840345500109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.3K Feb 25 14:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 14:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 14:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 14:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 14:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 14:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 14:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 14:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 141K 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 GPUForwardProgress-PT-28b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678477962186

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-28b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 19:52:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 19:52:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 19:52:45] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2023-03-10 19:52:45] [INFO ] Transformed 568 places.
[2023-03-10 19:52:45] [INFO ] Transformed 597 transitions.
[2023-03-10 19:52:45] [INFO ] Found NUPN structural information;
[2023-03-10 19:52:45] [INFO ] Parsed PT model containing 568 places and 597 transitions and 1477 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 597 rows 568 cols
[2023-03-10 19:52:45] [INFO ] Computed 30 place invariants in 34 ms
Incomplete random walk after 10000 steps, including 41 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :10
FORMULA GPUForwardProgress-PT-28b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
[2023-03-10 19:52:45] [INFO ] Invariant cache hit.
[2023-03-10 19:52:46] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 48 ms returned sat
[2023-03-10 19:52:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:52:46] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2023-03-10 19:52:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:52:47] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 46 ms returned sat
[2023-03-10 19:52:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:52:47] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2023-03-10 19:52:47] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 105 ms.
[2023-03-10 19:52:49] [INFO ] Added : 154 causal constraints over 31 iterations in 1825 ms. Result :sat
Minimization took 160 ms.
[2023-03-10 19:52:49] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 48 ms returned sat
[2023-03-10 19:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:52:50] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2023-03-10 19:52:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:52:50] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 43 ms returned sat
[2023-03-10 19:52:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:52:50] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2023-03-10 19:52:50] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 61 ms.
[2023-03-10 19:52:53] [INFO ] Added : 188 causal constraints over 38 iterations in 2229 ms. Result :sat
Minimization took 194 ms.
[2023-03-10 19:52:53] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 39 ms returned sat
[2023-03-10 19:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:52:53] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2023-03-10 19:52:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:52:54] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 43 ms returned sat
[2023-03-10 19:52:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:52:54] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2023-03-10 19:52:54] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 65 ms.
[2023-03-10 19:52:56] [INFO ] Added : 201 causal constraints over 41 iterations in 2177 ms. Result :sat
Minimization took 196 ms.
[2023-03-10 19:52:57] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 26 ms returned sat
[2023-03-10 19:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:52:57] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2023-03-10 19:52:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:52:57] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 41 ms returned sat
[2023-03-10 19:52:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:52:58] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2023-03-10 19:52:58] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 54 ms.
[2023-03-10 19:52:59] [INFO ] Added : 161 causal constraints over 33 iterations in 1665 ms. Result :sat
Minimization took 102 ms.
[2023-03-10 19:53:00] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 32 ms returned sat
[2023-03-10 19:53:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:53:00] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2023-03-10 19:53:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:53:00] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 30 ms returned sat
[2023-03-10 19:53:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:53:01] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2023-03-10 19:53:01] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 38 ms.
[2023-03-10 19:53:03] [INFO ] Added : 216 causal constraints over 44 iterations in 2539 ms. Result :sat
Minimization took 195 ms.
[2023-03-10 19:53:04] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 25 ms returned sat
[2023-03-10 19:53:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:53:04] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2023-03-10 19:53:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:53:04] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 40 ms returned sat
[2023-03-10 19:53:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:53:04] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2023-03-10 19:53:04] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 68 ms.
[2023-03-10 19:53:07] [INFO ] Added : 196 causal constraints over 40 iterations in 2343 ms. Result :sat
Minimization took 179 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA GPUForwardProgress-PT-28b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 597/597 transitions.
Graph (trivial) has 508 edges and 568 vertex of which 7 / 568 are part of one of the 1 SCC in 17 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 323 rules applied. Total rules applied 324 place count 561 transition count 267
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 352 rules applied. Total rules applied 676 place count 239 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 677 place count 238 transition count 237
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 677 place count 238 transition count 179
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 793 place count 180 transition count 179
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 796 place count 177 transition count 176
Iterating global reduction 3 with 3 rules applied. Total rules applied 799 place count 177 transition count 176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 799 place count 177 transition count 175
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 801 place count 176 transition count 175
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 969 place count 92 transition count 91
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 996 place count 92 transition count 64
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 999 place count 92 transition count 61
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1002 place count 89 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1003 place count 88 transition count 60
Applied a total of 1003 rules in 203 ms. Remains 88 /568 variables (removed 480) and now considering 60/597 (removed 537) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 88/568 places, 60/597 transitions.
// Phase 1: matrix 60 rows 88 cols
[2023-03-10 19:53:08] [INFO ] Computed 29 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 10803 resets, run finished after 4282 ms. (steps per millisecond=233 ) properties (out of 2) seen :2
FORMULA GPUForwardProgress-PT-28b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 27328 ms.
ITS solved all properties within timeout

BK_STOP 1678477993867

--------------------
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="GPUForwardProgress-PT-28b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is GPUForwardProgress-PT-28b, 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 r199-smll-167840345500109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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