fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r255-tall-167856440300058
Last Updated
May 14, 2023

About the Execution of 2022-gold for LeafsetExtension-PT-S08C3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
198.611 4968.00 11110.00 111.20 3 1 1 1 1 1 3 1 1 1 1 1 1 1 1 1 normal

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.r255-tall-167856440300058.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 gold2022
Input is LeafsetExtension-PT-S08C3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r255-tall-167856440300058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 13K Feb 25 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 16:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 254K 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 LeafsetExtension-PT-S08C3-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678751433425

Running Version 202205111006
[2023-03-13 23:50:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-13 23:50:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 23:50:34] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2023-03-13 23:50:34] [INFO ] Transformed 462 places.
[2023-03-13 23:50:34] [INFO ] Transformed 409 transitions.
[2023-03-13 23:50:34] [INFO ] Parsed PT model containing 462 places and 409 transitions in 199 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 409 rows 462 cols
[2023-03-13 23:50:34] [INFO ] Computed 53 place invariants in 35 ms
Incomplete random walk after 10000 steps, including 379 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :18
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :7
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :7
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :7
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :9
// Phase 1: matrix 409 rows 462 cols
[2023-03-13 23:50:35] [INFO ] Computed 53 place invariants in 14 ms
[2023-03-13 23:50:35] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-13 23:50:35] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-13 23:50:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:50:35] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-13 23:50:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:50:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-13 23:50:35] [INFO ] [Nat]Absence check using 11 positive and 42 generalized place invariants in 11 ms returned sat
[2023-03-13 23:50:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:50:35] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-13 23:50:35] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 40 ms.
[2023-03-13 23:50:35] [INFO ] Added : 14 causal constraints over 3 iterations in 181 ms. Result :sat
Minimization took 36 ms.
[2023-03-13 23:50:36] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2023-03-13 23:50:36] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 7 ms returned unsat
[2023-03-13 23:50:36] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-13 23:50:36] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 12 ms returned sat
[2023-03-13 23:50:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:50:36] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2023-03-13 23:50:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:50:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-13 23:50:36] [INFO ] [Nat]Absence check using 11 positive and 42 generalized place invariants in 14 ms returned sat
[2023-03-13 23:50:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:50:36] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-13 23:50:36] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 23 ms.
[2023-03-13 23:50:36] [INFO ] Added : 9 causal constraints over 2 iterations in 121 ms. Result :sat
Minimization took 31 ms.
[2023-03-13 23:50:36] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-13 23:50:36] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 10 ms returned unsat
[2023-03-13 23:50:36] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-13 23:50:36] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 9 ms returned unsat
[2023-03-13 23:50:36] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-13 23:50:36] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 7 ms returned unsat
[2023-03-13 23:50:36] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-13 23:50:36] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, 1, -1, 1, 1, 1, 1] Max seen :[2, 1, 2, 1, 1, 1, 1]
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 462 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 462/462 places, 409/409 transitions.
Graph (complete) has 849 edges and 462 vertex of which 53 are kept as prefixes of interest. Removing 409 places using SCC suffix rule.91 ms
Discarding 409 places :
Also discarding 231 output transitions
Drop transitions removed 231 transitions
Drop transitions removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 95 rules applied. Total rules applied 96 place count 45 transition count 91
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 15 rules applied. Total rules applied 111 place count 38 transition count 83
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 115 place count 34 transition count 83
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 115 place count 34 transition count 82
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 33 transition count 82
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 123 place count 27 transition count 76
Iterating global reduction 3 with 6 rules applied. Total rules applied 129 place count 27 transition count 76
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 132 place count 24 transition count 73
Iterating global reduction 3 with 3 rules applied. Total rules applied 135 place count 24 transition count 73
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 136 place count 23 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 136 place count 23 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 22 transition count 72
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 147 place count 22 transition count 63
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 156 place count 13 transition count 63
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 5 with 28 rules applied. Total rules applied 184 place count 13 transition count 35
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 185 place count 12 transition count 30
Iterating global reduction 5 with 1 rules applied. Total rules applied 186 place count 12 transition count 30
Applied a total of 186 rules in 120 ms. Remains 12 /462 variables (removed 450) and now considering 30/409 (removed 379) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/462 places, 30/409 transitions.
Successfully produced net in file /tmp/petri1000_9400939271813962446.dot
Successfully produced net in file /tmp/petri1001_263085936553903751.dot
Successfully produced net in file /tmp/petri1002_11475527438884843034.dot
Successfully produced net in file /tmp/petri1003_473733287928737870.dot
Successfully produced net in file /tmp/petri1004_4730241969901897943.dot
Successfully produced net in file /tmp/petri1005_9441191765220066100.dot
Drop transitions removed 6 transitions
Dominated transitions for bounds rules discarded 6 transitions
Normalized transition count is 14 out of 24 initially.
// Phase 1: matrix 14 rows 12 cols
[2023-03-13 23:50:37] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 129570 resets, run finished after 695 ms. (steps per millisecond=1438 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 22416 resets, run finished after 264 ms. (steps per millisecond=3787 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 26852 resets, run finished after 272 ms. (steps per millisecond=3676 ) properties (out of 2) seen :3
[2023-03-13 23:50:38] [INFO ] Flow matrix only has 14 transitions (discarded 10 similar events)
// Phase 1: matrix 14 rows 12 cols
[2023-03-13 23:50:38] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-13 23:50:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 23:50:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:50:38] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2023-03-13 23:50:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 23:50:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:50:38] [INFO ] [Real]Absence check using state equation in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : [3, 3] Max seen :[3, 3]
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 3687 ms.

BK_STOP 1678751438393

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="LeafsetExtension-PT-S08C3"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is LeafsetExtension-PT-S08C3, 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 r255-tall-167856440300058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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