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.r575-smll-171734919400021.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 MedleyA-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919400021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 26K Jun 2 16:33 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 MedleyA-PT-03-UpperBounds-00
FORMULA_NAME MedleyA-PT-03-UpperBounds-01
FORMULA_NAME MedleyA-PT-03-UpperBounds-02
FORMULA_NAME MedleyA-PT-03-UpperBounds-03
FORMULA_NAME MedleyA-PT-03-UpperBounds-04
FORMULA_NAME MedleyA-PT-03-UpperBounds-05
FORMULA_NAME MedleyA-PT-03-UpperBounds-06
FORMULA_NAME MedleyA-PT-03-UpperBounds-07
FORMULA_NAME MedleyA-PT-03-UpperBounds-08
FORMULA_NAME MedleyA-PT-03-UpperBounds-09
FORMULA_NAME MedleyA-PT-03-UpperBounds-10
FORMULA_NAME MedleyA-PT-03-UpperBounds-11
FORMULA_NAME MedleyA-PT-03-UpperBounds-12
FORMULA_NAME MedleyA-PT-03-UpperBounds-13
FORMULA_NAME MedleyA-PT-03-UpperBounds-14
FORMULA_NAME MedleyA-PT-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717352023910

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:13:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 18:13:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:13:46] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2024-06-02 18:13:46] [INFO ] Transformed 108 places.
[2024-06-02 18:13:46] [INFO ] Transformed 100 transitions.
[2024-06-02 18:13:46] [INFO ] Found NUPN structural information;
[2024-06-02 18:13:46] [INFO ] Parsed PT model containing 108 places and 100 transitions and 272 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 100 rows 108 cols
[2024-06-02 18:13:47] [INFO ] Computed 9 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (171 resets) in 68 ms. (144 steps per ms)
FORMULA MedleyA-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (45 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 18:13:47] [INFO ] Invariant cache hit.
[2024-06-02 18:13:47] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2024-06-02 18:13:47] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-06-02 18:13:47] [INFO ] Computed and/alt/rep : 97/162/97 causal constraints (skipped 2 transitions) in 33 ms.
[2024-06-02 18:13:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:13:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2024-06-02 18:13:48] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-06-02 18:13:48] [INFO ] Computed and/alt/rep : 97/162/97 causal constraints (skipped 2 transitions) in 24 ms.
[2024-06-02 18:13:49] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 28 ms to minimize.
[2024-06-02 18:13:49] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 3 ms to minimize.
[2024-06-02 18:13:49] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 3 ms to minimize.
[2024-06-02 18:13:49] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2024-06-02 18:13:49] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-06-02 18:13:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 640 ms
[2024-06-02 18:13:49] [INFO ] Added : 92 causal constraints over 19 iterations in 1023 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 108 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p92) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 99/99 transitions.
Graph (complete) has 183 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 106 transition count 74
Reduce places removed 25 places and 1 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 81 transition count 73
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 51 place count 81 transition count 67
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 63 place count 75 transition count 67
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 70 place count 68 transition count 60
Iterating global reduction 2 with 7 rules applied. Total rules applied 77 place count 68 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 77 place count 68 transition count 59
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 67 transition count 59
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 121 place count 46 transition count 38
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 46 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 45 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 44 transition count 36
Applied a total of 124 rules in 109 ms. Remains 44 /108 variables (removed 64) and now considering 36/99 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 44/108 places, 36/99 transitions.
// Phase 1: matrix 36 rows 44 cols
[2024-06-02 18:13:50] [INFO ] Computed 9 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (58236 resets) in 1088 ms. (918 steps per ms)
BEST_FIRST walk for 1000001 steps (20200 resets) in 456 ms. (2188 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 18:13:51] [INFO ] Invariant cache hit.
[2024-06-02 18:13:51] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-02 18:13:51] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-06-02 18:13:51] [INFO ] Computed and/alt/rep : 33/51/33 causal constraints (skipped 2 transitions) in 7 ms.
[2024-06-02 18:13:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:13:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-02 18:13:51] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-06-02 18:13:52] [INFO ] Computed and/alt/rep : 33/51/33 causal constraints (skipped 2 transitions) in 14 ms.
[2024-06-02 18:13:52] [INFO ] Added : 33 causal constraints over 7 iterations in 75 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 36/36 transitions.
Applied a total of 0 rules in 4 ms. Remains 44 /44 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 44/44 places, 36/36 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 36/36 transitions.
Applied a total of 0 rules in 4 ms. Remains 44 /44 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2024-06-02 18:13:52] [INFO ] Invariant cache hit.
[2024-06-02 18:13:52] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 18:13:52] [INFO ] Invariant cache hit.
[2024-06-02 18:13:52] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-06-02 18:13:52] [INFO ] Redundant transitions in 1 ms returned []
Running 35 sub problems to find dead transitions.
[2024-06-02 18:13:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 36/80 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 0/80 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 53 constraints, problems are : Problem set: 0 solved, 35 unsolved in 926 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 36/80 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 35/88 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 0/80 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 88 constraints, problems are : Problem set: 0 solved, 35 unsolved in 1165 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
After SMT, in 2165ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 2177ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2441 ms. Remains : 44/44 places, 36/36 transitions.
RANDOM walk for 40000 steps (2349 resets) in 925 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (786 resets) in 373 ms. (106 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (796 resets) in 288 ms. (138 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 652 steps, run visited all 2 properties in 22 ms. (steps per millisecond=29 )
Probabilistic random walk after 652 steps, saw 455 distinct states, run finished after 29 ms. (steps per millisecond=22 ) properties seen :2
FORMULA MedleyA-PT-03-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 8630 ms.
ITS solved all properties within timeout

BK_STOP 1717352035217

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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="MedleyA-PT-03"
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 MedleyA-PT-03, 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 r575-smll-171734919400021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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