Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399700525.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BusinessProcesses-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399700525
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 11 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 16:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 131K May 18 16:42 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 BusinessProcesses-PT-10-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717225552296

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:05:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 07:05:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:05:54] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2024-06-01 07:05:54] [INFO ] Transformed 518 places.
[2024-06-01 07:05:54] [INFO ] Transformed 471 transitions.
[2024-06-01 07:05:54] [INFO ] Found NUPN structural information;
[2024-06-01 07:05:54] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 468 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 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 471 rows 518 cols
[2024-06-01 07:05:54] [INFO ] Computed 85 invariants in 27 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 (83 resets) in 85 ms. (116 steps per ms)
FORMULA BusinessProcesses-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (56 resets) in 86 ms. (459 steps per ms)
FORMULA BusinessProcesses-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-01 07:05:54] [INFO ] Invariant cache hit.
[2024-06-01 07:05:55] [INFO ] [Real]Absence check using 48 positive place invariants in 25 ms returned sat
[2024-06-01 07:05:55] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 31 ms returned sat
[2024-06-01 07:05:55] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 14 ms to minimize.
[2024-06-01 07:05:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:05:55] [INFO ] [Nat]Absence check using 48 positive place invariants in 31 ms returned sat
[2024-06-01 07:05:55] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 11 ms returned sat
[2024-06-01 07:05:56] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2024-06-01 07:05:56] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:05:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2024-06-01 07:05:56] [INFO ] Computed and/alt/rep : 442/759/442 causal constraints (skipped 28 transitions) in 57 ms.
[2024-06-01 07:05:57] [INFO ] Added : 192 causal constraints over 39 iterations in 1158 ms. Result :sat
Minimization took 373 ms.
[2024-06-01 07:05:58] [INFO ] [Real]Absence check using 48 positive place invariants in 33 ms returned sat
[2024-06-01 07:05:58] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 19 ms returned sat
[2024-06-01 07:05:58] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 11 places in 320 ms of which 4 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:05:58] [INFO ] [Nat]Absence check using 48 positive place invariants in 29 ms returned sat
[2024-06-01 07:05:58] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 14 ms returned sat
[2024-06-01 07:05:58] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-06-01 07:05:59] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:05:59] [INFO ] Deduced a trap composed of 116 places in 250 ms of which 4 ms to minimize.
[2024-06-01 07:05:59] [INFO ] Deduced a trap composed of 18 places in 202 ms of which 11 ms to minimize.
[2024-06-01 07:05:59] [INFO ] Deduced a trap composed of 37 places in 256 ms of which 5 ms to minimize.
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 15 places in 239 ms of which 6 ms to minimize.
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 117 places in 215 ms of which 4 ms to minimize.
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 116 places in 145 ms of which 4 ms to minimize.
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 115 places in 142 ms of which 4 ms to minimize.
[2024-06-01 07:06:01] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:06:01] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:06:01] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:06:01] [INFO ] Deduced a trap composed of 117 places in 179 ms of which 4 ms to minimize.
[2024-06-01 07:06:01] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 118 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 2 ms to minimize.
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 4 ms to minimize.
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 136 places in 241 ms of which 3 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 130 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 125 places in 199 ms of which 5 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 121 places in 201 ms of which 5 ms to minimize.
[2024-06-01 07:06:03] [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 1
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[1, 1]
Support contains 2 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 471/471 transitions.
Graph (trivial) has 296 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 17 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1063 edges and 512 vertex of which 510 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 115 place count 510 transition count 349
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 1 with 113 rules applied. Total rules applied 228 place count 397 transition count 349
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 228 place count 397 transition count 271
Deduced a syphon composed of 78 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 169 rules applied. Total rules applied 397 place count 306 transition count 271
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 464 place count 239 transition count 204
Iterating global reduction 2 with 67 rules applied. Total rules applied 531 place count 239 transition count 204
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 531 place count 239 transition count 196
Deduced a syphon composed of 8 places in 15 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 549 place count 229 transition count 196
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 155 rules applied. Total rules applied 704 place count 150 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 706 place count 149 transition count 123
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 708 place count 149 transition count 121
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 710 place count 147 transition count 121
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 715 place count 147 transition count 121
Applied a total of 715 rules in 251 ms. Remains 147 /518 variables (removed 371) and now considering 121/471 (removed 350) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 284 ms. Remains : 147/518 places, 121/471 transitions.
// Phase 1: matrix 121 rows 147 cols
[2024-06-01 07:06:04] [INFO ] Computed 66 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA BusinessProcesses-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (46909 resets) in 2805 ms. (356 steps per ms)
FORMULA BusinessProcesses-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (21574 resets) in 1799 ms. (555 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 15008 ms.
ITS solved all properties within timeout

BK_STOP 1717225569011

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="BusinessProcesses-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-10, 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 r472-tajo-171620399700525"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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