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-171649612600351.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-S16C3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612600351
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 12 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K 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 905K 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-S16C3-ReachabilityFireability-2024-00
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-01
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-02
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-03
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-04
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-05
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-06
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-07
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-08
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-09
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-10
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-11
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-12
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-13
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-14
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717228472191

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-S16C3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:54:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:54:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:54:33] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2024-06-01 07:54:33] [INFO ] Transformed 1542 places.
[2024-06-01 07:54:33] [INFO ] Transformed 1449 transitions.
[2024-06-01 07:54:33] [INFO ] Parsed PT model containing 1542 places and 1449 transitions and 4668 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1529 resets) in 1639 ms. (24 steps per ms) remains 9/16 properties
FORMULA LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (97 resets) in 276 ms. (144 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (96 resets) in 187 ms. (212 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (96 resets) in 334 ms. (119 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (170 resets) in 469 ms. (85 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (170 resets) in 172 ms. (231 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (193 resets) in 269 ms. (148 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (169 resets) in 141 ms. (281 steps per ms) remains 8/9 properties
FORMULA LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (97 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (168 resets) in 56 ms. (701 steps per ms) remains 8/8 properties
// Phase 1: matrix 1449 rows 1542 cols
[2024-06-01 07:54:34] [INFO ] Computed 93 invariants in 82 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 17/274 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/275 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-01 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-04 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-09 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-11 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 1259/1534 variables, 67/85 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1534 variables, 0/85 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/1535 variables, 1/86 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1535 variables, 0/86 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/1542 variables, 7/93 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 0/93 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1449/2991 variables, 1542/1635 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2991 variables, 0/1635 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2991 variables, 0/1635 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2991/2991 variables, and 1635 constraints, problems are : Problem set: 4 solved, 4 unsolved in 2476 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 1542/1542 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/151 variables, 13/13 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/152 variables, 1/14 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/14 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1364/1516 variables, 59/73 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-06-01 07:54:38] [INFO ] Deduced a trap composed of 86 places in 771 ms of which 84 ms to minimize.
[2024-06-01 07:54:39] [INFO ] Deduced a trap composed of 85 places in 710 ms of which 11 ms to minimize.
[2024-06-01 07:54:40] [INFO ] Deduced a trap composed of 98 places in 653 ms of which 10 ms to minimize.
[2024-06-01 07:54:41] [INFO ] Deduced a trap composed of 61 places in 721 ms of which 11 ms to minimize.
[2024-06-01 07:54:41] [INFO ] Deduced a trap composed of 77 places in 654 ms of which 10 ms to minimize.
[2024-06-01 07:54:42] [INFO ] Deduced a trap composed of 79 places in 627 ms of which 10 ms to minimize.
[2024-06-01 07:54:43] [INFO ] Deduced a trap composed of 70 places in 684 ms of which 9 ms to minimize.
SMT process timed out in 8342ms, After SMT, problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 138 out of 1542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Graph (complete) has 2953 edges and 1542 vertex of which 1247 are kept as prefixes of interest. Removing 295 places using SCC suffix rule.5 ms
Discarding 295 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 209 place count 1247 transition count 1239
Reduce places removed 208 places and 0 transitions.
Performed 249 Post agglomeration using F-continuation condition.Transition count delta: 249
Iterating post reduction 1 with 457 rules applied. Total rules applied 666 place count 1039 transition count 990
Reduce places removed 249 places and 0 transitions.
Iterating post reduction 2 with 249 rules applied. Total rules applied 915 place count 790 transition count 990
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 915 place count 790 transition count 974
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 947 place count 774 transition count 974
Discarding 192 places :
Symmetric choice reduction at 3 with 192 rule applications. Total rules 1139 place count 582 transition count 782
Iterating global reduction 3 with 192 rules applied. Total rules applied 1331 place count 582 transition count 782
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1345 place count 568 transition count 768
Iterating global reduction 3 with 14 rules applied. Total rules applied 1359 place count 568 transition count 768
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1375 place count 568 transition count 752
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 1391 place count 552 transition count 752
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 4 with 22 rules applied. Total rules applied 1413 place count 552 transition count 752
Applied a total of 1413 rules in 359 ms. Remains 552 /1542 variables (removed 990) and now considering 752/1449 (removed 697) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 369 ms. Remains : 552/1542 places, 752/1449 transitions.
RANDOM walk for 40000 steps (2266 resets) in 425 ms. (93 steps per ms) remains 3/4 properties
FORMULA LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (127 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (198 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (197 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
// Phase 1: matrix 752 rows 552 cols
[2024-06-01 07:54:43] [INFO ] Computed 54 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 429/518 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 34/552 variables, 23/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 752/1304 variables, 552/606 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1304 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1304 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1304/1304 variables, and 606 constraints, problems are : Problem set: 0 solved, 3 unsolved in 678 ms.
Refiners :[Generalized P Invariants (flows): 54/54 constraints, State Equation: 552/552 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 429/518 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 34/552 variables, 23/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 752/1304 variables, 552/606 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1304 variables, 3/609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1304 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1304 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1304/1304 variables, and 609 constraints, problems are : Problem set: 0 solved, 3 unsolved in 964 ms.
Refiners :[Generalized P Invariants (flows): 54/54 constraints, State Equation: 552/552 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1693ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-10 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 20 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
FORMULA LeafsetExtension-PT-S16C3-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 24 ms.
All properties solved without resorting to model-checking.
Total runtime 12256 ms.
ITS solved all properties within timeout

BK_STOP 1717228485619

--------------------
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-S16C3"
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-S16C3, 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-171649612600351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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