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.r484-smll-171624275900382.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 DNAwalker-PT-02track12Block2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r484-smll-171624275900382
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K 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:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 13 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 13:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 13 13:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 16 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 37K 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 DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-00
FORMULA_NAME DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-01
FORMULA_NAME DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-02
FORMULA_NAME DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-03
FORMULA_NAME DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-04
FORMULA_NAME DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-05
FORMULA_NAME DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-06
FORMULA_NAME DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-07
FORMULA_NAME DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-08
FORMULA_NAME DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-09
FORMULA_NAME DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-10
FORMULA_NAME DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-11
FORMULA_NAME DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-12
FORMULA_NAME DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-13
FORMULA_NAME DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-14
FORMULA_NAME DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717260361024

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-02track12Block2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:46:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:46:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:46:03] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-06-01 16:46:03] [INFO ] Transformed 14 places.
[2024-06-01 16:46:03] [INFO ] Transformed 84 transitions.
[2024-06-01 16:46:03] [INFO ] Parsed PT model containing 14 places and 84 transitions and 244 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 133 ms.
Working with output stream class java.io.PrintStream
FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (4466 resets) in 3305 ms. (12 steps per ms) remains 13/15 properties
FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (751 resets) in 1111 ms. (35 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (693 resets) in 564 ms. (70 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (768 resets) in 228 ms. (174 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (781 resets) in 193 ms. (206 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (806 resets) in 318 ms. (125 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (913 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (674 resets) in 265 ms. (150 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (750 resets) in 126 ms. (314 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (751 resets) in 151 ms. (263 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (700 resets) in 102 ms. (388 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (699 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (672 resets) in 138 ms. (287 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (678 resets) in 59 ms. (666 steps per ms) remains 13/13 properties
[2024-06-01 16:46:05] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
// Phase 1: matrix 83 rows 14 cols
[2024-06-01 16:46:06] [INFO ] Computed 0 invariants in 5 ms
[2024-06-01 16:46:06] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-02 is UNSAT
FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-06 is UNSAT
FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-08 is UNSAT
FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-10 is UNSAT
FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 82/96 variables, 14/14 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 16/30 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/30 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/97 variables, 1/31 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/31 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/97 variables, 0/31 constraints. Problems are: Problem set: 4 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 31 constraints, problems are : Problem set: 4 solved, 9 unsolved in 1386 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 9 unsolved
[2024-06-01 16:46:07] [INFO ] Deduced a trap composed of 1 places in 37 ms of which 13 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 9 unsolved
[2024-06-01 16:46:07] [INFO ] Deduced a trap composed of 1 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Problem DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-00 is UNSAT
FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-07 is UNSAT
FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 82/96 variables, 14/16 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 16/32 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 7/39 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/39 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/97 variables, 1/40 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/40 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/97 variables, 0/40 constraints. Problems are: Problem set: 6 solved, 7 unsolved
No progress, stopping.
Problem DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-01 is UNSAT
FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-04 is UNSAT
FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 97/97 variables, and 40 constraints, problems are : Problem set: 6 solved, 7 unsolved in 5009 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 7/13 constraints, Known Traps: 2/2 constraints]
After SMT, in 6584ms problems are : Problem set: 6 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 84/84 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 82
Applied a total of 2 rules in 25 ms. Remains 14 /14 variables (removed 0) and now considering 82/84 (removed 2) transitions.
Running 74 sub problems to find dead transitions.
// Phase 1: matrix 82 rows 14 cols
[2024-06-01 16:46:12] [INFO ] Computed 0 invariants in 3 ms
[2024-06-01 16:46:12] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 80/92 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 4/96 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 0/96 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 30 constraints, problems are : Problem set: 0 solved, 74 unsolved in 3048 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 80/92 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 74/102 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 4/96 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/96 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 104 constraints, problems are : Problem set: 0 solved, 74 unsolved in 20009 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 23230ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 23235ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23294 ms. Remains : 14/14 places, 82/84 transitions.
RANDOM walk for 40000 steps (4481 resets) in 823 ms. (48 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (797 resets) in 313 ms. (127 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (745 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (697 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (685 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (687 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
Probably explored full state space saw : 5459 states, properties seen :0
Probabilistic random walk after 25506 steps, saw 5459 distinct states, run finished after 195 ms. (steps per millisecond=130 ) properties seen :0
Explored full state space saw : 5459 states, properties seen :0
Exhaustive walk after 25506 steps, saw 5459 distinct states, run finished after 127 ms. (steps per millisecond=200 ) properties seen :0
FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 33732 ms.
ITS solved all properties within timeout

BK_STOP 1717260396922

--------------------
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

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="DNAwalker-PT-02track12Block2"
export BK_EXAMINATION="ReachabilityCardinality"
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 DNAwalker-PT-02track12Block2, 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 r484-smll-171624275900382"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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