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

About the Execution of 2020-gold for HealthRecord-PT-12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
265.560 13425.00 21029.00 300.20 TTTFFTTTTTFTTTTT 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-162124171300176.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 HealthRecord-PT-12, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171300176
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.0K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K 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 3.0K May 11 18:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 11 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K 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 51K 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 net-ReachabilityFireability-00
FORMULA_NAME net-ReachabilityFireability-01
FORMULA_NAME net-ReachabilityFireability-02
FORMULA_NAME net-ReachabilityFireability-03
FORMULA_NAME net-ReachabilityFireability-04
FORMULA_NAME net-ReachabilityFireability-05
FORMULA_NAME net-ReachabilityFireability-06
FORMULA_NAME net-ReachabilityFireability-07
FORMULA_NAME net-ReachabilityFireability-08
FORMULA_NAME net-ReachabilityFireability-09
FORMULA_NAME net-ReachabilityFireability-10
FORMULA_NAME net-ReachabilityFireability-11
FORMULA_NAME net-ReachabilityFireability-12
FORMULA_NAME net-ReachabilityFireability-13
FORMULA_NAME net-ReachabilityFireability-14
FORMULA_NAME net-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621341952038

[2021-05-18 12:45:53] [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 12:45:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:45:53] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2021-05-18 12:45:53] [INFO ] Transformed 160 places.
[2021-05-18 12:45:53] [INFO ] Transformed 340 transitions.
[2021-05-18 12:45:53] [INFO ] Found NUPN structural information;
[2021-05-18 12:45:53] [INFO ] Parsed PT model containing 160 places and 340 transitions in 92 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 725 resets, run finished after 102 ms. (steps per millisecond=98 ) properties seen :[0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0]
FORMULA net-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 87 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 87 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA net-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA net-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2021-05-18 12:45:54] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
// Phase 1: matrix 300 rows 160 cols
[2021-05-18 12:45:54] [INFO ] Computed 18 place invariants in 9 ms
[2021-05-18 12:45:54] [INFO ] [Real]Absence check using 10 positive place invariants in 25 ms returned sat
[2021-05-18 12:45:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:45:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:54] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2021-05-18 12:45:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:45:54] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:45:54] [INFO ] Deduced a trap composed of 26 places in 91 ms
[2021-05-18 12:45:54] [INFO ] Deduced a trap composed of 42 places in 64 ms
[2021-05-18 12:45:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 183 ms
[2021-05-18 12:45:54] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2021-05-18 12:45:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:45:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:54] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-18 12:45:54] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:45:55] [INFO ] Deduced a trap composed of 40 places in 46 ms
[2021-05-18 12:45:55] [INFO ] Deduced a trap composed of 24 places in 44 ms
[2021-05-18 12:45:55] [INFO ] Deduced a trap composed of 28 places in 64 ms
[2021-05-18 12:45:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 200 ms
[2021-05-18 12:45:55] [INFO ] [Real]Absence check using 10 positive place invariants in 40 ms returned sat
[2021-05-18 12:45:55] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 20 ms returned sat
[2021-05-18 12:45:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:55] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2021-05-18 12:45:55] [INFO ] [Real]Added 1 Read/Feed constraints in 12 ms returned sat
[2021-05-18 12:45:55] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 28 ms.
[2021-05-18 12:45:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 48 ms returned sat
[2021-05-18 12:45:55] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:45:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:55] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2021-05-18 12:45:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:45:55] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 21 ms.
[2021-05-18 12:45:57] [INFO ] Added : 184 causal constraints over 38 iterations in 1723 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 36 ms.
[2021-05-18 12:45:57] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:45:57] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:45:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:57] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-18 12:45:57] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:45:57] [INFO ] Deduced a trap composed of 39 places in 47 ms
[2021-05-18 12:45:57] [INFO ] Deduced a trap composed of 39 places in 34 ms
[2021-05-18 12:45:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2021-05-18 12:45:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 49 ms returned sat
[2021-05-18 12:45:58] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:45:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:58] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-18 12:45:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:45:58] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 28 ms.
[2021-05-18 12:45:59] [INFO ] Added : 162 causal constraints over 33 iterations in 995 ms. Result :sat
[2021-05-18 12:45:59] [INFO ] Deduced a trap composed of 39 places in 43 ms
[2021-05-18 12:45:59] [INFO ] Deduced a trap composed of 39 places in 35 ms
[2021-05-18 12:45:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
[2021-05-18 12:45:59] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:45:59] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:59] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2021-05-18 12:45:59] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:45:59] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 19 ms.
[2021-05-18 12:45:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 57 ms returned sat
[2021-05-18 12:45:59] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-18 12:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:59] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2021-05-18 12:45:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:45:59] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 18 ms.
[2021-05-18 12:46:00] [INFO ] Added : 152 causal constraints over 31 iterations in 968 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
[2021-05-18 12:46:01] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:46:01] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:01] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:46:01] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:46:01] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 22 ms.
[2021-05-18 12:46:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 45 ms returned sat
[2021-05-18 12:46:01] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:46:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:01] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-18 12:46:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:01] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 25 ms.
[2021-05-18 12:46:02] [INFO ] Added : 142 causal constraints over 29 iterations in 776 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-18 12:46:02] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:46:02] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:02] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-18 12:46:02] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:02] [INFO ] Deduced a trap composed of 37 places in 41 ms
[2021-05-18 12:46:02] [INFO ] Deduced a trap composed of 40 places in 35 ms
[2021-05-18 12:46:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2021-05-18 12:46:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 44 ms returned sat
[2021-05-18 12:46:02] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:46:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:02] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:46:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:46:02] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 22 ms.
[2021-05-18 12:46:04] [INFO ] Added : 171 causal constraints over 35 iterations in 1492 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2021-05-18 12:46:04] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned unsat
FORMULA net-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 23200 steps, including 984 resets, run finished after 99 ms. (steps per millisecond=234 ) properties seen :[0, 1, 0, 0, 1] could not realise parikh vector
FORMULA net-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 449 steps, including 15 resets, run visited all 3 properties in 3 ms. (steps per millisecond=149 )
FORMULA net-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621341965463

--------------------
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="HealthRecord-PT-12"
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 HealthRecord-PT-12, 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-162124171300176"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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