About the Execution of GreatSPN+red for NeighborGrid-PT-d4n3m2c23
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.r245-tall-171654349900429.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 NeighborGrid-PT-d4n3m2c23, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349900429
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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 4.5K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 00:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 12 00:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 11 22:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 22:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rwxr-xr-x 1 mcc users 469K 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 NeighborGrid-PT-d4n3m2c23-UpperBounds-00
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-01
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-02
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-03
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-04
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-05
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-06
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-07
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-08
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-09
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-10
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-11
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-12
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-13
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-14
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716665789175
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeighborGrid-PT-d4n3m2c23
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 19:36:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-25 19:36:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 19:36:30] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-05-25 19:36:30] [INFO ] Transformed 81 places.
[2024-05-25 19:36:30] [INFO ] Transformed 1632 transitions.
[2024-05-25 19:36:30] [INFO ] Parsed PT model containing 81 places and 1632 transitions and 3264 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] 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:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 1632 rows 81 cols
[2024-05-25 19:36:30] [INFO ] Computed 1 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162]
RANDOM walk for 10004 steps (2 resets) in 94 ms. (105 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 285 ms. (559 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[24, 48, 105, 37, 5, 45, 46, 64, 46, 14, 8, 79, 16, 50, 20, 64] Max Struct:[162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162]
[2024-05-25 19:36:31] [INFO ] Invariant cache hit.
[2024-05-25 19:36:31] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-25 19:36:31] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2024-05-25 19:36:31] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 87 ms.
[2024-05-25 19:36:31] [INFO ] Added : 0 causal constraints over 0 iterations in 223 ms. Result :sat
Minimization took 611 ms.
[2024-05-25 19:36:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 19:36:32] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2024-05-25 19:36:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 80 ms.
[2024-05-25 19:36:32] [INFO ] Added : 0 causal constraints over 0 iterations in 179 ms. Result :sat
Minimization took 441 ms.
[2024-05-25 19:36:33] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-25 19:36:33] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2024-05-25 19:36:33] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 68 ms.
[2024-05-25 19:36:33] [INFO ] Added : 0 causal constraints over 0 iterations in 166 ms. Result :sat
Minimization took 441 ms.
[2024-05-25 19:36:34] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-25 19:36:34] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2024-05-25 19:36:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 70 ms.
[2024-05-25 19:36:34] [INFO ] Added : 0 causal constraints over 0 iterations in 165 ms. Result :sat
Minimization took 438 ms.
[2024-05-25 19:36:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 19:36:35] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-25 19:36:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 73 ms.
[2024-05-25 19:36:35] [INFO ] Added : 0 causal constraints over 0 iterations in 166 ms. Result :sat
Minimization took 425 ms.
[2024-05-25 19:36:36] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-25 19:36:36] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2024-05-25 19:36:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 71 ms.
[2024-05-25 19:36:36] [INFO ] Added : 0 causal constraints over 0 iterations in 160 ms. Result :sat
Minimization took 428 ms.
[2024-05-25 19:36:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 19:36:37] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2024-05-25 19:36:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 71 ms.
[2024-05-25 19:36:37] [INFO ] Added : 0 causal constraints over 0 iterations in 170 ms. Result :sat
Minimization took 417 ms.
[2024-05-25 19:36:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 19:36:38] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2024-05-25 19:36:38] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 59 ms.
[2024-05-25 19:36:38] [INFO ] Added : 0 causal constraints over 0 iterations in 161 ms. Result :sat
Minimization took 429 ms.
[2024-05-25 19:36:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 19:36:39] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2024-05-25 19:36:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 66 ms.
[2024-05-25 19:36:39] [INFO ] Added : 0 causal constraints over 0 iterations in 148 ms. Result :sat
Minimization took 420 ms.
[2024-05-25 19:36:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 19:36:40] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2024-05-25 19:36:40] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 67 ms.
[2024-05-25 19:36:40] [INFO ] Added : 0 causal constraints over 0 iterations in 157 ms. Result :sat
Minimization took 426 ms.
[2024-05-25 19:36:41] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-25 19:36:41] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-05-25 19:36:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 68 ms.
[2024-05-25 19:36:41] [INFO ] Added : 0 causal constraints over 0 iterations in 151 ms. Result :sat
Minimization took 422 ms.
[2024-05-25 19:36:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 19:36:42] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2024-05-25 19:36:42] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 64 ms.
[2024-05-25 19:36:42] [INFO ] Added : 0 causal constraints over 0 iterations in 139 ms. Result :sat
Minimization took 428 ms.
[2024-05-25 19:36:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 19:36:43] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-25 19:36:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 56 ms.
[2024-05-25 19:36:43] [INFO ] Added : 0 causal constraints over 0 iterations in 137 ms. Result :sat
Minimization took 429 ms.
[2024-05-25 19:36:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 19:36:44] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2024-05-25 19:36:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 90 ms.
[2024-05-25 19:36:44] [INFO ] Added : 0 causal constraints over 0 iterations in 192 ms. Result :sat
Minimization took 432 ms.
[2024-05-25 19:36:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 19:36:45] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2024-05-25 19:36:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 67 ms.
[2024-05-25 19:36:45] [INFO ] Added : 0 causal constraints over 0 iterations in 162 ms. Result :sat
Minimization took 431 ms.
[2024-05-25 19:36:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 19:36:46] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2024-05-25 19:36:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 64 ms.
[2024-05-25 19:36:46] [INFO ] Added : 0 causal constraints over 0 iterations in 144 ms. Result :sat
Minimization took 428 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[24, 48, 105, 37, 5, 45, 46, 64, 46, 14, 8, 79, 16, 50, 20, 64] Max Struct:[162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162]
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-15 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-14 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-13 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-12 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-11 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-10 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-09 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-08 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-07 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-06 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-05 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-04 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-03 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-02 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[88, 162] Max Struct:[162, 162]
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1550 edges and 81 vertex of which 79 / 81 are part of one of the 1 SCC in 4 ms
Free SCC test removed 78 places
Drop transitions (Empty/Sink Transition effects.) removed 1550 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 1628 transitions.
Applied a total of 1 rules in 33 ms. Remains 3 /81 variables (removed 78) and now considering 4/1632 (removed 1628) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 3/81 places, 4/1632 transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 19:37:07] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[88, 162] Max Struct:[162, 162]
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-01 162 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000107 steps (2 resets) in 172 ms. (5780 steps per ms)
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-00 162 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 233 ms. (4273 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 37724 ms.
ITS solved all properties within timeout
BK_STOP 1716665828174
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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="NeighborGrid-PT-d4n3m2c23"
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 NeighborGrid-PT-d4n3m2c23, 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 r245-tall-171654349900429"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeighborGrid-PT-d4n3m2c23.tgz
mv NeighborGrid-PT-d4n3m2c23 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 '
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 ;