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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 20:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 20:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 20:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 67K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717193926209

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:18:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-31 22:18:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:18:47] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-31 22:18:47] [INFO ] Transformed 154 places.
[2024-05-31 22:18:47] [INFO ] Transformed 319 transitions.
[2024-05-31 22:18:47] [INFO ] Found NUPN structural information;
[2024-05-31 22:18:47] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 165 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 154/154 places, 319/319 transitions.
Graph (trivial) has 262 edges and 154 vertex of which 14 / 154 are part of one of the 7 SCC in 4 ms
Free SCC test removed 7 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 113 place count 91 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 114 place count 91 transition count 230
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 1 with 54 rules applied. Total rules applied 168 place count 64 transition count 263
Applied a total of 168 rules in 68 ms. Remains 64 /154 variables (removed 90) and now considering 263/319 (removed 56) transitions.
[2024-05-31 22:18:47] [INFO ] Flow matrix only has 216 transitions (discarded 47 similar events)
// Phase 1: matrix 216 rows 64 cols
[2024-05-31 22:18:47] [INFO ] Computed 18 invariants in 14 ms
[2024-05-31 22:18:47] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-31 22:18:47] [INFO ] Flow matrix only has 216 transitions (discarded 47 similar events)
[2024-05-31 22:18:47] [INFO ] Invariant cache hit.
[2024-05-31 22:18:47] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-31 22:18:48] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-05-31 22:18:48] [INFO ] Flow matrix only has 216 transitions (discarded 47 similar events)
[2024-05-31 22:18:48] [INFO ] Invariant cache hit.
[2024-05-31 22:18:48] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 10 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 3 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:18:50] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:18:50] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-31 22:18:50] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (OVERLAPS) 215/279 variables, 64/152 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 83/235 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 11 (OVERLAPS) 1/280 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 13 (OVERLAPS) 0/280 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 236 constraints, problems are : Problem set: 0 solved, 247 unsolved in 9453 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 6/88 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 215/279 variables, 64/152 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 83/235 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 247/482 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 11 (OVERLAPS) 1/280 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 13 (OVERLAPS) 0/280 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 483 constraints, problems are : Problem set: 0 solved, 247 unsolved in 13038 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 6/6 constraints]
After SMT, in 22934ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 22955ms
Starting structural reductions in LIVENESS mode, iteration 1 : 64/154 places, 263/319 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 23457 ms. Remains : 64/154 places, 263/319 transitions.
Discarding 212 transitions out of 263. Remains 51
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (4346 resets) in 1864 ms. (21 steps per ms) remains 14/50 properties
BEST_FIRST walk for 40004 steps (558 resets) in 376 ms. (106 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (549 resets) in 158 ms. (251 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (888 resets) in 138 ms. (287 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (518 resets) in 141 ms. (281 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40002 steps (500 resets) in 57 ms. (689 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (513 resets) in 57 ms. (689 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (516 resets) in 47 ms. (833 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (522 resets) in 53 ms. (740 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (515 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (509 resets) in 53 ms. (740 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (517 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
[2024-05-31 22:19:12] [INFO ] Flow matrix only has 216 transitions (discarded 47 similar events)
[2024-05-31 22:19:12] [INFO ] Invariant cache hit.
[2024-05-31 22:19:12] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 33/55 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 33/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 22:19:12] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 9/64 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 215/279 variables, 64/147 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 83/230 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 1/280 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/280 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 231 constraints, problems are : Problem set: 0 solved, 9 unsolved in 640 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 33/55 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 33/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 9/64 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 215/279 variables, 64/147 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 83/230 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 1/280 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/280 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/280 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 240 constraints, problems are : Problem set: 0 solved, 9 unsolved in 623 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 1313ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Finished Parikh walk after 726 steps, including 60 resets, run visited all 1 properties in 3 ms. (steps per millisecond=242 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 49 ms.
Able to resolve query QuasiLiveness after proving 51 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 26155 ms.
ITS solved all properties within timeout

BK_STOP 1717193953543

--------------------
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="HealthRecord-PT-06"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is HealthRecord-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 r498-tall-171640617900462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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