Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r028-tall-165251936100123.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is BusinessProcesses-PT-01, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.5K Apr 29 23:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 23:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 29 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 29 23:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 29 23:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 29 23:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 29 23:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 23:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 47K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1655082888003

Running Version 0
[2022-06-13 01:14:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-13 01:14:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:14:49] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2022-06-13 01:14:49] [INFO ] Transformed 200 places.
[2022-06-13 01:14:49] [INFO ] Transformed 178 transitions.
[2022-06-13 01:14:49] [INFO ] Found NUPN structural information;
[2022-06-13 01:14:49] [INFO ] Parsed PT model containing 200 places and 178 transitions in 100 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Incomplete random walk after 10000 steps, including 116 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :7
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 177 rows 199 cols
[2022-06-13 01:14:50] [INFO ] Computed 30 place invariants in 25 ms
[2022-06-13 01:14:50] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2022-06-13 01:14:50] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 4 ms returned sat
[2022-06-13 01:14:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:14:50] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2022-06-13 01:14:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:14:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2022-06-13 01:14:50] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2022-06-13 01:14:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:14:50] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2022-06-13 01:14:50] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 7 ms to minimize.
[2022-06-13 01:14:50] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2022-06-13 01:14:51] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2022-06-13 01:14:51] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2022-06-13 01:14:51] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
[2022-06-13 01:14:51] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 0 ms to minimize.
[2022-06-13 01:14:51] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 0 ms to minimize.
[2022-06-13 01:14:51] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2022-06-13 01:14:51] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2022-06-13 01:14:51] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2022-06-13 01:14:51] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 0 ms to minimize.
[2022-06-13 01:14:51] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 1 ms to minimize.
[2022-06-13 01:14:51] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 0 ms to minimize.
[2022-06-13 01:14:51] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 0 ms to minimize.
[2022-06-13 01:14:51] [INFO ] Deduced a trap composed of 54 places in 34 ms of which 0 ms to minimize.
[2022-06-13 01:14:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 871 ms
[2022-06-13 01:14:51] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2022-06-13 01:14:51] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 2 ms returned sat
[2022-06-13 01:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:14:51] [INFO ] [Real]Absence check using state equation in 60 ms returned unsat
[2022-06-13 01:14:51] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned unsat
[2022-06-13 01:14:51] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2022-06-13 01:14:51] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 4 ms returned sat
[2022-06-13 01:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:14:52] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2022-06-13 01:14:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:14:52] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned unsat
[2022-06-13 01:14:52] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2022-06-13 01:14:52] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 2 ms returned sat
[2022-06-13 01:14:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:14:52] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2022-06-13 01:14:52] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2022-06-13 01:14:52] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2022-06-13 01:14:52] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 2 ms to minimize.
[2022-06-13 01:14:52] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2022-06-13 01:14:52] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2022-06-13 01:14:52] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 0 ms to minimize.
[2022-06-13 01:14:52] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2022-06-13 01:14:52] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 0 ms to minimize.
[2022-06-13 01:14:52] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2022-06-13 01:14:52] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2022-06-13 01:14:52] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 0 ms to minimize.
[2022-06-13 01:14:52] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2022-06-13 01:14:53] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 3 ms to minimize.
[2022-06-13 01:14:53] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 0 ms to minimize.
[2022-06-13 01:14:53] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 1 ms to minimize.
[2022-06-13 01:14:53] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 923 ms
[2022-06-13 01:14:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:14:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2022-06-13 01:14:53] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 2 ms returned sat
[2022-06-13 01:14:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:14:53] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2022-06-13 01:14:53] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2022-06-13 01:14:53] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2022-06-13 01:14:53] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2022-06-13 01:14:53] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2022-06-13 01:14:53] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 5 ms to minimize.
[2022-06-13 01:14:53] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2022-06-13 01:14:53] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2022-06-13 01:14:53] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 0 ms to minimize.
[2022-06-13 01:14:53] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2022-06-13 01:14:53] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2022-06-13 01:14:53] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2022-06-13 01:14:53] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2022-06-13 01:14:53] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2022-06-13 01:14:54] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2022-06-13 01:14:54] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2022-06-13 01:14:54] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 0 ms to minimize.
[2022-06-13 01:14:54] [INFO ] Deduced a trap composed of 51 places in 38 ms of which 1 ms to minimize.
[2022-06-13 01:14:54] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 0 ms to minimize.
[2022-06-13 01:14:54] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2022-06-13 01:14:54] [INFO ] Deduced a trap composed of 58 places in 38 ms of which 0 ms to minimize.
[2022-06-13 01:14:54] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 0 ms to minimize.
[2022-06-13 01:14:54] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 0 ms to minimize.
[2022-06-13 01:14:54] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
[2022-06-13 01:14:54] [INFO ] Deduced a trap composed of 62 places in 38 ms of which 0 ms to minimize.
[2022-06-13 01:14:54] [INFO ] Deduced a trap composed of 55 places in 37 ms of which 0 ms to minimize.
[2022-06-13 01:14:54] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 1385 ms
[2022-06-13 01:14:54] [INFO ] Computed and/alt/rep : 164/229/164 causal constraints (skipped 12 transitions) in 28 ms.
[2022-06-13 01:14:54] [INFO ] Added : 87 causal constraints over 18 iterations in 328 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-13 01:14:55] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned unsat
[2022-06-13 01:14:55] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2022-06-13 01:14:55] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2022-06-13 01:14:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:14:55] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2022-06-13 01:14:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:14:55] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned unsat
[2022-06-13 01:14:55] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2022-06-13 01:14:55] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2022-06-13 01:14:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:14:55] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2022-06-13 01:14:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:14:55] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned unsat
[2022-06-13 01:14:55] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2022-06-13 01:14:55] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2022-06-13 01:14:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:14:55] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2022-06-13 01:14:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:14:55] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned unsat
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 1 different solutions.
Finished Parikh walk after 68 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655082896549

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="BusinessProcesses-PT-01"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is BusinessProcesses-PT-01, 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 r028-tall-165251936100123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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