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

About the Execution of GreatSPN+red for RERS17pb115-PT-4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16205.392 888014.00 1757796.00 1976.50 ?FTT?F?TTFFT??F? 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.r311-tall-171662336300286.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 greatspnxred
Input is RERS17pb115-PT-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662336300286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 69M 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

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

=== Now, execution of the tool begins

BK_START 1716718288580

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb115-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 10:11:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 10:11:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 10:11:31] [INFO ] Load time of PNML (sax parser for PT used): 2109 ms
[2024-05-26 10:11:32] [INFO ] Transformed 1399 places.
[2024-05-26 10:11:32] [INFO ] Transformed 144369 transitions.
[2024-05-26 10:11:32] [INFO ] Parsed PT model containing 1399 places and 144369 transitions and 577414 arcs in 2674 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 7298 ms. (5 steps per ms) remains 9/16 properties
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 587 ms. (68 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 519 ms. (76 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 812 ms. (49 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 457 ms. (87 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 441 ms. (90 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 796 ms. (50 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 339 ms. (117 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 397 ms. (100 steps per ms) remains 9/9 properties
[2024-05-26 10:11:37] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1399 cols
[2024-05-26 10:11:37] [INFO ] Computed 37 invariants in 482 ms
[2024-05-26 10:11:43] [INFO ] State equation strengthened by 2277 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem RERS17pb115-PT-4-ReachabilityCardinality-2024-02 is UNSAT
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem RERS17pb115-PT-4-ReachabilityCardinality-2023-11 is UNSAT
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-2023-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 1228/1367 variables, 18/18 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1367 variables, 2/20 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1367 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 16/1383 variables, 1/21 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1383 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 16/1399 variables, 16/37 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1399 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 7 unsolved
SMT process timed out in 12096ms, After SMT, problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 117 out of 1399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1399/1399 places, 144369/144369 transitions.
Ensure Unique test removed 18 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1381 transition count 144369
Applied a total of 18 rules in 2187 ms. Remains 1381 /1399 variables (removed 18) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2227 ms. Remains : 1381/1399 places, 144369/144369 transitions.
RANDOM walk for 40000 steps (8 resets) in 5422 ms. (7 steps per ms) remains 6/7 properties
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 381 ms. (104 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 459 ms. (86 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 6/6 properties
[2024-05-26 10:11:53] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2024-05-26 10:11:54] [INFO ] Computed 19 invariants in 333 ms
[2024-05-26 10:11:59] [INFO ] State equation strengthened by 2277 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1265/1381 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1381 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 82619/82619 variables, and 1400 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45099 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 1381/1381 constraints, ReadFeed: 0/2277 constraints, PredecessorRefiner: 6/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1265/1381 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 10:12:56] [INFO ] Deduced a trap composed of 17 places in 8938 ms of which 52 ms to minimize.
[2024-05-26 10:13:04] [INFO ] Deduced a trap composed of 49 places in 7833 ms of which 6 ms to minimize.
[2024-05-26 10:13:11] [INFO ] Deduced a trap composed of 65 places in 7275 ms of which 5 ms to minimize.
[2024-05-26 10:13:17] [INFO ] Deduced a trap composed of 97 places in 6528 ms of which 4 ms to minimize.
[2024-05-26 10:13:24] [INFO ] Deduced a trap composed of 73 places in 6155 ms of which 3 ms to minimize.
[2024-05-26 10:13:29] [INFO ] Deduced a trap composed of 129 places in 5483 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1381/82619 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48066 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 0/1381 constraints, ReadFeed: 0/2277 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 98922ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 116 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 1149 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1149 ms. Remains : 1381/1381 places, 144369/144369 transitions.
RANDOM walk for 40000 steps (8 resets) in 4140 ms. (9 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 324 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 549 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 431 ms. (92 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 352 ms. (113 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 2848 steps, run timeout after 3002 ms. (steps per millisecond=0 ) properties seen :0 out of 6
Probabilistic random walk after 2848 steps, saw 2409 distinct states, run finished after 3008 ms. (steps per millisecond=0 ) properties seen :0
[2024-05-26 10:13:39] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2024-05-26 10:13:39] [INFO ] Invariant cache hit.
[2024-05-26 10:13:44] [INFO ] State equation strengthened by 2277 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1265/1381 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1381 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 82619/82619 variables, and 1400 constraints, problems are : Problem set: 0 solved, 6 unsolved in 75097 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 1381/1381 constraints, ReadFeed: 0/2277 constraints, PredecessorRefiner: 6/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1265/1381 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 10:15:08] [INFO ] Deduced a trap composed of 17 places in 6544 ms of which 4 ms to minimize.
[2024-05-26 10:15:14] [INFO ] Deduced a trap composed of 49 places in 5962 ms of which 3 ms to minimize.
[2024-05-26 10:15:20] [INFO ] Deduced a trap composed of 73 places in 5510 ms of which 2 ms to minimize.
[2024-05-26 10:15:24] [INFO ] Deduced a trap composed of 97 places in 4177 ms of which 1 ms to minimize.
[2024-05-26 10:15:33] [INFO ] Deduced a trap composed of 73 places in 5629 ms of which 3 ms to minimize.
[2024-05-26 10:15:39] [INFO ] Deduced a trap composed of 81 places in 5629 ms of which 2 ms to minimize.
[2024-05-26 10:15:44] [INFO ] Deduced a trap composed of 97 places in 4966 ms of which 2 ms to minimize.
[2024-05-26 10:15:47] [INFO ] Deduced a trap composed of 73 places in 3706 ms of which 1 ms to minimize.
[2024-05-26 10:15:57] [INFO ] Deduced a trap composed of 73 places in 3650 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1381 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 10:16:12] [INFO ] Deduced a trap composed of 97 places in 5969 ms of which 4 ms to minimize.
[2024-05-26 10:16:18] [INFO ] Deduced a trap composed of 41 places in 5552 ms of which 3 ms to minimize.
SMT process timed out in 159519ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 116 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 1012 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1012 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 1105 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2024-05-26 10:16:20] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2024-05-26 10:16:20] [INFO ] Invariant cache hit.
[2024-05-26 10:16:29] [INFO ] Implicit Places using invariants in 9035 ms returned []
Implicit Place search using SMT only with invariants took 9050 ms to find 0 implicit places.
Running 144368 sub problems to find dead transitions.
[2024-05-26 10:16:31] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2024-05-26 10:16:31] [INFO ] Invariant cache hit.
[2024-05-26 10:16:37] [INFO ] State equation strengthened by 2277 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RERS17pb115-PT-4

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1399
TRANSITIONS: 144369
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 3.336s, Sys 0.287s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.507s, Sys 0.063s]


----------------------------------------------------------------------
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: 627
MODEL NAME: /home/mcc/execution/model
1399 places, 144369 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716719176594

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

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