Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789700616.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is ShieldRVt-PT-020B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789700616
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 21:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 21:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 21:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 21:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 239K May 18 16:43 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 ShieldRVt-PT-020B-UpperBounds-00
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-01
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-02
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-03
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-04
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-05
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-06
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-07
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-08
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-09
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-10
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-11
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-12
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-13
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-14
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717014810374

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-29 20:33:32] [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]
[2024-05-29 20:33:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:33:32] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-29 20:33:32] [INFO ] Transformed 1003 places.
[2024-05-29 20:33:32] [INFO ] Transformed 1003 transitions.
[2024-05-29 20:33:32] [INFO ] Found NUPN structural information;
[2024-05-29 20:33:32] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 1003 rows 1003 cols
[2024-05-29 20:33:32] [INFO ] Computed 81 invariants in 31 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 16) seen :14
FORMULA ShieldRVt-PT-020B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
[2024-05-29 20:33:32] [INFO ] Invariant cache hit.
[2024-05-29 20:33:33] [INFO ] [Real]Absence check using 81 positive place invariants in 48 ms returned sat
[2024-05-29 20:33:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 20:33:33] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2024-05-29 20:33:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:33:33] [INFO ] [Nat]Absence check using 81 positive place invariants in 31 ms returned sat
[2024-05-29 20:33:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 20:33:34] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2024-05-29 20:33:34] [INFO ] Deduced a trap composed of 40 places in 267 ms of which 3 ms to minimize.
[2024-05-29 20:33:34] [INFO ] Deduced a trap composed of 31 places in 230 ms of which 1 ms to minimize.
[2024-05-29 20:33:34] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 2 ms to minimize.
[2024-05-29 20:33:35] [INFO ] Deduced a trap composed of 31 places in 235 ms of which 1 ms to minimize.
[2024-05-29 20:33:35] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 1 ms to minimize.
[2024-05-29 20:33:35] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 0 ms to minimize.
[2024-05-29 20:33:35] [INFO ] Deduced a trap composed of 65 places in 214 ms of which 1 ms to minimize.
[2024-05-29 20:33:36] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 0 ms to minimize.
[2024-05-29 20:33:36] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 1 ms to minimize.
[2024-05-29 20:33:36] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 0 ms to minimize.
[2024-05-29 20:33:36] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 1 ms to minimize.
[2024-05-29 20:33:37] [INFO ] Deduced a trap composed of 58 places in 185 ms of which 0 ms to minimize.
[2024-05-29 20:33:37] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 0 ms to minimize.
[2024-05-29 20:33:37] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 1 ms to minimize.
[2024-05-29 20:33:37] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 1 ms to minimize.
[2024-05-29 20:33:37] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 1 ms to minimize.
[2024-05-29 20:33:38] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 3 ms to minimize.
[2024-05-29 20:33:38] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 1 ms to minimize.
[2024-05-29 20:33:38] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 1 ms to minimize.
[2024-05-29 20:33:38] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 1 ms to minimize.
[2024-05-29 20:33:38] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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: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: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)
[2024-05-29 20:33:38] [INFO ] [Real]Absence check using 81 positive place invariants in 30 ms returned sat
[2024-05-29 20:33:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 20:33:39] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2024-05-29 20:33:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:33:39] [INFO ] [Nat]Absence check using 81 positive place invariants in 42 ms returned sat
[2024-05-29 20:33:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 20:33:39] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2024-05-29 20:33:40] [INFO ] Deduced a trap composed of 53 places in 233 ms of which 1 ms to minimize.
[2024-05-29 20:33:40] [INFO ] Deduced a trap composed of 29 places in 223 ms of which 1 ms to minimize.
[2024-05-29 20:33:40] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 1 ms to minimize.
[2024-05-29 20:33:40] [INFO ] Deduced a trap composed of 50 places in 226 ms of which 1 ms to minimize.
[2024-05-29 20:33:41] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 0 ms to minimize.
[2024-05-29 20:33:41] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 1 ms to minimize.
[2024-05-29 20:33:41] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 0 ms to minimize.
[2024-05-29 20:33:41] [INFO ] Deduced a trap composed of 57 places in 190 ms of which 1 ms to minimize.
[2024-05-29 20:33:42] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 1 ms to minimize.
[2024-05-29 20:33:42] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 1 ms to minimize.
[2024-05-29 20:33:42] [INFO ] Deduced a trap composed of 26 places in 211 ms of which 1 ms to minimize.
[2024-05-29 20:33:42] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 1 ms to minimize.
[2024-05-29 20:33:43] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 1 ms to minimize.
[2024-05-29 20:33:43] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 3 ms to minimize.
[2024-05-29 20:33:43] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 1 ms to minimize.
[2024-05-29 20:33:43] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 0 ms to minimize.
[2024-05-29 20:33:43] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 1 ms to minimize.
[2024-05-29 20:33:44] [INFO ] Deduced a trap composed of 60 places in 172 ms of which 1 ms to minimize.
[2024-05-29 20:33:44] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 0 ms to minimize.
[2024-05-29 20:33:44] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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: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: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 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions removed 321 transitions
Trivial Post-agglo rules discarded 321 transitions
Performed 321 trivial Post agglomeration. Transition count delta: 321
Iterating post reduction 0 with 321 rules applied. Total rules applied 321 place count 1003 transition count 682
Reduce places removed 321 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 323 rules applied. Total rules applied 644 place count 682 transition count 680
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 645 place count 681 transition count 680
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 645 place count 681 transition count 600
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 805 place count 601 transition count 600
Discarding 139 places :
Symmetric choice reduction at 3 with 139 rule applications. Total rules 944 place count 462 transition count 461
Iterating global reduction 3 with 139 rules applied. Total rules applied 1083 place count 462 transition count 461
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 1083 place count 462 transition count 401
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 1203 place count 402 transition count 401
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 1561 place count 223 transition count 222
Renaming transitions due to excessive name length > 1024 char.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1679 place count 164 transition count 280
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1680 place count 164 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1681 place count 163 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1682 place count 162 transition count 278
Applied a total of 1682 rules in 159 ms. Remains 162 /1003 variables (removed 841) and now considering 278/1003 (removed 725) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 162/1003 places, 278/1003 transitions.
// Phase 1: matrix 278 rows 162 cols
[2024-05-29 20:33:44] [INFO ] Computed 80 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 244 resets, run finished after 4086 ms. (steps per millisecond=244 ) properties (out of 2) seen :2
FORMULA ShieldRVt-PT-020B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 16367 ms.

BK_STOP 1717014829568

--------------------
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
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="ShieldRVt-PT-020B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is ShieldRVt-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 r373-tall-171683789700616"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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