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.r504-tall-171649612700407.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 ltsminxred
Input is LeafsetExtension-PT-S64C4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612700407
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:42 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 LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-00
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-01
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-02
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-03
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-04
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-05
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-06
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-07
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-08
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-09
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-10
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-11
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-12
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-13
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-14
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717229376135

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:09:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:09:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:09:38] [INFO ] Load time of PNML (sax parser for PT used): 693 ms
[2024-06-01 08:09:38] [INFO ] Transformed 21462 places.
[2024-06-01 08:09:38] [INFO ] Transformed 21129 transitions.
[2024-06-01 08:09:38] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 892 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1200 resets) in 3597 ms. (11 steps per ms) remains 8/16 properties
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (20 resets) in 580 ms. (68 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (43 resets) in 348 ms. (114 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (37 resets) in 457 ms. (87 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (36 resets) in 183 ms. (217 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (12 resets) in 165 ms. (240 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (37 resets) in 967 ms. (41 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (12 resets) in 222 ms. (179 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (43 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
// Phase 1: matrix 21129 rows 21462 cols
[2024-06-01 08:09:43] [INFO ] Computed 333 invariants in 2623 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 20/204 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 20075/20279 variables, 119/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20279/42591 variables, and 139 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5049 ms.
Refiners :[Positive P Invariants (semi-flows): 20/67 constraints, Generalized P Invariants (flows): 119/266 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 20/204 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 20075/20279 variables, 119/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 08:11:09] [INFO ] Deduced a trap composed of 293 places in 76823 ms of which 917 ms to minimize.
SMT process timed out in 89275ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 184 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 11257 are kept as prefixes of interest. Removing 10205 places using SCC suffix rule.41 ms
Discarding 10205 places :
Also discarding 4592 output transitions
Drop transitions (Output transitions of discarded places.) removed 4592 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1345 transitions
Reduce isomorphic transitions removed 1345 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4005 transitions
Trivial Post-agglo rules discarded 4005 transitions
Performed 4005 trivial Post agglomeration. Transition count delta: 4005
Iterating post reduction 0 with 5350 rules applied. Total rules applied 5351 place count 11257 transition count 11187
Reduce places removed 4006 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 4018 rules applied. Total rules applied 9369 place count 7251 transition count 11175
Reduce places removed 12 places and 0 transitions.
Performed 890 Post agglomeration using F-continuation condition.Transition count delta: 890
Iterating post reduction 2 with 902 rules applied. Total rules applied 10271 place count 7239 transition count 10285
Reduce places removed 890 places and 0 transitions.
Iterating post reduction 3 with 890 rules applied. Total rules applied 11161 place count 6349 transition count 10285
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 81 Pre rules applied. Total rules applied 11161 place count 6349 transition count 10204
Deduced a syphon composed of 81 places in 7 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 4 with 162 rules applied. Total rules applied 11323 place count 6268 transition count 10204
Discarding 2681 places :
Symmetric choice reduction at 4 with 2681 rule applications. Total rules 14004 place count 3587 transition count 7523
Iterating global reduction 4 with 2681 rules applied. Total rules applied 16685 place count 3587 transition count 7523
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 16715 place count 3557 transition count 7493
Iterating global reduction 4 with 30 rules applied. Total rules applied 16745 place count 3557 transition count 7493
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 4 with 23 rules applied. Total rules applied 16768 place count 3557 transition count 7470
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 16791 place count 3534 transition count 7470
Partial Free-agglomeration rule applied 358 times.
Drop transitions (Partial Free agglomeration) removed 358 transitions
Iterating global reduction 5 with 358 rules applied. Total rules applied 17149 place count 3534 transition count 7470
Applied a total of 17149 rules in 4091 ms. Remains 3534 /21462 variables (removed 17928) and now considering 7470/21129 (removed 13659) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4104 ms. Remains : 3534/21462 places, 7470/21129 transitions.
RANDOM walk for 40000 steps (2310 resets) in 2731 ms. (14 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (31 resets) in 158 ms. (251 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (51 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (45 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (49 resets) in 208 ms. (191 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (37 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (45 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (20 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (53 resets) in 103 ms. (384 steps per ms) remains 7/8 properties
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-01 08:11:15] [INFO ] Flow matrix only has 6277 transitions (discarded 1193 similar events)
// Phase 1: matrix 6277 rows 3534 cols
[2024-06-01 08:11:15] [INFO ] Computed 121 invariants in 89 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1144/1325 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1325 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/1326 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1326 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-00 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 3422/4748 variables, 1326/1373 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4748 variables, 0/1373 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 4008/8756 variables, 1153/2526 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8756 variables, 54/2580 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8756 variables, 0/2580 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1020/9776 variables, 20/2600 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/9776 variables, 1020/3620 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/9776 variables, 0/3620 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 35/9811 variables, 35/3655 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/9811 variables, 0/3655 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/9811 variables, 0/3655 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9811/9811 variables, and 3655 constraints, problems are : Problem set: 1 solved, 6 unsolved in 7898 ms.
Refiners :[Generalized P Invariants (flows): 121/121 constraints, State Equation: 3534/3534 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1045/1194 variables, 40/40 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1194 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/1195 variables, 1/41 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1195 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 3024/4219 variables, 1195/1236 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4219 variables, 0/1236 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 4297/8516 variables, 1054/2290 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8516 variables, 17/2307 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8516 variables, 6/2313 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8516 variables, 0/2313 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1180/9696 variables, 63/2376 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/9696 variables, 1169/3545 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/9696 variables, 0/3545 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 115/9811 variables, 116/3661 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/9811 variables, 0/3661 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/9811 variables, 0/3661 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9811/9811 variables, and 3661 constraints, problems are : Problem set: 1 solved, 6 unsolved in 18343 ms.
Refiners :[Generalized P Invariants (flows): 121/121 constraints, State Equation: 3534/3534 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 26529ms problems are : Problem set: 1 solved, 6 unsolved
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 6 properties in 210 ms.
All properties solved without resorting to model-checking.
Total runtime 124717 ms.
ITS solved all properties within timeout

BK_STOP 1717229502104

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LeafsetExtension-PT-S64C4"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is LeafsetExtension-PT-S64C4, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r504-tall-171649612700407"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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