Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r305-smll-165463878600187.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/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 AutonomousCar-PT-06b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878600187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 4.9K Jun 7 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Jun 7 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Jun 7 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Jun 7 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 3 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 3 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 3 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 3 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 9.6K Jun 7 15:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 7 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 7 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 228K Jun 3 16:02 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 AutonomousCar-PT-06b-UpperBounds-00
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-01
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-02
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-03
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-04
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-05
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-06
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-07
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-08
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-09
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-10
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-11
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-12
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-13
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-14
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654736215841

Running Version 0
[2022-06-09 00:56: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-06-09 00:56:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 00:56:59] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2022-06-09 00:56:59] [INFO ] Transformed 289 places.
[2022-06-09 00:56:59] [INFO ] Transformed 644 transitions.
[2022-06-09 00:56:59] [INFO ] Found NUPN structural information;
[2022-06-09 00:56:59] [INFO ] Parsed PT model containing 289 places and 644 transitions in 358 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 21 ms.
// Phase 1: matrix 644 rows 289 cols
[2022-06-09 00:56:59] [INFO ] Computed 11 place invariants in 37 ms
Incomplete random walk after 10000 steps, including 17 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :13
FORMULA AutonomousCar-PT-06b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-06b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 644 rows 289 cols
[2022-06-09 00:56:59] [INFO ] Computed 11 place invariants in 9 ms
[2022-06-09 00:57:00] [INFO ] [Real]Absence check using 11 positive place invariants in 23 ms returned sat
[2022-06-09 00:57:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:57:00] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2022-06-09 00:57:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:57:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2022-06-09 00:57:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:57:01] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2022-06-09 00:57:02] [INFO ] Deduced a trap composed of 11 places in 703 ms of which 6 ms to minimize.
[2022-06-09 00:57:02] [INFO ] Deduced a trap composed of 22 places in 326 ms of which 2 ms to minimize.
[2022-06-09 00:57:02] [INFO ] Deduced a trap composed of 17 places in 303 ms of which 2 ms to minimize.
[2022-06-09 00:57:03] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 1 ms to minimize.
[2022-06-09 00:57:03] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 3 ms to minimize.
[2022-06-09 00:57:03] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 1 ms to minimize.
[2022-06-09 00:57:04] [INFO ] Deduced a trap composed of 35 places in 365 ms of which 1 ms to minimize.
[2022-06-09 00:57:04] [INFO ] Deduced a trap composed of 35 places in 431 ms of which 4 ms to minimize.
[2022-06-09 00:57:04] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 1 ms to minimize.
[2022-06-09 00:57:05] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 0 ms to minimize.
[2022-06-09 00:57:05] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 1 ms to minimize.
[2022-06-09 00:57:05] [INFO ] Deduced a trap composed of 73 places in 212 ms of which 1 ms to minimize.
[2022-06-09 00:57:05] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4190 ms
[2022-06-09 00:57:05] [INFO ] Computed and/alt/rep : 237/274/237 causal constraints (skipped 406 transitions) in 175 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2022-06-09 00:57:06] [INFO ] Deduced a trap composed of 7 places in 405 ms of which 1 ms to minimize.
[2022-06-09 00:57:06] [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-06-09 00:57:06] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2022-06-09 00:57:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:57:06] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2022-06-09 00:57:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:57:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2022-06-09 00:57:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:57:07] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2022-06-09 00:57:07] [INFO ] Deduced a trap composed of 11 places in 311 ms of which 1 ms to minimize.
[2022-06-09 00:57:07] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 1 ms to minimize.
[2022-06-09 00:57:08] [INFO ] Deduced a trap composed of 17 places in 291 ms of which 1 ms to minimize.
[2022-06-09 00:57:08] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 1 ms to minimize.
[2022-06-09 00:57:08] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 0 ms to minimize.
[2022-06-09 00:57:08] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 1 ms to minimize.
[2022-06-09 00:57:08] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 1 ms to minimize.
[2022-06-09 00:57:09] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 0 ms to minimize.
[2022-06-09 00:57:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1931 ms
[2022-06-09 00:57:09] [INFO ] Computed and/alt/rep : 237/274/237 causal constraints (skipped 406 transitions) in 75 ms.
[2022-06-09 00:57:10] [INFO ] Added : 95 causal constraints over 19 iterations in 844 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 16500 steps, including 296 resets, run finished after 57 ms. (steps per millisecond=289 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 289/289 places, 644/644 transitions.
Graph (trivial) has 272 edges and 289 vertex of which 2 / 289 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 960 edges and 288 vertex of which 284 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 129 rules applied. Total rules applied 131 place count 284 transition count 510
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 165 rules applied. Total rules applied 296 place count 156 transition count 473
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 317 place count 135 transition count 473
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 317 place count 135 transition count 468
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 327 place count 130 transition count 468
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 353 place count 104 transition count 442
Iterating global reduction 3 with 26 rules applied. Total rules applied 379 place count 104 transition count 442
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 523 place count 104 transition count 298
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 523 place count 104 transition count 296
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 527 place count 102 transition count 296
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 534 place count 95 transition count 259
Iterating global reduction 4 with 7 rules applied. Total rules applied 541 place count 95 transition count 259
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 12 rules applied. Total rules applied 553 place count 95 transition count 247
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 559 place count 89 transition count 247
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 623 place count 57 transition count 215
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 629 place count 51 transition count 173
Iterating global reduction 6 with 6 rules applied. Total rules applied 635 place count 51 transition count 173
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 641 place count 51 transition count 167
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 647 place count 45 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 648 place count 44 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 649 place count 43 transition count 166
Applied a total of 649 rules in 209 ms. Remains 43 /289 variables (removed 246) and now considering 166/644 (removed 478) transitions.
Finished structural reductions, in 1 iterations. Remains : 43/289 places, 166/644 transitions.
// Phase 1: matrix 166 rows 43 cols
[2022-06-09 00:57:10] [INFO ] Computed 10 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1069 ms. (steps per millisecond=935 ) properties (out of 2) seen :2
FORMULA AutonomousCar-PT-06b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1654736232658

--------------------
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="AutonomousCar-PT-06b"
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 AutonomousCar-PT-06b, 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 r305-smll-165463878600187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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