Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689100309.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AirplaneLD-PT-4000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689100309
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 45M
-rw-r--r-- 1 mcc users 1002K Apr 29 23:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.5M Apr 29 23:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Apr 29 22:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.5M Apr 29 22:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 2.1M May 9 07:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 4.7M May 9 07:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M May 9 07:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.5M May 9 07:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 191K May 9 07:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 358K May 9 07:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 18M May 10 09:33 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 AirplaneLD-PT-4000-UpperBounds-00
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-01
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-02
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-03
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-04
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-05
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-06
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-07
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-08
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-09
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-10
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-11
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-12
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-13
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-14
FORMULA_NAME AirplaneLD-PT-4000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652659199723

Running Version 202205111006
[2022-05-16 00:00:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 00:00:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:00:02] [INFO ] Load time of PNML (sax parser for PT used): 1141 ms
[2022-05-16 00:00:02] [INFO ] Transformed 28019 places.
[2022-05-16 00:00:02] [INFO ] Transformed 32008 transitions.
[2022-05-16 00:00:02] [INFO ] Parsed PT model containing 28019 places and 32008 transitions in 1398 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 539 ms.
Reduce places removed 12002 places and 0 transitions.
FORMULA AirplaneLD-PT-4000-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-4000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 32008 rows 16017 cols
[2022-05-16 00:00:26] [INFO ] Computed 3 place invariants in 22877 ms
FORMULA AirplaneLD-PT-4000-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 1258 resets, run finished after 22373 ms. (steps per millisecond=0 ) properties (out of 13) seen :11
FORMULA AirplaneLD-PT-4000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :4
// Phase 1: matrix 32008 rows 16017 cols
[2022-05-16 00:01:13] [INFO ] Computed 3 place invariants in 23606 ms
[2022-05-16 00:01:15] [INFO ] [Real]Absence check using 2 positive place invariants in 312 ms returned sat
[2022-05-16 00:01:15] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 00:01:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:01:18] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 00:01:20] [INFO ] [Real]Absence check using 2 positive place invariants in 301 ms returned sat
[2022-05-16 00:01:20] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:01:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:01:23] [INFO ] [Real]Absence check using state equation in 3154 ms returned unknown
[2022-05-16 00:01:25] [INFO ] [Real]Absence check using 2 positive place invariants in 295 ms returned sat
[2022-05-16 00:01:25] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 00:01:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:01:28] [INFO ] [Real]Absence check using state equation in 2754 ms returned unknown
[2022-05-16 00:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 321 ms returned sat
[2022-05-16 00:01:30] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:01:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:01:33] [INFO ] [Real]Absence check using state equation in 2710 ms returned unknown
[2022-05-16 00:01:35] [INFO ] [Real]Absence check using 2 positive place invariants in 304 ms returned sat
[2022-05-16 00:01:35] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 00:01:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:01:38] [INFO ] [Real]Absence check using state equation in 3241 ms returned unknown
[2022-05-16 00:01:40] [INFO ] [Real]Absence check using 2 positive place invariants in 294 ms returned sat
[2022-05-16 00:01:40] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:01:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:01:43] [INFO ] [Real]Absence check using state equation in 3301 ms returned unknown
[2022-05-16 00:01:45] [INFO ] [Real]Absence check using 2 positive place invariants in 294 ms returned sat
[2022-05-16 00:01:45] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 00:01:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:01:48] [INFO ] [Real]Absence check using state equation in 2958 ms returned unknown
[2022-05-16 00:01:50] [INFO ] [Real]Absence check using 2 positive place invariants in 285 ms returned sat
[2022-05-16 00:01:50] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 00:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:01:53] [INFO ] [Real]Absence check using state equation in 3128 ms returned unknown
[2022-05-16 00:01:55] [INFO ] [Real]Absence check using 2 positive place invariants in 296 ms returned sat
[2022-05-16 00:01:55] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:01:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:01:58] [INFO ] [Real]Absence check using state equation in 2956 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[1, 1, 1, 1, 1, 1, 0, 1, 0]
Support contains 8006 out of 16017 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16017/16017 places, 32008/32008 transitions.
Graph (complete) has 42023 edges and 16017 vertex of which 12014 are kept as prefixes of interest. Removing 4003 places using SCC suffix rule.61 ms
Discarding 4003 places :
Also discarding 0 output transitions
Drop transitions removed 4001 transitions
Ensure Unique test removed 3998 transitions
Reduce isomorphic transitions removed 7999 transitions.
Iterating post reduction 0 with 7999 rules applied. Total rules applied 8000 place count 12014 transition count 24009
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 8000 place count 12014 transition count 24007
Deduced a syphon composed of 2 places in 22 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 8005 place count 12011 transition count 24007
Discarding 3999 places :
Symmetric choice reduction at 1 with 3999 rule applications. Total rules 12004 place count 8012 transition count 20008
Iterating global reduction 1 with 3999 rules applied. Total rules applied 16003 place count 8012 transition count 20008
Ensure Unique test removed 3999 transitions
Reduce isomorphic transitions removed 3999 transitions.
Iterating post reduction 1 with 3999 rules applied. Total rules applied 20002 place count 8012 transition count 16009
Applied a total of 20002 rules in 1491 ms. Remains 8012 /16017 variables (removed 8005) and now considering 16009/32008 (removed 15999) transitions.
Finished structural reductions, in 1 iterations. Remains : 8012/16017 places, 16009/32008 transitions.
// Phase 1: matrix 16009 rows 8012 cols
[2022-05-16 00:02:08] [INFO ] Computed 1 place invariants in 7614 ms
Finished random walk after 29909 steps, including 4389 resets, run visited all 9 properties in 30002 ms. (steps per millisecond=0 )
Incomplete Best-First random walk after 1000001 steps, including 83 resets, run finished after 761 ms. (steps per millisecond=1314 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 1000001 steps, including 49 resets, run finished after 602 ms. (steps per millisecond=1661 ) properties (out of 9) seen :8
Interrupted Best-First random walk after 212422 steps, including 17 resets, run timeout after 5008 ms. (steps per millisecond=42 ) properties seen 8
Interrupted Best-First random walk after 151308 steps, including 12 resets, run timeout after 5016 ms. (steps per millisecond=30 ) properties seen 8
Incomplete Best-First random walk after 1000001 steps, including 83 resets, run finished after 730 ms. (steps per millisecond=1369 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 1000001 steps, including 83 resets, run finished after 736 ms. (steps per millisecond=1358 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 1000001 steps, including 83 resets, run finished after 685 ms. (steps per millisecond=1459 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 1000001 steps, including 38 resets, run finished after 467 ms. (steps per millisecond=2141 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 1000001 steps, including 49 resets, run finished after 633 ms. (steps per millisecond=1579 ) properties (out of 9) seen :8
// Phase 1: matrix 16009 rows 8012 cols
[2022-05-16 00:02:59] [INFO ] Computed 1 place invariants in 6818 ms
[2022-05-16 00:03:00] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 68 ms returned sat
[2022-05-16 00:03:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:03:08] [INFO ] [Real]Absence check using state equation in 7238 ms returned unsat
[2022-05-16 00:03:08] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 83 ms returned sat
[2022-05-16 00:03:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:03:15] [INFO ] [Real]Absence check using state equation in 6839 ms returned unsat
[2022-05-16 00:03:16] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 89 ms returned sat
[2022-05-16 00:03:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:03:25] [INFO ] [Real]Absence check using state equation in 8665 ms returned unsat
[2022-05-16 00:03:26] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 65 ms returned sat
[2022-05-16 00:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:03:36] [INFO ] [Real]Absence check using state equation in 10172 ms returned unsat
[2022-05-16 00:03:37] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 71 ms returned sat
[2022-05-16 00:03:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:03:43] [INFO ] [Real]Absence check using state equation in 6276 ms returned unsat
[2022-05-16 00:03:44] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 63 ms returned sat
[2022-05-16 00:03:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:03:52] [INFO ] [Real]Absence check using state equation in 7661 ms returned unsat
[2022-05-16 00:03:53] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 64 ms returned sat
[2022-05-16 00:03:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:03:59] [INFO ] [Real]Absence check using state equation in 6204 ms returned unsat
[2022-05-16 00:04:00] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 74 ms returned sat
[2022-05-16 00:04:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:04:04] [INFO ] [Real]Absence check using state equation in 4088 ms returned unsat
[2022-05-16 00:04:05] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 67 ms returned sat
[2022-05-16 00:04:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:04:12] [INFO ] [Real]Absence check using state equation in 7060 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA AirplaneLD-PT-4000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-4000-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 251375 ms.

BK_STOP 1652659452455

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="AirplaneLD-PT-4000"
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-4028"
echo " Executing tool itstools"
echo " Input is AirplaneLD-PT-4000, 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 r006-tajo-165245689100309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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