About the Execution of 2023-gold for Sudoku-COL-AN07
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r417-tall-171690556100286.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Sudoku-COL-AN07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556100286
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.0K Apr 12 11:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 12 11:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 11:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 11:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 12 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 11:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 11:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-COL-AN07-UpperBounds-00
FORMULA_NAME Sudoku-COL-AN07-UpperBounds-01
FORMULA_NAME Sudoku-COL-AN07-UpperBounds-02
FORMULA_NAME Sudoku-COL-AN07-UpperBounds-03
FORMULA_NAME Sudoku-COL-AN07-UpperBounds-04
FORMULA_NAME Sudoku-COL-AN07-UpperBounds-05
FORMULA_NAME Sudoku-COL-AN07-UpperBounds-06
FORMULA_NAME Sudoku-COL-AN07-UpperBounds-07
FORMULA_NAME Sudoku-COL-AN07-UpperBounds-08
FORMULA_NAME Sudoku-COL-AN07-UpperBounds-09
FORMULA_NAME Sudoku-COL-AN07-UpperBounds-10
FORMULA_NAME Sudoku-COL-AN07-UpperBounds-11
FORMULA_NAME Sudoku-COL-AN07-UpperBounds-12
FORMULA_NAME Sudoku-COL-AN07-UpperBounds-13
FORMULA_NAME Sudoku-COL-AN07-UpperBounds-14
FORMULA_NAME Sudoku-COL-AN07-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717134651685
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN07
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-31 05:50:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 05:50:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 05:50:53] [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.
[2024-05-31 05:50:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 05:50:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 371 ms
[2024-05-31 05:50:53] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 490 PT places and 343.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2024-05-31 05:50:53] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2024-05-31 05:50:53] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2024-05-31 05:50:53] [INFO ] Computed 3 invariants in 5 ms
FORMULA Sudoku-COL-AN07-UpperBounds-15 49 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-14 49 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-13 49 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-11 49 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-08 49 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-07 49 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-05 49 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-04 49 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-03 49 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-02 49 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-00 49 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-31 05:50:53] [INFO ] Invariant cache hit.
[2024-05-31 05:50:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 05:50:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:53] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-31 05:50:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:50:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 05:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:54] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-31 05:50:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-31 05:50:54] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2024-05-31 05:50:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 05:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:54] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-31 05:50:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:50:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 05:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:54] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-31 05:50:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-31 05:50:54] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-31 05:50:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 05:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:54] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-31 05:50:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:50:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 05:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:54] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-31 05:50:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-31 05:50:54] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2024-05-31 05:50:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 05:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-31 05:50:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:50:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 05:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:54] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-31 05:50:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-31 05:50:54] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Minimization took 1 ms.
[2024-05-31 05:50:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 05:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:54] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-31 05:50:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:50:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 05:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:54] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-31 05:50:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-31 05:50:54] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : [49, 49, 49, 49, 49]
Domain [N(7), N(7)] of place Rows breaks symmetries in sort N
[2024-05-31 05:50:54] [INFO ] Unfolded HLPN to a Petri net with 490 places and 343 transitions 1372 arcs in 21 ms.
[2024-05-31 05:50:54] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 234 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 5) seen :225
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :75
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :70
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :70
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :70
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :75
// Phase 1: matrix 343 rows 490 cols
[2024-05-31 05:50:55] [INFO ] Computed 147 invariants in 17 ms
[2024-05-31 05:50:55] [INFO ] [Real]Absence check using 147 positive place invariants in 49 ms returned sat
[2024-05-31 05:50:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:55] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-31 05:50:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:50:55] [INFO ] [Nat]Absence check using 147 positive place invariants in 66 ms returned sat
[2024-05-31 05:50:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:55] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-31 05:50:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-31 05:50:55] [INFO ] Added : 0 causal constraints over 0 iterations in 51 ms. Result :sat
Minimization took 98 ms.
[2024-05-31 05:50:56] [INFO ] [Real]Absence check using 147 positive place invariants in 45 ms returned sat
[2024-05-31 05:50:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:56] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-31 05:50:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:50:56] [INFO ] [Nat]Absence check using 147 positive place invariants in 57 ms returned sat
[2024-05-31 05:50:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:56] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2024-05-31 05:50:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-31 05:50:56] [INFO ] Added : 0 causal constraints over 0 iterations in 46 ms. Result :sat
Minimization took 40 ms.
[2024-05-31 05:50:56] [INFO ] [Real]Absence check using 147 positive place invariants in 68 ms returned sat
[2024-05-31 05:50:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:56] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-05-31 05:50:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:50:56] [INFO ] [Nat]Absence check using 147 positive place invariants in 57 ms returned sat
[2024-05-31 05:50:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:57] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-31 05:50:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-31 05:50:57] [INFO ] Added : 0 causal constraints over 0 iterations in 52 ms. Result :sat
Minimization took 36 ms.
[2024-05-31 05:50:57] [INFO ] [Real]Absence check using 147 positive place invariants in 46 ms returned sat
[2024-05-31 05:50:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:57] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-05-31 05:50:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:50:57] [INFO ] [Nat]Absence check using 147 positive place invariants in 62 ms returned sat
[2024-05-31 05:50:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:57] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-31 05:50:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-31 05:50:57] [INFO ] Added : 0 causal constraints over 0 iterations in 52 ms. Result :sat
Minimization took 40 ms.
[2024-05-31 05:50:57] [INFO ] [Real]Absence check using 147 positive place invariants in 45 ms returned sat
[2024-05-31 05:50:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:58] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2024-05-31 05:50:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:50:58] [INFO ] [Nat]Absence check using 147 positive place invariants in 59 ms returned sat
[2024-05-31 05:50:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:50:58] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-31 05:50:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-31 05:50:58] [INFO ] Added : 0 causal constraints over 0 iterations in 48 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [49, 49, 49, 49, 49] Max seen :[45, 45, 45, 45, 45]
FORMULA Sudoku-COL-AN07-UpperBounds-12 49 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN07-UpperBounds-10 49 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN07-UpperBounds-09 49 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN07-UpperBounds-06 49 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN07-UpperBounds-01 49 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 5294 ms.
BK_STOP 1717134666667
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Sudoku-COL-AN07, 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 r417-tall-171690556100286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN07.tgz
mv Sudoku-COL-AN07 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 ;