fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r171-tall-167838858600453
Last Updated
May 14, 2023

About the Execution of Smart+red for FlexibleBarrier-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
289.991 9932.00 16144.00 481.60 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r171-tall-167838858600453.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is FlexibleBarrier-PT-04b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838858600453
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 12:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 12:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 25 12:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 69K Mar 5 18:22 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 FlexibleBarrier-PT-04b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679473557050

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-04b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 08:25:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 08:25:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 08:25:58] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-22 08:25:58] [INFO ] Transformed 268 places.
[2023-03-22 08:25:58] [INFO ] Transformed 305 transitions.
[2023-03-22 08:25:58] [INFO ] Found NUPN structural information;
[2023-03-22 08:25:58] [INFO ] Parsed PT model containing 268 places and 305 transitions and 743 arcs in 114 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 305 rows 268 cols
[2023-03-22 08:25:58] [INFO ] Computed 6 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 234 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :13
FORMULA FlexibleBarrier-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
[2023-03-22 08:25:58] [INFO ] Invariant cache hit.
[2023-03-22 08:25:59] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2023-03-22 08:25:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 08:25:59] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2023-03-22 08:25:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 08:25:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-22 08:25:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 08:25:59] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-22 08:25:59] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 3 ms to minimize.
[2023-03-22 08:25:59] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2023-03-22 08:25:59] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2023-03-22 08:25:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 320 ms
[2023-03-22 08:25:59] [INFO ] Computed and/alt/rep : 287/559/287 causal constraints (skipped 17 transitions) in 19 ms.
[2023-03-22 08:26:01] [INFO ] Added : 266 causal constraints over 54 iterations in 1345 ms. Result :sat
Minimization took 97 ms.
[2023-03-22 08:26:01] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-22 08:26:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 08:26:01] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-22 08:26:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 08:26:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-22 08:26:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 08:26:01] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-22 08:26:01] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 2 ms to minimize.
[2023-03-22 08:26:01] [INFO ] Deduced a trap composed of 78 places in 58 ms of which 0 ms to minimize.
[2023-03-22 08:26:01] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 0 ms to minimize.
[2023-03-22 08:26:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 239 ms
[2023-03-22 08:26:01] [INFO ] Computed and/alt/rep : 287/559/287 causal constraints (skipped 17 transitions) in 19 ms.
[2023-03-22 08:26:02] [INFO ] Added : 247 causal constraints over 50 iterations in 1173 ms. Result :sat
Minimization took 77 ms.
[2023-03-22 08:26:03] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-22 08:26:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 08:26:03] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-22 08:26:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 08:26:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-22 08:26:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 08:26:03] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-22 08:26:03] [INFO ] Deduced a trap composed of 105 places in 82 ms of which 0 ms to minimize.
[2023-03-22 08:26:03] [INFO ] Deduced a trap composed of 90 places in 74 ms of which 1 ms to minimize.
[2023-03-22 08:26:03] [INFO ] Deduced a trap composed of 96 places in 71 ms of which 1 ms to minimize.
[2023-03-22 08:26:03] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 1 ms to minimize.
[2023-03-22 08:26:03] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 1 ms to minimize.
[2023-03-22 08:26:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 438 ms
[2023-03-22 08:26:03] [INFO ] Computed and/alt/rep : 287/559/287 causal constraints (skipped 17 transitions) in 17 ms.
[2023-03-22 08:26:05] [INFO ] Deduced a trap composed of 91 places in 76 ms of which 1 ms to minimize.
[2023-03-22 08:26:05] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 0 ms to minimize.
[2023-03-22 08:26:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2023-03-22 08:26:05] [INFO ] Added : 272 causal constraints over 55 iterations in 1535 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA FlexibleBarrier-PT-04b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 268 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 303/303 transitions.
Graph (trivial) has 252 edges and 268 vertex of which 26 / 268 are part of one of the 4 SCC in 4 ms
Free SCC test removed 22 places
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 2 places and 2 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 244 transition count 198
Reduce places removed 77 places and 1 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 167 transition count 197
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 158 place count 166 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 159 place count 165 transition count 195
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 159 place count 165 transition count 183
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 183 place count 153 transition count 183
Discarding 68 places :
Symmetric choice reduction at 4 with 68 rule applications. Total rules 251 place count 85 transition count 115
Iterating global reduction 4 with 68 rules applied. Total rules applied 319 place count 85 transition count 115
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 319 place count 85 transition count 110
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 329 place count 80 transition count 110
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 332 place count 80 transition count 107
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 341 place count 71 transition count 98
Iterating global reduction 5 with 9 rules applied. Total rules applied 350 place count 71 transition count 98
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 359 place count 71 transition count 89
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 397 place count 52 transition count 70
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 402 place count 52 transition count 65
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 405 place count 49 transition count 62
Iterating global reduction 7 with 3 rules applied. Total rules applied 408 place count 49 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 410 place count 48 transition count 79
Free-agglomeration rule applied 22 times.
Iterating global reduction 7 with 22 rules applied. Total rules applied 432 place count 48 transition count 57
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 88 edges and 26 vertex of which 8 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 32 rules applied. Total rules applied 464 place count 8 transition count 48
Drop transitions removed 39 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 8 with 42 rules applied. Total rules applied 506 place count 8 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 507 place count 7 transition count 5
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t264.t176.t177.t300.t171 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 510 place count 4 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 511 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 511 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 513 place count 2 transition count 1
Applied a total of 513 rules in 61 ms. Remains 2 /268 variables (removed 266) and now considering 1/303 (removed 302) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 2/268 places, 1/303 transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-22 08:26:05] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 242 ms. (steps per millisecond=4132 ) properties (out of 1) seen :1
FORMULA FlexibleBarrier-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 7407 ms.
ITS solved all properties within timeout

BK_STOP 1679473566982

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="FlexibleBarrier-PT-04b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is FlexibleBarrier-PT-04b, 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 r171-tall-167838858600453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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