Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r311-tall-171662337200733.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is RefineWMG-PT-025026, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662337200733
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 05:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 13 05:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 13 05:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 13 05:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 56K May 18 16:43 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 RefineWMG-PT-025026-UpperBounds-00
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-01
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-02
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-03
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-04
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-05
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-06
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-07
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-08
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-09
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-10
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-11
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-12
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-13
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-14
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716768418155

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-025026
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 00:06:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-27 00:06:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 00:06:59] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-05-27 00:06:59] [INFO ] Transformed 129 places.
[2024-05-27 00:06:59] [INFO ] Transformed 103 transitions.
[2024-05-27 00:06:59] [INFO ] Parsed PT model containing 129 places and 103 transitions and 308 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[26, 0, 0, 0, 0, 0, 26, 0, 0, 0, 26, 0, 0, 7, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[26, 0, 0, 0, 0, 0, 26, 0, 0, 0, 26, 0, 0, 7, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 103 rows 129 cols
[2024-05-27 00:06:59] [INFO ] Computed 52 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[26, 0, 0, 0, 0, 0, 26, 0, 0, 0, 26, 0, 0, 7, 0, 0] Max Struct:[26, 26, 26, 7, 26, 26, 26, 26, 26, 26, 26, 26, 7, 7, 7, 26]
FORMULA RefineWMG-PT-025026-UpperBounds-13 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-UpperBounds-10 26 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-UpperBounds-06 26 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-UpperBounds-00 26 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 32 ms. (303 steps per ms)
FORMULA RefineWMG-PT-025026-UpperBounds-08 26 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RefineWMG-PT-025026-UpperBounds-07 26 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RefineWMG-PT-025026-UpperBounds-05 26 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RefineWMG-PT-025026-UpperBounds-02 26 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RefineWMG-PT-025026-UpperBounds-01 26 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (14 resets) in 135 ms. (514 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 6, 0, 0, 0, 0, 0] Max Struct:[7, 26, 26, 26, 7, 7, 26]
[2024-05-27 00:06:59] [INFO ] Invariant cache hit.
[2024-05-27 00:06:59] [INFO ] [Real]Absence check using 52 positive place invariants in 14 ms returned sat
[2024-05-27 00:06:59] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-27 00:06:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:07:00] [INFO ] [Nat]Absence check using 52 positive place invariants in 9 ms returned sat
[2024-05-27 00:07:00] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-27 00:07:00] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-27 00:07:00] [INFO ] Added : 35 causal constraints over 7 iterations in 92 ms. Result :sat
Minimization took 99 ms.
[2024-05-27 00:07:00] [INFO ] [Real]Absence check using 52 positive place invariants in 9 ms returned sat
[2024-05-27 00:07:00] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-27 00:07:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:07:00] [INFO ] [Nat]Absence check using 52 positive place invariants in 7 ms returned sat
[2024-05-27 00:07:00] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-27 00:07:00] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-27 00:07:00] [INFO ] Added : 56 causal constraints over 12 iterations in 108 ms. Result :sat
Minimization took 28 ms.
[2024-05-27 00:07:00] [INFO ] [Real]Absence check using 52 positive place invariants in 15 ms returned sat
[2024-05-27 00:07:00] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-27 00:07:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:07:00] [INFO ] [Nat]Absence check using 52 positive place invariants in 8 ms returned sat
[2024-05-27 00:07:00] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-27 00:07:00] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-27 00:07:00] [INFO ] Added : 56 causal constraints over 12 iterations in 119 ms. Result :sat
Minimization took 32 ms.
[2024-05-27 00:07:00] [INFO ] [Real]Absence check using 52 positive place invariants in 10 ms returned sat
[2024-05-27 00:07:01] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-27 00:07:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:07:01] [INFO ] [Nat]Absence check using 52 positive place invariants in 9 ms returned sat
[2024-05-27 00:07:01] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-27 00:07:01] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-27 00:07:01] [INFO ] Added : 55 causal constraints over 11 iterations in 90 ms. Result :sat
Minimization took 25 ms.
[2024-05-27 00:07:01] [INFO ] [Real]Absence check using 52 positive place invariants in 6 ms returned sat
[2024-05-27 00:07:01] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-27 00:07:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:07:01] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2024-05-27 00:07:01] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-27 00:07:01] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-27 00:07:01] [INFO ] Added : 30 causal constraints over 6 iterations in 53 ms. Result :sat
Minimization took 91 ms.
[2024-05-27 00:07:01] [INFO ] [Real]Absence check using 52 positive place invariants in 6 ms returned sat
[2024-05-27 00:07:01] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-27 00:07:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:07:01] [INFO ] [Nat]Absence check using 52 positive place invariants in 7 ms returned sat
[2024-05-27 00:07:01] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-27 00:07:01] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-27 00:07:01] [INFO ] Added : 32 causal constraints over 7 iterations in 61 ms. Result :sat
Minimization took 32 ms.
[2024-05-27 00:07:01] [INFO ] [Real]Absence check using 52 positive place invariants in 7 ms returned sat
[2024-05-27 00:07:01] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-27 00:07:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:07:01] [INFO ] [Nat]Absence check using 52 positive place invariants in 7 ms returned sat
[2024-05-27 00:07:01] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-27 00:07:01] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 00:07:02] [INFO ] Added : 55 causal constraints over 11 iterations in 100 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 6, 0, 0, 0, 0, 0] Max Struct:[7, 26, 26, 26, 7, 7, 26]
FORMULA RefineWMG-PT-025026-UpperBounds-15 26 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RefineWMG-PT-025026-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RefineWMG-PT-025026-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RefineWMG-PT-025026-UpperBounds-11 26 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RefineWMG-PT-025026-UpperBounds-09 26 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RefineWMG-PT-025026-UpperBounds-04 26 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[7]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 75 edges and 129 vertex of which 50 / 129 are part of one of the 25 SCC in 4 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 79 transition count 53
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 101 place count 29 transition count 28
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 21 rules applied. Total rules applied 122 place count 29 transition count 7
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 22 rules applied. Total rules applied 144 place count 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 145 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 145 place count 7 transition count 5
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 147 place count 6 transition count 5
Applied a total of 147 rules in 63 ms. Remains 6 /129 variables (removed 123) and now considering 5/103 (removed 98) transitions.
Running 4 sub problems to find dead transitions.
// Phase 1: matrix 5 rows 6 cols
[2024-05-27 00:07:03] [INFO ] Computed 2 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 119ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 126ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 6/129 places, 5/103 transitions.
[2024-05-27 00:07:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[7]
FORMULA RefineWMG-PT-025026-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 307 ms. (3246 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 4519 ms.
ITS solved all properties within timeout

BK_STOP 1716768423861

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="RefineWMG-PT-025026"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is RefineWMG-PT-025026, 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 r311-tall-171662337200733"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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