fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r303-tall-162124171300208
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for HirschbergSinclair-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
237.235 8233.00 14387.00 476.70 FTTTTFFFTTFTFTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r303-tall-162124171300208.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is HirschbergSinclair-PT-15, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171300208
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 924K
-rw-r--r-- 1 mcc users 34K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 167K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 127K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 5.2K May 11 18:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 11 18:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 11 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 11 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 421K May 12 08:13 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 leader_election-ReachabilityFireability-00
FORMULA_NAME leader_election-ReachabilityFireability-01
FORMULA_NAME leader_election-ReachabilityFireability-02
FORMULA_NAME leader_election-ReachabilityFireability-03
FORMULA_NAME leader_election-ReachabilityFireability-04
FORMULA_NAME leader_election-ReachabilityFireability-05
FORMULA_NAME leader_election-ReachabilityFireability-06
FORMULA_NAME leader_election-ReachabilityFireability-07
FORMULA_NAME leader_election-ReachabilityFireability-08
FORMULA_NAME leader_election-ReachabilityFireability-09
FORMULA_NAME leader_election-ReachabilityFireability-10
FORMULA_NAME leader_election-ReachabilityFireability-11
FORMULA_NAME leader_election-ReachabilityFireability-12
FORMULA_NAME leader_election-ReachabilityFireability-13
FORMULA_NAME leader_election-ReachabilityFireability-14
FORMULA_NAME leader_election-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621345867441

