Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961257700455.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 NoC3x3-PT-8B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257700455
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 4.1K Apr 8 15:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 8 15:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 7 18:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 18:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 6 20:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 6 20:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 04:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 6 04:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 3.0M Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589974327358

[2020-05-20 11:32:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-20 11:32:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 11:32:10] [INFO ] Load time of PNML (sax parser for PT used): 533 ms
[2020-05-20 11:32:10] [INFO ] Transformed 9140 places.
[2020-05-20 11:32:10] [INFO ] Transformed 14577 transitions.
[2020-05-20 11:32:10] [INFO ] Found NUPN structural information;
[2020-05-20 11:32:10] [INFO ] Parsed PT model containing 9140 places and 14577 transitions in 744 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 218 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 157 ms. (steps per millisecond=63 ) properties seen :[1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA NoC3x3-PT-8B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA NoC3x3-PT-8B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 14577 rows 9140 cols
[2020-05-20 11:32:11] [INFO ] Computed 99 place invariants in 460 ms
[2020-05-20 11:32:14] [INFO ] [Real]Absence check using 99 positive place invariants in 1167 ms returned unsat
[2020-05-20 11:32:16] [INFO ] [Real]Absence check using 99 positive place invariants in 1314 ms returned sat
[2020-05-20 11:32:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:32:19] [INFO ] [Real]Absence check using state equation in 2595 ms returned (error "Solver has unexpectedly terminated")
[2020-05-20 11:32:21] [INFO ] [Real]Absence check using 99 positive place invariants in 1227 ms returned sat
[2020-05-20 11:32:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:32:24] [INFO ] [Real]Absence check using state equation in 2762 ms returned (error "Solver has unexpectedly terminated")
[2020-05-20 11:32:26] [INFO ] [Real]Absence check using 99 positive place invariants in 1303 ms returned sat
[2020-05-20 11:32:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:32:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 11:32:29] [INFO ] [Real]Absence check using state equation in 2624 ms returned (error "Failed to check-sat")
[2020-05-20 11:32:31] [INFO ] [Real]Absence check using 99 positive place invariants in 1240 ms returned sat
[2020-05-20 11:32:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:32:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 11:32:34] [INFO ] [Real]Absence check using state equation in 2765 ms returned (error "Failed to check-sat")
[2020-05-20 11:32:36] [INFO ] [Real]Absence check using 99 positive place invariants in 1275 ms returned sat
[2020-05-20 11:32:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:32:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 11:32:39] [INFO ] [Real]Absence check using state equation in 2705 ms returned (error "Failed to check-sat")
[2020-05-20 11:32:41] [INFO ] [Real]Absence check using 99 positive place invariants in 1157 ms returned sat
[2020-05-20 11:32:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:32:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 11:32:44] [INFO ] [Real]Absence check using state equation in 2823 ms returned (error "Failed to check-sat")
[2020-05-20 11:32:46] [INFO ] [Real]Absence check using 99 positive place invariants in 1192 ms returned sat
[2020-05-20 11:32:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:32:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 11:32:49] [INFO ] [Real]Absence check using state equation in 2808 ms returned (error "Failed to check-sat")
[2020-05-20 11:32:51] [INFO ] [Real]Absence check using 99 positive place invariants in 1296 ms returned sat
[2020-05-20 11:32:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:32:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 11:32:54] [INFO ] [Real]Absence check using state equation in 2656 ms returned (error "Failed to check-sat")
[2020-05-20 11:32:56] [INFO ] [Real]Absence check using 99 positive place invariants in 1186 ms returned sat
[2020-05-20 11:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:32:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 11:32:59] [INFO ] [Real]Absence check using state equation in 2824 ms returned (error "Failed to check-sat")
FORMULA NoC3x3-PT-8B-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 49 out of 9140 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Graph (trivial) has 13367 edges and 9140 vertex of which 2111 / 9140 are part of one of the 33 SCC in 64 ms
Free SCC test removed 2078 places
Discarding 113 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Graph (complete) has 12768 edges and 7062 vertex of which 6949 are kept as prefixes of interest. Removing 113 places using SCC suffix rule.52 ms
Drop transitions removed 3286 transitions
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 3390 transitions.
Performed 4391 Post agglomeration using F-continuation condition.Transition count delta: 4391
Iterating post reduction 0 with 7781 rules applied. Total rules applied 7783 place count 6949 transition count 6716
Reduce places removed 4391 places and 0 transitions.
Ensure Unique test removed 2479 transitions
Reduce isomorphic transitions removed 2479 transitions.
Performed 1228 Post agglomeration using F-continuation condition.Transition count delta: 1228
Iterating post reduction 1 with 8098 rules applied. Total rules applied 15881 place count 2558 transition count 3009
Reduce places removed 1228 places and 0 transitions.
Ensure Unique test removed 1228 transitions
Reduce isomorphic transitions removed 1228 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 2 with 2474 rules applied. Total rules applied 18355 place count 1330 transition count 1763
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 18373 place count 1312 transition count 1763
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 18373 place count 1312 transition count 1714
Deduced a syphon composed of 49 places in 5 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 18471 place count 1263 transition count 1714
Symmetric choice reduction at 4 with 354 rule applications. Total rules 18825 place count 1263 transition count 1714
Deduced a syphon composed of 354 places in 6 ms
Reduce places removed 354 places and 354 transitions.
Iterating global reduction 4 with 708 rules applied. Total rules applied 19533 place count 909 transition count 1360
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 53 rules applied. Total rules applied 19586 place count 909 transition count 1307
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 60 Pre rules applied. Total rules applied 19586 place count 909 transition count 1247
Deduced a syphon composed of 60 places in 17 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 5 with 120 rules applied. Total rules applied 19706 place count 849 transition count 1247
Symmetric choice reduction at 5 with 45 rule applications. Total rules 19751 place count 849 transition count 1247
Deduced a syphon composed of 45 places in 8 ms
Reduce places removed 45 places and 60 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 19841 place count 804 transition count 1187
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 19856 place count 804 transition count 1172
Performed 239 Post agglomeration using F-continuation condition.Transition count delta: 239
Deduced a syphon composed of 239 places in 1 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 6 with 478 rules applied. Total rules applied 20334 place count 565 transition count 933
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 20357 place count 565 transition count 910
Symmetric choice reduction at 7 with 4 rule applications. Total rules 20361 place count 565 transition count 910
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 8 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 20369 place count 561 transition count 902
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 20383 place count 554 transition count 931
Free-agglomeration rule applied 208 times.
Iterating global reduction 7 with 208 rules applied. Total rules applied 20591 place count 554 transition count 723
Reduce places removed 208 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 4 places :
Also discarding 0 output transitions
Graph (complete) has 1068 edges and 346 vertex of which 342 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Iterating post reduction 7 with 260 rules applied. Total rules applied 20851 place count 342 transition count 672
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 20855 place count 342 transition count 668
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 9 with 24 rules applied. Total rules applied 20879 place count 342 transition count 668
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 20884 place count 342 transition count 668
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 20889 place count 342 transition count 663
Drop transitions removed 141 transitions
Redundant transition composition rules discarded 141 transitions
Iterating global reduction 10 with 141 rules applied. Total rules applied 21030 place count 342 transition count 522
Discarding 13 places :
Also discarding 0 output transitions
Graph (complete) has 939 edges and 342 vertex of which 329 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Iterating post reduction 10 with 1 rules applied. Total rules applied 21031 place count 329 transition count 522
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 21044 place count 329 transition count 509
Symmetric choice reduction at 12 with 5 rule applications. Total rules 21049 place count 329 transition count 509
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 7 transitions.
Iterating global reduction 12 with 10 rules applied. Total rules applied 21059 place count 324 transition count 502
Free-agglomeration rule applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 21063 place count 324 transition count 498
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 21067 place count 320 transition count 498
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 21068 place count 320 transition count 498
Applied a total of 21068 rules in 2452 ms. Remains 320 /9140 variables (removed 8820) and now considering 498/14577 (removed 14079) transitions.
Finished structural reductions, in 1 iterations. Remains : 320/9140 places, 498/14577 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2623 ms. (steps per millisecond=381 ) properties seen :[1, 0, 0, 0, 1, 1, 1, 0, 1]
FORMULA NoC3x3-PT-8B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1266 ms. (steps per millisecond=789 ) properties seen :[1, 0, 0, 0]
FORMULA NoC3x3-PT-8B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1315 ms. (steps per millisecond=760 ) properties seen :[1, 0, 0]
FORMULA NoC3x3-PT-8B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1522 ms. (steps per millisecond=657 ) properties seen :[1, 0]
FORMULA NoC3x3-PT-8B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 5243 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=655 )
FORMULA NoC3x3-PT-8B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589974389078

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="NoC3x3-PT-8B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 NoC3x3-PT-8B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r111-csrt-158961257700455"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-8B.tgz
mv NoC3x3-PT-8B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;