Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025800813.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVs-PT-020B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025800813
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.7K Apr 30 06:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 06:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 244K May 10 09:34 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 ShieldRVs-PT-020B-UpperBounds-00
FORMULA_NAME ShieldRVs-PT-020B-UpperBounds-01
FORMULA_NAME ShieldRVs-PT-020B-UpperBounds-02
FORMULA_NAME ShieldRVs-PT-020B-UpperBounds-03
FORMULA_NAME ShieldRVs-PT-020B-UpperBounds-04
FORMULA_NAME ShieldRVs-PT-020B-UpperBounds-05
FORMULA_NAME ShieldRVs-PT-020B-UpperBounds-06
FORMULA_NAME ShieldRVs-PT-020B-UpperBounds-07
FORMULA_NAME ShieldRVs-PT-020B-UpperBounds-08
FORMULA_NAME ShieldRVs-PT-020B-UpperBounds-09
FORMULA_NAME ShieldRVs-PT-020B-UpperBounds-10
FORMULA_NAME ShieldRVs-PT-020B-UpperBounds-11
FORMULA_NAME ShieldRVs-PT-020B-UpperBounds-12
FORMULA_NAME ShieldRVs-PT-020B-UpperBounds-13
FORMULA_NAME ShieldRVs-PT-020B-UpperBounds-14
FORMULA_NAME ShieldRVs-PT-020B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653052866699

Running Version 202205111006
[2022-05-20 13:21:07] [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-20 13:21:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 13:21:08] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2022-05-20 13:21:08] [INFO ] Transformed 803 places.
[2022-05-20 13:21:08] [INFO ] Transformed 903 transitions.
[2022-05-20 13:21:08] [INFO ] Found NUPN structural information;
[2022-05-20 13:21:08] [INFO ] Parsed PT model containing 803 places and 903 transitions in 238 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 903 rows 803 cols
[2022-05-20 13:21:08] [INFO ] Computed 81 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 11 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :14
FORMULA ShieldRVs-PT-020B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
// Phase 1: matrix 903 rows 803 cols
[2022-05-20 13:21:08] [INFO ] Computed 81 place invariants in 8 ms
[2022-05-20 13:21:08] [INFO ] [Real]Absence check using 81 positive place invariants in 29 ms returned sat
[2022-05-20 13:21:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 13:21:08] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2022-05-20 13:21:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 13:21:09] [INFO ] [Nat]Absence check using 81 positive place invariants in 30 ms returned sat
[2022-05-20 13:21:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 13:21:09] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2022-05-20 13:21:09] [INFO ] Deduced a trap composed of 25 places in 252 ms of which 8 ms to minimize.
[2022-05-20 13:21:10] [INFO ] Deduced a trap composed of 28 places in 257 ms of which 2 ms to minimize.
[2022-05-20 13:21:10] [INFO ] Deduced a trap composed of 29 places in 223 ms of which 1 ms to minimize.
[2022-05-20 13:21:10] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 4 ms to minimize.
[2022-05-20 13:21:10] [INFO ] Deduced a trap composed of 36 places in 259 ms of which 1 ms to minimize.
[2022-05-20 13:21:11] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 1 ms to minimize.
[2022-05-20 13:21:11] [INFO ] Deduced a trap composed of 46 places in 206 ms of which 0 ms to minimize.
[2022-05-20 13:21:11] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 1 ms to minimize.
[2022-05-20 13:21:11] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 0 ms to minimize.
[2022-05-20 13:21:12] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 1 ms to minimize.
[2022-05-20 13:21:12] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 1 ms to minimize.
[2022-05-20 13:21:12] [INFO ] Deduced a trap composed of 29 places in 209 ms of which 1 ms to minimize.
[2022-05-20 13:21:12] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 1 ms to minimize.
[2022-05-20 13:21:13] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 0 ms to minimize.
[2022-05-20 13:21:13] [INFO ] Deduced a trap composed of 28 places in 189 ms of which 0 ms to minimize.
[2022-05-20 13:21:13] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 0 ms to minimize.
[2022-05-20 13:21:13] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 3 ms to minimize.
[2022-05-20 13:21:13] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 0 ms to minimize.
[2022-05-20 13:21:13] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
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-20 13:21:14] [INFO ] [Real]Absence check using 81 positive place invariants in 31 ms returned sat
[2022-05-20 13:21:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 13:21:14] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2022-05-20 13:21:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 13:21:14] [INFO ] [Nat]Absence check using 81 positive place invariants in 27 ms returned sat
[2022-05-20 13:21:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 13:21:14] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2022-05-20 13:21:15] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 0 ms to minimize.
[2022-05-20 13:21:15] [INFO ] Deduced a trap composed of 28 places in 229 ms of which 1 ms to minimize.
[2022-05-20 13:21:15] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 1 ms to minimize.
[2022-05-20 13:21:16] [INFO ] Deduced a trap composed of 20 places in 259 ms of which 0 ms to minimize.
[2022-05-20 13:21:16] [INFO ] Deduced a trap composed of 26 places in 253 ms of which 0 ms to minimize.
[2022-05-20 13:21:16] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 1 ms to minimize.
[2022-05-20 13:21:16] [INFO ] Deduced a trap composed of 43 places in 248 ms of which 1 ms to minimize.
[2022-05-20 13:21:17] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 1 ms to minimize.
[2022-05-20 13:21:17] [INFO ] Deduced a trap composed of 30 places in 252 ms of which 1 ms to minimize.
[2022-05-20 13:21:17] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 1 ms to minimize.
[2022-05-20 13:21:18] [INFO ] Deduced a trap composed of 25 places in 239 ms of which 1 ms to minimize.
[2022-05-20 13:21:18] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 1 ms to minimize.
[2022-05-20 13:21:18] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 1 ms to minimize.
[2022-05-20 13:21:18] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 1 ms to minimize.
[2022-05-20 13:21:19] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 1 ms to minimize.
[2022-05-20 13:21:19] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 1 ms to minimize.
[2022-05-20 13:21:19] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 1 ms to minimize.
[2022-05-20 13:21:19] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
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)
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 803/803 places, 903/903 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 803 transition count 822
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 722 transition count 822
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 162 place count 722 transition count 722
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 362 place count 622 transition count 722
Discarding 138 places :
Symmetric choice reduction at 2 with 138 rule applications. Total rules 500 place count 484 transition count 584
Iterating global reduction 2 with 138 rules applied. Total rules applied 638 place count 484 transition count 584
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 638 place count 484 transition count 524
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 758 place count 424 transition count 524
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 1 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 280 rules applied. Total rules applied 1038 place count 284 transition count 384
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 2 with 42 rules applied. Total rules applied 1080 place count 284 transition count 384
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1081 place count 283 transition count 383
Applied a total of 1081 rules in 182 ms. Remains 283 /803 variables (removed 520) and now considering 383/903 (removed 520) transitions.
Finished structural reductions, in 1 iterations. Remains : 283/803 places, 383/903 transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 13:21:19] [INFO ] Computed 81 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 4068 resets, run finished after 2938 ms. (steps per millisecond=340 ) properties (out of 2) seen :2
FORMULA ShieldRVs-PT-020B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 14845 ms.

BK_STOP 1653052882751

--------------------
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="ShieldRVs-PT-020B"
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 ShieldRVs-PT-020B, 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 r222-tall-165286025800813"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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