Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r292-tall-162124156200291.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HealthRecord-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156200291
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.1K May 11 18:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 11 18:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 11 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 37K May 12 08:13 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 net-UpperBounds-00
FORMULA_NAME net-UpperBounds-01
FORMULA_NAME net-UpperBounds-02
FORMULA_NAME net-UpperBounds-03
FORMULA_NAME net-UpperBounds-04
FORMULA_NAME net-UpperBounds-05
FORMULA_NAME net-UpperBounds-06
FORMULA_NAME net-UpperBounds-07
FORMULA_NAME net-UpperBounds-08
FORMULA_NAME net-UpperBounds-09
FORMULA_NAME net-UpperBounds-10
FORMULA_NAME net-UpperBounds-11
FORMULA_NAME net-UpperBounds-12
FORMULA_NAME net-UpperBounds-13
FORMULA_NAME net-UpperBounds-14
FORMULA_NAME net-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621281220826

Running Version 0
[2021-05-17 19:53:56] [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]
[2021-05-17 19:53:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 19:53:56] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2021-05-17 19:53:56] [INFO ] Transformed 125 places.
[2021-05-17 19:53:56] [INFO ] Transformed 246 transitions.
[2021-05-17 19:53:56] [INFO ] Found NUPN structural information;
[2021-05-17 19:53:56] [INFO ] Parsed PT model containing 125 places and 246 transitions in 85 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Normalized transition count is 229 out of 237 initially.
// Phase 1: matrix 229 rows 125 cols
[2021-05-17 19:53:56] [INFO ] Computed 14 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 916 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :8
FORMULA net-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 119 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :1
FORMULA net-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 129 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :1
FORMULA net-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 119 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :2
FORMULA net-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA net-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2021-05-17 19:53:56] [INFO ] Flow matrix only has 229 transitions (discarded 8 similar events)
// Phase 1: matrix 229 rows 125 cols
[2021-05-17 19:53:56] [INFO ] Computed 14 place invariants in 5 ms
[2021-05-17 19:53:56] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-17 19:53:56] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 19:53:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:53:56] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-17 19:53:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 19:53:56] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:53:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:53:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-17 19:53:56] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 19:53:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:53:56] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-17 19:53:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:53:56] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 24 ms.
[2021-05-17 19:53:57] [INFO ] Added : 57 causal constraints over 13 iterations in 212 ms. Result :sat
Minimization took 24 ms.
[2021-05-17 19:53:57] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-17 19:53:57] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:53:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:53:57] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-17 19:53:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:53:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-17 19:53:57] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:53:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:53:57] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2021-05-17 19:53:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:53:57] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 17 ms.
[2021-05-17 19:53:57] [INFO ] Added : 53 causal constraints over 11 iterations in 140 ms. Result :sat
Minimization took 22 ms.
[2021-05-17 19:53:57] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-17 19:53:57] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:53:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:53:57] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-17 19:53:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:53:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 19:53:57] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-17 19:53:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:53:57] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-17 19:53:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:53:57] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 14 ms.
[2021-05-17 19:53:57] [INFO ] Added : 49 causal constraints over 10 iterations in 120 ms. Result :sat
Minimization took 21 ms.
[2021-05-17 19:53:57] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-17 19:53:57] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:53:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:53:57] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-17 19:53:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:53:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 19:53:57] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:53:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:53:58] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2021-05-17 19:53:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:53:58] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 15 ms.
[2021-05-17 19:53:58] [INFO ] Added : 53 causal constraints over 11 iterations in 128 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 9500 steps, including 553 resets, run finished after 36 ms. (steps per millisecond=263 ) properties (out of 4) seen :2 could not realise parikh vector
FORMULA net-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 8800 steps, including 391 resets, run finished after 34 ms. (steps per millisecond=258 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11800 steps, including 632 resets, run finished after 40 ms. (steps per millisecond=295 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 10500 steps, including 734 resets, run finished after 33 ms. (steps per millisecond=318 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 237/237 transitions.
Graph (trivial) has 181 edges and 125 vertex of which 4 / 125 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 459 edges and 123 vertex of which 116 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 222
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 114 transition count 218
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 13 place count 112 transition count 217
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 72 place count 53 transition count 99
Iterating global reduction 3 with 59 rules applied. Total rules applied 131 place count 53 transition count 99
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 141 place count 43 transition count 79
Iterating global reduction 3 with 10 rules applied. Total rules applied 151 place count 43 transition count 79
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 155 place count 43 transition count 75
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 158 place count 40 transition count 66
Iterating global reduction 4 with 3 rules applied. Total rules applied 161 place count 40 transition count 66
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 164 place count 37 transition count 60
Iterating global reduction 4 with 3 rules applied. Total rules applied 167 place count 37 transition count 60
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 170 place count 37 transition count 57
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 180 place count 32 transition count 80
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 183 place count 32 transition count 77
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 186 place count 29 transition count 77
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 189 place count 29 transition count 138
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 194 place count 26 transition count 136
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 195 place count 25 transition count 102
Iterating global reduction 7 with 1 rules applied. Total rules applied 196 place count 25 transition count 102
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 197 place count 24 transition count 100
Iterating global reduction 7 with 1 rules applied. Total rules applied 198 place count 24 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 202 place count 24 transition count 96
Applied a total of 202 rules in 60 ms. Remains 24 /125 variables (removed 101) and now considering 96/237 (removed 141) transitions.
[2021-05-17 19:53:58] [INFO ] Flow matrix only has 70 transitions (discarded 26 similar events)
// Phase 1: matrix 70 rows 24 cols
[2021-05-17 19:53:58] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-17 19:53:58] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/125 places, 96/237 transitions.
Successfully produced net in file /tmp/petri1000_16313162494433952972.dot
Successfully produced net in file /tmp/petri1001_9427492455680507015.dot
Successfully produced net in file /tmp/petri1002_3043553317184322120.dot
Successfully produced net in file /tmp/petri1003_1181508760949205295.dot
Successfully produced net in file /tmp/petri1004_13377986487554808832.dot
Successfully produced net in file /tmp/petri1005_12696402238659108674.dot
Successfully produced net in file /tmp/petri1006_1695990398484862941.dot
Drop transitions removed 7 transitions
Dominated transitions for bounds rules discarded 7 transitions
Normalized transition count is 63 out of 89 initially.
// Phase 1: matrix 63 rows 24 cols
[2021-05-17 19:53:58] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 335 resets, run finished after 1296 ms. (steps per millisecond=771 ) properties (out of 2) seen :2
FORMULA net-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621281240657

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-05, 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 r292-tall-162124156200291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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