fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r237-smll-174903502700050
Last Updated
June 24, 2025

About the Execution of 2024-gold for Sudoku-COL-AN10

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15695.420 2633457.00 2872676.00 8729.30 100 100 100 100 ? 100 100 100 100 100 100 100 100 ? ? 100 normal

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-174903502700050.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-AN10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r237-smll-174903502700050
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K 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-AN10-UpperBounds-00
FORMULA_NAME Sudoku-COL-AN10-UpperBounds-01
FORMULA_NAME Sudoku-COL-AN10-UpperBounds-02
FORMULA_NAME Sudoku-COL-AN10-UpperBounds-03
FORMULA_NAME Sudoku-COL-AN10-UpperBounds-04
FORMULA_NAME Sudoku-COL-AN10-UpperBounds-05
FORMULA_NAME Sudoku-COL-AN10-UpperBounds-06
FORMULA_NAME Sudoku-COL-AN10-UpperBounds-07
FORMULA_NAME Sudoku-COL-AN10-UpperBounds-08
FORMULA_NAME Sudoku-COL-AN10-UpperBounds-09
FORMULA_NAME Sudoku-COL-AN10-UpperBounds-10
FORMULA_NAME Sudoku-COL-AN10-UpperBounds-11
FORMULA_NAME Sudoku-COL-AN10-UpperBounds-12
FORMULA_NAME Sudoku-COL-AN10-UpperBounds-13
FORMULA_NAME Sudoku-COL-AN10-UpperBounds-14
FORMULA_NAME Sudoku-COL-AN10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749108551169

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-AN10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-05 07:29:13] [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:29:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:29:13] [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:29:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-05 07:29:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 852 ms
[2025-06-05 07:29:14] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 1300 PT places and 1000.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Reduction of identical properties reduced properties to check from 16 to 4
[2025-06-05 07:29:14] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 14 ms.
[2025-06-05 07:29:14] [INFO ] Skeletonized 4 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2025-06-05 07:29:14] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[100, 100, 100, 0] Max Struct:[100, 100, 100, 100]
FORMULA Sudoku-COL-AN10-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-05 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-06 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-08 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-09 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-15 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-11 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-12 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-07 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-10 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-00 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-05 07:29:14] [INFO ] Invariant cache hit.
[2025-06-05 07:29:14] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-05 07:29:14] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-05 07:29:14] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-05 07:29:14] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0] Max Struct:[100]
Domain [N(10), N(10)] of place Rows breaks symmetries in sort N
[2025-06-05 07:29:14] [INFO ] Unfolded HLPN to a Petri net with 1300 places and 1000 transitions 4000 arcs in 57 ms.
[2025-06-05 07:29:14] [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:[100]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[100]
// Phase 1: matrix 1000 rows 1300 cols
[2025-06-05 07:29:14] [INFO ] Computed 300 invariants in 41 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[100]
RANDOM walk for 10000 steps (114 resets) in 1112 ms. (8 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 277 ms. (35 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[91] Max Struct:[100]
[2025-06-05 07:29:16] [INFO ] Invariant cache hit.
[2025-06-05 07:29:16] [INFO ] [Real]Absence check using 300 positive place invariants in 280 ms returned sat
[2025-06-05 07:29:19] [INFO ] [Real]Absence check using state equation in 3235 ms returned sat
[2025-06-05 07:29:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 100 ms.
[2025-06-05 07:29:20] [INFO ] Added : 0 causal constraints over 0 iterations in 300 ms. Result :sat
Minimization took 467 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[91] Max Struct:[100]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[91] Max Struct:[100]
Support contains 1000 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 163 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2025-06-05 07:29:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[91] Max Struct:[100]
RANDOM walk for 361577 steps (4148 resets) in 30001 ms. (12 steps per ms)
BEST_FIRST walk for 149106 steps (5 resets) in 5008 ms. (29 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[94] Max Struct:[100]
[2025-06-05 07:29:56] [INFO ] Invariant cache hit.
[2025-06-05 07:29:57] [INFO ] [Real]Absence check using 300 positive place invariants in 377 ms returned sat
[2025-06-05 07:29:58] [INFO ] [Real]Absence check using state equation in 1658 ms returned sat
[2025-06-05 07:29:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 67 ms.
[2025-06-05 07:29:58] [INFO ] Added : 0 causal constraints over 0 iterations in 185 ms. Result :sat
Minimization took 6604 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[94] Max Struct:[100]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[94] Max Struct:[100]
Support contains 1000 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 40 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 59 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2025-06-05 07:30:05] [INFO ] Invariant cache hit.
[2025-06-05 07:30:07] [INFO ] Implicit Places using invariants in 1428 ms returned []
[2025-06-05 07:30:07] [INFO ] Invariant cache hit.
[2025-06-05 07:30:09] [INFO ] Implicit Places using invariants and state equation in 2756 ms returned []
Implicit Place search using SMT with State Equation took 4187 ms to find 0 implicit places.
[2025-06-05 07:30:10] [INFO ] Redundant transitions in 104 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 3ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4369 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2025-06-05 07:30:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[94] Max Struct:[100]
RANDOM walk for 359634 steps (4128 resets) in 30001 ms. (11 steps per ms)
BEST_FIRST walk for 163340 steps (6 resets) in 5004 ms. (32 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[94] Max Struct:[100]
[2025-06-05 07:30:45] [INFO ] Invariant cache hit.
[2025-06-05 07:30:45] [INFO ] [Real]Absence check using 300 positive place invariants in 242 ms returned sat
[2025-06-05 07:30:47] [INFO ] [Real]Absence check using state equation in 1517 ms returned sat
[2025-06-05 07:30:47] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 88 ms.
[2025-06-05 07:30:47] [INFO ] Added : 0 causal constraints over 0 iterations in 254 ms. Result :sat
Minimization took 6878 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[94] Max Struct:[100]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[94] Max Struct:[100]
Support contains 1000 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 35 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 33 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2025-06-05 07:30:54] [INFO ] Invariant cache hit.
[2025-06-05 07:30:55] [INFO ] Implicit Places using invariants in 1340 ms returned []
[2025-06-05 07:30:55] [INFO ] Invariant cache hit.
[2025-06-05 07:30:57] [INFO ] Implicit Places using invariants and state equation in 2160 ms returned []
Implicit Place search using SMT with State Equation took 3503 ms to find 0 implicit places.
[2025-06-05 07:30:58] [INFO ] Redundant transitions in 73 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 3622 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2025-06-05 07:30:59] [INFO ] Flatten gal took : 672 ms
[2025-06-05 07:30:59] [INFO ] Flatten gal took : 303 ms
[2025-06-05 07:30:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7077433456061362925.gal : 117 ms
[2025-06-05 07:30:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1765944197879378357.prop : 7 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/ReachabilityCardinality7077433456061362925.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1765944197879378357.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 ...328
Loading property file /tmp/ReachabilityCardinality1765944197879378357.prop.
RANDOM walk for 40000 steps (458 resets) in 9238 ms. (4 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1998 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1851 ms. (21 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 21
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :21 after 428
Interrupted probabilistic random walk after 220403 steps, run timeout after 9001 ms. (steps per millisecond=24 ) properties seen :0 out of 2
Probabilistic random walk after 220403 steps, saw 96421 distinct states, run finished after 9008 ms. (steps per millisecond=24 ) properties seen :0
[2025-06-05 07:31:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 300/1300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1000/2300 variables, 1300/1600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2300/2300 variables, and 1600 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 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/1000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/2300 variables, and 300 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2011 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 0/1300 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 8006ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1000 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 63 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 1300/1300 places, 1000/1000 transitions.
RANDOM walk for 40000 steps (456 resets) in 7041 ms. (5 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
BEST_FIRST walk for 40004 steps (8 resets) in 1797 ms. (22 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 213627 steps, run timeout after 9001 ms. (steps per millisecond=23 ) properties seen :0 out of 2
Probabilistic random walk after 213627 steps, saw 95294 distinct states, run finished after 9001 ms. (steps per millisecond=23 ) properties seen :0
[2025-06-05 07:31:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 300/1300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1000/2300 variables, 1300/1600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2300 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/2300 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2300/2300 variables, and 1600 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8155 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 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/1000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 300/1300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1000/2300 variables, 1300/1600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2025-06-05 07:31:50] [INFO ] Flatten gal took : 98 ms
[2025-06-05 07:31:50] [INFO ] Applying decomposition
[2025-06-05 07:31:50] [INFO ] Flatten gal took : 87 ms
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/graph17671545194357936793.txt' '-o' '/tmp/graph17671545194357936793.bin' '-w' '/tmp/graph17671545194357936793.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17671545194357936793.bin' '-l' '-1' '-v' '-w' '/tmp/graph17671545194357936793.weights' '-q' '0' '-e' '0.001'
[2025-06-05 07:31:53] [INFO ] Decomposing Gal with order
[2025-06-05 07:31:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 07:31:54] [INFO ] Removed a total of 2057 redundant transitions.
[2025-06-05 07:31:54] [INFO ] Flatten gal took : 942 ms
[2025-06-05 07:31:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 54 ms.
[2025-06-05 07:31:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5547136012317294907.gal : 30 ms
[2025-06-05 07:31:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8275706307652023203.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/ReachabilityCardinality5547136012317294907.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8275706307652023203.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 ...328
Loading property file /tmp/ReachabilityCardinality8275706307652023203.prop.
Solver is answering 'unknown', stopping.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 17
After SMT solving in domain Int declared 2300/2300 variables, and 1602 constraints, problems are : Problem set: 0 solved, 2 unsolved in 25271 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 34209ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1000 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 29 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 28 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2025-06-05 07:32:05] [INFO ] Invariant cache hit.
[2025-06-05 07:32:06] [INFO ] Implicit Places using invariants in 1032 ms returned []
[2025-06-05 07:32:06] [INFO ] Invariant cache hit.
[2025-06-05 07:32:08] [INFO ] Implicit Places using invariants and state equation in 1961 ms returned []
Implicit Place search using SMT with State Equation took 2995 ms to find 0 implicit places.
[2025-06-05 07:32:08] [INFO ] Redundant transitions in 20 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 3050 ms. Remains : 1300/1300 places, 1000/1000 transitions.
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:[94] Max Struct:[100]
Starting property specific reduction for Sudoku-COL-AN10-UpperBounds-04
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:[100]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[100]
[2025-06-05 07:32:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[100]
RANDOM walk for 10000 steps (114 resets) in 1029 ms. (9 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 302 ms. (33 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[90] Max Struct:[100]
[2025-06-05 07:32:09] [INFO ] Invariant cache hit.
[2025-06-05 07:32:10] [INFO ] [Real]Absence check using 300 positive place invariants in 185 ms returned sat
[2025-06-05 07:32:11] [INFO ] [Real]Absence check using state equation in 1460 ms returned sat
[2025-06-05 07:32:11] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 53 ms.
[2025-06-05 07:32:11] [INFO ] Added : 0 causal constraints over 0 iterations in 178 ms. Result :sat
Minimization took 549 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[90] Max Struct:[100]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[90] Max Struct:[100]
Support contains 1000 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 40 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2025-06-05 07:32:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[90] Max Struct:[100]
RANDOM walk for 365160 steps (4189 resets) in 30001 ms. (12 steps per ms)
BEST_FIRST walk for 169578 steps (6 resets) in 5021 ms. (33 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[93] Max Struct:[100]
[2025-06-05 07:32:47] [INFO ] Invariant cache hit.
[2025-06-05 07:32:48] [INFO ] [Real]Absence check using 300 positive place invariants in 462 ms returned sat
[2025-06-05 07:32:50] [INFO ] [Real]Absence check using state equation in 2379 ms returned sat
[2025-06-05 07:32:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 60 ms.
[2025-06-05 07:32:50] [INFO ] Added : 0 causal constraints over 0 iterations in 171 ms. Result :sat
Minimization took 5499 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[93] Max Struct:[100]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[93] Max Struct:[100]
Support contains 1000 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 19 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2025-06-05 07:32:56] [INFO ] Invariant cache hit.
[2025-06-05 07:32:57] [INFO ] Implicit Places using invariants in 896 ms returned []
[2025-06-05 07:32:57] [INFO ] Invariant cache hit.
[2025-06-05 07:32:59] [INFO ] Implicit Places using invariants and state equation in 1997 ms returned []
Implicit Place search using SMT with State Equation took 2894 ms to find 0 implicit places.
[2025-06-05 07:32:59] [INFO ] Redundant transitions in 13 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 2932 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2025-06-05 07:32:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[93] Max Struct:[100]
RANDOM walk for 364468 steps (4181 resets) in 30001 ms. (12 steps per ms)
BEST_FIRST walk for 161836 steps (6 resets) in 5006 ms. (32 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[93] Max Struct:[100]
[2025-06-05 07:33:34] [INFO ] Invariant cache hit.
[2025-06-05 07:33:35] [INFO ] [Real]Absence check using 300 positive place invariants in 420 ms returned sat
[2025-06-05 07:33:37] [INFO ] [Real]Absence check using state equation in 2285 ms returned sat
[2025-06-05 07:33:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 73 ms.
[2025-06-05 07:33:37] [INFO ] Added : 0 causal constraints over 0 iterations in 186 ms. Result :sat
Minimization took 7243 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[93] Max Struct:[100]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[93] Max Struct:[100]
Support contains 1000 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 19 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 17 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2025-06-05 07:33:45] [INFO ] Invariant cache hit.
[2025-06-05 07:33:46] [INFO ] Implicit Places using invariants in 1148 ms returned []
[2025-06-05 07:33:46] [INFO ] Invariant cache hit.
[2025-06-05 07:33:48] [INFO ] Implicit Places using invariants and state equation in 1936 ms returned []
Implicit Place search using SMT with State Equation took 3089 ms to find 0 implicit places.
[2025-06-05 07:33:48] [INFO ] Redundant transitions in 12 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 3125 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2025-06-05 07:33:48] [INFO ] Flatten gal took : 66 ms
[2025-06-05 07:33:48] [INFO ] Flatten gal took : 61 ms
[2025-06-05 07:33:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8029890510066396305.gal : 18 ms
[2025-06-05 07:33:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5756036799023638508.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/ReachabilityCardinality8029890510066396305.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5756036799023638508.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 ...328
Loading property file /tmp/ReachabilityCardinality5756036799023638508.prop.
RANDOM walk for 40000 steps (456 resets) in 7617 ms. (5 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1678 ms. (23 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1565 ms. (25 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 21
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :21 after 428
Interrupted probabilistic random walk after 124844 steps, run timeout after 6017 ms. (steps per millisecond=20 ) properties seen :0 out of 2
Probabilistic random walk after 124844 steps, saw 70501 distinct states, run finished after 6018 ms. (steps per millisecond=20 ) properties seen :0
[2025-06-05 07:33:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 300/1300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1000/2300 variables, 1300/1600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2300/2300 variables, and 1600 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 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/1000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 300/1300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2300/2300 variables, and 1600 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 10490ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1000 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 17 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1300/1300 places, 1000/1000 transitions.
RANDOM walk for 40000 steps (457 resets) in 7286 ms. (5 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1737 ms. (23 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1689 ms. (23 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 220627 steps, run timeout after 9001 ms. (steps per millisecond=24 ) properties seen :0 out of 2
Probabilistic random walk after 220627 steps, saw 96541 distinct states, run finished after 9002 ms. (steps per millisecond=24 ) properties seen :0
[2025-06-05 07:34:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 300/1300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1000/2300 variables, 1300/1600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2300 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/2300 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2300/2300 variables, and 1600 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8189 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 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/1000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 300/1300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1000/2300 variables, 1300/1600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2025-06-05 07:34:38] [INFO ] Flatten gal took : 53 ms
[2025-06-05 07:34:38] [INFO ] Applying decomposition
[2025-06-05 07:34:38] [INFO ] Flatten gal took : 53 ms
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/graph11333832353554969362.txt' '-o' '/tmp/graph11333832353554969362.bin' '-w' '/tmp/graph11333832353554969362.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11333832353554969362.bin' '-l' '-1' '-v' '-w' '/tmp/graph11333832353554969362.weights' '-q' '0' '-e' '0.001'
[2025-06-05 07:34:41] [INFO ] Decomposing Gal with order
[2025-06-05 07:34:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 07:34:41] [INFO ] Removed a total of 2053 redundant transitions.
[2025-06-05 07:34:42] [INFO ] Flatten gal took : 532 ms
[2025-06-05 07:34:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 38 ms.
[2025-06-05 07:34:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6611462096884762266.gal : 17 ms
[2025-06-05 07:34:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13004480983344256412.prop : 3 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/ReachabilityCardinality6611462096884762266.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13004480983344256412.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 ...329
Loading property file /tmp/ReachabilityCardinality13004480983344256412.prop.
Solver is answering 'unknown', stopping.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :65 after 2213
After SMT solving in domain Int declared 2300/2300 variables, and 1602 constraints, problems are : Problem set: 0 solved, 2 unsolved in 25355 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 34131ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1000 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 33 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2025-06-05 07:34:53] [INFO ] Invariant cache hit.
[2025-06-05 07:34:55] [INFO ] Implicit Places using invariants in 1314 ms returned []
[2025-06-05 07:34:55] [INFO ] Invariant cache hit.
[2025-06-05 07:34:57] [INFO ] Implicit Places using invariants and state equation in 2549 ms returned []
Implicit Place search using SMT with State Equation took 3864 ms to find 0 implicit places.
[2025-06-05 07:34:57] [INFO ] Redundant transitions in 21 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 3910 ms. Remains : 1300/1300 places, 1000/1000 transitions.
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:[93] Max Struct:[100]
Ending property specific reduction for Sudoku-COL-AN10-UpperBounds-04 in 169537 ms.
[2025-06-05 07:34:57] [INFO ] Flatten gal took : 55 ms
[2025-06-05 07:34:57] [INFO ] Applying decomposition
[2025-06-05 07:34:58] [INFO ] Flatten gal took : 57 ms
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/graph9174256762417822843.txt' '-o' '/tmp/graph9174256762417822843.bin' '-w' '/tmp/graph9174256762417822843.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9174256762417822843.bin' '-l' '-1' '-v' '-w' '/tmp/graph9174256762417822843.weights' '-q' '0' '-e' '0.001'
[2025-06-05 07:34:58] [INFO ] Decomposing Gal with order
[2025-06-05 07:34:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 07:34:58] [INFO ] Removed a total of 1700 redundant transitions.
[2025-06-05 07:34:58] [INFO ] Flatten gal took : 111 ms
[2025-06-05 07:34:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2025-06-05 07:34:58] [INFO ] Time to serialize gal into /tmp/UpperBounds6388912637188061950.gal : 19 ms
[2025-06-05 07:34:58] [INFO ] Time to serialize properties into /tmp/UpperBounds8433941550736430896.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/UpperBounds6388912637188061950.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8433941550736430896.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 ...304
Loading property file /tmp/UpperBounds8433941550736430896.prop.
ITS-tools command line returned an error code 137
[2025-06-05 07:47:51] [INFO ] Applying decomposition
[2025-06-05 07:47:51] [INFO ] Flatten gal took : 50 ms
[2025-06-05 07:47:51] [INFO ] Decomposing Gal with order
[2025-06-05 07:47:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 07:47:51] [INFO ] Removed a total of 2310 redundant transitions.
[2025-06-05 07:47:51] [INFO ] Flatten gal took : 132 ms
[2025-06-05 07:47:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2025-06-05 07:47:52] [INFO ] Time to serialize gal into /tmp/UpperBounds116404927819172963.gal : 20 ms
[2025-06-05 07:47:52] [INFO ] Time to serialize properties into /tmp/UpperBounds12134629357081361593.prop : 4 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/UpperBounds116404927819172963.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12134629357081361593.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 ...304
Loading property file /tmp/UpperBounds12134629357081361593.prop.
ITS-tools command line returned an error code 137
[2025-06-05 08:00:13] [INFO ] Flatten gal took : 50 ms
[2025-06-05 08:00:13] [INFO ] Input system was already deterministic with 1000 transitions.
[2025-06-05 08:00:13] [INFO ] Transformed 1300 places.
[2025-06-05 08:00:13] [INFO ] Transformed 1000 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-05 08:00:14] [INFO ] Time to serialize gal into /tmp/UpperBounds16833800964764701426.gal : 7 ms
[2025-06-05 08:00:14] [INFO ] Time to serialize properties into /tmp/UpperBounds5889004400542567850.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/UpperBounds16833800964764701426.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5889004400542567850.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds5889004400542567850.prop.
ITS-tools command line returned an error code 137
Total runtime 2631483 ms.

BK_STOP 1749111184626

--------------------
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-AN10"
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-AN10, 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-174903502700050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN10.tgz
mv Sudoku-COL-AN10 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;