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-158961257600438.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-7B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257600438
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 3.5K Apr 8 15:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 8 15:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 7 18:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 18:39 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.5K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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.2K Apr 6 20:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 20:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 04:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 04:02 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 2.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-7B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589972755971

[2020-05-20 11:05:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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:05:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 11:06:00] [INFO ] Load time of PNML (sax parser for PT used): 488 ms
[2020-05-20 11:06:00] [INFO ] Transformed 7014 places.
[2020-05-20 11:06:00] [INFO ] Transformed 8833 transitions.
[2020-05-20 11:06:00] [INFO ] Found NUPN structural information;
[2020-05-20 11:06:00] [INFO ] Parsed PT model containing 7014 places and 8833 transitions in 836 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 207 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 120 ms. (steps per millisecond=83 ) properties seen :[1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1]
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[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]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[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]
// Phase 1: matrix 8833 rows 7014 cols
[2020-05-20 11:06:01] [INFO ] Computed 66 place invariants in 311 ms
[2020-05-20 11:06:04] [INFO ] [Real]Absence check using 66 positive place invariants in 1322 ms returned sat
[2020-05-20 11:06:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:06:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 11:06:06] [INFO ] [Real]Absence check using state equation in 1925 ms returned (error "Failed to check-sat")
[2020-05-20 11:06:09] [INFO ] [Real]Absence check using 66 positive place invariants in 779 ms returned sat
[2020-05-20 11:06:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:06:11] [INFO ] [Real]Absence check using state equation in 2558 ms returned (error "Solver has unexpectedly terminated")
[2020-05-20 11:06:14] [INFO ] [Real]Absence check using 66 positive place invariants in 1330 ms returned sat
[2020-05-20 11:06:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:06:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 11:06:16] [INFO ] [Real]Absence check using state equation in 2423 ms returned (error "Failed to check-sat")
[2020-05-20 11:06:19] [INFO ] [Real]Absence check using 66 positive place invariants in 1004 ms returned sat
[2020-05-20 11:06:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:06:21] [INFO ] [Real]Absence check using state equation in 2380 ms returned sat
[2020-05-20 11:07:03] [INFO ] Deduced a trap composed of 7 places in 42259 ms
[2020-05-20 11:07:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s6414 s6415 s6416) 0)") while checking expression at index 3
[2020-05-20 11:07:07] [INFO ] [Real]Absence check using 66 positive place invariants in 1167 ms returned sat
[2020-05-20 11:07:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:07:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 11:07:09] [INFO ] [Real]Absence check using state equation in 1346 ms returned (error "Failed to check-sat")
Support contains 17 out of 7014 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Graph (trivial) has 7792 edges and 7014 vertex of which 4544 / 7014 are part of one of the 31 SCC in 94 ms
Free SCC test removed 4513 places
Drop transitions removed 5532 transitions
Reduce isomorphic transitions removed 5532 transitions.
Performed 568 Post agglomeration using F-continuation condition.Transition count delta: 568
Iterating post reduction 0 with 6100 rules applied. Total rules applied 6101 place count 2501 transition count 2733
Reduce places removed 568 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 607 rules applied. Total rules applied 6708 place count 1933 transition count 2694
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 24 rules applied. Total rules applied 6732 place count 1913 transition count 2690
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6733 place count 1912 transition count 2690
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 6733 place count 1912 transition count 2687
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 6739 place count 1909 transition count 2687
Symmetric choice reduction at 4 with 743 rule applications. Total rules 7482 place count 1909 transition count 2687
Deduced a syphon composed of 743 places in 22 ms
Reduce places removed 743 places and 745 transitions.
Iterating global reduction 4 with 1486 rules applied. Total rules applied 8968 place count 1166 transition count 1942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8969 place count 1166 transition count 1941
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 62 Pre rules applied. Total rules applied 8969 place count 1166 transition count 1879
Deduced a syphon composed of 62 places in 15 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 9093 place count 1104 transition count 1879
Symmetric choice reduction at 5 with 445 rule applications. Total rules 9538 place count 1104 transition count 1879
Deduced a syphon composed of 445 places in 14 ms
Reduce places removed 445 places and 609 transitions.
Iterating global reduction 5 with 890 rules applied. Total rules applied 10428 place count 659 transition count 1270
Ensure Unique test removed 399 transitions
Reduce isomorphic transitions removed 399 transitions.
Iterating post reduction 5 with 399 rules applied. Total rules applied 10827 place count 659 transition count 871
Symmetric choice reduction at 6 with 3 rule applications. Total rules 10830 place count 659 transition count 871
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 6 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 10836 place count 656 transition count 865
Symmetric choice reduction at 6 with 3 rule applications. Total rules 10839 place count 656 transition count 865
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 10845 place count 653 transition count 862
Symmetric choice reduction at 6 with 3 rule applications. Total rules 10848 place count 653 transition count 862
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 8 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 10854 place count 650 transition count 854
Symmetric choice reduction at 6 with 3 rule applications. Total rules 10857 place count 650 transition count 854
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 6 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 10863 place count 647 transition count 848
Performed 163 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 163 places in 1 ms
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 6 with 326 rules applied. Total rules applied 11189 place count 484 transition count 679
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 11199 place count 484 transition count 669
Symmetric choice reduction at 7 with 1 rule applications. Total rules 11200 place count 484 transition count 669
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 5 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 11202 place count 483 transition count 664
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 11212 place count 478 transition count 659
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 11213 place count 478 transition count 658
Performed 32 Post agglomeration using F-continuation condition with reduction of 54 identical transitions.
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 8 with 64 rules applied. Total rules applied 11277 place count 446 transition count 766
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 8 with 40 rules applied. Total rules applied 11317 place count 446 transition count 726
Free-agglomeration rule applied 196 times.
Iterating global reduction 9 with 196 rules applied. Total rules applied 11513 place count 446 transition count 530
Reduce places removed 196 places and 0 transitions.
Drop transitions removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Discarding 85 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Graph (complete) has 784 edges and 250 vertex of which 165 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.23 ms
Iterating post reduction 9 with 258 rules applied. Total rules applied 11771 place count 165 transition count 430
Drop transitions removed 68 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 10 with 74 rules applied. Total rules applied 11845 place count 165 transition count 356
Symmetric choice reduction at 11 with 5 rule applications. Total rules 11850 place count 165 transition count 356
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 11860 place count 160 transition count 351
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 11863 place count 160 transition count 367
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 11866 place count 157 transition count 367
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 12 with 18 rules applied. Total rules applied 11884 place count 157 transition count 367
Drop transitions removed 90 transitions
Redundant transition composition rules discarded 90 transitions
Iterating global reduction 12 with 90 rules applied. Total rules applied 11974 place count 157 transition count 277
Symmetric choice reduction at 12 with 3 rule applications. Total rules 11977 place count 157 transition count 277
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 11983 place count 154 transition count 274
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 11984 place count 154 transition count 273
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 6 places :
Also discarding 0 output transitions
Graph (complete) has 498 edges and 153 vertex of which 147 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Iterating post reduction 12 with 3 rules applied. Total rules applied 11987 place count 147 transition count 272
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 13 with 9 rules applied. Total rules applied 11996 place count 147 transition count 263
Applied a total of 11996 rules in 1565 ms. Remains 147 /7014 variables (removed 6867) and now considering 263/8833 (removed 8570) transitions.
Finished structural reductions, in 1 iterations. Remains : 147/7014 places, 263/8833 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1941 ms. (steps per millisecond=515 ) properties seen :[0, 1, 1, 1, 1]
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1257 ms. (steps per millisecond=795 ) properties seen :[0]
[2020-05-20 11:07:13] [INFO ] Flow matrix only has 251 transitions (discarded 12 similar events)
// Phase 1: matrix 251 rows 147 cols
[2020-05-20 11:07:13] [INFO ] Computed 42 place invariants in 1 ms
[2020-05-20 11:07:14] [INFO ] [Real]Absence check using 42 positive place invariants in 89 ms returned sat
[2020-05-20 11:07:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:07:14] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2020-05-20 11:07:14] [INFO ] State equation strengthened by 94 read => feed constraints.
[2020-05-20 11:07:14] [INFO ] [Real]Added 94 Read/Feed constraints in 25 ms returned sat
[2020-05-20 11:07:14] [INFO ] Computed and/alt/rep : 261/1449/249 causal constraints in 23 ms.
[2020-05-20 11:07:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 11:07:15] [INFO ] [Nat]Absence check using 42 positive place invariants in 257 ms returned sat
[2020-05-20 11:07:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 11:07:15] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2020-05-20 11:07:15] [INFO ] [Nat]Added 94 Read/Feed constraints in 45 ms returned sat
[2020-05-20 11:07:15] [INFO ] Computed and/alt/rep : 261/1449/249 causal constraints in 53 ms.
[2020-05-20 11:07:17] [INFO ] Added : 241 causal constraints over 49 iterations in 1972 ms. Result :sat
[2020-05-20 11:07:17] [INFO ] Deduced a trap composed of 3 places in 52 ms
[2020-05-20 11:07:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
Attempting to minimize the solution found.
Minimization took 47 ms.
Finished Parikh walk after 3808 steps, including 60 resets, run visited all 1 properties in 19 ms. (steps per millisecond=200 )
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589972838686

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-7B"
export BK_EXAMINATION="ReachabilityCardinality"
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-7B, examination is ReachabilityCardinality"
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-158961257600438"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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