About the Execution of ITS-Tools for FamilyReunion-PT-L00100M0010C005P005G002
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110800741.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FamilyReunion-PT-L00100M0010C005P005G002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110800741
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 469K Apr 30 09:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.8M Apr 30 09:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 30 09:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.6M Apr 30 09:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 194K May 9 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 782K May 9 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 362K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 970K May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 9 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 48K May 9 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 17M 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 FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-00
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-01
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-02
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-03
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-04
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-05
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-06
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-07
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-08
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-09
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-10
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-11
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-12
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-13
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-14
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652725724296
Running Version 202205111006
[2022-05-16 18:28:45] [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-16 18:28:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 18:28:46] [INFO ] Load time of PNML (sax parser for PT used): 761 ms
[2022-05-16 18:28:46] [INFO ] Transformed 40605 places.
[2022-05-16 18:28:46] [INFO ] Transformed 36871 transitions.
[2022-05-16 18:28:46] [INFO ] Parsed PT model containing 40605 places and 36871 transitions in 1040 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 169 ms.
Reduce places removed 31 places and 0 transitions.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-06 11 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 36871 rows 40574 cols
[2022-05-16 18:28:52] [INFO ] Computed 8805 place invariants in 5552 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 615 ms. (steps per millisecond=16 ) properties (out of 14) seen :64
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
// Phase 1: matrix 36871 rows 40574 cols
[2022-05-16 18:28:59] [INFO ] Computed 8805 place invariants in 5259 ms
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, 2, 1, 5, -1, 1] Max seen :[1, 13, 27, 2, 1, 16, 1, 0, 0, 0, 0]
Support contains 1431 out of 40574 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40574/40574 places, 36871/36871 transitions.
Graph (complete) has 65258 edges and 40574 vertex of which 38314 are kept as prefixes of interest. Removing 2260 places using SCC suffix rule.66 ms
Discarding 2260 places :
Also discarding 2424 output transitions
Drop transitions removed 2424 transitions
Discarding 6666 places :
Implicit places reduction removed 6666 places
Drop transitions removed 17669 transitions
Trivial Post-agglo rules discarded 17669 transitions
Performed 17669 trivial Post agglomeration. Transition count delta: 17669
Iterating post reduction 0 with 24335 rules applied. Total rules applied 24336 place count 31648 transition count 16778
Reduce places removed 17669 places and 0 transitions.
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Iterating post reduction 1 with 17771 rules applied. Total rules applied 42107 place count 13979 transition count 16676
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 2 with 102 rules applied. Total rules applied 42209 place count 13877 transition count 16676
Performed 1716 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1716 Pre rules applied. Total rules applied 42209 place count 13877 transition count 14960
Deduced a syphon composed of 1716 places in 11 ms
Ensure Unique test removed 908 places
Reduce places removed 2624 places and 0 transitions.
Iterating global reduction 3 with 4340 rules applied. Total rules applied 46549 place count 11253 transition count 14960
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 704 transitions
Trivial Post-agglo rules discarded 704 transitions
Performed 704 trivial Post agglomeration. Transition count delta: 704
Iterating post reduction 3 with 705 rules applied. Total rules applied 47254 place count 11252 transition count 14256
Reduce places removed 704 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 706 rules applied. Total rules applied 47960 place count 10548 transition count 14254
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 47962 place count 10546 transition count 14254
Discarding 3535 places :
Symmetric choice reduction at 6 with 3535 rule applications. Total rules 51497 place count 7011 transition count 10719
Iterating global reduction 6 with 3535 rules applied. Total rules applied 55032 place count 7011 transition count 10719
Ensure Unique test removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Discarding 201 places :
Implicit places reduction removed 201 places
Drop transitions removed 704 transitions
Trivial Post-agglo rules discarded 704 transitions
Performed 704 trivial Post agglomeration. Transition count delta: 704
Iterating post reduction 6 with 1409 rules applied. Total rules applied 56441 place count 6810 transition count 9511
Reduce places removed 704 places and 0 transitions.
Iterating post reduction 7 with 704 rules applied. Total rules applied 57145 place count 6106 transition count 9511
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 57145 place count 6106 transition count 9510
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 57147 place count 6105 transition count 9510
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 57157 place count 6095 transition count 8500
Iterating global reduction 8 with 10 rules applied. Total rules applied 57167 place count 6095 transition count 8500
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 8 with 202 rules applied. Total rules applied 57369 place count 5994 transition count 8399
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 9 with 101 rules applied. Total rules applied 57470 place count 5893 transition count 8399
Discarding 1009 places :
Symmetric choice reduction at 10 with 1009 rule applications. Total rules 58479 place count 4884 transition count 7390
Iterating global reduction 10 with 1009 rules applied. Total rules applied 59488 place count 4884 transition count 7390
Ensure Unique test removed 1009 transitions
Reduce isomorphic transitions removed 1009 transitions.
Discarding 100 places :
Implicit places reduction removed 100 places
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 10 with 1309 rules applied. Total rules applied 60797 place count 4784 transition count 6181
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 11 with 200 rules applied. Total rules applied 60997 place count 4584 transition count 6181
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Deduced a syphon composed of 202 places in 3 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 12 with 404 rules applied. Total rules applied 61401 place count 4382 transition count 5979
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 61402 place count 4382 transition count 5978
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 61403 place count 4382 transition count 5977
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 61404 place count 4381 transition count 5977
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 61409 place count 4381 transition count 5977
Reduce places removed 100 places and 100 transitions.
Iterating global reduction 13 with 100 rules applied. Total rules applied 61509 place count 4281 transition count 5877
Applied a total of 61509 rules in 6563 ms. Remains 4281 /40574 variables (removed 36293) and now considering 5877/36871 (removed 30994) transitions.
Finished structural reductions, in 1 iterations. Remains : 4281/40574 places, 5877/36871 transitions.
// Phase 1: matrix 5877 rows 4281 cols
[2022-05-16 18:30:01] [INFO ] Computed 410 place invariants in 89 ms
Finished random walk after 774080 steps, including 537 resets, run visited all 11 properties in 30001 ms. (steps per millisecond=25 )
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4506 ms. (steps per millisecond=221 ) properties (out of 9) seen :310
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2796 ms. (steps per millisecond=357 ) properties (out of 9) seen :252
Incomplete Best-First random walk after 1000001 steps, including 5 resets, run finished after 2783 ms. (steps per millisecond=359 ) properties (out of 9) seen :241
Finished Best-First random walk after 409055 steps, including 2 resets, run visited all 9 properties in 5002 ms. (steps per millisecond=81 )
Interrupted Best-First random walk after 431217 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=86 ) properties seen 318
Incomplete Best-First random walk after 1000001 steps, including 12 resets, run finished after 2978 ms. (steps per millisecond=335 ) properties (out of 9) seen :209
Incomplete Best-First random walk after 1000001 steps, including 5 resets, run finished after 2709 ms. (steps per millisecond=369 ) properties (out of 9) seen :247
Incomplete Best-First random walk after 1000001 steps, including 5 resets, run finished after 2700 ms. (steps per millisecond=370 ) properties (out of 9) seen :234
Incomplete Best-First random walk after 1000001 steps, including 5 resets, run finished after 2697 ms. (steps per millisecond=370 ) properties (out of 9) seen :249
// Phase 1: matrix 5877 rows 4281 cols
[2022-05-16 18:31:02] [INFO ] Computed 410 place invariants in 97 ms
[2022-05-16 18:31:03] [INFO ] [Real]Absence check using 2 positive place invariants in 49 ms returned sat
[2022-05-16 18:31:03] [INFO ] [Real]Absence check using 2 positive and 408 generalized place invariants in 135 ms returned sat
[2022-05-16 18:31:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:31:06] [INFO ] [Real]Absence check using state equation in 3338 ms returned unsat
[2022-05-16 18:31:06] [INFO ] [Real]Absence check using 2 positive place invariants in 35 ms returned sat
[2022-05-16 18:31:07] [INFO ] [Real]Absence check using 2 positive and 408 generalized place invariants in 113 ms returned sat
[2022-05-16 18:31:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:31:09] [INFO ] [Real]Absence check using state equation in 2181 ms returned unsat
[2022-05-16 18:31:09] [INFO ] [Real]Absence check using 2 positive place invariants in 43 ms returned unsat
[2022-05-16 18:31:10] [INFO ] [Real]Absence check using 2 positive place invariants in 34 ms returned sat
[2022-05-16 18:31:10] [INFO ] [Real]Absence check using 2 positive and 408 generalized place invariants in 117 ms returned sat
[2022-05-16 18:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:31:13] [INFO ] [Real]Absence check using state equation in 2945 ms returned unsat
[2022-05-16 18:31:13] [INFO ] [Real]Absence check using 2 positive place invariants in 34 ms returned sat
[2022-05-16 18:31:13] [INFO ] [Real]Absence check using 2 positive and 408 generalized place invariants in 107 ms returned sat
[2022-05-16 18:31:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:31:18] [INFO ] [Real]Absence check using state equation in 4700 ms returned unsat
[2022-05-16 18:31:18] [INFO ] [Real]Absence check using 2 positive place invariants in 32 ms returned unsat
[2022-05-16 18:31:19] [INFO ] [Real]Absence check using 2 positive place invariants in 37 ms returned sat
[2022-05-16 18:31:19] [INFO ] [Real]Absence check using 2 positive and 408 generalized place invariants in 114 ms returned sat
[2022-05-16 18:31:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:31:21] [INFO ] [Real]Absence check using state equation in 2340 ms returned unsat
[2022-05-16 18:31:22] [INFO ] [Real]Absence check using 2 positive place invariants in 33 ms returned sat
[2022-05-16 18:31:22] [INFO ] [Real]Absence check using 2 positive and 408 generalized place invariants in 111 ms returned sat
[2022-05-16 18:31:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:31:23] [INFO ] [Real]Absence check using state equation in 1066 ms returned unsat
[2022-05-16 18:31:23] [INFO ] [Real]Absence check using 2 positive place invariants in 35 ms returned sat
[2022-05-16 18:31:23] [INFO ] [Real]Absence check using 2 positive and 408 generalized place invariants in 119 ms returned sat
[2022-05-16 18:31:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:31:25] [INFO ] [Real]Absence check using state equation in 1885 ms returned unsat
Current structural bounds on expressions (after SMT) : [101, 101, 101, 101, 101, 101, 1, 1, 1] Max seen :[101, 101, 101, 101, 101, 101, 1, 1, 1]
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-07 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-05 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-04 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-03 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-02 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-01 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 160320 ms.
BK_STOP 1652725885728
--------------------
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="FamilyReunion-PT-L00100M0010C005P005G002"
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 FamilyReunion-PT-L00100M0010C005P005G002, 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 r078-tall-165260110800741"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00100M0010C005P005G002.tgz
mv FamilyReunion-PT-L00100M0010C005P005G002 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 ;