Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r042-smll-174853822900162.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is CANInsertWithFailure-PT-010, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-174853822900162
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 698K May 29 14:32 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 1748549274943

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CANInsertWithFailure-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 20:07:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-29 20:07:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:07:58] [INFO ] Load time of PNML (sax parser for PT used): 272 ms
[2025-05-29 20:07:58] [INFO ] Transformed 324 places.
[2025-05-29 20:07:58] [INFO ] Transformed 660 transitions.
[2025-05-29 20:07:58] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 513 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 253 transition count 590
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 321 place count 163 transition count 500
Applied a total of 321 rules in 138 ms. Remains 163 /324 variables (removed 161) and now considering 500/660 (removed 160) transitions.
[2025-05-29 20:07:58] [INFO ] Flow matrix only has 428 transitions (discarded 72 similar events)
// Phase 1: matrix 428 rows 163 cols
[2025-05-29 20:07:58] [INFO ] Computed 12 invariants in 48 ms
[2025-05-29 20:07:59] [INFO ] Implicit Places using invariants in 643 ms returned []
[2025-05-29 20:07:59] [INFO ] Flow matrix only has 428 transitions (discarded 72 similar events)
[2025-05-29 20:07:59] [INFO ] Invariant cache hit.
[2025-05-29 20:07:59] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-05-29 20:08:00] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1629 ms to find 0 implicit places.
Running 490 sub problems to find dead transitions.
[2025-05-29 20:08:00] [INFO ] Flow matrix only has 428 transitions (discarded 72 similar events)
[2025-05-29 20:08:00] [INFO ] Invariant cache hit.
[2025-05-29 20:08:00] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2025-05-29 20:08:04] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 21 ms to minimize.
[2025-05-29 20:08:04] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 3 ms to minimize.
[2025-05-29 20:08:04] [INFO ] Deduced a trap composed of 2 places in 205 ms of which 3 ms to minimize.
[2025-05-29 20:08:04] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 3 ms to minimize.
[2025-05-29 20:08:04] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2025-05-29 20:08:04] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2025-05-29 20:08:05] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 3 ms to minimize.
[2025-05-29 20:08:05] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2025-05-29 20:08:05] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 3 ms to minimize.
[2025-05-29 20:08:05] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 3 ms to minimize.
[2025-05-29 20:08:05] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 3 ms to minimize.
[2025-05-29 20:08:05] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 2 ms to minimize.
[2025-05-29 20:08:07] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 4 ms to minimize.
[2025-05-29 20:08:07] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2025-05-29 20:08:07] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2025-05-29 20:08:07] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2025-05-29 20:08:07] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 3 ms to minimize.
[2025-05-29 20:08:07] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2025-05-29 20:08:08] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2025-05-29 20:08:08] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2025-05-29 20:08:08] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2025-05-29 20:08:08] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 3 ms to minimize.
[2025-05-29 20:08:09] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 3 ms to minimize.
[2025-05-29 20:08:09] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2025-05-29 20:08:09] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2025-05-29 20:08:09] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2025-05-29 20:08:09] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2025-05-29 20:08:09] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2025-05-29 20:08:09] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2025-05-29 20:08:10] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 3 ms to minimize.
[2025-05-29 20:08:11] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2025-05-29 20:08:11] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2025-05-29 20:08:11] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2025-05-29 20:08:12] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 3 ms to minimize.
[2025-05-29 20:08:12] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2025-05-29 20:08:12] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2025-05-29 20:08:12] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2025-05-29 20:08:12] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2025-05-29 20:08:12] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2025-05-29 20:08:12] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2025-05-29 20:08:15] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2025-05-29 20:08:15] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2025-05-29 20:08:15] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
[2025-05-29 20:08:16] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2025-05-29 20:08:16] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2025-05-29 20:08:16] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2025-05-29 20:08:16] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2025-05-29 20:08:16] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2025-05-29 20:08:16] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2025-05-29 20:08:18] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 3 ms to minimize.
[2025-05-29 20:08:18] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 4 ms to minimize.
[2025-05-29 20:08:18] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2025-05-29 20:08:18] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2025-05-29 20:08:18] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2025-05-29 20:08:19] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2025-05-29 20:08:19] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2025-05-29 20:08:19] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2025-05-29 20:08:20] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2025-05-29 20:08:20] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2025-05-29 20:08:20] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2025-05-29 20:08:21] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2025-05-29 20:08:21] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2025-05-29 20:08:21] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2025-05-29 20:08:21] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 4 ms to minimize.
[2025-05-29 20:08:21] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2025-05-29 20:08:21] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2025-05-29 20:08:21] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2025-05-29 20:08:21] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2025-05-29 20:08:21] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2025-05-29 20:08:22] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2025-05-29 20:08:22] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2025-05-29 20:08:22] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2025-05-29 20:08:22] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 3 ms to minimize.
[2025-05-29 20:08:22] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2025-05-29 20:08:22] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2025-05-29 20:08:22] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2025-05-29 20:08:22] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
[2025-05-29 20:08:22] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2025-05-29 20:08:22] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2025-05-29 20:08:22] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2025-05-29 20:08:24] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2025-05-29 20:08:29] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2025-05-29 20:08:29] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2025-05-29 20:08:29] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2025-05-29 20:08:29] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2025-05-29 20:08:29] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2025-05-29 20:08:29] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
[2025-05-29 20:08:29] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 162/591 variables, and 100 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/163 constraints, ReadFeed: 0/288 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 0 solved, 490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2025-05-29 20:08:33] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2025-05-29 20:08:34] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2025-05-29 20:08:35] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (OVERLAPS) 428/590 variables, 162/265 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 288/553 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/590 variables, 490/1043 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/591 variables, and 1043 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 162/163 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 91/91 constraints]
After SMT, in 60559ms problems are : Problem set: 0 solved, 490 unsolved
Search for dead transitions found 0 dead transitions in 60611ms
Starting structural reductions in LIVENESS mode, iteration 1 : 163/324 places, 500/660 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 62445 ms. Remains : 163/324 places, 500/660 transitions.
Discarding 260 transitions out of 500. Remains 240
Initial state reduction rules removed 10 formulas.
RANDOM walk for 9995 steps (188 resets) in 1029 ms. (9 steps per ms) remains 0/230 properties
Able to resolve query QuasiLiveness after proving 240 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 63515 ms.
ITS solved all properties within timeout

BK_STOP 1748549341214

--------------------
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="CANInsertWithFailure-PT-010"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is CANInsertWithFailure-PT-010, 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 r042-smll-174853822900162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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