About the Execution of 2021-gold for Sudoku-PT-AN12
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r269-tall-165303553300109.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is Sudoku-PT-AN12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r269-tall-165303553300109
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 599K Apr 30 12:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.8M Apr 30 12:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 30 12:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.7M Apr 30 12:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 181K May 9 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 599K May 9 09:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 671K May 9 09:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.4M May 9 09:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 85K May 9 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 208K May 9 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 963K May 10 09:34 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-PT-AN12-UpperBounds-00
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-01
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-02
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-03
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-04
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-05
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-06
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-07
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-08
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-09
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-10
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-11
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-12
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-13
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-14
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1653116147961
Running Version 0
[2022-05-21 06:55:49] [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]
[2022-05-21 06:55:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 06:55:49] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2022-05-21 06:55:49] [INFO ] Transformed 2160 places.
[2022-05-21 06:55:49] [INFO ] Transformed 1728 transitions.
[2022-05-21 06:55:49] [INFO ] Parsed PT model containing 2160 places and 1728 transitions in 210 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 68 ms.
// Phase 1: matrix 1728 rows 2160 cols
[2022-05-21 06:55:49] [INFO ] Computed 432 place invariants in 44 ms
FORMULA Sudoku-PT-AN12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-06 144 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-05 144 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-02 144 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-01 144 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-00 144 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1972 ms. (steps per millisecond=5 ) properties (out of 6) seen :390
FORMULA Sudoku-PT-AN12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 3) seen :6
// Phase 1: matrix 1728 rows 2160 cols
[2022-05-21 06:55:53] [INFO ] Computed 432 place invariants in 19 ms
[2022-05-21 06:55:53] [INFO ] [Real]Absence check using 432 positive place invariants in 378 ms returned sat
[2022-05-21 06:55:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:55:54] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2022-05-21 06:55:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:55:55] [INFO ] [Nat]Absence check using 432 positive place invariants in 287 ms returned sat
[2022-05-21 06:55:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:55:55] [INFO ] [Nat]Absence check using state equation in 788 ms returned sat
[2022-05-21 06:55:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 63 ms.
[2022-05-21 06:55:56] [INFO ] Added : 0 causal constraints over 0 iterations in 227 ms. Result :sat
Minimization took 462 ms.
[2022-05-21 06:55:57] [INFO ] [Real]Absence check using 432 positive place invariants in 348 ms returned sat
[2022-05-21 06:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:55:58] [INFO ] [Real]Absence check using state equation in 763 ms returned sat
[2022-05-21 06:55:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:55:58] [INFO ] [Nat]Absence check using 432 positive place invariants in 261 ms returned sat
[2022-05-21 06:55:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:55:59] [INFO ] [Nat]Absence check using state equation in 810 ms returned sat
[2022-05-21 06:55:59] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 53 ms.
[2022-05-21 06:55:59] [INFO ] Added : 0 causal constraints over 0 iterations in 196 ms. Result :sat
Minimization took 462 ms.
[2022-05-21 06:56:00] [INFO ] [Real]Absence check using 432 positive place invariants in 328 ms returned sat
[2022-05-21 06:56:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:56:01] [INFO ] [Real]Absence check using state equation in 773 ms returned sat
[2022-05-21 06:56:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:56:02] [INFO ] [Nat]Absence check using 432 positive place invariants in 259 ms returned sat
[2022-05-21 06:56:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:56:02] [INFO ] [Nat]Absence check using state equation in 865 ms returned sat
[2022-05-21 06:56:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 68 ms.
[2022-05-21 06:56:03] [INFO ] Added : 0 causal constraints over 0 iterations in 223 ms. Result :sat
Minimization took 454 ms.
Current structural bounds on expressions (after SMT) : [1728, 1728, 1728] Max seen :[129, 129, 129]
Incomplete Parikh walk after 14400 steps, including 99 resets, run finished after 1698 ms. (steps per millisecond=8 ) properties (out of 3) seen :432 could not realise parikh vector
Incomplete Parikh walk after 14400 steps, including 99 resets, run finished after 1657 ms. (steps per millisecond=8 ) properties (out of 3) seen :432 could not realise parikh vector
Incomplete Parikh walk after 14400 steps, including 99 resets, run finished after 1627 ms. (steps per millisecond=8 ) properties (out of 3) seen :432 could not realise parikh vector
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 141 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2160/2160 places, 1728/1728 transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2022-05-21 06:56:08] [INFO ] Computed 432 place invariants in 8 ms
Interrupted random walk after 158463 steps, including 1256 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen :{0=133, 1=133, 2=133}
Interrupted Best-First random walk after 144894 steps, including 2 resets, run timeout after 5029 ms. (steps per millisecond=28 ) properties seen :{0=125, 1=125, 2=125}
Interrupted Best-First random walk after 144549 steps, including 2 resets, run timeout after 5034 ms. (steps per millisecond=28 ) properties seen :{0=124, 1=124, 2=124}
Interrupted Best-First random walk after 137944 steps, including 2 resets, run timeout after 5024 ms. (steps per millisecond=27 ) properties seen :{0=124, 1=124, 2=124}
// Phase 1: matrix 1728 rows 2160 cols
[2022-05-21 06:56:54] [INFO ] Computed 432 place invariants in 7 ms
[2022-05-21 06:56:55] [INFO ] [Real]Absence check using 432 positive place invariants in 1469 ms returned unsat
[2022-05-21 06:56:57] [INFO ] [Real]Absence check using 432 positive place invariants in 1459 ms returned unsat
[2022-05-21 06:56:58] [INFO ] [Real]Absence check using 432 positive place invariants in 1464 ms returned unsat
Current structural bounds on expressions (after SMT) : [144, 144, 144] Max seen :[144, 144, 144]
FORMULA Sudoku-PT-AN12-UpperBounds-07 144 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Sudoku-PT-AN12-UpperBounds-04 144 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Sudoku-PT-AN12-UpperBounds-03 144 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
BK_STOP 1653116220243
--------------------
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="Sudoku-PT-AN12"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is Sudoku-PT-AN12, 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 r269-tall-165303553300109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN12.tgz
mv Sudoku-PT-AN12 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 ;