Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r070-smll-174854076200114.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is Dekker-PT-015, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-174854076200114
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 141K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1748647512800

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Dekker-PT-015
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-30 23:25:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-05-30 23:25:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 23:25:15] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2025-05-30 23:25:15] [INFO ] Transformed 75 places.
[2025-05-30 23:25:15] [INFO ] Transformed 255 transitions.
[2025-05-30 23:25:15] [INFO ] Found NUPN structural information;
[2025-05-30 23:25:15] [INFO ] Parsed PT model containing 75 places and 255 transitions and 1830 arcs in 447 ms.
Built sparse matrix representations for Structural reductions in 13 ms.20419KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 75/75 places, 255/255 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 98 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 131 ms. Remains : 75/75 places, 255/255 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 75/75 places, 255/255 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 49 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2025-05-30 23:25:16] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2025-05-30 23:25:16] [INFO ] Computed 45 invariants in 20 ms
[2025-05-30 23:25:17] [INFO ] Implicit Places using invariants in 403 ms returned []
[2025-05-30 23:25:17] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2025-05-30 23:25:17] [INFO ] Invariant cache hit.
[2025-05-30 23:25:17] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-05-30 23:25:17] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
[2025-05-30 23:25:17] [INFO ] Redundant transitions in 23 ms returned []
Running 240 sub problems to find dead transitions.
[2025-05-30 23:25:17] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2025-05-30 23:25:17] [INFO ] Invariant cache hit.
[2025-05-30 23:25:17] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 15/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2025-05-30 23:25:19] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 12 ms to minimize.
[2025-05-30 23:25:19] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2025-05-30 23:25:19] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2025-05-30 23:25:19] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2025-05-30 23:25:19] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2025-05-30 23:25:19] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2025-05-30 23:25:19] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2025-05-30 23:25:19] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2025-05-30 23:25:19] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2025-05-30 23:25:19] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-05-30 23:25:19] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-05-30 23:25:19] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-05-30 23:25:19] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2025-05-30 23:25:19] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2025-05-30 23:25:19] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2025-05-30 23:25:19] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2025-05-30 23:25:19] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2025-05-30 23:25:19] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-05-30 23:25:19] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2025-05-30 23:25:20] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2025-05-30 23:25:20] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-05-30 23:25:20] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
[2025-05-30 23:25:20] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2025-05-30 23:25:20] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2025-05-30 23:25:20] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2025-05-30 23:25:20] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-05-30 23:25:20] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2025-05-30 23:25:20] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2025-05-30 23:25:20] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2025-05-30 23:25:20] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2025-05-30 23:25:20] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-05-30 23:25:21] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2025-05-30 23:25:21] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-05-30 23:25:21] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2025-05-30 23:25:21] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2025-05-30 23:25:21] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2025-05-30 23:25:21] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2025-05-30 23:25:21] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 18/128 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 15/75 variables, 15/143 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 15/158 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 60/135 variables, 75/233 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 15/248 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (OVERLAPS) 0/135 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 248 constraints, problems are : Problem set: 0 solved, 240 unsolved in 10690 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 75/75 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 15/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 38/128 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 15/75 variables, 15/143 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 15/158 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 60/135 variables, 75/233 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 15/248 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 240/488 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (OVERLAPS) 0/135 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 488 constraints, problems are : Problem set: 0 solved, 240 unsolved in 7036 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 75/75 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 38/38 constraints]
After SMT, in 18173ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 18210ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 19009 ms. Remains : 75/75 places, 255/255 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4508 ms (no deadlock found). (steps per millisecond=277 )
Random directed walk for 1250011 steps, including 0 resets, run took 4501 ms (no deadlock found). (steps per millisecond=277 )
[2025-05-30 23:25:44] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2025-05-30 23:25:44] [INFO ] Invariant cache hit.
[2025-05-30 23:25:44] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2025-05-30 23:25:44] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 5 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2025-05-30 23:25:44] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2025-05-30 23:25:44] [INFO ] Invariant cache hit.
[2025-05-30 23:25:44] [INFO ] Implicit Places using invariants in 188 ms returned [30, 33, 36, 39, 42, 45, 48, 51, 54, 57, 60, 63, 66, 69, 72]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 196 ms to find 15 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 60/75 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 203 ms. Remains : 60/75 places, 255/255 transitions.
Discarding 15 transitions out of 255. Remains 240
RANDOM walk for 40000 steps (8 resets) in 3211 ms. (12 steps per ms) remains 16/240 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 11/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 8/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 6/8 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 1/2 properties
BEST_FIRST walk for 128 steps (0 resets) in 4 ms. (25 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 240 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 5 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2025-05-30 23:25:46] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2025-05-30 23:25:46] [INFO ] Invariant cache hit.
[2025-05-30 23:25:46] [INFO ] Implicit Places using invariants in 255 ms returned [30, 33, 36, 39, 42, 45, 48, 51, 54, 57, 60, 63, 66, 69, 72]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 256 ms to find 15 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 60/75 places, 255/255 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 265 ms. Remains : 60/75 places, 255/255 transitions.
Discarding 15 transitions out of 255. Remains 240
Net is quasi-live, checking if it is reversible to establish liveness.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :240 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 240 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 30994 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Dekker-PT-015

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 75
TRANSITIONS: 255
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 1830
NUPN UNITS: 32
LOADING TIME: 0.733

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.052
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.253
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 668
MODEL NAME: /home/mcc/execution/model
75 places, 255 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1748647558563

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML

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="Dekker-PT-015"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5832"
echo " Executing tool gold2024"
echo " Input is Dekker-PT-015, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-smll-174854076200114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-015.tgz
mv Dekker-PT-015 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;