About the Execution of 2024-gold for Sudoku-COL-AN09
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-174903502700049.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-AN09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r237-smll-174903502700049
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K 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 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K 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-AN09-UpperBounds-00
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-01
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-02
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-03
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-04
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-05
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-06
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-07
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-08
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-09
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-10
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-11
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-12
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-13
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-14
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749108440108
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-AN09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-05 07:27:21] [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:27:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:27:22] [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:27:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-05 07:27:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 753 ms
[2025-06-05 07:27:22] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 972 PT places and 729.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Reduction of identical properties reduced properties to check from 16 to 4
[2025-06-05 07:27:22] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2025-06-05 07:27:22] [INFO ] Skeletonized 4 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2025-06-05 07:27:22] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[81, 81, 0, 81] Max Struct:[81, 81, 81, 81]
FORMULA Sudoku-COL-AN09-UpperBounds-13 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-11 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-14 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-15 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-01 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-06 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-07 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-08 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-12 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-00 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-05 07:27:22] [INFO ] Invariant cache hit.
[2025-06-05 07:27:23] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 07:27:23] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-05 07:27:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-05 07:27:23] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0] Max Struct:[81]
Domain [N(9), N(9)] of place Rows breaks symmetries in sort N
[2025-06-05 07:27:23] [INFO ] Unfolded HLPN to a Petri net with 972 places and 729 transitions 2916 arcs in 51 ms.
[2025-06-05 07:27:23] [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:[81]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[81]
// Phase 1: matrix 729 rows 972 cols
[2025-06-05 07:27:23] [INFO ] Computed 243 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[81]
RANDOM walk for 10000 steps (142 resets) in 729 ms. (13 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 198 ms. (50 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[73] Max Struct:[81]
[2025-06-05 07:27:24] [INFO ] Invariant cache hit.
[2025-06-05 07:27:24] [INFO ] [Real]Absence check using 243 positive place invariants in 173 ms returned sat
[2025-06-05 07:27:25] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2025-06-05 07:27:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 90 ms.
[2025-06-05 07:27:25] [INFO ] Added : 0 causal constraints over 0 iterations in 238 ms. Result :sat
Minimization took 596 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[73] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[73] Max Struct:[81]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 91 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 972/972 places, 729/729 transitions.
[2025-06-05 07:27:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[73] Max Struct:[81]
RANDOM walk for 493649 steps (7008 resets) in 30001 ms. (16 steps per ms)
BEST_FIRST walk for 234642 steps (14 resets) in 5004 ms. (46 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[77] Max Struct:[81]
[2025-06-05 07:28:01] [INFO ] Invariant cache hit.
[2025-06-05 07:28:02] [INFO ] [Real]Absence check using 243 positive place invariants in 287 ms returned sat
[2025-06-05 07:28:03] [INFO ] [Real]Absence check using state equation in 1464 ms returned sat
[2025-06-05 07:28:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 50 ms.
[2025-06-05 07:28:03] [INFO ] Added : 0 causal constraints over 0 iterations in 137 ms. Result :sat
Minimization took 6218 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[77] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[77] Max Struct:[81]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 28 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 35 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2025-06-05 07:28:10] [INFO ] Invariant cache hit.
[2025-06-05 07:28:10] [INFO ] Implicit Places using invariants in 686 ms returned []
[2025-06-05 07:28:10] [INFO ] Invariant cache hit.
[2025-06-05 07:28:12] [INFO ] Implicit Places using invariants and state equation in 1884 ms returned []
Implicit Place search using SMT with State Equation took 2574 ms to find 0 implicit places.
[2025-06-05 07:28:12] [INFO ] Redundant transitions in 52 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 2680 ms. Remains : 972/972 places, 729/729 transitions.
[2025-06-05 07:28:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[77] Max Struct:[81]
RANDOM walk for 491445 steps (6975 resets) in 30001 ms. (16 steps per ms)
BEST_FIRST walk for 243378 steps (15 resets) in 5007 ms. (48 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[77] Max Struct:[81]
[2025-06-05 07:28:47] [INFO ] Invariant cache hit.
[2025-06-05 07:28:48] [INFO ] [Real]Absence check using 243 positive place invariants in 295 ms returned sat
[2025-06-05 07:28:49] [INFO ] [Real]Absence check using state equation in 1180 ms returned sat
[2025-06-05 07:28:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 44 ms.
[2025-06-05 07:28:49] [INFO ] Added : 0 causal constraints over 0 iterations in 132 ms. Result :sat
Minimization took 6498 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[77] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[77] Max Struct:[81]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 21 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 20 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2025-06-05 07:28:56] [INFO ] Invariant cache hit.
[2025-06-05 07:28:57] [INFO ] Implicit Places using invariants in 899 ms returned []
[2025-06-05 07:28:57] [INFO ] Invariant cache hit.
[2025-06-05 07:28:58] [INFO ] Implicit Places using invariants and state equation in 1736 ms returned []
Implicit Place search using SMT with State Equation took 2651 ms to find 0 implicit places.
[2025-06-05 07:28:58] [INFO ] Redundant transitions in 11 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2692 ms. Remains : 972/972 places, 729/729 transitions.
[2025-06-05 07:28:59] [INFO ] Flatten gal took : 550 ms
[2025-06-05 07:28:59] [INFO ] Flatten gal took : 177 ms
[2025-06-05 07:29:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11248411580855754012.gal : 111 ms
[2025-06-05 07:29:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14095729276629788179.prop : 8 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/ReachabilityCardinality11248411580855754012.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14095729276629788179.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14095729276629788179.prop.
RANDOM walk for 40000 steps (567 resets) in 7404 ms. (5 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1665 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1916 ms. (20 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 73
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :73 after 3916
Interrupted probabilistic random walk after 414131 steps, run timeout after 9001 ms. (steps per millisecond=46 ) properties seen :0 out of 2
Probabilistic random walk after 414131 steps, saw 98976 distinct states, run finished after 9007 ms. (steps per millisecond=45 ) properties seen :0
[2025-06-05 07:29:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 243/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1701 variables, 972/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1701 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/1701 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1701/1701 variables, and 1215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3329 ms.
Refiners :[Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 243/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1701 variables, 972/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1701/1701 variables, and 1217 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 9164ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 32 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 972/972 places, 729/729 transitions.
RANDOM walk for 40000 steps (566 resets) in 5399 ms. (7 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1131 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1139 ms. (35 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 244745 steps, run timeout after 6001 ms. (steps per millisecond=40 ) properties seen :0 out of 2
Probabilistic random walk after 244745 steps, saw 72379 distinct states, run finished after 6001 ms. (steps per millisecond=40 ) properties seen :0
[2025-06-05 07:29:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 243/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1701 variables, 972/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1701 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/1701 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1701/1701 variables, and 1215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2018 ms.
Refiners :[Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 243/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1701 variables, 972/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
Detected timeout of ITS tools.
[2025-06-05 07:29:50] [INFO ] Flatten gal took : 96 ms
[2025-06-05 07:29:50] [INFO ] Applying decomposition
[2025-06-05 07:29:50] [INFO ] Flatten gal took : 75 ms
After SMT solving in domain Int declared 1701/1701 variables, and 1217 constraints, problems are : Problem set: 0 solved, 2 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 22424ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 25 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2025-06-05 07:29:50] [INFO ] Invariant cache hit.
[2025-06-05 07:29:51] [INFO ] Implicit Places using invariants in 644 ms returned []
[2025-06-05 07:29:51] [INFO ] Invariant cache hit.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5576323378249391142.txt' '-o' '/tmp/graph5576323378249391142.bin' '-w' '/tmp/graph5576323378249391142.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5576323378249391142.bin' '-l' '-1' '-v' '-w' '/tmp/graph5576323378249391142.weights' '-q' '0' '-e' '0.001'
[2025-06-05 07:29:52] [INFO ] Decomposing Gal with order
[2025-06-05 07:29:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 07:29:53] [INFO ] Implicit Places using invariants and state equation in 1626 ms returned []
Implicit Place search using SMT with State Equation took 2272 ms to find 0 implicit places.
[2025-06-05 07:29:53] [INFO ] Redundant transitions in 6 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2327 ms. Remains : 972/972 places, 729/729 transitions.
[2025-06-05 07:29:53] [INFO ] Removed a total of 1422 redundant transitions.
[2025-06-05 07:29:53] [INFO ] Flatten gal took : 832 ms
[2025-06-05 07:29:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 33 ms.
[2025-06-05 07:29:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11403287711615659444.gal : 21 ms
[2025-06-05 07:29:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12749902579591941051.prop : 2 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/ReachabilityCardinality11403287711615659444.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12749902579591941051.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
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:[77] Max Struct:[81]
Starting property specific reduction for Sudoku-COL-AN09-UpperBounds-02
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:[81]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[81]
[2025-06-05 07:29:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[81]
RANDOM walk for 10000 steps (142 resets) in 701 ms. (14 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 350 ms. (28 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[74] Max Struct:[81]
[2025-06-05 07:29:54] [INFO ] Invariant cache hit.
[2025-06-05 07:29:55] [INFO ] [Real]Absence check using 243 positive place invariants in 303 ms returned sat
[2025-06-05 07:29:56] [INFO ] [Real]Absence check using state equation in 1071 ms returned sat
[2025-06-05 07:29:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 76 ms.
[2025-06-05 07:29:56] [INFO ] Added : 0 causal constraints over 0 iterations in 223 ms. Result :sat
Minimization took 534 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[74] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[74] Max Struct:[81]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 23 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 972/972 places, 729/729 transitions.
[2025-06-05 07:29:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[74] Max Struct:[81]
RANDOM walk for 491193 steps (6967 resets) in 30001 ms. (16 steps per ms)
BEST_FIRST walk for 218989 steps (13 resets) in 5001 ms. (43 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[76] Max Struct:[81]
[2025-06-05 07:30:32] [INFO ] Invariant cache hit.
[2025-06-05 07:30:33] [INFO ] [Real]Absence check using 243 positive place invariants in 501 ms returned sat
[2025-06-05 07:30:34] [INFO ] [Real]Absence check using state equation in 965 ms returned sat
[2025-06-05 07:30:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:30:34] [INFO ] [Nat]Absence check using 243 positive place invariants in 357 ms returned sat
[2025-06-05 07:30:35] [INFO ] [Nat]Absence check using state equation in 980 ms returned sat
[2025-06-05 07:30:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 44 ms.
[2025-06-05 07:30:35] [INFO ] Added : 0 causal constraints over 0 iterations in 125 ms. Result :sat
Minimization took 2745 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[76] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[81] Max Struct:[81]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 22 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 22 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2025-06-05 07:30:39] [INFO ] Invariant cache hit.
[2025-06-05 07:30:40] [INFO ] Implicit Places using invariants in 1114 ms returned []
[2025-06-05 07:30:40] [INFO ] Invariant cache hit.
[2025-06-05 07:30:42] [INFO ] Implicit Places using invariants and state equation in 2204 ms returned []
Implicit Place search using SMT with State Equation took 3323 ms to find 0 implicit places.
[2025-06-05 07:30:42] [INFO ] Redundant transitions in 8 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3363 ms. Remains : 972/972 places, 729/729 transitions.
[2025-06-05 07:30:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[81] Max Struct:[81]
FORMULA Sudoku-COL-AN09-UpperBounds-03 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-04 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-05 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-09 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-10 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-02 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 693592 steps (9841 resets) in 30001 ms. (23 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:31:12] [INFO ] Flatten gal took : 65 ms
[2025-06-05 07:31:12] [INFO ] Flatten gal took : 71 ms
[2025-06-05 07:31:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8302314451568070624.gal : 26 ms
[2025-06-05 07:31:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16932627357939367355.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/ReachabilityCardinality8302314451568070624.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16932627357939367355.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Sudoku-COL-AN09-UpperBounds-02 in 78844 ms.
[2025-06-05 07:31:12] [INFO ] Flatten gal took : 47 ms
Total runtime 230830 ms.
BK_STOP 1749108672734
--------------------
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-AN09"
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-AN09, 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-174903502700049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN09.tgz
mv Sudoku-COL-AN09 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 ;