fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r330-tall-171662363100236
Last Updated
July 7, 2024

About the Execution of 2023-gold for RERS2020-PT-pb107

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9012.735 910699.00 979672.00 3493.20 T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r330-tall-171662363100236.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is RERS2020-PT-pb107, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-171662363100236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 59M May 18 16:43 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1716803344417

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS2020-PT-pb107
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202304061127
[2024-05-27 09:49:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-27 09:49:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 09:49:08] [INFO ] Load time of PNML (sax parser for PT used): 1922 ms
[2024-05-27 09:49:08] [INFO ] Transformed 1382 places.
[2024-05-27 09:49:08] [INFO ] Transformed 104643 transitions.
[2024-05-27 09:49:08] [INFO ] Found NUPN structural information;
[2024-05-27 09:49:08] [INFO ] Parsed PT model containing 1382 places and 104643 transitions and 417030 arcs in 2339 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 11427 transitions
Reduce redundant transitions removed 11427 transitions.
Built sparse matrix representations for Structural reductions in 58 ms.231106KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1382/1382 places, 93216/93216 transitions.
Computed a total of 273 stabilizing places and 30825 stable transitions
Graph (complete) has 95856 edges and 1382 vertex of which 1381 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.412 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 places
Computed a total of 261 stabilizing places and 30825 stable transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 1369 transition count 93215
Reduce places removed 1 places and 0 transitions.
Computed a total of 260 stabilizing places and 30824 stable transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 1368 transition count 93215
Computed a total of 260 stabilizing places and 30824 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 15 place count 1368 transition count 93213
Deduced a syphon composed of 2 places in 69 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 1366 transition count 93213
Computed a total of 260 stabilizing places and 30824 stable transitions
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 119 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 53 place count 1349 transition count 93193
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Computed a total of 258 stabilizing places and 30686 stable transitions
Iterating post reduction 2 with 439 rules applied. Total rules applied 492 place count 1349 transition count 92754
Computed a total of 258 stabilizing places and 30686 stable transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 67 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 500 place count 1345 transition count 92750
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Computed a total of 258 stabilizing places and 30630 stable transitions
Iterating post reduction 3 with 96 rules applied. Total rules applied 596 place count 1345 transition count 92654
Computed a total of 258 stabilizing places and 30630 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 65 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 598 place count 1344 transition count 92655
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Computed a total of 258 stabilizing places and 30630 stable transitions
Iterating post reduction 4 with 3 rules applied. Total rules applied 601 place count 1344 transition count 92652
Computed a total of 258 stabilizing places and 30630 stable transitions
Computed a total of 258 stabilizing places and 30630 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 602 place count 1343 transition count 92651
Computed a total of 257 stabilizing places and 30632 stable transitions
Computed a total of 257 stabilizing places and 30632 stable transitions
Applied a total of 602 rules in 6557 ms. Remains 1343 /1382 variables (removed 39) and now considering 92651/93216 (removed 565) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 6569 ms. Remains : 1343/1382 places, 92651/93216 transitions.
Interrupted Random walk after 513827 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=17 )
[2024-05-27 09:49:46] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2024-05-27 09:49:46] [INFO ] Computed 12 invariants in 363 ms
[2024-05-27 09:49:56] [INFO ] [Real]Absence check using 12 positive place invariants in 42 ms returned sat
[2024-05-27 09:49:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 09:50:09] [INFO ] [Real]Absence check using state equation in 12304 ms returned sat
[2024-05-27 09:50:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 09:50:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 32 ms returned sat
[2024-05-27 09:50:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 09:50:33] [INFO ] [Nat]Absence check using state equation in 12927 ms returned sat
[2024-05-27 09:50:34] [INFO ] State equation strengthened by 3673 read => feed constraints.
[2024-05-27 09:50:41] [INFO ] [Nat]Added 3673 Read/Feed constraints in 7048 ms returned sat
[2024-05-27 09:50:48] [INFO ] Deduced a trap composed of 20 places in 6135 ms of which 16 ms to minimize.
[2024-05-27 09:50:55] [INFO ] Deduced a trap composed of 16 places in 5784 ms of which 2 ms to minimize.
[2024-05-27 09:51:01] [INFO ] Deduced a trap composed of 40 places in 5557 ms of which 3 ms to minimize.
[2024-05-27 09:51:08] [INFO ] Deduced a trap composed of 84 places in 5390 ms of which 2 ms to minimize.
[2024-05-27 09:51:15] [INFO ] Deduced a trap composed of 69 places in 6644 ms of which 1 ms to minimize.
[2024-05-27 09:51:22] [INFO ] Deduced a trap composed of 66 places in 6169 ms of which 3 ms to minimize.
[2024-05-27 09:51:29] [INFO ] Deduced a trap composed of 47 places in 5969 ms of which 2 ms to minimize.
[2024-05-27 09:51:37] [INFO ] Deduced a trap composed of 138 places in 6527 ms of which 2 ms to minimize.
[2024-05-27 09:51:44] [INFO ] Deduced a trap composed of 28 places in 6752 ms of which 2 ms to minimize.
[2024-05-27 09:51:52] [INFO ] Deduced a trap composed of 54 places in 6912 ms of which 3 ms to minimize.
[2024-05-27 09:52:00] [INFO ] Deduced a trap composed of 171 places in 7338 ms of which 1 ms to minimize.
[2024-05-27 09:52:10] [INFO ] Deduced a trap composed of 208 places in 8529 ms of which 2 ms to minimize.
[2024-05-27 09:52:19] [INFO ] Deduced a trap composed of 64 places in 8172 ms of which 2 ms to minimize.
[2024-05-27 09:52:29] [INFO ] Deduced a trap composed of 122 places in 8751 ms of which 3 ms to minimize.
[2024-05-27 09:52:37] [INFO ] Deduced a trap composed of 209 places in 7450 ms of which 1 ms to minimize.
[2024-05-27 09:52:45] [INFO ] Deduced a trap composed of 68 places in 7261 ms of which 2 ms to minimize.
[2024-05-27 09:52:53] [INFO ] Deduced a trap composed of 176 places in 6655 ms of which 1 ms to minimize.
[2024-05-27 09:53:00] [INFO ] Deduced a trap composed of 51 places in 6657 ms of which 1 ms to minimize.
[2024-05-27 09:53:06] [INFO ] Deduced a trap composed of 73 places in 5242 ms of which 1 ms to minimize.
[2024-05-27 09:53:12] [INFO ] Deduced a trap composed of 96 places in 4847 ms of which 1 ms to minimize.
[2024-05-27 09:53:17] [INFO ] Deduced a trap composed of 76 places in 4510 ms of which 1 ms to minimize.
[2024-05-27 09:53:22] [INFO ] Deduced a trap composed of 204 places in 3398 ms of which 2 ms to minimize.
[2024-05-27 09:53:24] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 162663 ms
[2024-05-27 09:53:34] [INFO ] Computed and/alt/rep : 255/1158/255 causal constraints (skipped 62053 transitions) in 10427 ms.
[2024-05-27 09:53:46] [INFO ] Added : 7 causal constraints over 3 iterations in 21954 ms. Result :sat
Interrupted Parikh directed walk after 7964 steps, including 7964 resets, run timeout after 30003 ms. (steps per millisecond=0 )
Parikh directed walk for 7964 steps, including 7964 resets, run took 30005 ms. (steps per millisecond=0 )
Interrupted Random directed walk after 337977 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Random walk for 500000 steps, including 0 resets, run took 25001 ms (no deadlock found). (steps per millisecond=19 )
Interrupted Random directed walk after 353345 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Random walk for 500000 steps, including 0 resets, run took 23943 ms (no deadlock found). (steps per millisecond=20 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 1343/1343 places, 92651/92651 transitions.
Computed a total of 257 stabilizing places and 30632 stable transitions
Computed a total of 257 stabilizing places and 30632 stable transitions
Computed a total of 257 stabilizing places and 30632 stable transitions
Applied a total of 0 rules in 900 ms. Remains 1343 /1343 variables (removed 0) and now considering 92651/92651 (removed 0) transitions.
[2024-05-27 09:56:07] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2024-05-27 09:56:07] [INFO ] Invariant cache hit.
[2024-05-27 09:56:11] [INFO ] Implicit Places using invariants in 4021 ms returned []
Implicit Place search using SMT only with invariants took 4041 ms to find 0 implicit places.
[2024-05-27 09:56:11] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2024-05-27 09:56:11] [INFO ] Invariant cache hit.
[2024-05-27 09:56:41] [INFO ] Performed 81361/92651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 09:56:45] [INFO ] Dead Transitions using invariants and state equation in 34495 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 39439 ms. Remains : 1343/1343 places, 92651/92651 transitions.
Interrupted Random walk after 440888 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=14 )
[2024-05-27 09:57:16] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
[2024-05-27 09:57:16] [INFO ] Invariant cache hit.
[2024-05-27 09:57:26] [INFO ] [Real]Absence check using 12 positive place invariants in 50 ms returned sat
[2024-05-27 09:57:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 09:57:39] [INFO ] [Real]Absence check using state equation in 13240 ms returned sat
[2024-05-27 09:57:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 09:57:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 30 ms returned sat
[2024-05-27 09:57:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 09:58:03] [INFO ] [Nat]Absence check using state equation in 12936 ms returned sat
[2024-05-27 09:58:03] [INFO ] State equation strengthened by 3673 read => feed constraints.
[2024-05-27 09:58:11] [INFO ] [Nat]Added 3673 Read/Feed constraints in 7640 ms returned sat
[2024-05-27 09:58:20] [INFO ] Deduced a trap composed of 70 places in 7939 ms of which 2 ms to minimize.
[2024-05-27 09:58:29] [INFO ] Deduced a trap composed of 16 places in 7793 ms of which 2 ms to minimize.
[2024-05-27 09:58:37] [INFO ] Deduced a trap composed of 16 places in 7614 ms of which 2 ms to minimize.
[2024-05-27 09:58:46] [INFO ] Deduced a trap composed of 30 places in 8287 ms of which 2 ms to minimize.
[2024-05-27 09:58:55] [INFO ] Deduced a trap composed of 66 places in 8236 ms of which 1 ms to minimize.
[2024-05-27 09:59:05] [INFO ] Deduced a trap composed of 80 places in 8906 ms of which 2 ms to minimize.
[2024-05-27 09:59:14] [INFO ] Deduced a trap composed of 64 places in 8075 ms of which 2 ms to minimize.
[2024-05-27 09:59:23] [INFO ] Deduced a trap composed of 23 places in 8209 ms of which 2 ms to minimize.
[2024-05-27 09:59:33] [INFO ] Deduced a trap composed of 47 places in 8673 ms of which 2 ms to minimize.
[2024-05-27 09:59:42] [INFO ] Deduced a trap composed of 77 places in 8124 ms of which 2 ms to minimize.
[2024-05-27 09:59:51] [INFO ] Deduced a trap composed of 20 places in 8462 ms of which 2 ms to minimize.
[2024-05-27 10:00:00] [INFO ] Deduced a trap composed of 96 places in 8299 ms of which 2 ms to minimize.
[2024-05-27 10:00:10] [INFO ] Deduced a trap composed of 100 places in 8605 ms of which 12 ms to minimize.
[2024-05-27 10:00:19] [INFO ] Deduced a trap composed of 70 places in 7613 ms of which 2 ms to minimize.
[2024-05-27 10:00:27] [INFO ] Deduced a trap composed of 104 places in 7732 ms of which 1 ms to minimize.
[2024-05-27 10:00:36] [INFO ] Deduced a trap composed of 141 places in 7372 ms of which 2 ms to minimize.
[2024-05-27 10:00:43] [INFO ] Deduced a trap composed of 52 places in 6470 ms of which 1 ms to minimize.
[2024-05-27 10:00:52] [INFO ] Deduced a trap composed of 120 places in 7906 ms of which 2 ms to minimize.
[2024-05-27 10:01:00] [INFO ] Deduced a trap composed of 217 places in 7931 ms of which 2 ms to minimize.
[2024-05-27 10:01:10] [INFO ] Deduced a trap composed of 147 places in 8496 ms of which 2 ms to minimize.
[2024-05-27 10:01:18] [INFO ] Deduced a trap composed of 170 places in 7755 ms of which 2 ms to minimize.
[2024-05-27 10:01:25] [INFO ] Deduced a trap composed of 26 places in 6100 ms of which 1 ms to minimize.
[2024-05-27 10:01:34] [INFO ] Deduced a trap composed of 20 places in 7573 ms of which 2 ms to minimize.
[2024-05-27 10:01:42] [INFO ] Deduced a trap composed of 76 places in 7122 ms of which 1 ms to minimize.
[2024-05-27 10:01:51] [INFO ] Deduced a trap composed of 39 places in 8056 ms of which 2 ms to minimize.
[2024-05-27 10:01:59] [INFO ] Deduced a trap composed of 98 places in 7402 ms of which 2 ms to minimize.
[2024-05-27 10:02:06] [INFO ] Deduced a trap composed of 88 places in 5589 ms of which 1 ms to minimize.
[2024-05-27 10:02:12] [INFO ] Deduced a trap composed of 88 places in 5565 ms of which 1 ms to minimize.
[2024-05-27 10:02:19] [INFO ] Deduced a trap composed of 69 places in 5588 ms of which 2 ms to minimize.
[2024-05-27 10:02:27] [INFO ] Deduced a trap composed of 160 places in 7664 ms of which 1 ms to minimize.
[2024-05-27 10:02:36] [INFO ] Deduced a trap composed of 162 places in 7975 ms of which 1 ms to minimize.
[2024-05-27 10:02:44] [INFO ] Deduced a trap composed of 123 places in 7611 ms of which 2 ms to minimize.
[2024-05-27 10:02:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking Deadlocks.
Interrupted Random directed walk after 331866 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Random walk for 500000 steps, including 0 resets, run took 29193 ms (no deadlock found). (steps per millisecond=17 )
Interrupted Random directed walk after 312260 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
Finished random walk after 212 steps, including 0 resets, run found a deadlock after 17 ms. (steps per millisecond=12 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 908225 ms.

BK_STOP 1716804255116

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="RERS2020-PT-pb107"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is RERS2020-PT-pb107, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-171662363100236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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