About the Execution of 2022-gold for Sudoku-COL-AN11
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r511-tall-167912735500011.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is Sudoku-COL-AN11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r511-tall-167912735500011
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.1K Feb 26 09:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 09:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 09:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 09:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 09:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 09:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 09:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 09:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 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 Sudoku-COL-AN11-UpperBounds-00
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-01
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-02
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-03
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-04
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-05
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-06
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-07
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-08
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-09
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-10
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-11
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-12
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-13
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-14
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679319487391
Running Version 202205111006
[2023-03-20 13:38:08] [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]
[2023-03-20 13:38:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:38:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-20 13:38:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-20 13:38:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 547 ms
[2023-03-20 13:38:09] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 1694 PT places and 1331.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2023-03-20 13:38:09] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 9 ms.
[2023-03-20 13:38:09] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2023-03-20 13:38:09] [INFO ] Computed 3 place invariants in 6 ms
FORMULA Sudoku-COL-AN11-UpperBounds-15 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-14 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-12 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-10 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-08 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-06 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-04 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-03 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-02 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-01 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 1 rows 4 cols
[2023-03-20 13:38:09] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-20 13:38:09] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 13:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:09] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-20 13:38:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:38:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:38:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:09] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-20 13:38:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 13:38:09] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2023-03-20 13:38:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:09] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-20 13:38:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:38:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 13:38:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:09] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-20 13:38:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-20 13:38:09] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2023-03-20 13:38:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 13:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:09] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-20 13:38:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:38:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:38:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:09] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-20 13:38:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 13:38:09] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-20 13:38:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:09] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-20 13:38:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:38:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:38:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:09] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-20 13:38:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-20 13:38:09] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 1 ms.
[2023-03-20 13:38:09] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-20 13:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:09] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-20 13:38:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:38:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:38:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:09] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-20 13:38:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-20 13:38:09] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 3 ms.
[2023-03-20 13:38:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:09] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-20 13:38:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:38:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:38:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:09] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-20 13:38:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 13:38:09] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [121, 121, 121, 121, 121, 121]
Domain [N(11), N(11)] of place Rows breaks symmetries in sort N
[2023-03-20 13:38:09] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 1331 transitions 5324 arcs in 38 ms.
[2023-03-20 13:38:09] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 2277 ms. (steps per millisecond=4 ) properties (out of 6) seen :660
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 6) seen :18
// Phase 1: matrix 1331 rows 1694 cols
[2023-03-20 13:38:13] [INFO ] Computed 363 place invariants in 40 ms
[2023-03-20 13:38:14] [INFO ] [Real]Absence check using 363 positive place invariants in 314 ms returned sat
[2023-03-20 13:38:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:15] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2023-03-20 13:38:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:38:15] [INFO ] [Nat]Absence check using 363 positive place invariants in 515 ms returned sat
[2023-03-20 13:38:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:16] [INFO ] [Nat]Absence check using state equation in 708 ms returned sat
[2023-03-20 13:38:16] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 66 ms.
[2023-03-20 13:38:16] [INFO ] Added : 0 causal constraints over 0 iterations in 204 ms. Result :sat
Minimization took 269 ms.
[2023-03-20 13:38:17] [INFO ] [Real]Absence check using 363 positive place invariants in 281 ms returned sat
[2023-03-20 13:38:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:18] [INFO ] [Real]Absence check using state equation in 576 ms returned sat
[2023-03-20 13:38:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:38:18] [INFO ] [Nat]Absence check using 363 positive place invariants in 518 ms returned sat
[2023-03-20 13:38:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:19] [INFO ] [Nat]Absence check using state equation in 744 ms returned sat
[2023-03-20 13:38:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 53 ms.
[2023-03-20 13:38:19] [INFO ] Added : 0 causal constraints over 0 iterations in 170 ms. Result :sat
Minimization took 269 ms.
[2023-03-20 13:38:20] [INFO ] [Real]Absence check using 363 positive place invariants in 282 ms returned sat
[2023-03-20 13:38:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:21] [INFO ] [Real]Absence check using state equation in 622 ms returned sat
[2023-03-20 13:38:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:38:22] [INFO ] [Nat]Absence check using 363 positive place invariants in 527 ms returned sat
[2023-03-20 13:38:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:22] [INFO ] [Nat]Absence check using state equation in 774 ms returned sat
[2023-03-20 13:38:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 49 ms.
[2023-03-20 13:38:23] [INFO ] Added : 0 causal constraints over 0 iterations in 163 ms. Result :sat
Minimization took 283 ms.
[2023-03-20 13:38:23] [INFO ] [Real]Absence check using 363 positive place invariants in 286 ms returned sat
[2023-03-20 13:38:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:24] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2023-03-20 13:38:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:38:25] [INFO ] [Nat]Absence check using 363 positive place invariants in 530 ms returned sat
[2023-03-20 13:38:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:26] [INFO ] [Nat]Absence check using state equation in 809 ms returned sat
[2023-03-20 13:38:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 51 ms.
[2023-03-20 13:38:26] [INFO ] Added : 0 causal constraints over 0 iterations in 193 ms. Result :sat
Minimization took 272 ms.
[2023-03-20 13:38:27] [INFO ] [Real]Absence check using 363 positive place invariants in 290 ms returned sat
[2023-03-20 13:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:27] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2023-03-20 13:38:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:38:28] [INFO ] [Nat]Absence check using 363 positive place invariants in 528 ms returned sat
[2023-03-20 13:38:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:29] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2023-03-20 13:38:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 47 ms.
[2023-03-20 13:38:29] [INFO ] Added : 0 causal constraints over 0 iterations in 158 ms. Result :sat
Minimization took 268 ms.
[2023-03-20 13:38:30] [INFO ] [Real]Absence check using 363 positive place invariants in 267 ms returned sat
[2023-03-20 13:38:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:30] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2023-03-20 13:38:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:38:31] [INFO ] [Nat]Absence check using 363 positive place invariants in 519 ms returned sat
[2023-03-20 13:38:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:32] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2023-03-20 13:38:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 47 ms.
[2023-03-20 13:38:32] [INFO ] Added : 0 causal constraints over 0 iterations in 157 ms. Result :sat
Minimization took 270 ms.
Current structural bounds on expressions (after SMT) : [121, 121, 121, 121, 121, 121] Max seen :[110, 110, 110, 110, 110, 110]
FORMULA Sudoku-COL-AN11-UpperBounds-13 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-11 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-09 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-07 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-05 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-00 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 26072 ms.
BK_STOP 1679319514741
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN11"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is Sudoku-COL-AN11, 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 r511-tall-167912735500011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN11.tgz
mv Sudoku-COL-AN11 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 '
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 ;