Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245688700029.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-02a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245688700029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.2K Apr 30 07:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 30 07:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 07:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 07:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 9 06:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 06:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 06:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 06:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 06:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 06:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 279K May 10 09: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 ASLink-PT-02a-UpperBounds-00
FORMULA_NAME ASLink-PT-02a-UpperBounds-01
FORMULA_NAME ASLink-PT-02a-UpperBounds-02
FORMULA_NAME ASLink-PT-02a-UpperBounds-03
FORMULA_NAME ASLink-PT-02a-UpperBounds-04
FORMULA_NAME ASLink-PT-02a-UpperBounds-05
FORMULA_NAME ASLink-PT-02a-UpperBounds-06
FORMULA_NAME ASLink-PT-02a-UpperBounds-07
FORMULA_NAME ASLink-PT-02a-UpperBounds-08
FORMULA_NAME ASLink-PT-02a-UpperBounds-09
FORMULA_NAME ASLink-PT-02a-UpperBounds-10
FORMULA_NAME ASLink-PT-02a-UpperBounds-11
FORMULA_NAME ASLink-PT-02a-UpperBounds-12
FORMULA_NAME ASLink-PT-02a-UpperBounds-13
FORMULA_NAME ASLink-PT-02a-UpperBounds-14
FORMULA_NAME ASLink-PT-02a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652644619412