[2021-05-18 13:51: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]
[2021-05-18 13:51:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 13:51:09] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2021-05-18 13:51:09] [INFO ] Transformed 330 places.
[2021-05-18 13:51:09] [INFO ] Transformed 296 transitions.
[2021-05-18 13:51:09] [INFO ] Parsed PT model containing 330 places and 296 transitions in 115 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 33 resets, run finished after 69 ms. (steps per millisecond=144 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0]
FORMULA leader_election-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA leader_election-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA leader_election-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA leader_election-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA leader_election-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA leader_election-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA leader_election-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA leader_election-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA leader_election-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA leader_election-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 296 rows 330 cols
[2021-05-18 13:51:09] [INFO ] Computed 34 place invariants in 15 ms
[2021-05-18 13:51:09] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned unsat
[2021-05-18 13:51:09] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned unsat
[2021-05-18 13:51:09] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned unsat
[2021-05-18 13:51:09] [INFO ] [Real]Absence check using 30 positive place invariants in 25 ms returned sat
[2021-05-18 13:51:09] [INFO ] [Real]Absence check using 30 positive and 4 generalized place invariants in 3 ms returned unsat
[2021-05-18 13:51:09] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2021-05-18 13:51:09] [INFO ] [Real]Absence check using 30 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-18 13:51:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 13:51:10] [INFO ] [Real]Absence check using state equation in 267 ms returned unsat
[2021-05-18 13:51:10] [INFO ] [Real]Absence check using 30 positive place invariants in 18 ms returned sat
[2021-05-18 13:51:10] [INFO ] [Real]Absence check using 30 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-18 13:51:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 13:51:10] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2021-05-18 13:51:10] [INFO ] Computed and/alt/rep : 281/1742/281 causal constraints in 27 ms.
[2021-05-18 13:51:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 13:51:10] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2021-05-18 13:51:10] [INFO ] [Nat]Absence check using 30 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-18 13:51:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 13:51:11] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2021-05-18 13:51:11] [INFO ] Deduced a trap composed of 31 places in 142 ms
[2021-05-18 13:51:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2021-05-18 13:51:11] [INFO ] Computed and/alt/rep : 281/1742/281 causal constraints in 17 ms.
[2021-05-18 13:51:11] [INFO ] Added : 127 causal constraints over 26 iterations in 690 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
FORMULA leader_election-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA leader_election-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA leader_election-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA leader_election-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA leader_election-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 13800 steps, including 149 resets, run finished after 78 ms. (steps per millisecond=176 ) properties seen :[0] could not realise parikh vector
Support contains 7 out of 330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 330/330 places, 296/296 transitions.
Discarding 25 places :
Also discarding 0 output transitions
Graph (complete) has 628 edges and 330 vertex of which 305 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.6 ms
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 305 transition count 183
Reduce places removed 103 places and 0 transitions.
Discarding 31 places :
Also discarding 0 output transitions
Graph (complete) has 336 edges and 202 vertex of which 171 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Iterating post reduction 1 with 104 rules applied. Total rules applied 218 place count 171 transition count 183
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 249 place count 171 transition count 152
Symmetric choice reduction at 3 with 5 rule applications. Total rules 254 place count 171 transition count 152
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 264 place count 166 transition count 147
Symmetric choice reduction at 3 with 4 rule applications. Total rules 268 place count 166 transition count 147
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 276 place count 162 transition count 143
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 279 place count 162 transition count 140
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 282 place count 159 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 283 place count 158 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 284 place count 157 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 285 place count 156 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 286 place count 155 transition count 137
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 286 place count 155 transition count 133
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 294 place count 151 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 296 place count 150 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 297 place count 149 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 298 place count 148 transition count 131
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 298 place count 148 transition count 126
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 308 place count 143 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 309 place count 142 transition count 125
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 311 place count 141 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 312 place count 140 transition count 124
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 312 place count 140 transition count 120
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 320 place count 136 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 321 place count 135 transition count 119
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 323 place count 134 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 324 place count 133 transition count 118
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 324 place count 133 transition count 115
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 330 place count 130 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 331 place count 129 transition count 114
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 2 rules applied. Total rules applied 333 place count 128 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 334 place count 127 transition count 113
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 3 Pre rules applied. Total rules applied 334 place count 127 transition count 110
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 340 place count 124 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 341 place count 123 transition count 109
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 2 rules applied. Total rules applied 343 place count 122 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 344 place count 121 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 4 Pre rules applied. Total rules applied 344 place count 121 transition count 104
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 352 place count 117 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 353 place count 116 transition count 103
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 14 with 3 rules applied. Total rules applied 356 place count 115 transition count 101
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 358 place count 113 transition count 101
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 4 Pre rules applied. Total rules applied 358 place count 113 transition count 97
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 366 place count 109 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 367 place count 108 transition count 96
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 16 with 3 rules applied. Total rules applied 370 place count 107 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 372 place count 105 transition count 94
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 5 Pre rules applied. Total rules applied 372 place count 105 transition count 89
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 18 with 10 rules applied. Total rules applied 382 place count 100 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 383 place count 99 transition count 88
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 18 with 4 rules applied. Total rules applied 387 place count 98 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 390 place count 95 transition count 85
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 20 with 5 Pre rules applied. Total rules applied 390 place count 95 transition count 80
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 20 with 10 rules applied. Total rules applied 400 place count 90 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 402 place count 89 transition count 79
Applied a total of 402 rules in 170 ms. Remains 89 /330 variables (removed 241) and now considering 79/296 (removed 217) transitions.
Finished structural reductions, in 1 iterations. Remains : 89/330 places, 79/296 transitions.
Incomplete random walk after 1000000 steps, including 11368 resets, run finished after 1607 ms. (steps per millisecond=622 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 4075 resets, run finished after 810 ms. (steps per millisecond=1234 ) properties seen :[0]
Finished probabilistic random walk after 124 steps, run visited all 1 properties in 7 ms. (steps per millisecond=17 )
Probabilistic random walk after 124 steps, saw 27 distinct states, run finished after 7 ms. (steps per millisecond=17 ) properties seen :[1]
FORMULA leader_election-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621345875674

--------------------
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="HirschbergSinclair-PT-15"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is HirschbergSinclair-PT-15, 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 r303-tall-162124171300208"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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