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.r254-tall-171654364200402.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 greatspnxred
Input is NoC3x3-PT-6B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-171654364200402
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 552K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1716636979129

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=NoC3x3-PT-6B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 11:36:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-25 11:36:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 11:36:20] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2024-05-25 11:36:20] [INFO ] Transformed 1544 places.
[2024-05-25 11:36:20] [INFO ] Transformed 2229 transitions.
[2024-05-25 11:36:20] [INFO ] Found NUPN structural information;
[2024-05-25 11:36:20] [INFO ] Parsed PT model containing 1544 places and 2229 transitions and 6663 arcs in 408 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1544/1544 places, 2229/2229 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 230 transitions
Trivial Post-agglo rules discarded 230 transitions
Performed 230 trivial Post agglomeration. Transition count delta: 230
Iterating post reduction 0 with 230 rules applied. Total rules applied 230 place count 1544 transition count 1999
Reduce places removed 230 places and 0 transitions.
Iterating post reduction 1 with 230 rules applied. Total rules applied 460 place count 1314 transition count 1999
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 460 place count 1314 transition count 1935
Deduced a syphon composed of 64 places in 35 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 588 place count 1250 transition count 1935
Performed 501 Post agglomeration using F-continuation condition.Transition count delta: 501
Deduced a syphon composed of 501 places in 1 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 1590 place count 749 transition count 1434
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -61
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 1792 place count 648 transition count 1495
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 68 places in 17 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 1928 place count 580 transition count 1521
Applied a total of 1928 rules in 477 ms. Remains 580 /1544 variables (removed 964) and now considering 1521/2229 (removed 708) transitions.
[2024-05-25 11:36:21] [INFO ] Flow matrix only has 1401 transitions (discarded 120 similar events)
// Phase 1: matrix 1401 rows 580 cols
[2024-05-25 11:36:21] [INFO ] Computed 66 invariants in 35 ms
[2024-05-25 11:36:22] [INFO ] Implicit Places using invariants in 851 ms returned [13, 55, 117, 165, 245, 372, 442, 490, 558]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 885 ms to find 9 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 571/1544 places, 1521/2229 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 547 transition count 1497
Applied a total of 48 rules in 29 ms. Remains 547 /571 variables (removed 24) and now considering 1497/1521 (removed 24) transitions.
[2024-05-25 11:36:22] [INFO ] Flow matrix only has 1377 transitions (discarded 120 similar events)
// Phase 1: matrix 1377 rows 547 cols
[2024-05-25 11:36:22] [INFO ] Computed 57 invariants in 10 ms
[2024-05-25 11:36:22] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-25 11:36:22] [INFO ] Flow matrix only has 1377 transitions (discarded 120 similar events)
[2024-05-25 11:36:22] [INFO ] Invariant cache hit.
[2024-05-25 11:36:23] [INFO ] State equation strengthened by 128 read => feed constraints.
[2024-05-25 11:36:24] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 2036 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 547/1544 places, 1497/2229 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 3456 ms. Remains : 547/1544 places, 1497/2229 transitions.
Discarding 665 transitions out of 1497. Remains 832
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (281 resets) in 5026 ms. (7 steps per ms) remains 40/831 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
[2024-05-25 11:36:25] [INFO ] Flow matrix only has 1377 transitions (discarded 120 similar events)
[2024-05-25 11:36:25] [INFO ] Invariant cache hit.
[2024-05-25 11:36:25] [INFO ] State equation strengthened by 128 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 199/260 variables, 27/88 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 199/287 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-25 11:36:26] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 287/547 variables, 30/318 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 287/605 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-25 11:36:27] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/547 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 1377/1924 variables, 547/1153 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1924 variables, 128/1281 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1924 variables, 0/1281 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1924/1924 variables, and 1281 constraints, problems are : Problem set: 0 solved, 40 unsolved in 5012 ms.
Refiners :[Domain max(s): 547/547 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 547/547 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 199/260 variables, 27/88 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 199/287 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 287/547 variables, 30/318 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 287/605 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-25 11:36:31] [INFO ] Deduced a trap composed of 27 places in 246 ms of which 4 ms to minimize.
[2024-05-25 11:36:32] [INFO ] Deduced a trap composed of 39 places in 242 ms of which 3 ms to minimize.
[2024-05-25 11:36:32] [INFO ] Deduced a trap composed of 69 places in 241 ms of which 3 ms to minimize.
[2024-05-25 11:36:32] [INFO ] Deduced a trap composed of 29 places in 227 ms of which 3 ms to minimize.
[2024-05-25 11:36:32] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 3 ms to minimize.
[2024-05-25 11:36:33] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 3 ms to minimize.
[2024-05-25 11:36:33] [INFO ] Deduced a trap composed of 52 places in 206 ms of which 3 ms to minimize.
[2024-05-25 11:36:33] [INFO ] Deduced a trap composed of 60 places in 194 ms of which 3 ms to minimize.
[2024-05-25 11:36:33] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 2 ms to minimize.
[2024-05-25 11:36:34] [INFO ] Deduced a trap composed of 60 places in 148 ms of which 2 ms to minimize.
[2024-05-25 11:36:34] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 2 ms to minimize.
[2024-05-25 11:36:34] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 2 ms to minimize.
[2024-05-25 11:36:34] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 3 ms to minimize.
[2024-05-25 11:36:35] [INFO ] Deduced a trap composed of 52 places in 236 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/547 variables, 14/620 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/547 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 40 unsolved
SMT process timed out in 10148ms, After SMT, problems are : Problem set: 0 solved, 40 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 61 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 1497/1497 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 98 place count 449 transition count 1157
Iterating global reduction 0 with 98 rules applied. Total rules applied 196 place count 449 transition count 1157
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 213 place count 432 transition count 1089
Iterating global reduction 0 with 17 rules applied. Total rules applied 230 place count 432 transition count 1089
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 232 place count 430 transition count 1081
Iterating global reduction 0 with 2 rules applied. Total rules applied 234 place count 430 transition count 1081
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 240 place count 430 transition count 1075
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 1 with 46 rules applied. Total rules applied 286 place count 430 transition count 1029
Free-agglomeration rule applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 311 place count 430 transition count 1004
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 350 place count 405 transition count 990
Applied a total of 350 rules in 176 ms. Remains 405 /547 variables (removed 142) and now considering 990/1497 (removed 507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 405/547 places, 990/1497 transitions.
RANDOM walk for 1287404 steps (9635 resets) in 11068 ms. (116 steps per ms) remains 0/40 properties
Able to resolve query QuasiLiveness after proving 832 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 20524 ms.
ITS solved all properties within timeout

BK_STOP 1716637000911

--------------------
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 QuasiLiveness -timeout 180 -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="NoC3x3-PT-6B"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 NoC3x3-PT-6B, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-171654364200402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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