Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r216-tall-162098205100467.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 ShieldIIPt-PT-040A, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205100467
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 12:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 12:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 18:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 212K May 5 16:52 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 ShieldIIPt-PT-040A-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-040A-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-040A-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-040A-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-040A-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-040A-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-040A-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-040A-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-040A-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-040A-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-040A-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-040A-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-040A-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-040A-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-040A-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-040A-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621108279534

Running Version 0
[2021-05-15 19:51:21] [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]
[2021-05-15 19:51:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 19:51:21] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2021-05-15 19:51:21] [INFO ] Transformed 763 places.
[2021-05-15 19:51:21] [INFO ] Transformed 563 transitions.
[2021-05-15 19:51:21] [INFO ] Found NUPN structural information;
[2021-05-15 19:51:21] [INFO ] Parsed PT model containing 763 places and 563 transitions in 140 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 562 rows 763 cols
[2021-05-15 19:51:21] [INFO ] Computed 361 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 16) seen :8
FORMULA ShieldIIPt-PT-040A-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040A-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040A-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040A-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040A-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040A-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040A-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040A-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
// Phase 1: matrix 562 rows 763 cols
[2021-05-15 19:51:21] [INFO ] Computed 361 place invariants in 9 ms
[2021-05-15 19:51:22] [INFO ] [Real]Absence check using 361 positive place invariants in 65 ms returned sat
[2021-05-15 19:51:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:51:22] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2021-05-15 19:51:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:51:22] [INFO ] [Nat]Absence check using 361 positive place invariants in 63 ms returned sat
[2021-05-15 19:51:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:51:22] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2021-05-15 19:51:23] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 37 ms.
[2021-05-15 19:51:27] [INFO ] Deduced a trap composed of 3 places in 398 ms of which 39 ms to minimize.
[2021-05-15 19:51:28] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-15 19:51:28] [INFO ] [Real]Absence check using 361 positive place invariants in 65 ms returned sat
[2021-05-15 19:51:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:51:28] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2021-05-15 19:51:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:51:28] [INFO ] [Nat]Absence check using 361 positive place invariants in 57 ms returned sat
[2021-05-15 19:51:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:51:28] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2021-05-15 19:51:28] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 38 ms.
[2021-05-15 19:51:33] [INFO ] Added : 455 causal constraints over 91 iterations in 4557 ms. Result :unknown
[2021-05-15 19:51:33] [INFO ] [Real]Absence check using 361 positive place invariants in 57 ms returned sat
[2021-05-15 19:51:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:51:33] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2021-05-15 19:51:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:51:34] [INFO ] [Nat]Absence check using 361 positive place invariants in 58 ms returned sat
[2021-05-15 19:51:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:51:34] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2021-05-15 19:51:34] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 38 ms.
[2021-05-15 19:51:38] [INFO ] Added : 450 causal constraints over 90 iterations in 4585 ms. Result :unknown
[2021-05-15 19:51:39] [INFO ] [Real]Absence check using 361 positive place invariants in 53 ms returned sat
[2021-05-15 19:51:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:51:39] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2021-05-15 19:51:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:51:39] [INFO ] [Nat]Absence check using 361 positive place invariants in 54 ms returned sat
[2021-05-15 19:51:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:51:39] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2021-05-15 19:51:39] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 34 ms.
[2021-05-15 19:51:44] [INFO ] Added : 455 causal constraints over 91 iterations in 4655 ms. Result :unknown
[2021-05-15 19:51:44] [INFO ] [Real]Absence check using 361 positive place invariants in 53 ms returned sat
[2021-05-15 19:51:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:51:44] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2021-05-15 19:51:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:51:44] [INFO ] [Nat]Absence check using 361 positive place invariants in 54 ms returned sat
[2021-05-15 19:51:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:51:45] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2021-05-15 19:51:45] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 48 ms.
[2021-05-15 19:51:49] [INFO ] Added : 435 causal constraints over 87 iterations in 4584 ms. Result :unknown
[2021-05-15 19:51:49] [INFO ] [Real]Absence check using 361 positive place invariants in 57 ms returned sat
[2021-05-15 19:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:51:50] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2021-05-15 19:51:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:51:50] [INFO ] [Nat]Absence check using 361 positive place invariants in 58 ms returned sat
[2021-05-15 19:51:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:51:50] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2021-05-15 19:51:50] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 34 ms.
[2021-05-15 19:51:55] [INFO ] Added : 464 causal constraints over 93 iterations in 4613 ms. Result :unknown
[2021-05-15 19:51:55] [INFO ] [Real]Absence check using 361 positive place invariants in 117 ms returned sat
[2021-05-15 19:51:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:51:55] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2021-05-15 19:51:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:51:55] [INFO ] [Nat]Absence check using 361 positive place invariants in 53 ms returned sat
[2021-05-15 19:51:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:51:55] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2021-05-15 19:51:55] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 33 ms.
[2021-05-15 19:52:00] [INFO ] Added : 410 causal constraints over 82 iterations in 4643 ms. Result :unknown
[2021-05-15 19:52:00] [INFO ] [Real]Absence check using 361 positive place invariants in 53 ms returned sat
[2021-05-15 19:52:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:52:00] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2021-05-15 19:52:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:52:01] [INFO ] [Nat]Absence check using 361 positive place invariants in 57 ms returned sat
[2021-05-15 19:52:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:52:01] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2021-05-15 19:52:01] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 28 ms.
[2021-05-15 19:52:05] [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 7
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 73400 steps, including 1000 resets, run finished after 564 ms. (steps per millisecond=130 ) properties (out of 8) seen :7 could not realise parikh vector
FORMULA ShieldIIPt-PT-040A-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040A-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040A-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040A-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040A-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040A-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040A-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 71900 steps, including 248 resets, run finished after 499 ms. (steps per millisecond=144 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 77600 steps, including 578 resets, run finished after 565 ms. (steps per millisecond=137 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 107800 steps, including 375 resets, run finished after 761 ms. (steps per millisecond=141 ) properties (out of 1) seen :1 could not realise parikh vector
FORMULA ShieldIIPt-PT-040A-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621108329405

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ShieldIIPt-PT-040A"
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 ShieldIIPt-PT-040A, 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 r216-tall-162098205100467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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