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.r356-tall-171683761500621.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 itstools
Input is ShieldPPPt-PT-010B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761500621
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 11 14:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 11 14:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 185K May 18 16:43 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 ShieldPPPt-PT-010B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717010604151

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-29 19:23:25] [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-29 19:23:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:23:25] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-29 19:23:25] [INFO ] Transformed 783 places.
[2024-05-29 19:23:25] [INFO ] Transformed 713 transitions.
[2024-05-29 19:23:25] [INFO ] Found NUPN structural information;
[2024-05-29 19:23:25] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 713 rows 783 cols
[2024-05-29 19:23:25] [INFO ] Computed 111 invariants in 31 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 53 ms. (185 steps per ms)
FORMULA ShieldPPPt-PT-010B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-29 19:23:25] [INFO ] Invariant cache hit.
[2024-05-29 19:23:26] [INFO ] [Real]Absence check using 111 positive place invariants in 42 ms returned sat
[2024-05-29 19:23:26] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2024-05-29 19:23:26] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 40 ms to minimize.
[2024-05-29 19:23:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:23:26] [INFO ] [Nat]Absence check using 111 positive place invariants in 35 ms returned sat
[2024-05-29 19:23:27] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2024-05-29 19:23:27] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 5 ms to minimize.
[2024-05-29 19:23:27] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 5 ms to minimize.
[2024-05-29 19:23:27] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 3 ms to minimize.
[2024-05-29 19:23:27] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 3 ms to minimize.
[2024-05-29 19:23:28] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 5 ms to minimize.
[2024-05-29 19:23:28] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 4 ms to minimize.
[2024-05-29 19:23:28] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 4 ms to minimize.
[2024-05-29 19:23:28] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 3 ms to minimize.
[2024-05-29 19:23:28] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 2 ms to minimize.
[2024-05-29 19:23:28] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2024-05-29 19:23:29] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 3 ms to minimize.
[2024-05-29 19:23:29] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-29 19:23:29] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 2 ms to minimize.
[2024-05-29 19:23:29] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-29 19:23:29] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 3 ms to minimize.
[2024-05-29 19:23:29] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 3 ms to minimize.
[2024-05-29 19:23:29] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-29 19:23:30] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-29 19:23:30] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 3 ms to minimize.
[2024-05-29 19:23:30] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-29 19:23:30] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3148 ms
[2024-05-29 19:23:30] [INFO ] Computed and/alt/rep : 712/1063/712 causal constraints (skipped 0 transitions) in 42 ms.
[2024-05-29 19:23:31] [INFO ] Added : 170 causal constraints over 34 iterations in 1409 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 783 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p234) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 712/712 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 194 rules applied. Total rules applied 194 place count 783 transition count 518
Reduce places removed 194 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 196 rules applied. Total rules applied 390 place count 589 transition count 516
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 391 place count 588 transition count 516
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 391 place count 588 transition count 476
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 471 place count 548 transition count 476
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 540 place count 479 transition count 407
Iterating global reduction 3 with 69 rules applied. Total rules applied 609 place count 479 transition count 407
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 609 place count 479 transition count 378
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 667 place count 450 transition count 378
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 1 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 1007 place count 280 transition count 208
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 1063 place count 252 transition count 208
Partial Free-agglomeration rule applied 29 times.
Drop transitions (Partial Free agglomeration) removed 29 transitions
Iterating global reduction 3 with 29 rules applied. Total rules applied 1092 place count 252 transition count 208
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1093 place count 251 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1094 place count 250 transition count 207
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1094 place count 250 transition count 205
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 1098 place count 248 transition count 205
Applied a total of 1098 rules in 184 ms. Remains 248 /783 variables (removed 535) and now considering 205/712 (removed 507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 248/783 places, 205/712 transitions.
// Phase 1: matrix 205 rows 248 cols
[2024-05-29 19:23:32] [INFO ] Computed 110 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (247 resets) in 2933 ms. (340 steps per ms)
FORMULA ShieldPPPt-PT-010B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (27 resets) in 1517 ms. (658 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-29 19:23:36] [INFO ] Flatten gal took : 51 ms
[2024-05-29 19:23:36] [INFO ] Flatten gal took : 20 ms
[2024-05-29 19:23:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16527541227215813109.gal : 12 ms
[2024-05-29 19:23:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality212750851938312365.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16527541227215813109.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality212750851938312365.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 11567 ms.

BK_STOP 1717010616915

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="ShieldPPPt-PT-010B"
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-5568"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-010B, 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 r356-tall-171683761500621"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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