Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r215-oct2-165281605900175.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is ServersAndClients-PT-100040, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-oct2-165281605900175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 5.4K Apr 29 17:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 29 17:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 29 17:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 17:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 08:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 2.5M May 10 09:34 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 ServersAndClients-PT-100040-UpperBounds-00
FORMULA_NAME ServersAndClients-PT-100040-UpperBounds-01
FORMULA_NAME ServersAndClients-PT-100040-UpperBounds-02
FORMULA_NAME ServersAndClients-PT-100040-UpperBounds-03
FORMULA_NAME ServersAndClients-PT-100040-UpperBounds-04
FORMULA_NAME ServersAndClients-PT-100040-UpperBounds-05
FORMULA_NAME ServersAndClients-PT-100040-UpperBounds-06
FORMULA_NAME ServersAndClients-PT-100040-UpperBounds-07
FORMULA_NAME ServersAndClients-PT-100040-UpperBounds-08
FORMULA_NAME ServersAndClients-PT-100040-UpperBounds-09
FORMULA_NAME ServersAndClients-PT-100040-UpperBounds-10
FORMULA_NAME ServersAndClients-PT-100040-UpperBounds-11
FORMULA_NAME ServersAndClients-PT-100040-UpperBounds-12
FORMULA_NAME ServersAndClients-PT-100040-UpperBounds-13
FORMULA_NAME ServersAndClients-PT-100040-UpperBounds-14
FORMULA_NAME ServersAndClients-PT-100040-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653212818395

