Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r519-tall-167987244700053.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Anderson-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987244700053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 31 16:48 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 Anderson-PT-10-UpperBounds-00
FORMULA_NAME Anderson-PT-10-UpperBounds-01
FORMULA_NAME Anderson-PT-10-UpperBounds-02
FORMULA_NAME Anderson-PT-10-UpperBounds-03
FORMULA_NAME Anderson-PT-10-UpperBounds-04
FORMULA_NAME Anderson-PT-10-UpperBounds-05
FORMULA_NAME Anderson-PT-10-UpperBounds-06
FORMULA_NAME Anderson-PT-10-UpperBounds-07
FORMULA_NAME Anderson-PT-10-UpperBounds-08
FORMULA_NAME Anderson-PT-10-UpperBounds-09
FORMULA_NAME Anderson-PT-10-UpperBounds-10
FORMULA_NAME Anderson-PT-10-UpperBounds-11
FORMULA_NAME Anderson-PT-10-UpperBounds-12
FORMULA_NAME Anderson-PT-10-UpperBounds-13
FORMULA_NAME Anderson-PT-10-UpperBounds-14
FORMULA_NAME Anderson-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680831974880

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 01:46:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-07 01:46:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 01:46:16] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2023-04-07 01:46:16] [INFO ] Transformed 621 places.
[2023-04-07 01:46:16] [INFO ] Transformed 2480 transitions.
[2023-04-07 01:46:16] [INFO ] Found NUPN structural information;
[2023-04-07 01:46:16] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 2480 rows 621 cols
[2023-04-07 01:46:16] [INFO ] Computed 23 invariants in 80 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 16) seen :12
FORMULA Anderson-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :2
FORMULA Anderson-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
[2023-04-07 01:46:16] [INFO ] Invariant cache hit.
[2023-04-07 01:46:17] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2023-04-07 01:46:17] [INFO ] [Real]Absence check using 11 positive and 12 generalized place invariants in 10 ms returned sat
[2023-04-07 01:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:46:17] [INFO ] [Real]Absence check using state equation in 711 ms returned sat
[2023-04-07 01:46:18] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:46:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2023-04-07 01:46:18] [INFO ] [Nat]Absence check using 11 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 01:46:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:46:18] [INFO ] [Nat]Absence check using state equation in 725 ms returned sat
[2023-04-07 01:46:18] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:46:19] [INFO ] [Nat]Added 90 Read/Feed constraints in 630 ms returned sat
[2023-04-07 01:46:19] [INFO ] Computed and/alt/rep : 110/120/110 causal constraints (skipped 2360 transitions) in 362 ms.
[2023-04-07 01:46:20] [INFO ] Deduced a trap composed of 194 places in 400 ms of which 4 ms to minimize.
[2023-04-07 01:46:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 571 ms
[2023-04-07 01:46:20] [INFO ] Added : 2 causal constraints over 2 iterations in 1342 ms. Result :sat
Minimization took 446 ms.
[2023-04-07 01:46:21] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2023-04-07 01:46:21] [INFO ] [Real]Absence check using 11 positive and 12 generalized place invariants in 15 ms returned sat
[2023-04-07 01:46:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:46:22] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
[2023-04-07 01:46:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:46:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2023-04-07 01:46:22] [INFO ] [Nat]Absence check using 11 positive and 12 generalized place invariants in 9 ms returned sat
[2023-04-07 01:46:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:46:23] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2023-04-07 01:46:23] [INFO ] [Nat]Added 90 Read/Feed constraints in 376 ms returned sat
[2023-04-07 01:46:23] [INFO ] Computed and/alt/rep : 110/120/110 causal constraints (skipped 2360 transitions) in 211 ms.
[2023-04-07 01:46:24] [INFO ] Deduced a trap composed of 304 places in 381 ms of which 1 ms to minimize.
[2023-04-07 01:46:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 528 ms
[2023-04-07 01:46:24] [INFO ] Added : 2 causal constraints over 1 iterations in 1051 ms. Result :sat
Minimization took 417 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 88 Pre rules applied. Total rules applied 0 place count 621 transition count 2392
Deduced a syphon composed of 88 places in 3 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 0 with 176 rules applied. Total rules applied 176 place count 533 transition count 2392
Discarding 178 places :
Symmetric choice reduction at 0 with 178 rule applications. Total rules 354 place count 355 transition count 594
Iterating global reduction 0 with 178 rules applied. Total rules applied 532 place count 355 transition count 594
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 536 place count 353 transition count 592
Applied a total of 536 rules in 138 ms. Remains 353 /621 variables (removed 268) and now considering 592/2480 (removed 1888) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 353/621 places, 592/2480 transitions.
// Phase 1: matrix 592 rows 353 cols
[2023-04-07 01:46:25] [INFO ] Computed 23 invariants in 18 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1808 ms. (steps per millisecond=553 ) properties (out of 2) seen :1
FORMULA Anderson-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 931 ms. (steps per millisecond=1074 ) properties (out of 1) seen :0
[2023-04-07 01:46:28] [INFO ] Invariant cache hit.
[2023-04-07 01:46:28] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-04-07 01:46:28] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 9 ms returned sat
[2023-04-07 01:46:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:46:28] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-04-07 01:46:28] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:46:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-04-07 01:46:28] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 9 ms returned sat
[2023-04-07 01:46:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:46:28] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-04-07 01:46:28] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:46:28] [INFO ] [Nat]Added 90 Read/Feed constraints in 34 ms returned sat
[2023-04-07 01:46:28] [INFO ] Computed and/alt/rep : 22/32/22 causal constraints (skipped 560 transitions) in 32 ms.
[2023-04-07 01:46:28] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 1 ms to minimize.
[2023-04-07 01:46:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-04-07 01:46:28] [INFO ] Added : 2 causal constraints over 2 iterations in 351 ms. Result :sat
Minimization took 136 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 592/592 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 591
Applied a total of 2 rules in 38 ms. Remains 352 /353 variables (removed 1) and now considering 591/592 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 352/353 places, 591/592 transitions.
// Phase 1: matrix 591 rows 352 cols
[2023-04-07 01:46:29] [INFO ] Computed 23 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1734 ms. (steps per millisecond=576 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 930 ms. (steps per millisecond=1075 ) properties (out of 1) seen :0
[2023-04-07 01:46:31] [INFO ] Invariant cache hit.
[2023-04-07 01:46:31] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-04-07 01:46:31] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 9 ms returned sat
[2023-04-07 01:46:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:46:31] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2023-04-07 01:46:31] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:46:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-04-07 01:46:32] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 8 ms returned sat
[2023-04-07 01:46:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:46:32] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2023-04-07 01:46:32] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:46:32] [INFO ] [Nat]Added 90 Read/Feed constraints in 58 ms returned sat
[2023-04-07 01:46:32] [INFO ] Computed and/alt/rep : 21/31/21 causal constraints (skipped 560 transitions) in 33 ms.
[2023-04-07 01:46:32] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 1 ms to minimize.
[2023-04-07 01:46:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-04-07 01:46:32] [INFO ] Added : 2 causal constraints over 1 iterations in 341 ms. Result :sat
Minimization took 132 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 591/591 transitions.
Applied a total of 0 rules in 16 ms. Remains 352 /352 variables (removed 0) and now considering 591/591 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 352/352 places, 591/591 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 591/591 transitions.
Applied a total of 0 rules in 16 ms. Remains 352 /352 variables (removed 0) and now considering 591/591 (removed 0) transitions.
[2023-04-07 01:46:32] [INFO ] Invariant cache hit.
[2023-04-07 01:46:33] [INFO ] Implicit Places using invariants in 344 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 347 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 351/352 places, 591/591 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 351 transition count 491
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 251 transition count 491
Applied a total of 200 rules in 17 ms. Remains 251 /351 variables (removed 100) and now considering 491/591 (removed 100) transitions.
// Phase 1: matrix 491 rows 251 cols
[2023-04-07 01:46:33] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 01:46:33] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-04-07 01:46:33] [INFO ] Invariant cache hit.
[2023-04-07 01:46:33] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:46:34] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 251/352 places, 491/591 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1230 ms. Remains : 251/352 places, 491/591 transitions.
[2023-04-07 01:46:34] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1198 ms. (steps per millisecond=834 ) properties (out of 1) seen :1
FORMULA Anderson-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 18893 ms.
ITS solved all properties within timeout

BK_STOP 1680831996077

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="Anderson-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is Anderson-PT-10, 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 r519-tall-167987244700053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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