Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r162-smll-177961107900469.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is LeafsetExtension-PT-S08C4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107900469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 9.6K Mar 7 16:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Mar 7 16:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 7 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Mar 15 11:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 15 11:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 11:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Mar 7 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 198K Mar 7 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Mar 7 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Mar 7 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Mar 15 11:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 254K 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 LeafsetExtension-PT-S08C4-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779910722951

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S08C4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-27 19:38:45] [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-27 19:38:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 19:38:45] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2026-05-27 19:38:45] [INFO ] Transformed 462 places.
[2026-05-27 19:38:45] [INFO ] Transformed 409 transitions.
[2026-05-27 19:38:45] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 454 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
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:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15007796555452288883.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12999045978041097839.kers'
[2026-05-27 19:38:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15007796555452288883.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12999045978041097839.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 409 rows 450 cols 1132 entries
Finished phase 1 with 251 SingleSign rule and 158 generalized
[2026-05-27 19:38:45] [INFO ] Computed 53 invariants in 3 ms
Computed 53 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-12999045978041097839.kers
Total runtime 11 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:[7, 1, 4, 1, 1, 1, 1, 4, 1, 1, 1, 7, 1, 1, 4, 1]
RANDOM walk for 10000 steps (295 resets) in 94 ms. (105 steps per ms)
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50003 steps (214 resets) in 119 ms. (416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3, 1, 2, 1] Max Struct:[7, 4, 4, 7, 4]
[2026-05-27 19:38:46] [INFO ] Invariant cache hit.
[2026-05-27 19:38:46] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2026-05-27 19:38:46] [INFO ] [Real]Absence check using 20 positive and 33 generalized place invariants in 29 ms returned sat
[2026-05-27 19:38:46] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2026-05-27 19:38:47] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 71 ms.
[2026-05-27 19:38:47] [INFO ] Added : 13 causal constraints over 3 iterations in 380 ms. Result :sat
Minimization took 262 ms.
[2026-05-27 19:38:48] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2026-05-27 19:38:48] [INFO ] [Real]Absence check using 20 positive and 33 generalized place invariants in 27 ms returned sat
[2026-05-27 19:38:48] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2026-05-27 19:38:48] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 63 ms.
[2026-05-27 19:38:48] [INFO ] Added : 13 causal constraints over 3 iterations in 280 ms. Result :sat
Minimization took 161 ms.
[2026-05-27 19:38:49] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2026-05-27 19:38:49] [INFO ] [Real]Absence check using 20 positive and 33 generalized place invariants in 9 ms returned unsat
[2026-05-27 19:38:49] [INFO ] [Real]Absence check using 20 positive place invariants in 24 ms returned sat
[2026-05-27 19:38:49] [INFO ] [Real]Absence check using 20 positive and 33 generalized place invariants in 23 ms returned sat
[2026-05-27 19:38:49] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2026-05-27 19:38:49] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 55 ms.
[2026-05-27 19:38:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 19:38:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 23 ms returned sat
[2026-05-27 19:38:50] [INFO ] [Nat]Absence check using 20 positive and 33 generalized place invariants in 25 ms returned sat
[2026-05-27 19:38:50] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2026-05-27 19:38:50] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 59 ms.
[2026-05-27 19:38:51] [INFO ] Added : 15 causal constraints over 4 iterations in 332 ms. Result :sat
Minimization took 253 ms.
[2026-05-27 19:38:51] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2026-05-27 19:38:51] [INFO ] [Real]Absence check using 20 positive and 33 generalized place invariants in 19 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3, 1, 2, 1] Max Struct:[7, 4, 1, 7, 1]
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 4] Max Struct:[7, 7]
Support contains 2 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 409/409 transitions.
Graph (complete) has 849 edges and 462 vertex of which 43 are kept as prefixes of interest. Removing 419 places using SCC suffix rule.3 ms
Discarding 419 places :
Also discarding 276 output transitions
Drop transitions (Output transitions of discarded places.) removed 276 transitions
Drop transitions (Empty/Sink Transition effects.) removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 41 transition count 41
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 104 place count 32 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 104 place count 32 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 31 transition count 40
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 28 transition count 37
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 28 transition count 37
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 116 place count 26 transition count 35
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 26 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 120 place count 24 transition count 33
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 123 place count 24 transition count 33
Applied a total of 123 rules in 74 ms. Remains 24 /462 variables (removed 438) and now considering 33/409 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 24/462 places, 33/409 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11094573817469383811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3624889245057168039.kers'
[2026-05-27 19:38:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11094573817469383811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3624889245057168039.kers]
Normalized transition count is 26 out of 33 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 26 rows 23 cols 66 entries
Finished phase 1 with 15 SingleSign rule and 6 generalized
[2026-05-27 19:38:51] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3624889245057168039.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 4] Max Struct:[7, 7]
RANDOM walk for 1000000 steps (87932 resets) in 1305 ms. (765 steps per ms)
BEST_FIRST walk for 2000001 steps (40092 resets) in 1056 ms. (1892 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4] Max Struct:[7, 7]
[2026-05-27 19:38:54] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18372128063278299761.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-801770555983881719.kers'
[2026-05-27 19:38:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18372128063278299761.kers, --Pflows, --basisKERS=/tmp/petrispot-output-801770555983881719.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 26 rows 23 cols 66 entries
Finished phase 1 with 15 SingleSign rule and 6 generalized
[2026-05-27 19:38:54] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-801770555983881719.kers
Total runtime 0 ms.
[2026-05-27 19:38:54] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-27 19:38:54] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2026-05-27 19:38:54] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-27 19:38:54] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4] Max Struct:[4, 4]
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 9105 ms.

BK_STOP 1779910734213

--------------------
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
++ 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.202604301425.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="LeafsetExtension-PT-S08C4"
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 LeafsetExtension-PT-S08C4, 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 r162-smll-177961107900469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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