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.r024-tall-165251918700557.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 itstools
Input is CANConstruction-PT-090, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918700557
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 11K Apr 29 12:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 12:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 29 12:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 12:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 12M May 10 09:33 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 CANConstruction-PT-090-UpperBounds-00
FORMULA_NAME CANConstruction-PT-090-UpperBounds-01
FORMULA_NAME CANConstruction-PT-090-UpperBounds-02
FORMULA_NAME CANConstruction-PT-090-UpperBounds-03
FORMULA_NAME CANConstruction-PT-090-UpperBounds-04
FORMULA_NAME CANConstruction-PT-090-UpperBounds-05
FORMULA_NAME CANConstruction-PT-090-UpperBounds-06
FORMULA_NAME CANConstruction-PT-090-UpperBounds-07
FORMULA_NAME CANConstruction-PT-090-UpperBounds-08
FORMULA_NAME CANConstruction-PT-090-UpperBounds-09
FORMULA_NAME CANConstruction-PT-090-UpperBounds-10
FORMULA_NAME CANConstruction-PT-090-UpperBounds-11
FORMULA_NAME CANConstruction-PT-090-UpperBounds-12
FORMULA_NAME CANConstruction-PT-090-UpperBounds-13
FORMULA_NAME CANConstruction-PT-090-UpperBounds-14
FORMULA_NAME CANConstruction-PT-090-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652660190760

