About the Execution of 2024-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/mcc2025-input.r237-smll-174903502700047.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
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 r237-smll-174903502700047
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_pt
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 5 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 6.5K May 29 14:33 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
echo here is the order used to build the result vector(from xml 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 1749108232360
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-05 07:23:54] [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]
[2025-06-05 07:23:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:23:54] [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.
[2025-06-05 07:23:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-05 07:23:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 826 ms
[2025-06-05 07:23:55] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 490 PT places and 343.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Reduction of identical properties reduced properties to check from 16 to 4
[2025-06-05 07:23:55] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 28 ms.
[2025-06-05 07:23:55] [INFO ] Skeletonized 4 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2025-06-05 07:23:55] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[49, 0, 49, 49] Max Struct:[49, 49, 49, 49]
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-10 49 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-15 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-11 49 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-12 49 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-00 49 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-05 07:23:55] [INFO ] Invariant cache hit.
[2025-06-05 07:23:55] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 07:23:55] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-05 07:23:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 07:23:55] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0] Max Struct:[49]
Domain [N(7), N(7)] of place Rows breaks symmetries in sort N
[2025-06-05 07:23:55] [INFO ] Unfolded HLPN to a Petri net with 490 places and 343 transitions 1372 arcs in 40 ms.
[2025-06-05 07:23:55] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[49]
// Phase 1: matrix 343 rows 490 cols
[2025-06-05 07:23:55] [INFO ] Computed 147 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 10000 steps (234 resets) in 464 ms. (21 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 110 ms. (90 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[45] Max Struct:[49]
[2025-06-05 07:23:56] [INFO ] Invariant cache hit.
[2025-06-05 07:23:56] [INFO ] [Real]Absence check using 147 positive place invariants in 75 ms returned sat
[2025-06-05 07:23:56] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2025-06-05 07:23:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 36 ms.
[2025-06-05 07:23:57] [INFO ] Added : 0 causal constraints over 0 iterations in 103 ms. Result :sat
Minimization took 697 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[45] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[45] Max Struct:[49]
Support contains 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 58 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 490/490 places, 343/343 transitions.
[2025-06-05 07:23:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[45] Max Struct:[49]
RANDOM walk for 1000000 steps (23478 resets) in 28094 ms. (35 steps per ms)
BEST_FIRST walk for 468800 steps (100 resets) in 5001 ms. (93 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[47] Max Struct:[49]
[2025-06-05 07:24:31] [INFO ] Invariant cache hit.
[2025-06-05 07:24:31] [INFO ] [Real]Absence check using 147 positive place invariants in 90 ms returned sat
[2025-06-05 07:24:31] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2025-06-05 07:24:31] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 27 ms.
[2025-06-05 07:24:31] [INFO ] Added : 0 causal constraints over 0 iterations in 73 ms. Result :sat
Minimization took 1770 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[47] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[49] Max Struct:[49]
Support contains 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 18 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 490/490 places, 343/343 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 16 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2025-06-05 07:24:33] [INFO ] Invariant cache hit.
[2025-06-05 07:24:34] [INFO ] Implicit Places using invariants in 440 ms returned []
[2025-06-05 07:24:34] [INFO ] Invariant cache hit.
[2025-06-05 07:24:34] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
[2025-06-05 07:24:34] [INFO ] Redundant transitions in 23 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1154 ms. Remains : 490/490 places, 343/343 transitions.
[2025-06-05 07:24:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[49] Max Struct:[49]
FORMULA Sudoku-COL-AN07-UpperBounds-02 49 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-03 49 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-05 49 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-06 49 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-09 49 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-13 49 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-14 49 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-UpperBounds-01 49 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (23477 resets) in 19658 ms. (50 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-05 07:24:54] [INFO ] Flatten gal took : 110 ms
[2025-06-05 07:24:54] [INFO ] Flatten gal took : 68 ms
[2025-06-05 07:24:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17703043803874340663.gal : 30 ms
[2025-06-05 07:24:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17230113800556465607.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17703043803874340663.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17230113800556465607.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 60648 ms.
BK_STOP 1749108294940
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="gold2024"
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-5832"
echo " Executing tool gold2024"
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 r237-smll-174903502700047"
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.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 ;