Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969019900109.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is MedleyA-PT-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019900109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.6K Mar 7 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 7 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 11:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 11:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Mar 7 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 11:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 48K Mar 3 18:30 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-02-UpperBounds-00
FORMULA_NAME MedleyA-PT-02-UpperBounds-01
FORMULA_NAME MedleyA-PT-02-UpperBounds-02
FORMULA_NAME MedleyA-PT-02-UpperBounds-03
FORMULA_NAME MedleyA-PT-02-UpperBounds-04
FORMULA_NAME MedleyA-PT-02-UpperBounds-05
FORMULA_NAME MedleyA-PT-02-UpperBounds-06
FORMULA_NAME MedleyA-PT-02-UpperBounds-07
FORMULA_NAME MedleyA-PT-02-UpperBounds-08
FORMULA_NAME MedleyA-PT-02-UpperBounds-09
FORMULA_NAME MedleyA-PT-02-UpperBounds-10
FORMULA_NAME MedleyA-PT-02-UpperBounds-11
FORMULA_NAME MedleyA-PT-02-UpperBounds-12
FORMULA_NAME MedleyA-PT-02-UpperBounds-13
FORMULA_NAME MedleyA-PT-02-UpperBounds-14
FORMULA_NAME MedleyA-PT-02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779698980353

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 08:49:42] [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]
[2026-05-25 08:49:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:49:42] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2026-05-25 08:49:42] [INFO ] Transformed 69 places.
[2026-05-25 08:49:42] [INFO ] Transformed 168 transitions.
[2026-05-25 08:49:42] [INFO ] Found NUPN structural information;
[2026-05-25 08:49:42] [INFO ] Parsed PT model containing 69 places and 168 transitions and 765 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
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]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16860006898831840168.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16414485182295164198.kers'
[2026-05-25 08:49:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16860006898831840168.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16414485182295164198.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 69 cols 601 entries
Finished phase 1 with 59 SingleSign rule and 1 generalized
[2026-05-25 08:49:43] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16414485182295164198.kers
Total runtime 5 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 (1017 resets) in 52 ms. (188 steps per ms)
FORMULA MedleyA-PT-02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50002 steps (1168 resets) in 134 ms. (370 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-25 08:49:43] [INFO ] Invariant cache hit.
[2026-05-25 08:49:43] [INFO ] [Real]Absence check using 8 positive place invariants in 23 ms returned sat
[2026-05-25 08:49:43] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 11 ms returned sat
[2026-05-25 08:49:43] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2026-05-25 08:49:43] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-25 08:49:43] [INFO ] [Real]Added 60 Read/Feed constraints in 13 ms returned sat
[2026-05-25 08:49:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:49:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-25 08:49:43] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-25 08:49:43] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2026-05-25 08:49:43] [INFO ] [Nat]Added 60 Read/Feed constraints in 10 ms returned sat
[2026-05-25 08:49:43] [INFO ] Computed and/alt/rep : 113/600/113 causal constraints (skipped 48 transitions) in 27 ms.
[2026-05-25 08:49:44] [INFO ] Added : 19 causal constraints over 4 iterations in 152 ms. Result :sat
Minimization took 33 ms.
[2026-05-25 08:49:44] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-25 08:49:44] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 08:49:44] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2026-05-25 08:49:44] [INFO ] [Real]Added 60 Read/Feed constraints in 7 ms returned sat
[2026-05-25 08:49:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:49:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-25 08:49:44] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 08:49:44] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2026-05-25 08:49:44] [INFO ] [Nat]Added 60 Read/Feed constraints in 10 ms returned sat
[2026-05-25 08:49:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2026-05-25 08:49:44] [INFO ] Computed and/alt/rep : 113/600/113 causal constraints (skipped 48 transitions) in 18 ms.
[2026-05-25 08:49:44] [INFO ] Added : 23 causal constraints over 5 iterations in 146 ms. Result :sat
Minimization took 63 ms.
[2026-05-25 08:49:44] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 08:49:44] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 08:49:44] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2026-05-25 08:49:44] [INFO ] [Real]Added 60 Read/Feed constraints in 9 ms returned sat
[2026-05-25 08:49:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:49:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-25 08:49:44] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 08:49:44] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2026-05-25 08:49:44] [INFO ] [Nat]Added 60 Read/Feed constraints in 7 ms returned sat
[2026-05-25 08:49:44] [INFO ] Computed and/alt/rep : 113/600/113 causal constraints (skipped 48 transitions) in 11 ms.
[2026-05-25 08:49:44] [INFO ] Added : 11 causal constraints over 3 iterations in 55 ms. Result :sat
Minimization took 28 ms.
[2026-05-25 08:49:45] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 08:49:45] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 08:49:45] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2026-05-25 08:49:45] [INFO ] [Real]Added 60 Read/Feed constraints in 5 ms returned sat
[2026-05-25 08:49:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:49:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2026-05-25 08:49:45] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-25 08:49:45] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-25 08:49:45] [INFO ] [Nat]Added 60 Read/Feed constraints in 13 ms returned sat
[2026-05-25 08:49:45] [INFO ] Computed and/alt/rep : 113/600/113 causal constraints (skipped 48 transitions) in 17 ms.
[2026-05-25 08:49:45] [INFO ] Added : 11 causal constraints over 3 iterations in 118 ms. Result :sat
Minimization took 28 ms.
[2026-05-25 08:49:45] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 08:49:45] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 08:49:45] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2026-05-25 08:49:45] [INFO ] [Real]Added 60 Read/Feed constraints in 9 ms returned sat
[2026-05-25 08:49:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:49:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-25 08:49:45] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 08:49:45] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2026-05-25 08:49:45] [INFO ] [Nat]Added 60 Read/Feed constraints in 14 ms returned sat
[2026-05-25 08:49:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2026-05-25 08:49:45] [INFO ] Computed and/alt/rep : 113/600/113 causal constraints (skipped 48 transitions) in 10 ms.
[2026-05-25 08:49:45] [INFO ] Added : 17 causal constraints over 5 iterations in 143 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA MedleyA-PT-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 162/162 transitions.
Graph (complete) has 288 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 53 transition count 140
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 53 transition count 140
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 31 place count 51 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 33 place count 51 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 34 place count 50 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 50 transition count 125
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 41 place count 47 transition count 122
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 53 place count 41 transition count 161
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 0 with 34 rules applied. Total rules applied 87 place count 41 transition count 127
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 89 place count 41 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 91 place count 39 transition count 125
Applied a total of 91 rules in 106 ms. Remains 39 /69 variables (removed 30) and now considering 125/162 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 39/69 places, 125/162 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9146954330387628951.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15885205738632905603.kers'
[2026-05-25 08:49:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9146954330387628951.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15885205738632905603.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 125 rows 39 cols 552 entries
Finished phase 1 with 29 SingleSign rule and 1 generalized
[2026-05-25 08:49:46] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15885205738632905603.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (213972 resets) in 2009 ms. (497 steps per ms)
FORMULA MedleyA-PT-02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (54956 resets) in 620 ms. (1610 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 6211 ms.

BK_STOP 1779698988983

--------------------
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
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="MedleyA-PT-02"
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-5973"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-02, 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 r178-oct2-177969019900109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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