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.r043-smll-171620180100121.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 gold2023
Input is AutoFlight-PT-48b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180100121
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 22:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 22:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 12 22:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 22:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 956K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-48b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-48b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-48b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-48b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-48b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-48b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-48b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-48b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-48b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-48b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-48b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-48b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-48b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-48b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-48b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-48b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716296505718

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-48b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-21 13:01:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 13:01:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:01:50] [INFO ] Load time of PNML (sax parser for PT used): 613 ms
[2024-05-21 13:01:50] [INFO ] Transformed 3950 places.
[2024-05-21 13:01:50] [INFO ] Transformed 3936 transitions.
[2024-05-21 13:01:50] [INFO ] Found NUPN structural information;
[2024-05-21 13:01:50] [INFO ] Parsed PT model containing 3950 places and 3936 transitions and 9104 arcs in 1007 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 3936 rows 3950 cols
[2024-05-21 13:01:50] [INFO ] Computed 258 invariants in 153 ms
Incomplete random walk after 10000 steps, including 5 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 16) seen :11
FORMULA AutoFlight-PT-48b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
[2024-05-21 13:01:51] [INFO ] Invariant cache hit.
[2024-05-21 13:01:53] [INFO ] [Real]Absence check using 257 positive place invariants in 399 ms returned sat
[2024-05-21 13:01:53] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 15 ms returned sat
[2024-05-21 13:01:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 13:01:56] [INFO ] [Real]Absence check using state equation in 3191 ms returned unknown
[2024-05-21 13:01:57] [INFO ] [Real]Absence check using 257 positive place invariants in 350 ms returned sat
[2024-05-21 13:01:57] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 15 ms returned sat
[2024-05-21 13:01:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 13:02:00] [INFO ] [Real]Absence check using state equation in 3217 ms returned sat
[2024-05-21 13:02:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:02:02] [INFO ] [Nat]Absence check using 257 positive place invariants in 431 ms returned sat
[2024-05-21 13:02:02] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 15 ms returned sat
[2024-05-21 13:02:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 13:02:06] [INFO ] [Nat]Absence check using state equation in 3351 ms returned unknown
[2024-05-21 13:02:07] [INFO ] [Real]Absence check using 257 positive place invariants in 378 ms returned sat
[2024-05-21 13:02:07] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 26 ms returned sat
[2024-05-21 13:02:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 13:02:11] [INFO ] [Real]Absence check using state equation in 3355 ms returned unknown
[2024-05-21 13:02:12] [INFO ] [Real]Absence check using 257 positive place invariants in 406 ms returned sat
[2024-05-21 13:02:12] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 24 ms returned sat
[2024-05-21 13:02:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 13:02:16] [INFO ] [Real]Absence check using state equation in 3475 ms returned unknown
[2024-05-21 13:02:17] [INFO ] [Real]Absence check using 257 positive place invariants in 365 ms returned sat
[2024-05-21 13:02:17] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 15 ms returned sat
[2024-05-21 13:02:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 13:02:21] [INFO ] [Real]Absence check using state equation in 3439 ms returned sat
[2024-05-21 13:02:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:02:22] [INFO ] [Nat]Absence check using 257 positive place invariants in 414 ms returned sat
[2024-05-21 13:02:22] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 29 ms returned sat
[2024-05-21 13:02:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 13:02:26] [INFO ] [Nat]Absence check using state equation in 3444 ms returned sat
[2024-05-21 13:02:30] [INFO ] Deduced a trap composed of 46 places in 3395 ms of which 6 ms to minimize.
[2024-05-21 13:02:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 3950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3950/3950 places, 3936/3936 transitions.
Drop transitions removed 1701 transitions
Trivial Post-agglo rules discarded 1701 transitions
Performed 1701 trivial Post agglomeration. Transition count delta: 1701
Iterating post reduction 0 with 1701 rules applied. Total rules applied 1701 place count 3950 transition count 2235
Reduce places removed 1701 places and 0 transitions.
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1989 rules applied. Total rules applied 3690 place count 2249 transition count 1947
Reduce places removed 96 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 99 rules applied. Total rules applied 3789 place count 2153 transition count 1944
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 3792 place count 2150 transition count 1944
Performed 506 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 506 Pre rules applied. Total rules applied 3792 place count 2150 transition count 1438
Deduced a syphon composed of 506 places in 23 ms
Reduce places removed 506 places and 0 transitions.
Iterating global reduction 4 with 1012 rules applied. Total rules applied 4804 place count 1644 transition count 1438
Discarding 339 places :
Symmetric choice reduction at 4 with 339 rule applications. Total rules 5143 place count 1305 transition count 1099
Iterating global reduction 4 with 339 rules applied. Total rules applied 5482 place count 1305 transition count 1099
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 108 Pre rules applied. Total rules applied 5482 place count 1305 transition count 991
Deduced a syphon composed of 108 places in 8 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 4 with 216 rules applied. Total rules applied 5698 place count 1197 transition count 991
Performed 305 Post agglomeration using F-continuation condition.Transition count delta: 305
Deduced a syphon composed of 305 places in 3 ms
Reduce places removed 305 places and 0 transitions.
Iterating global reduction 4 with 610 rules applied. Total rules applied 6308 place count 892 transition count 686
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 144 times.
Iterating global reduction 4 with 144 rules applied. Total rules applied 6452 place count 892 transition count 542
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 6596 place count 748 transition count 542
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6597 place count 747 transition count 541
Reduce places removed 155 places and 0 transitions.
Drop transitions removed 232 transitions
Trivial Post-agglo rules discarded 232 transitions
Performed 232 trivial Post agglomeration. Transition count delta: 232
Iterating post reduction 5 with 387 rules applied. Total rules applied 6984 place count 592 transition count 309
Reduce places removed 232 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 6 with 236 rules applied. Total rules applied 7220 place count 360 transition count 305
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 7224 place count 356 transition count 305
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 92 Pre rules applied. Total rules applied 7224 place count 356 transition count 213
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 8 with 184 rules applied. Total rules applied 7408 place count 264 transition count 213
Applied a total of 7408 rules in 1209 ms. Remains 264 /3950 variables (removed 3686) and now considering 213/3936 (removed 3723) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1211 ms. Remains : 264/3950 places, 213/3936 transitions.
// Phase 1: matrix 213 rows 264 cols
[2024-05-21 13:02:31] [INFO ] Computed 103 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 11503 ms. (steps per millisecond=86 ) properties (out of 5) seen :5
FORMULA AutoFlight-PT-48b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 53482 ms.

BK_STOP 1716296563999

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="AutoFlight-PT-48b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is AutoFlight-PT-48b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-smll-171620180100121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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