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.r476-tall-171620505100095.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 CANInsertWithFailure-PT-005, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505100095
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 7.8K 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 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 07:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 07:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 12 07:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 126K Apr 12 07:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 202K 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 CANInsertWithFailure-PT-005-ReachabilityFireability-2024-00
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityFireability-2024-01
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityFireability-2024-02
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityFireability-2024-03
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityFireability-2024-04
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityFireability-2024-05
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityFireability-2024-06
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityFireability-2024-07
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityFireability-2024-08
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityFireability-2024-09
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityFireability-2024-10
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityFireability-2024-11
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityFireability-2024-12
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityFireability-2024-13
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityFireability-2024-14
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717186066182

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-005
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:07:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:07:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:07:47] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-31 20:07:47] [INFO ] Transformed 114 places.
[2024-05-31 20:07:47] [INFO ] Transformed 180 transitions.
[2024-05-31 20:07:47] [INFO ] Parsed PT model containing 114 places and 180 transitions and 500 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-005-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (415 resets) in 1682 ms. (23 steps per ms) remains 12/14 properties
FORMULA CANInsertWithFailure-PT-005-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (71 resets) in 325 ms. (122 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (93 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (114 resets) in 1253 ms. (31 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (97 resets) in 141 ms. (281 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (42 resets) in 147 ms. (270 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (103 resets) in 208 ms. (191 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (77 resets) in 134 ms. (296 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (21 resets) in 139 ms. (285 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (51 resets) in 129 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (88 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (90 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (100 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
// Phase 1: matrix 180 rows 114 cols
[2024-05-31 20:07:49] [INFO ] Computed 8 invariants in 14 ms
[2024-05-31 20:07:49] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem CANInsertWithFailure-PT-005-ReachabilityFireability-2024-01 is UNSAT
FORMULA CANInsertWithFailure-PT-005-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANInsertWithFailure-PT-005-ReachabilityFireability-2024-07 is UNSAT
FORMULA CANInsertWithFailure-PT-005-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANInsertWithFailure-PT-005-ReachabilityFireability-2024-08 is UNSAT
FORMULA CANInsertWithFailure-PT-005-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 18/113 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 9 unsolved
[2024-05-31 20:07:49] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 8 ms to minimize.
[2024-05-31 20:07:49] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
Problem CANInsertWithFailure-PT-005-ReachabilityFireability-2024-11 is UNSAT
FORMULA CANInsertWithFailure-PT-005-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 2/9 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-05-31 20:07:49] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 2 ms to minimize.
[2024-05-31 20:07:50] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:07:50] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:07:50] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 4/13 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-05-31 20:07:50] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:07:50] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:07:50] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:07:50] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:07:50] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 5/18 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-05-31 20:07:50] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:07:50] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 2/20 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/114 variables, 1/21 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 180/294 variables, 114/135 constraints. Problems are: Problem set: 4 solved, 8 unsolved
Problem CANInsertWithFailure-PT-005-ReachabilityFireability-2024-09 is UNSAT
FORMULA CANInsertWithFailure-PT-005-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 45/180 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/180 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/294 variables, 0/180 constraints. Problems are: Problem set: 5 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 180 constraints, problems are : Problem set: 5 solved, 7 unsolved in 1525 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 5 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 27/113 variables, 6/6 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/7 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 13/20 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/20 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/114 variables, 1/21 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/21 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 180/294 variables, 114/135 constraints. Problems are: Problem set: 5 solved, 7 unsolved
Problem CANInsertWithFailure-PT-005-ReachabilityFireability-2024-00 is UNSAT
FORMULA CANInsertWithFailure-PT-005-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANInsertWithFailure-PT-005-ReachabilityFireability-2024-03 is UNSAT
FORMULA CANInsertWithFailure-PT-005-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANInsertWithFailure-PT-005-ReachabilityFireability-2024-04 is UNSAT
FORMULA CANInsertWithFailure-PT-005-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 45/180 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 4/184 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 0/184 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/294 variables, 0/184 constraints. Problems are: Problem set: 8 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 184 constraints, problems are : Problem set: 8 solved, 4 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 4/12 constraints, Known Traps: 13/13 constraints]
After SMT, in 2334ms problems are : Problem set: 8 solved, 4 unsolved
Parikh walk visited 0 properties in 531 ms.
Support contains 74 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 180/180 transitions.
Graph (complete) has 276 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 113 transition count 177
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 110 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 109 transition count 176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 109 transition count 175
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 108 transition count 175
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 20 place count 108 transition count 175
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 108 transition count 175
Applied a total of 22 rules in 96 ms. Remains 108 /114 variables (removed 6) and now considering 175/180 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 108/114 places, 175/180 transitions.
RANDOM walk for 40000 steps (467 resets) in 422 ms. (94 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (122 resets) in 200 ms. (199 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (112 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (74 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (116 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
Probably explored full state space saw : 131150 states, properties seen :0
Probabilistic random walk after 711338 steps, saw 131150 distinct states, run finished after 2506 ms. (steps per millisecond=283 ) properties seen :0
Explored full state space saw : 131153 states, properties seen :0
Exhaustive walk after 711354 steps, saw 131153 distinct states, run finished after 2210 ms. (steps per millisecond=321 ) properties seen :0
FORMULA CANInsertWithFailure-PT-005-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 9971 ms.
ITS solved all properties within timeout

BK_STOP 1717186077435

--------------------
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="CANInsertWithFailure-PT-005"
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 CANInsertWithFailure-PT-005, 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 r476-tall-171620505100095"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-005.tgz
mv CANInsertWithFailure-PT-005 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 ;