Running Version 202205111006
[2022-05-15 19:57:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 19:57:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 19:57:01] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2022-05-15 19:57:01] [INFO ] Transformed 626 places.
[2022-05-15 19:57:01] [INFO ] Transformed 1008 transitions.
[2022-05-15 19:57:01] [INFO ] Found NUPN structural information;
[2022-05-15 19:57:01] [INFO ] Parsed PT model containing 626 places and 1008 transitions in 311 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
// Phase 1: matrix 998 rows 626 cols
[2022-05-15 19:57:01] [INFO ] Computed 118 place invariants in 73 ms
Incomplete random walk after 10000 steps, including 124 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 16) seen :14
FORMULA ASLink-PT-02a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
FORMULA ASLink-PT-02a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 998 rows 626 cols
[2022-05-15 19:57:01] [INFO ] Computed 118 place invariants in 40 ms
[2022-05-15 19:57:01] [INFO ] [Real]Absence check using 28 positive place invariants in 17 ms returned sat
[2022-05-15 19:57:01] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 25 ms returned sat
[2022-05-15 19:57:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:57:01] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2022-05-15 19:57:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:57:02] [INFO ] [Nat]Absence check using 28 positive place invariants in 16 ms returned sat
[2022-05-15 19:57:02] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 21 ms returned sat
[2022-05-15 19:57:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:57:03] [INFO ] [Nat]Absence check using state equation in 1602 ms returned sat
[2022-05-15 19:57:04] [INFO ] Deduced a trap composed of 36 places in 282 ms of which 8 ms to minimize.
[2022-05-15 19:57:04] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 2 ms to minimize.
[2022-05-15 19:57:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 596 ms
[2022-05-15 19:57:04] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 98 ms.
[2022-05-15 19:57:07] [INFO ] Added : 165 causal constraints over 33 iterations in 2626 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 626 places. Attempting structural reductions.
Drop transitions removed 8 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 626/626 places, 990/990 transitions.
Ensure Unique test removed 8 places
Reduce places removed 9 places and 8 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 613 transition count 931
Reduce places removed 52 places and 8 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 116 place count 561 transition count 923
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 560 transition count 915
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 118 place count 559 transition count 907
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 119 place count 558 transition count 899
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 120 place count 557 transition count 891
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 121 place count 556 transition count 883
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 122 place count 555 transition count 875
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 123 place count 554 transition count 867
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 124 place count 553 transition count 859
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 125 place count 552 transition count 851
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 126 place count 551 transition count 843
Reduce places removed 1 places and 2 transitions.
Graph (complete) has 2111 edges and 550 vertex of which 548 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 2 rules applied. Total rules applied 128 place count 548 transition count 841
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 2105 edges and 547 vertex of which 545 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 2 rules applied. Total rules applied 130 place count 545 transition count 840
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 131 place count 545 transition count 839
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 49 Pre rules applied. Total rules applied 131 place count 545 transition count 790
Deduced a syphon composed of 49 places in 2 ms
Ensure Unique test removed 19 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 15 with 117 rules applied. Total rules applied 248 place count 477 transition count 790
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 15 with 1 rules applied. Total rules applied 249 place count 477 transition count 789
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 250 place count 476 transition count 789
Discarding 5 places :
Symmetric choice reduction at 17 with 5 rule applications. Total rules 255 place count 471 transition count 766
Ensure Unique test removed 1 places
Iterating global reduction 17 with 6 rules applied. Total rules applied 261 place count 470 transition count 766
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 17 with 6 rules applied. Total rules applied 267 place count 469 transition count 761
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 270 place count 466 transition count 761
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 271 place count 465 transition count 753
Iterating global reduction 19 with 1 rules applied. Total rules applied 272 place count 465 transition count 753
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 273 place count 464 transition count 745
Iterating global reduction 19 with 1 rules applied. Total rules applied 274 place count 464 transition count 745
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 275 place count 463 transition count 737
Iterating global reduction 19 with 1 rules applied. Total rules applied 276 place count 463 transition count 737
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 277 place count 462 transition count 729
Iterating global reduction 19 with 1 rules applied. Total rules applied 278 place count 462 transition count 729
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 279 place count 461 transition count 721
Iterating global reduction 19 with 1 rules applied. Total rules applied 280 place count 461 transition count 721
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 281 place count 460 transition count 713
Iterating global reduction 19 with 1 rules applied. Total rules applied 282 place count 460 transition count 713
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 283 place count 459 transition count 705
Iterating global reduction 19 with 1 rules applied. Total rules applied 284 place count 459 transition count 705
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 285 place count 458 transition count 697
Iterating global reduction 19 with 1 rules applied. Total rules applied 286 place count 458 transition count 697
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 287 place count 457 transition count 689
Iterating global reduction 19 with 1 rules applied. Total rules applied 288 place count 457 transition count 689
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 289 place count 456 transition count 681
Iterating global reduction 19 with 1 rules applied. Total rules applied 290 place count 456 transition count 681
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 291 place count 455 transition count 673
Iterating global reduction 19 with 1 rules applied. Total rules applied 292 place count 455 transition count 673
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 293 place count 454 transition count 665
Iterating global reduction 19 with 1 rules applied. Total rules applied 294 place count 454 transition count 665
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 295 place count 453 transition count 657
Iterating global reduction 19 with 1 rules applied. Total rules applied 296 place count 453 transition count 657
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 297 place count 452 transition count 649
Iterating global reduction 19 with 1 rules applied. Total rules applied 298 place count 452 transition count 649
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 299 place count 451 transition count 641
Iterating global reduction 19 with 1 rules applied. Total rules applied 300 place count 451 transition count 641
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 301 place count 450 transition count 633
Iterating global reduction 19 with 1 rules applied. Total rules applied 302 place count 450 transition count 633
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 19 with 28 rules applied. Total rules applied 330 place count 436 transition count 619
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 331 place count 436 transition count 618
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 333 place count 435 transition count 617
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 20 with 2 rules applied. Total rules applied 335 place count 435 transition count 615
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 337 place count 433 transition count 615
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 21 with 2 rules applied. Total rules applied 339 place count 433 transition count 615
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 340 place count 432 transition count 614
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 344 place count 428 transition count 614
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 22 with 7 Pre rules applied. Total rules applied 344 place count 428 transition count 607
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 22 with 15 rules applied. Total rules applied 359 place count 420 transition count 607
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 22 with 3 rules applied. Total rules applied 362 place count 417 transition count 607
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 362 place count 417 transition count 606
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 364 place count 416 transition count 606
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 23 with 6 rules applied. Total rules applied 370 place count 413 transition count 603
Discarding 2 places :
Symmetric choice reduction at 23 with 2 rule applications. Total rules 372 place count 411 transition count 601
Iterating global reduction 23 with 2 rules applied. Total rules applied 374 place count 411 transition count 601
Free-agglomeration rule applied 2 times.
Iterating global reduction 23 with 2 rules applied. Total rules applied 376 place count 411 transition count 599
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 378 place count 409 transition count 599
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 24 with 2 rules applied. Total rules applied 380 place count 409 transition count 599
Applied a total of 380 rules in 576 ms. Remains 409 /626 variables (removed 217) and now considering 599/990 (removed 391) transitions.
Finished structural reductions, in 1 iterations. Remains : 409/626 places, 599/990 transitions.
// Phase 1: matrix 599 rows 409 cols
[2022-05-15 19:57:08] [INFO ] Computed 75 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 16292 resets, run finished after 1579 ms. (steps per millisecond=633 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5621 resets, run finished after 747 ms. (steps per millisecond=1338 ) properties (out of 1) seen :1
FORMULA ASLink-PT-02a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 9675 ms.

BK_STOP 1652644630438

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ASLink-PT-02a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-02a, 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 r006-tajo-165245688700029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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