fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r368-tall-178024404800120
Last Updated
Jun 17, 2026

About the Execution of 2025-gold for SupplyChain-PT-00020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
480.044 7342.00 19310.00 90.60 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/mcc2026-input.r368-tall-178024404800120.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is SupplyChain-PT-00020, examination is OneSafe
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r368-tall-178024404800120
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.6K May 27 07:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 27 07:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 27 07:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 27 07:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 27 10:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 07:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 27 07:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 27 07:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 27 07:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 10:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 6 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 81K May 26 18:17 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 OneSafe

=== Now, execution of the tool begins

BK_START 1780307444305

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=OneSafe
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SupplyChain-PT-00020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
OneSafe PT
Running Version 202505121319
[2026-06-01 09:50:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, OneSafe, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-06-01 09:50:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 09:50:45] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2026-06-01 09:50:45] [INFO ] Transformed 264 places.
[2026-06-01 09:50:45] [INFO ] Transformed 163 transitions.
[2026-06-01 09:50:45] [INFO ] Parsed PT model containing 264 places and 163 transitions and 726 arcs in 162 ms.
Structural unfed/single firing approximation deduced that 102/264 places are one safe.
// Phase 1: matrix 163 rows 264 cols
[2026-06-01 09:50:45] [INFO ] Computed 142 invariants in 18 ms
[2026-06-01 09:50:45] [INFO ] Rough structural analysis with invariants proved 1 places are one safe in 27 ms (including invariant computation).
Starting Z3 with timeout 100.0 s and query timeout 10000.0 ms
[2026-06-01 09:50:46] [INFO ] [Real]Absence check using 59 positive place invariants in 156 ms proved 0 places are One-Safe.
[2026-06-01 09:50:46] [INFO ] [Real]Absence check using 59 positive and 83 generalized place invariants in 143 ms proved 61 places are One-Safe.
[2026-06-01 09:50:46] [INFO ] [Real] State equation constraints in 162 ms proved 201 places are One-Safe.
[2026-06-01 09:50:47] [INFO ] Flatten gal took : 105 ms
[2026-06-01 09:50:47] [INFO ] Flatten gal took : 39 ms
[2026-06-01 09:50:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13415263410801641550.gal : 23 ms
[2026-06-01 09:50:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality691717620069816874.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13415263410801641550.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality691717620069816874.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality691717620069816874.prop.
RANDOM walk for 40000 steps (386 resets) in 2342 ms. (17 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 161/161 properties
SDD proceeding with computation,161 properties remain. new max is 4
SDD size :1 after 3
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 161/161 properties
SDD proceeding with computation,161 properties remain. new max is 8
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 161/161 properties
SDD size :3 after 18
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 161/161 properties
SDD proceeding with computation,161 properties remain. new max is 16
SDD size :18 after 243
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 161/161 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 161/161 properties
SDD proceeding with computation,161 properties remain. new max is 32
SDD size :243 after 59049
Probabilistic random walk after 100001 steps, saw 18602 distinct states, run finished after 730 ms. (steps per millisecond=136 ) properties seen :0
[2026-06-01 09:50:48] [INFO ] Invariant cache hit.
[2026-06-01 09:50:48] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 62/223 variables, 58/100 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Problem osplace_26 is UNSAT
Problem osplace_27 is UNSAT
Problem osplace_28 is UNSAT
Problem osplace_29 is UNSAT
Problem osplace_30 is UNSAT
Problem osplace_31 is UNSAT
Problem osplace_32 is UNSAT
Problem osplace_33 is UNSAT
Problem osplace_35 is UNSAT
Problem osplace_36 is UNSAT
Problem osplace_37 is UNSAT
Problem osplace_38 is UNSAT
Problem osplace_39 is UNSAT
Problem osplace_40 is UNSAT
Problem osplace_41 is UNSAT
Problem osplace_42 is UNSAT
Problem osplace_43 is UNSAT
Problem osplace_44 is UNSAT
Problem osplace_46 is UNSAT
Problem osplace_47 is UNSAT
Problem osplace_116 is UNSAT
Problem osplace_117 is UNSAT
Problem osplace_118 is UNSAT
Problem osplace_119 is UNSAT
Problem osplace_120 is UNSAT
Problem osplace_121 is UNSAT
Problem osplace_122 is UNSAT
Problem osplace_123 is UNSAT
Problem osplace_124 is UNSAT
Problem osplace_125 is UNSAT
Problem osplace_126 is UNSAT
Problem osplace_127 is UNSAT
Problem osplace_128 is UNSAT
Problem osplace_129 is UNSAT
Problem osplace_130 is UNSAT
Problem osplace_131 is UNSAT
Problem osplace_132 is UNSAT
Problem osplace_133 is UNSAT
Problem osplace_135 is UNSAT
Problem osplace_136 is UNSAT
Problem osplace_137 is UNSAT
Problem osplace_140 is UNSAT
Problem osplace_141 is UNSAT
Problem osplace_142 is UNSAT
Problem osplace_143 is UNSAT
Problem osplace_144 is UNSAT
Problem osplace_146 is UNSAT
Problem osplace_147 is UNSAT
Problem osplace_148 is UNSAT
Problem osplace_149 is UNSAT
Problem osplace_150 is UNSAT
Problem osplace_151 is UNSAT
Problem osplace_152 is UNSAT
Problem osplace_153 is UNSAT
Problem osplace_154 is UNSAT
Problem osplace_155 is UNSAT
Problem osplace_157 is UNSAT
Problem osplace_158 is UNSAT
Problem osplace_159 is UNSAT
Problem osplace_160 is UNSAT
Problem osplace_161 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 1/101 constraints. Problems are: Problem set: 61 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/101 constraints. Problems are: Problem set: 61 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 1/224 variables, 1/102 constraints. Problems are: Problem set: 61 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/102 constraints. Problems are: Problem set: 61 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 40/264 variables, 40/142 constraints. Problems are: Problem set: 61 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/142 constraints. Problems are: Problem set: 61 solved, 100 unsolved
Problem osplace_0 is UNSAT
Problem osplace_1 is UNSAT
Problem osplace_2 is UNSAT
Problem osplace_3 is UNSAT
Problem osplace_4 is UNSAT
Problem osplace_5 is UNSAT
Problem osplace_6 is UNSAT
Problem osplace_7 is UNSAT
Problem osplace_8 is UNSAT
Problem osplace_9 is UNSAT
Problem osplace_10 is UNSAT
Problem osplace_11 is UNSAT
Problem osplace_12 is UNSAT
Problem osplace_13 is UNSAT
Problem osplace_14 is UNSAT
Problem osplace_15 is UNSAT
Problem osplace_16 is UNSAT
Problem osplace_17 is UNSAT
Problem osplace_18 is UNSAT
Problem osplace_19 is UNSAT
Problem osplace_20 is UNSAT
Problem osplace_21 is UNSAT
Problem osplace_22 is UNSAT
Problem osplace_23 is UNSAT
Problem osplace_24 is UNSAT
Problem osplace_25 is UNSAT
Problem osplace_34 is UNSAT
Problem osplace_45 is UNSAT
Problem osplace_49 is UNSAT
Problem osplace_50 is UNSAT
Problem osplace_51 is UNSAT
Problem osplace_52 is UNSAT
Problem osplace_53 is UNSAT
Problem osplace_54 is UNSAT
Problem osplace_55 is UNSAT
Problem osplace_56 is UNSAT
Problem osplace_57 is UNSAT
Problem osplace_58 is UNSAT
Problem osplace_59 is UNSAT
Problem osplace_60 is UNSAT
Problem osplace_61 is UNSAT
Problem osplace_62 is UNSAT
Problem osplace_63 is UNSAT
Problem osplace_64 is UNSAT
Problem osplace_65 is UNSAT
Problem osplace_66 is UNSAT
Problem osplace_67 is UNSAT
Problem osplace_68 is UNSAT
Problem osplace_69 is UNSAT
Problem osplace_70 is UNSAT
Problem osplace_78 is UNSAT
Problem osplace_89 is UNSAT
Problem osplace_100 is UNSAT
Problem osplace_111 is UNSAT
Problem osplace_112 is UNSAT
Problem osplace_162 is UNSAT
Problem osplace_163 is UNSAT
Problem osplace_164 is UNSAT
Problem osplace_165 is UNSAT
Problem osplace_166 is UNSAT
Problem osplace_168 is UNSAT
Problem osplace_169 is UNSAT
Problem osplace_170 is UNSAT
Problem osplace_171 is UNSAT
Problem osplace_172 is UNSAT
Problem osplace_173 is UNSAT
Problem osplace_174 is UNSAT
Problem osplace_175 is UNSAT
Problem osplace_176 is UNSAT
Problem osplace_177 is UNSAT
Problem osplace_179 is UNSAT
Problem osplace_180 is UNSAT
Problem osplace_181 is UNSAT
Problem osplace_182 is UNSAT
Problem osplace_183 is UNSAT
Problem osplace_187 is UNSAT
Problem osplace_198 is UNSAT
Problem osplace_209 is UNSAT
Problem osplace_220 is UNSAT
Problem osplace_231 is UNSAT
Problem osplace_242 is UNSAT
Problem osplace_245 is UNSAT
Problem osplace_246 is UNSAT
Problem osplace_247 is UNSAT
Problem osplace_248 is UNSAT
Problem osplace_249 is UNSAT
Problem osplace_250 is UNSAT
Problem osplace_251 is UNSAT
Problem osplace_252 is UNSAT
Problem osplace_253 is UNSAT
Problem osplace_254 is UNSAT
Problem osplace_255 is UNSAT
Problem osplace_256 is UNSAT
Problem osplace_257 is UNSAT
Problem osplace_258 is UNSAT
Problem osplace_259 is UNSAT
Problem osplace_260 is UNSAT
Problem osplace_261 is UNSAT
Problem osplace_262 is UNSAT
Problem osplace_263 is UNSAT
After SMT solving in domain Real declared 426/427 variables, and 406 constraints, problems are : Problem set: 161 solved, 0 unsolved in 3439 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 264/264 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3486ms problems are : Problem set: 161 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query OneSafe after proving 424 properties.
FORMULA OneSafe TRUE TECHNIQUES INVARIANTS SMT_REFINEMENT SAT_SMT STRUCTURAL
Total runtime 5970 ms.

BK_STOP 1780307451647

--------------------
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
+ [[ OneSafe = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution OneSafe -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination OneSafe -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="SupplyChain-PT-00020"
export BK_EXAMINATION="OneSafe"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is SupplyChain-PT-00020, examination is OneSafe"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r368-tall-178024404800120"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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