fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r448-tajo-167905989600078
Last Updated
May 14, 2023

About the Execution of 2022-gold for ShieldRVs-PT-030B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
349.771 59657.00 99254.00 53.90 F normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r448-tajo-167905989600078.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is ShieldRVs-PT-030B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r448-tajo-167905989600078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 18:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 18:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 370K Mar 5 18:23 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 StableMarking

=== Now, execution of the tool begins

BK_START 1679476714894

Running Version 202205111006
[2023-03-22 09:18:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -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, 1800]
[2023-03-22 09:18:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 09:18:36] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2023-03-22 09:18:36] [INFO ] Transformed 1203 places.
[2023-03-22 09:18:36] [INFO ] Transformed 1353 transitions.
[2023-03-22 09:18:36] [INFO ] Found NUPN structural information;
[2023-03-22 09:18:36] [INFO ] Parsed PT model containing 1203 places and 1353 transitions in 262 ms.
Structural test allowed to assert that 571 places are NOT stable. Took 13 ms.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 640 ms. (steps per millisecond=15 ) properties (out of 632) seen :553
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 79) seen :0
Running SMT prover for 79 properties.
// Phase 1: matrix 1353 rows 1203 cols
[2023-03-22 09:18:37] [INFO ] Computed 121 place invariants in 19 ms
[2023-03-22 09:18:39] [INFO ] After 1735ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:79
[2023-03-22 09:18:40] [INFO ] [Nat]Absence check using 121 positive place invariants in 40 ms returned sat
[2023-03-22 09:18:47] [INFO ] After 5889ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :79
[2023-03-22 09:18:47] [INFO ] Deduced a trap composed of 37 places in 364 ms of which 7 ms to minimize.
[2023-03-22 09:18:48] [INFO ] Deduced a trap composed of 32 places in 318 ms of which 2 ms to minimize.
[2023-03-22 09:18:48] [INFO ] Deduced a trap composed of 42 places in 252 ms of which 2 ms to minimize.
[2023-03-22 09:18:48] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 2 ms to minimize.
[2023-03-22 09:18:49] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 1 ms to minimize.
[2023-03-22 09:18:49] [INFO ] Deduced a trap composed of 45 places in 254 ms of which 1 ms to minimize.
[2023-03-22 09:18:49] [INFO ] Deduced a trap composed of 53 places in 189 ms of which 1 ms to minimize.
[2023-03-22 09:18:49] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 2 ms to minimize.
[2023-03-22 09:18:50] [INFO ] Deduced a trap composed of 48 places in 266 ms of which 1 ms to minimize.
[2023-03-22 09:18:50] [INFO ] Deduced a trap composed of 46 places in 225 ms of which 0 ms to minimize.
[2023-03-22 09:18:50] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 0 ms to minimize.
[2023-03-22 09:18:51] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 1 ms to minimize.
[2023-03-22 09:18:51] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 0 ms to minimize.
[2023-03-22 09:18:51] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 0 ms to minimize.
[2023-03-22 09:18:51] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 1 ms to minimize.
[2023-03-22 09:18:52] [INFO ] Deduced a trap composed of 36 places in 214 ms of which 0 ms to minimize.
[2023-03-22 09:18:52] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 1 ms to minimize.
[2023-03-22 09:18:52] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 1 ms to minimize.
[2023-03-22 09:18:52] [INFO ] Deduced a trap composed of 43 places in 232 ms of which 0 ms to minimize.
[2023-03-22 09:18:53] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 0 ms to minimize.
[2023-03-22 09:18:53] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 0 ms to minimize.
[2023-03-22 09:18:53] [INFO ] Deduced a trap composed of 73 places in 242 ms of which 1 ms to minimize.
[2023-03-22 09:18:54] [INFO ] Deduced a trap composed of 46 places in 241 ms of which 0 ms to minimize.
[2023-03-22 09:18:54] [INFO ] Deduced a trap composed of 50 places in 231 ms of which 1 ms to minimize.
[2023-03-22 09:18:54] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 1 ms to minimize.
[2023-03-22 09:18:54] [INFO ] Deduced a trap composed of 53 places in 203 ms of which 1 ms to minimize.
[2023-03-22 09:18:55] [INFO ] Deduced a trap composed of 75 places in 225 ms of which 0 ms to minimize.
[2023-03-22 09:18:55] [INFO ] Deduced a trap composed of 47 places in 218 ms of which 1 ms to minimize.
[2023-03-22 09:18:55] [INFO ] Deduced a trap composed of 50 places in 215 ms of which 1 ms to minimize.
[2023-03-22 09:18:56] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 1 ms to minimize.
[2023-03-22 09:18:56] [INFO ] Deduced a trap composed of 27 places in 439 ms of which 1 ms to minimize.
[2023-03-22 09:18:57] [INFO ] Deduced a trap composed of 27 places in 381 ms of which 1 ms to minimize.
[2023-03-22 09:18:57] [INFO ] Deduced a trap composed of 48 places in 397 ms of which 1 ms to minimize.
[2023-03-22 09:18:57] [INFO ] Deduced a trap composed of 23 places in 371 ms of which 1 ms to minimize.
[2023-03-22 09:18:58] [INFO ] Deduced a trap composed of 39 places in 363 ms of which 1 ms to minimize.
[2023-03-22 09:18:58] [INFO ] Deduced a trap composed of 60 places in 343 ms of which 1 ms to minimize.
[2023-03-22 09:18:59] [INFO ] Deduced a trap composed of 30 places in 419 ms of which 1 ms to minimize.
[2023-03-22 09:18:59] [INFO ] Deduced a trap composed of 30 places in 403 ms of which 1 ms to minimize.
[2023-03-22 09:19:00] [INFO ] Deduced a trap composed of 57 places in 390 ms of which 1 ms to minimize.
[2023-03-22 09:19:00] [INFO ] Deduced a trap composed of 32 places in 398 ms of which 1 ms to minimize.
[2023-03-22 09:19:00] [INFO ] Deduced a trap composed of 36 places in 380 ms of which 1 ms to minimize.
[2023-03-22 09:19:01] [INFO ] Deduced a trap composed of 29 places in 384 ms of which 1 ms to minimize.
[2023-03-22 09:19:01] [INFO ] Deduced a trap composed of 29 places in 401 ms of which 1 ms to minimize.
[2023-03-22 09:19:02] [INFO ] Deduced a trap composed of 23 places in 393 ms of which 1 ms to minimize.
[2023-03-22 09:19:02] [INFO ] Deduced a trap composed of 35 places in 339 ms of which 1 ms to minimize.
[2023-03-22 09:19:03] [INFO ] Deduced a trap composed of 33 places in 306 ms of which 0 ms to minimize.
[2023-03-22 09:19:03] [INFO ] Deduced a trap composed of 23 places in 359 ms of which 1 ms to minimize.
[2023-03-22 09:19:03] [INFO ] Deduced a trap composed of 34 places in 361 ms of which 0 ms to minimize.
[2023-03-22 09:19:04] [INFO ] Deduced a trap composed of 35 places in 268 ms of which 1 ms to minimize.
[2023-03-22 09:19:04] [INFO ] Deduced a trap composed of 39 places in 306 ms of which 1 ms to minimize.
[2023-03-22 09:19:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 09:19:04] [INFO ] After 25225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:79
Parikh walk visited 4 properties in 29156 ms.
Support contains 75 out of 1203 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 1203 transition count 1232
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 1082 transition count 1232
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 242 place count 1082 transition count 1082
Deduced a syphon composed of 150 places in 4 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 542 place count 932 transition count 1082
Discarding 153 places :
Symmetric choice reduction at 2 with 153 rule applications. Total rules 695 place count 779 transition count 929
Iterating global reduction 2 with 153 rules applied. Total rules applied 848 place count 779 transition count 929
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 848 place count 779 transition count 839
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1028 place count 689 transition count 839
Performed 192 Post agglomeration using F-continuation condition.Transition count delta: 192
Deduced a syphon composed of 192 places in 2 ms
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 2 with 384 rules applied. Total rules applied 1412 place count 497 transition count 647
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 2 with 62 rules applied. Total rules applied 1474 place count 497 transition count 647
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1475 place count 496 transition count 646
Applied a total of 1475 rules in 370 ms. Remains 496 /1203 variables (removed 707) and now considering 646/1353 (removed 707) transitions.
Finished structural reductions, in 1 iterations. Remains : 496/1203 places, 646/1353 transitions.
Finished random walk after 10446 steps, including 28 resets, run visited all 75 properties in 352 ms. (steps per millisecond=29 )
Able to resolve query StableMarking after proving 633 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 58267 ms.

BK_STOP 1679476774551

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -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 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldRVs-PT-030B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is ShieldRVs-PT-030B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r448-tajo-167905989600078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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