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.r028-tall-165251936200202.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 CANConstruction-PT-070, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936200202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.6M
-rw-r--r-- 1 mcc users 7.4K Apr 29 12:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 29 12:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 29 12:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 29 12:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:11 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 7.3M 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-070-UpperBounds-00
FORMULA_NAME CANConstruction-PT-070-UpperBounds-01
FORMULA_NAME CANConstruction-PT-070-UpperBounds-02
FORMULA_NAME CANConstruction-PT-070-UpperBounds-03
FORMULA_NAME CANConstruction-PT-070-UpperBounds-04
FORMULA_NAME CANConstruction-PT-070-UpperBounds-05
FORMULA_NAME CANConstruction-PT-070-UpperBounds-06
FORMULA_NAME CANConstruction-PT-070-UpperBounds-07
FORMULA_NAME CANConstruction-PT-070-UpperBounds-08
FORMULA_NAME CANConstruction-PT-070-UpperBounds-09
FORMULA_NAME CANConstruction-PT-070-UpperBounds-10
FORMULA_NAME CANConstruction-PT-070-UpperBounds-11
FORMULA_NAME CANConstruction-PT-070-UpperBounds-12
FORMULA_NAME CANConstruction-PT-070-UpperBounds-13
FORMULA_NAME CANConstruction-PT-070-UpperBounds-14
FORMULA_NAME CANConstruction-PT-070-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652541622437