Running Version 0
[2022-05-22 09:46:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-22 09:46:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 09:47:00] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2022-05-22 09:47:00] [INFO ] Transformed 4441 places.
[2022-05-22 09:47:00] [INFO ] Transformed 8200 transitions.
[2022-05-22 09:47:00] [INFO ] Parsed PT model containing 4441 places and 8200 transitions in 311 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 8200 rows 4441 cols
[2022-05-22 09:47:00] [INFO ] Computed 241 place invariants in 152 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 16) seen :7
FORMULA ServersAndClients-PT-100040-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100040-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100040-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100040-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100040-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100040-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :1
FORMULA ServersAndClients-PT-100040-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :1
FORMULA ServersAndClients-PT-100040-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :1
FORMULA ServersAndClients-PT-100040-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :1
FORMULA ServersAndClients-PT-100040-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 8200 rows 4441 cols
[2022-05-22 09:47:01] [INFO ] Computed 241 place invariants in 89 ms
[2022-05-22 09:47:01] [INFO ] [Real]Absence check using 141 positive place invariants in 197 ms returned sat
[2022-05-22 09:47:01] [INFO ] [Real]Absence check using 141 positive and 100 generalized place invariants in 64 ms returned sat
[2022-05-22 09:47:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:47:04] [INFO ] [Real]Absence check using state equation in 2836 ms returned sat
[2022-05-22 09:47:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 09:47:05] [INFO ] [Nat]Absence check using 141 positive place invariants in 213 ms returned sat
[2022-05-22 09:47:05] [INFO ] [Nat]Absence check using 141 positive and 100 generalized place invariants in 63 ms returned sat
[2022-05-22 09:47:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 09:47:08] [INFO ] [Nat]Absence check using state equation in 2669 ms returned sat
[2022-05-22 09:47:09] [INFO ] Computed and/alt/rep : 8000/8000/8000 causal constraints (skipped 100 transitions) in 422 ms.
[2022-05-22 09:47:16] [INFO ] Deduced a trap composed of 2 places in 6097 ms of which 26 ms to minimize.
[2022-05-22 09:47:16] [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 0
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-22 09:47:17] [INFO ] [Real]Absence check using 141 positive place invariants in 218 ms returned sat
[2022-05-22 09:47:17] [INFO ] [Real]Absence check using 141 positive and 100 generalized place invariants in 30 ms returned unsat
[2022-05-22 09:47:17] [INFO ] [Real]Absence check using 141 positive place invariants in 221 ms returned sat
[2022-05-22 09:47:17] [INFO ] [Real]Absence check using 141 positive and 100 generalized place invariants in 47 ms returned sat
[2022-05-22 09:47:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:47:20] [INFO ] [Real]Absence check using state equation in 2547 ms returned sat
[2022-05-22 09:47:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 09:47:20] [INFO ] [Nat]Absence check using 141 positive place invariants in 160 ms returned sat
[2022-05-22 09:47:20] [INFO ] [Nat]Absence check using 141 positive and 100 generalized place invariants in 46 ms returned sat
[2022-05-22 09:47:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 09:47:23] [INFO ] [Nat]Absence check using state equation in 2531 ms returned sat
[2022-05-22 09:47:24] [INFO ] Computed and/alt/rep : 8000/8000/8000 causal constraints (skipped 100 transitions) in 359 ms.
[2022-05-22 09:47:24] [INFO ] Added : 1 causal constraints over 1 iterations in 1167 ms. Result :sat
[2022-05-22 09:47:25] [INFO ] [Real]Absence check using 141 positive place invariants in 164 ms returned sat
[2022-05-22 09:47:25] [INFO ] [Real]Absence check using 141 positive and 100 generalized place invariants in 47 ms returned sat
[2022-05-22 09:47:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:47:28] [INFO ] [Real]Absence check using state equation in 2613 ms returned sat
[2022-05-22 09:47:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 09:47:29] [INFO ] [Nat]Absence check using 141 positive place invariants in 160 ms returned sat
[2022-05-22 09:47:29] [INFO ] [Nat]Absence check using 141 positive and 100 generalized place invariants in 41 ms returned sat
[2022-05-22 09:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 09:47:31] [INFO ] [Nat]Absence check using state equation in 2729 ms returned sat
[2022-05-22 09:47:32] [INFO ] Computed and/alt/rep : 8000/8000/8000 causal constraints (skipped 100 transitions) in 297 ms.
[2022-05-22 09:47:33] [INFO ] Added : 1 causal constraints over 1 iterations in 1080 ms. Result :sat
[2022-05-22 09:47:33] [INFO ] [Real]Absence check using 141 positive place invariants in 165 ms returned sat
[2022-05-22 09:47:33] [INFO ] [Real]Absence check using 141 positive and 100 generalized place invariants in 46 ms returned sat
[2022-05-22 09:47:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:47:36] [INFO ] [Real]Absence check using state equation in 2603 ms returned sat
[2022-05-22 09:47:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 09:47:37] [INFO ] [Nat]Absence check using 141 positive place invariants in 172 ms returned sat
[2022-05-22 09:47:37] [INFO ] [Nat]Absence check using 141 positive and 100 generalized place invariants in 65 ms returned sat
[2022-05-22 09:47:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 09:47:39] [INFO ] [Nat]Absence check using state equation in 2489 ms returned sat
[2022-05-22 09:47:40] [INFO ] Computed and/alt/rep : 8000/8000/8000 causal constraints (skipped 100 transitions) in 307 ms.
[2022-05-22 09:47:41] [INFO ] Added : 1 causal constraints over 1 iterations in 1023 ms. Result :sat
[2022-05-22 09:47:41] [INFO ] [Real]Absence check using 141 positive place invariants in 179 ms returned sat
[2022-05-22 09:47:41] [INFO ] [Real]Absence check using 141 positive and 100 generalized place invariants in 60 ms returned sat
[2022-05-22 09:47:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:47:44] [INFO ] [Real]Absence check using state equation in 2410 ms returned sat
[2022-05-22 09:47:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 09:47:44] [INFO ] [Nat]Absence check using 141 positive place invariants in 163 ms returned sat
[2022-05-22 09:47:44] [INFO ] [Nat]Absence check using 141 positive and 100 generalized place invariants in 48 ms returned sat
[2022-05-22 09:47:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 09:47:47] [INFO ] [Nat]Absence check using state equation in 2432 ms returned sat
[2022-05-22 09:47:47] [INFO ] Computed and/alt/rep : 8000/8000/8000 causal constraints (skipped 100 transitions) in 300 ms.
[2022-05-22 09:47:48] [INFO ] Added : 1 causal constraints over 1 iterations in 951 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 1, 0, 0, 0, 0]
FORMULA ServersAndClients-PT-100040-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 200 steps, including 65 resets, run finished after 4 ms. (steps per millisecond=50 ) properties (out of 5) seen :1 could not realise parikh vector
FORMULA ServersAndClients-PT-100040-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 200 steps, including 65 resets, run finished after 4 ms. (steps per millisecond=50 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA ServersAndClients-PT-100040-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 200 steps, including 66 resets, run finished after 4 ms. (steps per millisecond=50 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA ServersAndClients-PT-100040-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 200 steps, including 66 resets, run finished after 4 ms. (steps per millisecond=50 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA ServersAndClients-PT-100040-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 4441 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Drop transitions removed 3999 transitions
Trivial Post-agglo rules discarded 3999 transitions
Performed 3999 trivial Post agglomeration. Transition count delta: 3999
Iterating post reduction 0 with 3999 rules applied. Total rules applied 3999 place count 4441 transition count 4201
Reduce places removed 4038 places and 0 transitions.
Ensure Unique test removed 3800 transitions
Reduce isomorphic transitions removed 3800 transitions.
Iterating post reduction 1 with 7838 rules applied. Total rules applied 11837 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 11936 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 12233 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 3 with 396 rules applied. Total rules applied 12629 place count 7 transition count 5
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 12630 place count 6 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 12633 place count 4 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 12635 place count 3 transition count 3
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 12636 place count 3 transition count 2
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 12637 place count 2 transition count 2
Applied a total of 12637 rules in 144 ms. Remains 2 /4441 variables (removed 4439) and now considering 2/8200 (removed 8198) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/4441 places, 2/8200 transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-22 09:47:48] [INFO ] Computed 1 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 334 ms. (steps per millisecond=2994 ) properties (out of 1) seen :1
FORMULA ServersAndClients-PT-100040-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1653212869627

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ServersAndClients-PT-100040"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is ServersAndClients-PT-100040, 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 r215-oct2-165281605900175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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