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.r179-tall-171640600900165.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 FunctionPointer-PT-a002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640600900165
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 16:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 16:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 16:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 11 16:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 34K May 18 16:42 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 FunctionPointer-PT-a002-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716430846197

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-a002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:20:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 02:20:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:20:47] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-23 02:20:47] [INFO ] Transformed 40 places.
[2024-05-23 02:20:47] [INFO ] Transformed 70 transitions.
[2024-05-23 02:20:47] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 4 transitions.
FORMULA FunctionPointer-PT-a002-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:20:47] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2024-05-23 02:20:47] [INFO ] Computed 4 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1, +inf, 2, +inf, 1, 1, 1, 1, 2, +inf]
FORMULA FunctionPointer-PT-a002-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (67 resets) in 35 ms. (277 steps per ms)
FORMULA FunctionPointer-PT-a002-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60003 steps (48 resets) in 60 ms. (983 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[76, 16, 46, 90, 9, 127] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:20:47] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2024-05-23 02:20:47] [INFO ] Invariant cache hit.
[2024-05-23 02:20:47] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 02:20:47] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:20:47] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 02:20:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 02:20:47] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:20:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:20:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:20:47] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 7 ms to minimize.
[2024-05-23 02:20:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-23 02:20:48] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 7 ms.
[2024-05-23 02:20:48] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 10 ms.
[2024-05-23 02:20:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:20:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:20:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-23 02:20:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-23 02:20:48] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-23 02:20:48] [INFO ] Added : 13 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 9 ms.
[2024-05-23 02:20:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:20:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:20:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-23 02:20:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-23 02:20:48] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-23 02:20:48] [INFO ] Added : 14 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 13 ms.
[2024-05-23 02:20:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:20:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-23 02:20:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-23 02:20:48] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-23 02:20:48] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2024-05-23 02:20:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:20:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-23 02:20:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-05-23 02:20:48] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-23 02:20:48] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 11 ms.
[2024-05-23 02:20:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:20:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 02:20:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:20:48] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-23 02:20:48] [INFO ] Added : 19 causal constraints over 7 iterations in 47 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[76, 16, 46, 90, 9, 127] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[77, 103, 46, 90, 9, 161] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 118 edges and 34 vertex of which 29 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 29 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 29 transition count 58
Applied a total of 9 rules in 30 ms. Remains 29 /34 variables (removed 5) and now considering 58/66 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 29/34 places, 58/66 transitions.
[2024-05-23 02:20:49] [INFO ] Flow matrix only has 41 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 4=1, 6=1, 20=1, 28=1, 38=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {3=1, 20=1, 30=1, 40=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :[2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, +inf, +inf, +inf, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:20:49] [INFO ] Flow matrix only has 41 transitions (discarded 17 similar events)
// Phase 1: matrix 41 rows 29 cols
[2024-05-23 02:20:49] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, +inf, +inf, +inf, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 860 ms. (1161 steps per ms)
FORMULA FunctionPointer-PT-a002-UpperBounds-15 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-09 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-07 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-02 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-01 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-00 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 2933 ms.
ITS solved all properties within timeout

BK_STOP 1716430850363

--------------------
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="FunctionPointer-PT-a002"
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 FunctionPointer-PT-a002, 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 r179-tall-171640600900165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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