Running Version 202205111006
[2022-05-16 00:16:31] [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-16 00:16:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:16:32] [INFO ] Load time of PNML (sax parser for PT used): 657 ms
[2022-05-16 00:16:32] [INFO ] Transformed 17282 places.
[2022-05-16 00:16:32] [INFO ] Transformed 33120 transitions.
[2022-05-16 00:16:32] [INFO ] Parsed PT model containing 17282 places and 33120 transitions in 860 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 33120 rows 17282 cols
[2022-05-16 00:16:33] [INFO ] Computed 181 place invariants in 506 ms
Incomplete random walk after 10000 steps, including 6 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 16) seen :1
FORMULA CANConstruction-PT-090-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :0
// Phase 1: matrix 33120 rows 17282 cols
[2022-05-16 00:16:34] [INFO ] Computed 181 place invariants in 280 ms
[2022-05-16 00:16:38] [INFO ] [Real]Absence check using 91 positive place invariants in 621 ms returned sat
[2022-05-16 00:16:38] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 108 ms returned sat
[2022-05-16 00:16:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:16:41] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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: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)
[2022-05-16 00:16:43] [INFO ] [Real]Absence check using 91 positive place invariants in 623 ms returned sat
[2022-05-16 00:16:43] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 113 ms returned sat
[2022-05-16 00:16:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:16:46] [INFO ] [Real]Absence check using state equation in 2562 ms returned unknown
[2022-05-16 00:16:48] [INFO ] [Real]Absence check using 91 positive place invariants in 623 ms returned sat
[2022-05-16 00:16:48] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 109 ms returned sat
[2022-05-16 00:16:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:16:51] [INFO ] [Real]Absence check using state equation in 2650 ms returned unknown
[2022-05-16 00:16:53] [INFO ] [Real]Absence check using 91 positive place invariants in 583 ms returned sat
[2022-05-16 00:16:53] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 110 ms returned sat
[2022-05-16 00:16:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:16:56] [INFO ] [Real]Absence check using state equation in 2647 ms returned unknown
[2022-05-16 00:16:58] [INFO ] [Real]Absence check using 91 positive place invariants in 567 ms returned sat
[2022-05-16 00:16:58] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 106 ms returned sat
[2022-05-16 00:16:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:17:01] [INFO ] [Real]Absence check using state equation in 2742 ms returned unknown
[2022-05-16 00:17:03] [INFO ] [Real]Absence check using 91 positive place invariants in 574 ms returned sat
[2022-05-16 00:17:03] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 101 ms returned sat
[2022-05-16 00:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:17:06] [INFO ] [Real]Absence check using state equation in 2674 ms returned unknown
[2022-05-16 00:17:08] [INFO ] [Real]Absence check using 91 positive place invariants in 577 ms returned sat
[2022-05-16 00:17:08] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 109 ms returned sat
[2022-05-16 00:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:17:11] [INFO ] [Real]Absence check using state equation in 2767 ms returned unknown
[2022-05-16 00:17:13] [INFO ] [Real]Absence check using 91 positive place invariants in 583 ms returned sat
[2022-05-16 00:17:13] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 105 ms returned sat
[2022-05-16 00:17:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:17:16] [INFO ] [Real]Absence check using state equation in 2657 ms returned unknown
[2022-05-16 00:17:18] [INFO ] [Real]Absence check using 91 positive place invariants in 572 ms returned sat
[2022-05-16 00:17:18] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 105 ms returned sat
[2022-05-16 00:17:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:17:21] [INFO ] [Real]Absence check using state equation in 2721 ms returned unknown
[2022-05-16 00:17:23] [INFO ] [Real]Absence check using 91 positive place invariants in 573 ms returned sat
[2022-05-16 00:17:23] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 109 ms returned sat
[2022-05-16 00:17:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:17:26] [INFO ] [Real]Absence check using state equation in 2698 ms returned unknown
[2022-05-16 00:17:28] [INFO ] [Real]Absence check using 91 positive place invariants in 563 ms returned sat
[2022-05-16 00:17:28] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 103 ms returned sat
[2022-05-16 00:17:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:17:31] [INFO ] [Real]Absence check using state equation in 2739 ms returned unknown
[2022-05-16 00:17:33] [INFO ] [Real]Absence check using 91 positive place invariants in 583 ms returned sat
[2022-05-16 00:17:33] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 107 ms returned sat
[2022-05-16 00:17:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:17:36] [INFO ] [Real]Absence check using state equation in 2699 ms returned unknown
[2022-05-16 00:17:38] [INFO ] [Real]Absence check using 91 positive place invariants in 593 ms returned sat
[2022-05-16 00:17:38] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 112 ms returned sat
[2022-05-16 00:17:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:17:41] [INFO ] [Real]Absence check using state equation in 2673 ms returned unknown
[2022-05-16 00:17:43] [INFO ] [Real]Absence check using 91 positive place invariants in 615 ms returned sat
[2022-05-16 00:17:43] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 120 ms returned sat
[2022-05-16 00:17:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:17:46] [INFO ] [Real]Absence check using state equation in 2634 ms returned unknown
[2022-05-16 00:17:48] [INFO ] [Real]Absence check using 91 positive place invariants in 590 ms returned sat
[2022-05-16 00:17:48] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 121 ms returned sat
[2022-05-16 00:17:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:17:51] [INFO ] [Real]Absence check using state equation in 2632 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 15 out of 17282 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 17282 transition count 32490
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 16652 transition count 32490
Discarding 7910 places :
Symmetric choice reduction at 2 with 7910 rule applications. Total rules 9170 place count 8742 transition count 16670
Iterating global reduction 2 with 7910 rules applied. Total rules applied 17080 place count 8742 transition count 16670
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 12 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 17260 place count 8652 transition count 16580
Free-agglomeration rule applied 160 times.
Iterating global reduction 2 with 160 rules applied. Total rules applied 17420 place count 8652 transition count 16420
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 2 with 160 rules applied. Total rules applied 17580 place count 8492 transition count 16420
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 17600 place count 8492 transition count 16420
Applied a total of 17600 rules in 14395 ms. Remains 8492 /17282 variables (removed 8790) and now considering 16420/33120 (removed 16700) transitions.
Finished structural reductions, in 1 iterations. Remains : 8492/17282 places, 16420/33120 transitions.
// Phase 1: matrix 16420 rows 8492 cols
[2022-05-16 00:18:05] [INFO ] Computed 181 place invariants in 124 ms
Incomplete random walk after 1000000 steps, including 1595 resets, run finished after 27467 ms. (steps per millisecond=36 ) properties (out of 15) seen :15
FORMULA CANConstruction-PT-090-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 121575 ms.

BK_STOP 1652660313496

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="CANConstruction-PT-090"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is CANConstruction-PT-090, 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 r024-tall-165251918700557"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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