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.r014-tall-174853743300102.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 Anderson-PT-06, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743300102
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 302K 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 1748542229180

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:10:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-29 18:10:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:10:30] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2025-05-29 18:10:30] [INFO ] Transformed 229 places.
[2025-05-29 18:10:30] [INFO ] Transformed 600 transitions.
[2025-05-29 18:10:30] [INFO ] Found NUPN structural information;
[2025-05-29 18:10:30] [INFO ] Parsed PT model containing 229 places and 600 transitions and 2280 arcs in 191 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 229/229 places, 600/600 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 229 transition count 570
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 199 transition count 570
Applied a total of 60 rules in 49 ms. Remains 199 /229 variables (removed 30) and now considering 570/600 (removed 30) transitions.
// Phase 1: matrix 570 rows 199 cols
[2025-05-29 18:10:30] [INFO ] Computed 15 invariants in 39 ms
[2025-05-29 18:10:31] [INFO ] Implicit Places using invariants in 562 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 594 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 198/229 places, 570/600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 198 transition count 534
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 162 transition count 534
Applied a total of 72 rules in 12 ms. Remains 162 /198 variables (removed 36) and now considering 534/570 (removed 36) transitions.
// Phase 1: matrix 534 rows 162 cols
[2025-05-29 18:10:31] [INFO ] Computed 14 invariants in 7 ms
[2025-05-29 18:10:31] [INFO ] Implicit Places using invariants in 237 ms returned []
[2025-05-29 18:10:31] [INFO ] Invariant cache hit.
[2025-05-29 18:10:31] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-29 18:10:32] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 162/229 places, 534/600 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1648 ms. Remains : 162/229 places, 534/600 transitions.
Initial state reduction rules removed 6 formulas.
RANDOM walk for 40000 steps (8 resets) in 1913 ms. (20 steps per ms) remains 93/528 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 76/93 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 73/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 39/73 properties
BEST_FIRST walk for 4002 steps (8 resets) in 74 ms. (53 steps per ms) remains 37/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 22/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
[2025-05-29 18:10:33] [INFO ] Invariant cache hit.
[2025-05-29 18:10:33] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 132/146 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 132/152 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 15/161 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 15/174 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2025-05-29 18:10:34] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 20 ms to minimize.
[2025-05-29 18:10:34] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2025-05-29 18:10:34] [INFO ] Deduced a trap composed of 68 places in 157 ms of which 1 ms to minimize.
[2025-05-29 18:10:34] [INFO ] Deduced a trap composed of 70 places in 411 ms of which 2 ms to minimize.
[2025-05-29 18:10:34] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 1 ms to minimize.
[2025-05-29 18:10:35] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 1 ms to minimize.
[2025-05-29 18:10:35] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 1 ms to minimize.
[2025-05-29 18:10:35] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 2 ms to minimize.
[2025-05-29 18:10:35] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 1 ms to minimize.
[2025-05-29 18:10:35] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 1 ms to minimize.
[2025-05-29 18:10:35] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 2 ms to minimize.
[2025-05-29 18:10:35] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 1 ms to minimize.
[2025-05-29 18:10:35] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 1 ms to minimize.
[2025-05-29 18:10:35] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 1 ms to minimize.
[2025-05-29 18:10:35] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
[2025-05-29 18:10:36] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 1 ms to minimize.
[2025-05-29 18:10:36] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2025-05-29 18:10:36] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 1 ms to minimize.
[2025-05-29 18:10:36] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 1 ms to minimize.
[2025-05-29 18:10:36] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2025-05-29 18:10:36] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2025-05-29 18:10:36] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2025-05-29 18:10:36] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2025-05-29 18:10:36] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2025-05-29 18:10:37] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 1 ms to minimize.
[2025-05-29 18:10:37] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 1 ms to minimize.
[2025-05-29 18:10:37] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 1 ms to minimize.
[2025-05-29 18:10:37] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2025-05-29 18:10:37] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 1 ms to minimize.
[2025-05-29 18:10:37] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
[2025-05-29 18:10:37] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 7/205 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 1/162 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 162/696 variables, and 207 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5012 ms.
Refiners :[Domain max(s): 162/162 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/162 constraints, ReadFeed: 0/54 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 132/146 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 132/152 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 15/161 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 15/174 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 31/205 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 1/162 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 534/696 variables, 162/369 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 54/423 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 15/438 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/696 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 0/696 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 696/696 variables, and 438 constraints, problems are : Problem set: 0 solved, 15 unsolved in 4094 ms.
Refiners :[Domain max(s): 162/162 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 31/31 constraints]
After SMT, in 9219ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 4 properties in 1478 ms.
Support contains 10 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 534/534 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 110 transition count 262
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 110 transition count 262
Applied a total of 104 rules in 25 ms. Remains 110 /162 variables (removed 52) and now considering 262/534 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 110/162 places, 262/534 transitions.
RANDOM walk for 4000000 steps (8 resets) in 10434 ms. (383 steps per ms) remains 3/11 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 2071 ms. (1930 steps per ms) remains 1/3 properties
BEST_FIRST walk for 58303 steps (0 resets) in 37 ms. (1534 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 534 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 17178 ms.
ITS solved all properties within timeout

BK_STOP 1748542247592

--------------------
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="Anderson-PT-06"
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 Anderson-PT-06, 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 r014-tall-174853743300102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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