About the Execution of 2021-gold for Sudoku-COL-BN09
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-165303553300070.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-COL-BN09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r269-tall-165303553300070
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 8.5K Apr 30 11:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 30 11:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 30 11:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 30 11:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 146K 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-COL-BN09-UpperBounds-00
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-01
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-02
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-03
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-04
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-05
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-06
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-07
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-08
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-09
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-10
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-11
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-12
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-13
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-14
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1653115974042
Running Version 0
[2022-05-21 06:52:55] [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:52:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 06:52:55] [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.
[2022-05-21 06:52:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-21 06:52:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 580 ms
[2022-05-21 06:52:56] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 1053 PT places and 6561.0 transition bindings in 33 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-21 06:52:56] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions in 3 ms.
[2022-05-21 06:52:56] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_5274368957118794381.dot
// Phase 1: matrix 1 rows 5 cols
[2022-05-21 06:52:56] [INFO ] Computed 4 place invariants in 4 ms
FORMULA Sudoku-COL-BN09-UpperBounds-15 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-14 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-13 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-12 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-11 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-08 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-06 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-05 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-04 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-03 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-02 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-01 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-00 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-21 06:52:56] [INFO ] Unfolded HLPN to a Petri net with 1053 places and 729 transitions in 30 ms.
[2022-05-21 06:52:56] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 5 cols
[2022-05-21 06:52:56] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-21 06:52:56] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-21 06:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:56] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-21 06:52:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:52:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-21 06:52:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:56] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-21 06:52:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-21 06:52:56] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2022-05-21 06:52:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-21 06:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:56] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-21 06:52:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:52:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-21 06:52:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:56] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-21 06:52:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-21 06:52:56] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2022-05-21 06:52:56] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-21 06:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:56] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 06:52:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:52:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-21 06:52:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:56] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-21 06:52:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 06:52:56] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [81, 81, 81]
[2022-05-21 06:52:56] [INFO ] Unfolded HLPN to a Petri net with 1053 places and 729 transitions in 10 ms.
[2022-05-21 06:52:56] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_17482244761235868180.dot
Incomplete random walk after 10000 steps, including 151 resets, run finished after 951 ms. (steps per millisecond=10 ) properties (out of 3) seen :213
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 3) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 3) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 3) seen :15
// Phase 1: matrix 729 rows 1053 cols
[2022-05-21 06:52:58] [INFO ] Computed 324 place invariants in 22 ms
[2022-05-21 06:52:58] [INFO ] [Real]Absence check using 324 positive place invariants in 101 ms returned sat
[2022-05-21 06:52:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:58] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2022-05-21 06:52:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:52:59] [INFO ] [Nat]Absence check using 324 positive place invariants in 101 ms returned sat
[2022-05-21 06:52:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:59] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2022-05-21 06:52:59] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 31 ms.
[2022-05-21 06:52:59] [INFO ] Added : 0 causal constraints over 0 iterations in 113 ms. Result :sat
Minimization took 100 ms.
[2022-05-21 06:52:59] [INFO ] [Real]Absence check using 324 positive place invariants in 101 ms returned sat
[2022-05-21 06:52:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:53:00] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2022-05-21 06:53:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:53:00] [INFO ] [Nat]Absence check using 324 positive place invariants in 102 ms returned sat
[2022-05-21 06:53:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:53:00] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2022-05-21 06:53:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 31 ms.
[2022-05-21 06:53:01] [INFO ] Added : 0 causal constraints over 0 iterations in 103 ms. Result :sat
Minimization took 92 ms.
[2022-05-21 06:53:01] [INFO ] [Real]Absence check using 324 positive place invariants in 90 ms returned sat
[2022-05-21 06:53:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:53:01] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2022-05-21 06:53:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:53:01] [INFO ] [Nat]Absence check using 324 positive place invariants in 102 ms returned sat
[2022-05-21 06:53:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:53:02] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2022-05-21 06:53:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 35 ms.
[2022-05-21 06:53:02] [INFO ] Added : 0 causal constraints over 0 iterations in 109 ms. Result :sat
Minimization took 105 ms.
Current structural bounds on expressions (after SMT) : [81, 81, 81] Max seen :[71, 71, 71]
Incomplete Parikh walk after 8100 steps, including 98 resets, run finished after 449 ms. (steps per millisecond=18 ) properties (out of 3) seen :243 could not realise parikh vector
FORMULA Sudoku-COL-BN09-UpperBounds-10 81 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-BN09-UpperBounds-09 81 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-BN09-UpperBounds-07 81 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
BK_STOP 1653115983927
--------------------
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-COL-BN09"
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-COL-BN09, 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-165303553300070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-BN09.tgz
mv Sudoku-COL-BN09 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 ;