Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445700351.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S06J06T06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445700351
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 20K Apr 11 17:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 17:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 340K Apr 11 17:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 11 17:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.1K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 28K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 374K Apr 11 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 11 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11M May 18 16:43 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 PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716874219117

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:30:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 05:30:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:30:21] [INFO ] Load time of PNML (sax parser for PT used): 1013 ms
[2024-05-28 05:30:21] [INFO ] Transformed 700 places.
[2024-05-28 05:30:21] [INFO ] Transformed 10740 transitions.
[2024-05-28 05:30:21] [INFO ] Parsed PT model containing 700 places and 10740 transitions and 89778 arcs in 1294 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 96 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 05:30:21] [INFO ] Reduced 7020 identical enabling conditions.
[2024-05-28 05:30:21] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 05:30:21] [INFO ] Reduced 90 identical enabling conditions.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
RANDOM walk for 40000 steps (256 resets) in 2891 ms. (13 steps per ms) remains 7/16 properties
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (19 resets) in 315 ms. (126 steps per ms) remains 6/7 properties
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (28 resets) in 273 ms. (145 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (40 resets) in 884 ms. (45 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 375 ms. (106 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (21 resets) in 346 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 1264 ms. (31 steps per ms) remains 6/6 properties
[2024-05-28 05:30:24] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 700 cols
[2024-05-28 05:30:24] [INFO ] Computed 58 invariants in 220 ms
[2024-05-28 05:30:24] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-09 is UNSAT
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-10 is UNSAT
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-12 is UNSAT
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 175/205 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 1/10 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 25/230 variables, 5/15 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 54/284 variables, 2/17 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-13 is UNSAT
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-15 is UNSAT
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 385/669 variables, 20/37 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 0/37 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/678 variables, 5/42 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/678 variables, 0/42 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 20/698 variables, 15/57 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/698 variables, 0/57 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/3334 variables, and 755 constraints, problems are : Problem set: 5 solved, 1 unsolved in 5043 ms.
Refiners :[Positive P Invariants (semi-flows): 21/22 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 698/700 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/84 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/109 variables, 5/8 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/244 variables, 5/13 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/13 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 420/664 variables, 19/32 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-05-28 05:30:30] [INFO ] Deduced a trap composed of 94 places in 387 ms of which 33 ms to minimize.
[2024-05-28 05:30:31] [INFO ] Deduced a trap composed of 93 places in 299 ms of which 4 ms to minimize.
[2024-05-28 05:30:31] [INFO ] Deduced a trap composed of 93 places in 162 ms of which 2 ms to minimize.
[2024-05-28 05:30:31] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 4/36 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 0/36 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/676 variables, 8/44 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/676 variables, 0/44 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/698 variables, 17/61 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/698 variables, 0/61 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/3334 variables, and 759 constraints, problems are : Problem set: 5 solved, 1 unsolved in 4785 ms.
Refiners :[Positive P Invariants (semi-flows): 21/22 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 698/700 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 4/4 constraints]
After SMT, in 10728ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 5 out of 700 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 694 transition count 2622
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 102 place count 646 transition count 2622
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 102 place count 646 transition count 2538
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 270 place count 562 transition count 2538
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 20 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 414 place count 490 transition count 2466
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 2 with 17 rules applied. Total rules applied 431 place count 490 transition count 2449
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 448 place count 473 transition count 2449
Applied a total of 448 rules in 570 ms. Remains 473 /700 variables (removed 227) and now considering 2449/2670 (removed 221) transitions.
Running 2443 sub problems to find dead transitions.
[2024-05-28 05:30:35] [INFO ] Flow matrix only has 2413 transitions (discarded 36 similar events)
// Phase 1: matrix 2413 rows 473 cols
[2024-05-28 05:30:35] [INFO ] Computed 52 invariants in 88 ms
[2024-05-28 05:30:35] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 2443 unsolved
[2024-05-28 05:31:16] [INFO ] Deduced a trap composed of 15 places in 474 ms of which 2 ms to minimize.
[2024-05-28 05:31:16] [INFO ] Deduced a trap composed of 26 places in 462 ms of which 7 ms to minimize.
[2024-05-28 05:31:17] [INFO ] Deduced a trap composed of 50 places in 453 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/2886 variables, and 48 constraints, problems are : Problem set: 0 solved, 2443 unsolved in 20072 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 28/34 constraints, State Equation: 0/473 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2443/1098 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2443 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 2443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/467 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2443 unsolved
[2024-05-28 05:31:20] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 2 ms to minimize.
[2024-05-28 05:31:20] [INFO ] Deduced a trap composed of 58 places in 187 ms of which 1 ms to minimize.
[2024-05-28 05:31:21] [INFO ] Deduced a trap composed of 145 places in 478 ms of which 3 ms to minimize.
[2024-05-28 05:31:36] [INFO ] Deduced a trap composed of 134 places in 373 ms of which 3 ms to minimize.
[2024-05-28 05:31:37] [INFO ] Deduced a trap composed of 119 places in 323 ms of which 2 ms to minimize.
[2024-05-28 05:31:38] [INFO ] Deduced a trap composed of 139 places in 405 ms of which 2 ms to minimize.
SMT process timed out in 62330ms, After SMT, problems are : Problem set: 0 solved, 2443 unsolved
Search for dead transitions found 0 dead transitions in 62370ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62966 ms. Remains : 473/700 places, 2449/2670 transitions.
RANDOM walk for 40000 steps (415 resets) in 1280 ms. (31 steps per ms) remains 1/1 properties
BEST_FIRST walk for 28598 steps (29 resets) in 235 ms. (121 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 78031 ms.
ITS solved all properties within timeout

BK_STOP 1716874298631

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="PolyORBLF-PT-S06J06T06"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBLF-PT-S06J06T06, 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 r289-tajo-171654445700351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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