About the Execution of 2023-gold for Angiogenesis-PT-25
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r043-smll-171620179900026.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Angiogenesis-PT-25, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620179900026
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 19:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 11 19:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 33K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Angiogenesis-PT-25-UpperBounds-00
FORMULA_NAME Angiogenesis-PT-25-UpperBounds-01
FORMULA_NAME Angiogenesis-PT-25-UpperBounds-02
FORMULA_NAME Angiogenesis-PT-25-UpperBounds-03
FORMULA_NAME Angiogenesis-PT-25-UpperBounds-04
FORMULA_NAME Angiogenesis-PT-25-UpperBounds-05
FORMULA_NAME Angiogenesis-PT-25-UpperBounds-06
FORMULA_NAME Angiogenesis-PT-25-UpperBounds-07
FORMULA_NAME Angiogenesis-PT-25-UpperBounds-08
FORMULA_NAME Angiogenesis-PT-25-UpperBounds-09
FORMULA_NAME Angiogenesis-PT-25-UpperBounds-10
FORMULA_NAME Angiogenesis-PT-25-UpperBounds-11
FORMULA_NAME Angiogenesis-PT-25-UpperBounds-12
FORMULA_NAME Angiogenesis-PT-25-UpperBounds-13
FORMULA_NAME Angiogenesis-PT-25-UpperBounds-14
FORMULA_NAME Angiogenesis-PT-25-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716274656877
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Angiogenesis-PT-25
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-21 06:57:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 06:57:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 06:57:40] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2024-05-21 06:57:40] [INFO ] Transformed 39 places.
[2024-05-21 06:57:40] [INFO ] Transformed 64 transitions.
[2024-05-21 06:57:40] [INFO ] Parsed PT model containing 39 places and 64 transitions and 185 arcs in 275 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 64 rows 39 cols
[2024-05-21 06:57:40] [INFO ] Computed 8 invariants in 14 ms
FORMULA Angiogenesis-PT-25-UpperBounds-13 25 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-25-UpperBounds-02 25 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-25-UpperBounds-01 25 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10022 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=371 ) properties (out of 13) seen :248
FORMULA Angiogenesis-PT-25-UpperBounds-15 25 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-25-UpperBounds-14 25 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-25-UpperBounds-12 25 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-25-UpperBounds-08 25 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-25-UpperBounds-06 25 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-25-UpperBounds-05 25 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-25-UpperBounds-03 25 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-25-UpperBounds-00 25 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :5
[2024-05-21 06:57:40] [INFO ] Invariant cache hit.
[2024-05-21 06:57:40] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-05-21 06:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 06:57:40] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-21 06:57:40] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 17 ms.
[2024-05-21 06:57:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 06:57:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 06:57:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 06:57:40] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-21 06:57:40] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 11 ms.
[2024-05-21 06:57:41] [INFO ] Added : 52 causal constraints over 11 iterations in 130 ms. Result :sat
Minimization took 27 ms.
[2024-05-21 06:57:41] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 06:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 06:57:41] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-21 06:57:41] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 22 ms.
[2024-05-21 06:57:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 06:57:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 06:57:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 06:57:41] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-21 06:57:41] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 13 ms.
[2024-05-21 06:57:41] [INFO ] Added : 52 causal constraints over 11 iterations in 132 ms. Result :sat
Minimization took 44 ms.
[2024-05-21 06:57:41] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 06:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 06:57:41] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-21 06:57:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 06:57:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 06:57:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 06:57:41] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-21 06:57:41] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 8 ms.
[2024-05-21 06:57:41] [INFO ] Added : 55 causal constraints over 11 iterations in 96 ms. Result :sat
Minimization took 22 ms.
[2024-05-21 06:57:41] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 06:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 06:57:41] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-21 06:57:41] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 8 ms.
[2024-05-21 06:57:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 06:57:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 06:57:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 06:57:41] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 06:57:41] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 11 ms.
[2024-05-21 06:57:42] [INFO ] Added : 52 causal constraints over 11 iterations in 97 ms. Result :sat
Minimization took 21 ms.
[2024-05-21 06:57:42] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 06:57:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 06:57:42] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-21 06:57:42] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 8 ms.
[2024-05-21 06:57:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 06:57:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 06:57:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 06:57:42] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-21 06:57:42] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 8 ms.
[2024-05-21 06:57:42] [INFO ] Added : 52 causal constraints over 11 iterations in 98 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [12, 25, 25, 25, 12] Max seen :[10, 2, 23, 9, 6]
FORMULA Angiogenesis-PT-25-UpperBounds-11 12 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Angiogenesis-PT-25-UpperBounds-10 25 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Angiogenesis-PT-25-UpperBounds-09 25 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Angiogenesis-PT-25-UpperBounds-04 12 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 64/64 transitions.
Graph (complete) has 117 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 38 transition count 63
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 36 transition count 63
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 36 transition count 62
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 25 place count 26 transition count 52
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 79 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 10 rules applied. Total rules applied 35 place count 25 transition count 43
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 25 transition count 42
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 46 place count 20 transition count 48
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 56 place count 20 transition count 38
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 62 place count 20 transition count 32
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 67 place count 20 transition count 27
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 74 place count 15 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 75 place count 15 transition count 24
Applied a total of 75 rules in 66 ms. Remains 15 /39 variables (removed 24) and now considering 24/64 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 15/39 places, 24/64 transitions.
Normalized transition count is 23 out of 24 initially.
// Phase 1: matrix 23 rows 15 cols
[2024-05-21 06:57:42] [INFO ] Computed 6 invariants in 3 ms
Incomplete random walk after 1000024 steps, including 2 resets, run finished after 472 ms. (steps per millisecond=2118 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 582 ms. (steps per millisecond=1718 ) properties (out of 1) seen :13
[2024-05-21 06:57:43] [INFO ] Flow matrix only has 23 transitions (discarded 1 similar events)
// Phase 1: matrix 23 rows 15 cols
[2024-05-21 06:57:43] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 06:57:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 06:57:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 06:57:43] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-21 06:57:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 06:57:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 06:57:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 06:57:43] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-21 06:57:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 06:57:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-21 06:57:43] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 6 ms to minimize.
[2024-05-21 06:57:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
Current structural bounds on expressions (after SMT) : [24] Max seen :[24]
FORMULA Angiogenesis-PT-25-UpperBounds-07 24 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 3891 ms.
BK_STOP 1716274664952
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Angiogenesis-PT-25"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Angiogenesis-PT-25, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-smll-171620179900026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Angiogenesis-PT-25.tgz
mv Angiogenesis-PT-25 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 '
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 ;