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.r127-smll-177955743800066.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 gold2025
Input is ErlangenMainframeV0-PT-1202, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-smll-177955743800066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 38M
-rw-r--r-- 1 mcc users 8.8K Mar 7 04:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 7 04:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 7 04:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 7 04:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 09:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 09:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 09:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 04:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 7 04:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 04:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 7 04:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 38M 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 ErlangenMainframeV0-PT-1202-UpperBounds-00
FORMULA_NAME ErlangenMainframeV0-PT-1202-UpperBounds-01
FORMULA_NAME ErlangenMainframeV0-PT-1202-UpperBounds-02
FORMULA_NAME ErlangenMainframeV0-PT-1202-UpperBounds-03
FORMULA_NAME ErlangenMainframeV0-PT-1202-UpperBounds-04
FORMULA_NAME ErlangenMainframeV0-PT-1202-UpperBounds-05
FORMULA_NAME ErlangenMainframeV0-PT-1202-UpperBounds-06
FORMULA_NAME ErlangenMainframeV0-PT-1202-UpperBounds-07
FORMULA_NAME ErlangenMainframeV0-PT-1202-UpperBounds-08
FORMULA_NAME ErlangenMainframeV0-PT-1202-UpperBounds-09
FORMULA_NAME ErlangenMainframeV0-PT-1202-UpperBounds-10
FORMULA_NAME ErlangenMainframeV0-PT-1202-UpperBounds-11
FORMULA_NAME ErlangenMainframeV0-PT-1202-UpperBounds-12
FORMULA_NAME ErlangenMainframeV0-PT-1202-UpperBounds-13
FORMULA_NAME ErlangenMainframeV0-PT-1202-UpperBounds-14
FORMULA_NAME ErlangenMainframeV0-PT-1202-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779572057736

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-1202
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 21:34:19] [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-23 21:34:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 21:34:23] [INFO ] Load time of PNML (sax parser for PT used): 3964 ms
[2026-05-23 21:34:23] [INFO ] Transformed 283 places.
[2026-05-23 21:34:24] [INFO ] Transformed 27934 transitions.
[2026-05-23 21:34:24] [INFO ] Found NUPN structural information;
[2026-05-23 21:34:24] [INFO ] Parsed PT model containing 283 places and 27934 transitions and 756485 arcs in 4489 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 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 27934 rows 283 cols
[2026-05-23 21:34:25] [INFO ] Computed 30 invariants in 963 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 2337 ms. (4 steps per ms)
FORMULA ErlangenMainframeV0-PT-1202-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1202-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1202-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1202-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1202-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1202-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1202-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1202-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1202-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1202-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1202-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1202-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1202-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1202-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1202-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10000 steps (2 resets) in 191 ms. (52 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-23 21:34:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 21:34:29] [INFO ] [Real]Absence check using 18 positive place invariants in 30 ms returned sat
[2026-05-23 21:34:29] [INFO ] [Real]Absence check using 18 positive and 12 generalized place invariants in 14 ms returned sat
[2026-05-23 21:34:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
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 283 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p64) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 27932/27932 transitions.
Graph (trivial) has 222 edges and 283 vertex of which 6 / 283 are part of one of the 3 SCC in 17 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 2 places and 9217 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 278 transition count 18618
Reduce places removed 92 places and 4608 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 186 place count 186 transition count 14010
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 188 place count 184 transition count 14009
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 188 place count 184 transition count 14006
Deduced a syphon composed of 3 places in 20 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 194 place count 181 transition count 14006
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 238 place count 137 transition count 13962
Iterating global reduction 3 with 44 rules applied. Total rules applied 282 place count 137 transition count 13962
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 282 place count 137 transition count 13955
Deduced a syphon composed of 7 places in 17 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 296 place count 130 transition count 13955
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 309 place count 117 transition count 9348
Ensure Unique test removed 11 places
Iterating global reduction 3 with 24 rules applied. Total rules applied 333 place count 106 transition count 9348
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 346 place count 93 transition count 134
Iterating global reduction 3 with 13 rules applied. Total rules applied 359 place count 93 transition count 134
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 361 place count 91 transition count 130
Iterating global reduction 3 with 2 rules applied. Total rules applied 363 place count 91 transition count 130
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 449 place count 48 transition count 87
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 452 place count 45 transition count 65
Iterating global reduction 3 with 3 rules applied. Total rules applied 455 place count 45 transition count 65
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 458 place count 45 transition count 62
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 466 place count 41 transition count 74
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 467 place count 41 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 482 place count 41 transition count 58
Free-agglomeration rule applied 17 times.
Iterating global reduction 5 with 17 rules applied. Total rules applied 499 place count 41 transition count 41
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 53 edges and 24 vertex of which 5 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Iterating post reduction 5 with 35 rules applied. Total rules applied 534 place count 5 transition count 8
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 540 place count 5 transition count 2
Ensure Unique test removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 541 place count 4 transition count 2
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 542 place count 3 transition count 1
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 543 place count 2 transition count 1
Applied a total of 543 rules in 5894 ms. Remains 2 /283 variables (removed 281) and now considering 1/27932 (removed 27931) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5907 ms. Remains : 2/283 places, 1/27932 transitions.
// Phase 1: matrix 1 rows 2 cols
[2026-05-23 21:34:40] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (500000 resets) in 344 ms. (2898 steps per ms)
FORMULA ErlangenMainframeV0-PT-1202-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (500000 resets) in 215 ms. (4629 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 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 )
[2026-05-23 21:34:41] [INFO ] Flatten gal took : 176 ms
[2026-05-23 21:34:41] [INFO ] Flatten gal took : 1 ms
[2026-05-23 21:34:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14044610094267484737.gal : 4 ms
[2026-05-23 21:34:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9972526102259511570.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14044610094267484737.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9972526102259511570.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 21530 ms.

BK_STOP 1779572081268

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="ErlangenMainframeV0-PT-1202"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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 gold2025"
echo " Input is ErlangenMainframeV0-PT-1202, 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 r127-smll-177955743800066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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