Running Version 0
[2022-05-14 15:20:24] [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-14 15:20:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 15:20:24] [INFO ] Load time of PNML (sax parser for PT used): 412 ms
[2022-05-14 15:20:24] [INFO ] Transformed 10642 places.
[2022-05-14 15:20:24] [INFO ] Transformed 20160 transitions.
[2022-05-14 15:20:24] [INFO ] Parsed PT model containing 10642 places and 20160 transitions in 523 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 20160 rows 10642 cols
[2022-05-14 15:20:25] [INFO ] Computed 141 place invariants in 296 ms
Incomplete random walk after 10000 steps, including 7 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 16) seen :2
FORMULA CANConstruction-PT-070-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
// Phase 1: matrix 20160 rows 10642 cols
[2022-05-14 15:20:25] [INFO ] Computed 141 place invariants in 157 ms
[2022-05-14 15:20:27] [INFO ] [Real]Absence check using 71 positive place invariants in 326 ms returned sat
[2022-05-14 15:20:27] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 72 ms returned sat
[2022-05-14 15:20:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:20: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: 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
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-14 15:20:32] [INFO ] [Real]Absence check using 71 positive place invariants in 310 ms returned sat
[2022-05-14 15:20:32] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 71 ms returned sat
[2022-05-14 15:20:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:20:35] [INFO ] [Real]Absence check using state equation in 3715 ms returned unknown
[2022-05-14 15:20:37] [INFO ] [Real]Absence check using 71 positive place invariants in 292 ms returned sat
[2022-05-14 15:20:37] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 64 ms returned sat
[2022-05-14 15:20:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:20:40] [INFO ] [Real]Absence check using state equation in 3779 ms returned unknown
[2022-05-14 15:20:42] [INFO ] [Real]Absence check using 71 positive place invariants in 276 ms returned sat
[2022-05-14 15:20:42] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 72 ms returned sat
[2022-05-14 15:20:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:20:45] [INFO ] [Real]Absence check using state equation in 3792 ms returned unknown
[2022-05-14 15:20:47] [INFO ] [Real]Absence check using 71 positive place invariants in 253 ms returned sat
[2022-05-14 15:20:47] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 52 ms returned sat
[2022-05-14 15:20:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:20:50] [INFO ] [Real]Absence check using state equation in 3852 ms returned unknown
[2022-05-14 15:20:52] [INFO ] [Real]Absence check using 71 positive place invariants in 264 ms returned sat
[2022-05-14 15:20:52] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 64 ms returned sat
[2022-05-14 15:20:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:20:56] [INFO ] [Real]Absence check using state equation in 3847 ms returned unknown
[2022-05-14 15:20:57] [INFO ] [Real]Absence check using 71 positive place invariants in 272 ms returned sat
[2022-05-14 15:20:57] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 65 ms returned sat
[2022-05-14 15:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:21:01] [INFO ] [Real]Absence check using state equation in 3807 ms returned unknown
[2022-05-14 15:21:02] [INFO ] [Real]Absence check using 71 positive place invariants in 275 ms returned sat
[2022-05-14 15:21:02] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 71 ms returned sat
[2022-05-14 15:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:21:06] [INFO ] [Real]Absence check using state equation in 3801 ms returned unknown
[2022-05-14 15:21:07] [INFO ] [Real]Absence check using 71 positive place invariants in 271 ms returned sat
[2022-05-14 15:21:07] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 68 ms returned sat
[2022-05-14 15:21:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:21:11] [INFO ] [Real]Absence check using state equation in 3791 ms returned unknown
[2022-05-14 15:21:12] [INFO ] [Real]Absence check using 71 positive place invariants in 278 ms returned sat
[2022-05-14 15:21:12] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 68 ms returned sat
[2022-05-14 15:21:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:21:16] [INFO ] [Real]Absence check using state equation in 3776 ms returned unknown
[2022-05-14 15:21:17] [INFO ] [Real]Absence check using 71 positive place invariants in 270 ms returned sat
[2022-05-14 15:21:17] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 69 ms returned sat
[2022-05-14 15:21:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:21:21] [INFO ] [Real]Absence check using state equation in 3795 ms returned unknown
[2022-05-14 15:21:22] [INFO ] [Real]Absence check using 71 positive place invariants in 268 ms returned sat
[2022-05-14 15:21:22] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 66 ms returned sat
[2022-05-14 15:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:21:26] [INFO ] [Real]Absence check using state equation in 3791 ms returned unknown
[2022-05-14 15:21:27] [INFO ] [Real]Absence check using 71 positive place invariants in 275 ms returned sat
[2022-05-14 15:21:27] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 74 ms returned sat
[2022-05-14 15:21:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:21:31] [INFO ] [Real]Absence check using state equation in 3789 ms returned unknown
[2022-05-14 15:21:32] [INFO ] [Real]Absence check using 71 positive place invariants in 263 ms returned sat
[2022-05-14 15:21:32] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 70 ms returned sat
[2022-05-14 15:21:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:21:36] [INFO ] [Real]Absence check using state equation in 3820 ms returned unknown
Current structural bounds on expressions (after SMT) : [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]
Support contains 14 out of 10642 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10642/10642 places, 20160/20160 transitions.
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10642 transition count 19670
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10152 transition count 19670
Discarding 4751 places :
Symmetric choice reduction at 2 with 4751 rule applications. Total rules 5731 place count 5401 transition count 10168
Iterating global reduction 2 with 4751 rules applied. Total rules applied 10482 place count 5401 transition count 10168
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 5 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 10622 place count 5331 transition count 10098
Free-agglomeration rule applied 122 times.
Iterating global reduction 2 with 122 rules applied. Total rules applied 10744 place count 5331 transition count 9976
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 2 with 122 rules applied. Total rules applied 10866 place count 5209 transition count 9976
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 10884 place count 5209 transition count 9976
Applied a total of 10884 rules in 6203 ms. Remains 5209 /10642 variables (removed 5433) and now considering 9976/20160 (removed 10184) transitions.
Finished structural reductions, in 1 iterations. Remains : 5209/10642 places, 9976/20160 transitions.
// Phase 1: matrix 9976 rows 5209 cols
[2022-05-14 15:21:42] [INFO ] Computed 141 place invariants in 83 ms
Incomplete random walk after 1000000 steps, including 2059 resets, run finished after 18878 ms. (steps per millisecond=52 ) properties (out of 14) seen :14
FORMULA CANConstruction-PT-070-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652541722968

--------------------
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="CANConstruction-PT-070"
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 CANConstruction-PT-070, 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 r028-tall-165251936200202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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