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-162098204600147.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 SharedMemory-PT-000100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098204600147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 151M
-rw-r--r-- 1 mcc users 11M May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 40M May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 41M 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 1.3M Mar 28 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 3.5M Mar 28 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6M Mar 28 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 11M Mar 28 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.3M Mar 27 11:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.1M Mar 27 11:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4M Mar 25 15:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.8M Mar 25 15:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 611K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 1.2M Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 16M 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 SharedMemory-PT-000100-UpperBounds-00
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-01
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-02
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-03
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-04
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-05
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-06
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-07
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-08
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-09
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-10
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-11
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-12
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-13
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-14
FORMULA_NAME SharedMemory-PT-000100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621046231870

Running Version 0
[2021-05-15 02:37:13] [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 02:37:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 02:37:14] [INFO ] Load time of PNML (sax parser for PT used): 642 ms
[2021-05-15 02:37:14] [INFO ] Transformed 10301 places.
[2021-05-15 02:37:14] [INFO ] Transformed 20100 transitions.
[2021-05-15 02:37:14] [INFO ] Found NUPN structural information;
[2021-05-15 02:37:14] [INFO ] Parsed PT model containing 10301 places and 20100 transitions in 764 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 1369 ms.
FORMULA SharedMemory-PT-000100-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000100-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000100-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 20100 rows 10301 cols
[2021-05-15 02:37:18] [INFO ] Computed 201 place invariants in 3062 ms
Interrupted random walk after 6157 steps, including 1 resets, run timeout after 30013 ms. (steps per millisecond=0 ) properties seen :{0=1, 1=32, 2=99, 3=32, 4=1, 5=1, 6=1}
FORMULA SharedMemory-PT-000100-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1734 ms. (steps per millisecond=5 ) properties (out of 12) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1650 ms. (steps per millisecond=6 ) properties (out of 12) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1645 ms. (steps per millisecond=6 ) properties (out of 12) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :37
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :27
// Phase 1: matrix 20100 rows 10301 cols
[2021-05-15 02:37:57] [INFO ] Computed 201 place invariants in 2952 ms
[2021-05-15 02:37:59] [INFO ] [Real]Absence check using 201 positive place invariants in 488 ms returned unsat
[2021-05-15 02:38:02] [INFO ] [Real]Absence check using 201 positive place invariants in 629 ms returned sat
[2021-05-15 02:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 02:38:04] [INFO ] [Real]Absence check using state equation in 2746 ms returned unknown
[2021-05-15 02:38:07] [INFO ] [Real]Absence check using 201 positive place invariants in 667 ms returned sat
[2021-05-15 02:38:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 02:38:09] [INFO ] [Real]Absence check using state equation in 2704 ms returned unknown
[2021-05-15 02:38:12] [INFO ] [Real]Absence check using 201 positive place invariants in 626 ms returned sat
[2021-05-15 02:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 02:38:14] [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 3
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.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
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 02:38:16] [INFO ] [Real]Absence check using 201 positive place invariants in 473 ms returned unsat
[2021-05-15 02:38:19] [INFO ] [Real]Absence check using 201 positive place invariants in 474 ms returned unsat
[2021-05-15 02:38:21] [INFO ] [Real]Absence check using 201 positive place invariants in 715 ms returned sat
[2021-05-15 02:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 02:38:24] [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 6
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.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
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 02:38:26] [INFO ] [Real]Absence check using 201 positive place invariants in 708 ms returned sat
[2021-05-15 02:38:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 02:38:29] [INFO ] [Real]Absence check using state equation in 2642 ms returned unknown
[2021-05-15 02:38:31] [INFO ] [Real]Absence check using 201 positive place invariants in 697 ms returned sat
[2021-05-15 02:38:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 02:38:34] [INFO ] [Real]Absence check using state equation in 2672 ms returned unknown
[2021-05-15 02:38:36] [INFO ] [Real]Absence check using 201 positive place invariants in 729 ms returned sat
[2021-05-15 02:38:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 02:38:39] [INFO ] [Real]Absence check using state equation in 2652 ms returned unknown
[2021-05-15 02:38:41] [INFO ] [Real]Absence check using 201 positive place invariants in 699 ms returned sat
[2021-05-15 02:38:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 02:38:44] [INFO ] [Real]Absence check using state equation in 2661 ms returned unknown
[2021-05-15 02:38:46] [INFO ] [Real]Absence check using 201 positive place invariants in 718 ms returned sat
[2021-05-15 02:38:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 02:38:49] [INFO ] [Real]Absence check using state equation in 2658 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[1, 32, 99, 32, 1, 1, 0, 0, 0, 0, 0, 0]
FORMULA SharedMemory-PT-000100-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SharedMemory-PT-000100-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SharedMemory-PT-000100-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 206 out of 10301 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Performed 9894 Post agglomeration using F-continuation condition.Transition count delta: 9894
Iterating post reduction 0 with 9894 rules applied. Total rules applied 9894 place count 10301 transition count 10206
Reduce places removed 9988 places and 0 transitions.
Ensure Unique test removed 9206 transitions
Reduce isomorphic transitions removed 9206 transitions.
Iterating post reduction 1 with 19194 rules applied. Total rules applied 29088 place count 313 transition count 1000
Drop transitions removed 588 transitions
Redundant transition composition rules discarded 588 transitions
Iterating global reduction 2 with 588 rules applied. Total rules applied 29676 place count 313 transition count 412
Applied a total of 29676 rules in 2663 ms. Remains 313 /10301 variables (removed 9988) and now considering 412/20100 (removed 19688) transitions.
Finished structural reductions, in 1 iterations. Remains : 313/10301 places, 412/20100 transitions.
// Phase 1: matrix 412 rows 313 cols
[2021-05-15 02:38:51] [INFO ] Computed 107 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 18861 ms. (steps per millisecond=53 ) properties (out of 9) seen :215
FORMULA SharedMemory-PT-000100-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-PT-000100-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-PT-000100-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-PT-000100-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-PT-000100-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-PT-000100-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3424 ms. (steps per millisecond=292 ) properties (out of 3) seen :200
FORMULA SharedMemory-PT-000100-UpperBounds-05 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SharedMemory-PT-000100-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 412 rows 313 cols
[2021-05-15 02:39:14] [INFO ] Computed 107 place invariants in 12 ms
[2021-05-15 02:39:14] [INFO ] [Real]Absence check using 107 positive place invariants in 15 ms returned sat
[2021-05-15 02:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 02:39:14] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2021-05-15 02:39:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 02:39:14] [INFO ] [Nat]Absence check using 107 positive place invariants in 16 ms returned sat
[2021-05-15 02:39:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 02:39:14] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2021-05-15 02:39:14] [INFO ] Computed and/alt/rep : 212/212/212 causal constraints (skipped 0 transitions) in 28 ms.
[2021-05-15 02:39:14] [INFO ] Added : 0 causal constraints over 0 iterations in 62 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [100] Max seen :[99]
Incomplete Parikh walk after 10000 steps, including 97 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :100 could not realise parikh vector
FORMULA SharedMemory-PT-000100-UpperBounds-04 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621046356559

--------------------
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="SharedMemory-PT-000100"
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 SharedMemory-PT-000100, 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-162098204600147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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